To utilize residual redundancy to reduce the error induced by fading channels and decrease the complexity of the field model to describe the probability structure for residual redundancy, a simplified statistical mode...To utilize residual redundancy to reduce the error induced by fading channels and decrease the complexity of the field model to describe the probability structure for residual redundancy, a simplified statistical model for residual redundancy and a low complexity joint source-channel decoding（JSCD） algorithm are proposed. The complicated residual redundancy in wavelet compressed images is decomposed into several independent 1-D probability check equations composed of Markov chains and it is regarded as a natural channel code with a structure similar to the low density parity check （LDPC） code. A parallel sum-product （SP） and iterative JSCD algorithm is proposed. Simulation results show that the proposed JSCD algorithm can make full use of residual redundancy in different directions to correct errors and improve the peak signal noise ratio （PSNR） of the reconstructed image and reduce the complexity and delay of JSCD. The performance of JSCD is more robust than the traditional separated encoding system with arithmetic coding in the same data rate.展开更多
A hybrid decoding algorithm is proposed for nonbinary low-density parity-check （LDPC） codes, which combines the weighted symbol-flipping （WSF） algorithm with the fast Fourier trans- form q-ary sum-product algorit...A hybrid decoding algorithm is proposed for nonbinary low-density parity-check （LDPC） codes, which combines the weighted symbol-flipping （WSF） algorithm with the fast Fourier trans- form q-ary sum-product algorithm （FFT-QSPA）. The flipped position and value are determined by the symbol flipping metric and the received bit values in the first stage WSF algorithm. If the low- eomplexity WSF algorithm is failed, the second stage FFT-QSPA is activated as a switching strategy. Simulation results show that the proposed hybrid algorithm greatly reduces the computational complexity with the performance close to that of FFT-QSPA.展开更多
已有应用于OFDM(O rthogonal Frequency D ivision Mu ltip lexing)的各种纠错码,但有的纠错能力不强,误码率较大,有的译码复杂度较高。为此,在分析了密度演变算法的基础上,利用差分分解算法和计算机搜索,选择了基于多径衰落信道的OFDM...已有应用于OFDM(O rthogonal Frequency D ivision Mu ltip lexing)的各种纠错码,但有的纠错能力不强,误码率较大,有的译码复杂度较高。为此,在分析了密度演变算法的基础上,利用差分分解算法和计算机搜索,选择了基于多径衰落信道的OFDM系统的非规则LDPC(Low Density Parity Check)码的最佳度分配对,对系统的误码性能作了仿真,并与最佳规则LDPC码的OFDM系统在同样条件下作了比较。仿真结果显示,在各种映射模式下,所选择的最佳度分配对非规则LDPC码系统的性能优于最佳规则LDPC码系统的性能,在误码率为10-5时,信噪比增益达到1 dB。展开更多
The cumulative sum （CUSUM） algorithm is proposed to detect the selfish behavior of a node in a wireless ad hoc network. By tracing the statistics characteristic of the backoff time between successful transmissions, ...The cumulative sum （CUSUM） algorithm is proposed to detect the selfish behavior of a node in a wireless ad hoc network. By tracing the statistics characteristic of the backoff time between successful transmissions, a wireless node can distinguish if there is a selfish behavior in the wireless network. The detection efficiency is validated using a Qualnet simulator. An IEEE 802.11 wireless ad hoc network with 20 senders and 20 receivers spreading out randomly in a given area is evaluated. The well-behaved senders use minimum contention window size of 32 and maximum con- tention window size of I 024, and the selfish nodes are assumed not to use the binary exponential strategy for which the contention window sizes are both fixed as 16. The transmission radius of all nodes is 250 m. Two scenarios are investigated： a single-hop network with nodes spreading out in 100 m^100 m, and all the nodes are in the range of each other; and a multi-hop network with nodes spreading out in 1 000 m~ 1 000 m. The node can monitor the backoff time from all the other nodes and run the detection algorithms over those samples. It is noted that the threshold can significantly affect the detection time and the detection accuracy. For a given threshold of 0.3 s, the false alarm rates and the missed alarm rates are less than 5%. The detection delay is less than 1.0 s. The simulation results show that the algorithm has short detection time and high detection accuracy.展开更多
In this paper, an improved low-complexity sum-product decoding algorithm is presented for low-density parity-check （LDPC） codes. In the proposed algorithm, reduction in computational complexity is achieved by utiliz...In this paper, an improved low-complexity sum-product decoding algorithm is presented for low-density parity-check （LDPC） codes. In the proposed algorithm, reduction in computational complexity is achieved by utilizing fast Fourier transform （FFT） with time shift in the check node process. The improvement in the decoding performance is achieved by utilizing an op- timized integer constant in the variable node process. Simulation results show that the proposed algorithm achieves an overall coding gain improvement ranging from 0.04 to 0.46 dB. Moreover, when compared with the sum-product algorithm （SPA）, the proposed decoding algorithm can achieve a reduction of 42%-67% of the total number of arithmetic operations required for the decoding process.展开更多
文摘To utilize residual redundancy to reduce the error induced by fading channels and decrease the complexity of the field model to describe the probability structure for residual redundancy, a simplified statistical model for residual redundancy and a low complexity joint source-channel decoding（JSCD） algorithm are proposed. The complicated residual redundancy in wavelet compressed images is decomposed into several independent 1-D probability check equations composed of Markov chains and it is regarded as a natural channel code with a structure similar to the low density parity check （LDPC） code. A parallel sum-product （SP） and iterative JSCD algorithm is proposed. Simulation results show that the proposed JSCD algorithm can make full use of residual redundancy in different directions to correct errors and improve the peak signal noise ratio （PSNR） of the reconstructed image and reduce the complexity and delay of JSCD. The performance of JSCD is more robust than the traditional separated encoding system with arithmetic coding in the same data rate.
基金Supported by the National High Technology Research and Development Programme of China(No.2009AAJ128,2009AAJ208,2010AA7010422)
文摘A hybrid decoding algorithm is proposed for nonbinary low-density parity-check （LDPC） codes, which combines the weighted symbol-flipping （WSF） algorithm with the fast Fourier trans- form q-ary sum-product algorithm （FFT-QSPA）. The flipped position and value are determined by the symbol flipping metric and the received bit values in the first stage WSF algorithm. If the low- eomplexity WSF algorithm is failed, the second stage FFT-QSPA is activated as a switching strategy. Simulation results show that the proposed hybrid algorithm greatly reduces the computational complexity with the performance close to that of FFT-QSPA.
文摘已有应用于OFDM(O rthogonal Frequency D ivision Mu ltip lexing)的各种纠错码,但有的纠错能力不强,误码率较大,有的译码复杂度较高。为此,在分析了密度演变算法的基础上,利用差分分解算法和计算机搜索,选择了基于多径衰落信道的OFDM系统的非规则LDPC(Low Density Parity Check)码的最佳度分配对,对系统的误码性能作了仿真,并与最佳规则LDPC码的OFDM系统在同样条件下作了比较。仿真结果显示,在各种映射模式下,所选择的最佳度分配对非规则LDPC码系统的性能优于最佳规则LDPC码系统的性能,在误码率为10-5时,信噪比增益达到1 dB。
基金Supported by National Natural Science Foundation of China (No. 60702038)National High Technology Research and Development Program of China ("863"Program, No. 2007AA01Z220)Cultivation Fund of Innovation Project,Ministry of Education of China (No. 708024)
文摘The cumulative sum （CUSUM） algorithm is proposed to detect the selfish behavior of a node in a wireless ad hoc network. By tracing the statistics characteristic of the backoff time between successful transmissions, a wireless node can distinguish if there is a selfish behavior in the wireless network. The detection efficiency is validated using a Qualnet simulator. An IEEE 802.11 wireless ad hoc network with 20 senders and 20 receivers spreading out randomly in a given area is evaluated. The well-behaved senders use minimum contention window size of 32 and maximum con- tention window size of I 024, and the selfish nodes are assumed not to use the binary exponential strategy for which the contention window sizes are both fixed as 16. The transmission radius of all nodes is 250 m. Two scenarios are investigated： a single-hop network with nodes spreading out in 100 m^100 m, and all the nodes are in the range of each other; and a multi-hop network with nodes spreading out in 1 000 m~ 1 000 m. The node can monitor the backoff time from all the other nodes and run the detection algorithms over those samples. It is noted that the threshold can significantly affect the detection time and the detection accuracy. For a given threshold of 0.3 s, the false alarm rates and the missed alarm rates are less than 5%. The detection delay is less than 1.0 s. The simulation results show that the algorithm has short detection time and high detection accuracy.
文摘In this paper, an improved low-complexity sum-product decoding algorithm is presented for low-density parity-check （LDPC） codes. In the proposed algorithm, reduction in computational complexity is achieved by utilizing fast Fourier transform （FFT） with time shift in the check node process. The improvement in the decoding performance is achieved by utilizing an op- timized integer constant in the variable node process. Simulation results show that the proposed algorithm achieves an overall coding gain improvement ranging from 0.04 to 0.46 dB. Moreover, when compared with the sum-product algorithm （SPA）, the proposed decoding algorithm can achieve a reduction of 42%-67% of the total number of arithmetic operations required for the decoding process.
