This paper introduces a novel blind recognition of non-binary low-density parity-check(LDPC)codes without a candidate set,using ant colony optimization(ACO)algorithm over additive white Gaussian noise(AWGN)channels.Sp...This paper introduces a novel blind recognition of non-binary low-density parity-check(LDPC)codes without a candidate set,using ant colony optimization(ACO)algorithm over additive white Gaussian noise(AWGN)channels.Specifically,the scheme that effectively combines the ACO algorithm and the non-binary elements over finite fields is proposed.Furthermore,an improved,simplified elitist ACO algorithm based on soft decision reliability is introduced to recognize the parity-check matrix over noisy channels.Simulation results show that the recognition rate continuously increases with an increased signalto-noise ratio(SNR)over the AWGN channel.展开更多
This paper presents a software turbo decoder on graphics processing units(GPU).Unlike previous works,the proposed decoding architecture for turbo codes mainly focuses on the Consultative Committee for Space Data Syste...This paper presents a software turbo decoder on graphics processing units(GPU).Unlike previous works,the proposed decoding architecture for turbo codes mainly focuses on the Consultative Committee for Space Data Systems(CCSDS)standard.However,the information frame lengths of the CCSDS turbo codes are not suitable for flexible sub-frame parallelism design.To mitigate this issue,we propose a padding method that inserts several bits before the information frame header.To obtain low-latency performance and high resource utilization,two-level intra-frame parallelisms and an efficient data structure are considered.The presented Max-Log-Map decoder can be adopted to decode the Long Term Evolution(LTE)turbo codes with only small modifications.The proposed CCSDS turbo decoder at 10 iterations on NVIDIA RTX3070 achieves about 150 Mbps and 50Mbps throughputs for the code rates 1/6 and 1/2,respectively.展开更多
Turbo code has drawn more and more attractions for high data rate transmission these years especially in W CDMA and CDMA2000 of the third generation mobile communications systems. In this paper, the simulation perfor...Turbo code has drawn more and more attractions for high data rate transmission these years especially in W CDMA and CDMA2000 of the third generation mobile communications systems. In this paper, the simulation performance of turbo code under Rayleigh fading channel and additive white Gaussian channels are depicted. Comparison with the performance of convolutional code are made respect to different parameters, such as pilot length, interleaver size, frame length, mobile velocity and data rate, etc. Faithful results are drawn out.展开更多
A new method to design interleaver based on Henon chaos model is presented. The designed interleaver is with rather random behavior. Experimental results show that the proposed S-henon interleaver make a magnitude of ...A new method to design interleaver based on Henon chaos model is presented. The designed interleaver is with rather random behavior. Experimental results show that the proposed S-henon interleaver make a magnitude of im provement in bit error rate （BER） performance by 0.4 dB compared with the S-random interleaver for AWGN channel respectively. The S-henon interleaver may be adapted to 3G mobile communication systems.展开更多
This paper describes a new interleaver construction technique for turbo code.The technique searches as much as possible pseudo-random interleaving patterns under a certain condition using genetic algorithms(GAs).The n...This paper describes a new interleaver construction technique for turbo code.The technique searches as much as possible pseudo-random interleaving patterns under a certain condition using genetic algorithms(GAs).The new interleavers have the superiority of the S-random interleavers and this interleaver construction technique can reduce the time taken to generate pseudo-random interleaving patterns under a certain condition.The results obtained indicate that the new interleavers yield an equal to or better performance than the S-random interleavers.Compared to the S-random interleaver,this design requires a lower level of computational complexity.展开更多
A novel Joint Source and Channel Decoding (JSCD) scheme for Variable Length Codes (VLCs) concatenated with turbo codes utilizing a new super-trellis decoding algorithm is presented in this letter. The basic idea of ou...A novel Joint Source and Channel Decoding (JSCD) scheme for Variable Length Codes (VLCs) concatenated with turbo codes utilizing a new super-trellis decoding algorithm is presented in this letter. The basic idea of our decoding algorithm is that source a priori information with the form of bit transition probabilities corresponding to the VLC tree can be derived directly from sub-state transitions in new composite-state represented super-trellis. A Maximum Likelihood (ML) decoding algorithm for VLC sequence estimations based on the proposed super-trellis is also described. Simu-lation results show that the new iterative decoding scheme can obtain obvious encoding gain especially for Reversible Variable Length Codes (RVLCs),when compared with the classical separated turbo decoding and the previous joint decoding not considering source statistical characteristics.展开更多
Optimization of mapping rule of bit-interleaved Turbo coded modulation with 16 quadrature amplitude modulation (QAM) is investigated based on different impacts of various encoded bits sequence on Turbo decoding perfor...Optimization of mapping rule of bit-interleaved Turbo coded modulation with 16 quadrature amplitude modulation (QAM) is investigated based on different impacts of various encoded bits sequence on Turbo decoding performance. Furthermore, bit-interleaved in-phase and quadrature phase (I-Q) Turbo coded modulation scheme are designed similarly with I-Q trellis coded modulation (TCM). Through performance evaluation and analysis, it can be seen that the novel mapping rule outperforms traditional one and the I-Q Turbo coded modulation can not achieve good performance as expected. Therefore, there is not obvious advantage in using I-Q method in bit-interleaved Turbo coded modulation.展开更多
The multilevel modulation techniques nf M-Differential Amplitude Phase Shift Keying (DAPSK) have been proposed in combination with Turbo code scheme for digital radio broadcasting bands below 30 MHz radio channel. Com...The multilevel modulation techniques nf M-Differential Amplitude Phase Shift Keying (DAPSK) have been proposed in combination with Turbo code scheme for digital radio broadcasting bands below 30 MHz radio channel. Comparison of this modulation method with channel coding in an Additive White Gaussian Noise (AWGN) and multi-path fading channels has been presented. The analysis provides an iterative decoding of the Turbo code.展开更多
Binary Polar Codes (BPCs) have advantages of high-efficiency and capacity-achieving but suffer from large latency due to the Successive-Cancellation List (SCL) decoding. Non-Binary Polar Codes (NBPCs) have been invest...Binary Polar Codes (BPCs) have advantages of high-efficiency and capacity-achieving but suffer from large latency due to the Successive-Cancellation List (SCL) decoding. Non-Binary Polar Codes (NBPCs) have been investigated to obtain the performance gains and reduce latency under the implementation of parallel architectures for multi-bit decoding. However, most of the existing works only focus on the Reed-Solomon matrix-based NBPCs and the probability domain-based non-binary polar decoding, which lack flexible structure and have a large computation amount in the decoding process, while little attention has been paid to general non-binary kernel-based NBPCs and Log-Likelihood Ratio (LLR) based decoding methods. In this paper, we consider a scheme of NBPCs with a general structure over GF(2m). Specifically, we pursue a detailed Monte-Carlo simulation implementation to determine the construction for proposed NBPCs. For non-binary polar decoding, an SCL decoding based on LLRs is proposed for NBPCs, which can be implemented with non-binary kernels of arbitrary size. Moreover, we propose a Perfect Polarization-Based SCL (PPB-SCL) algorithm based on LLRs to reduce decoding complexity by deriving a new update function of path metric for NBPCs and eliminating the path splitting process at perfect polarized (i.e., highly reliable) positions. Simulation results show that the bit error rate of the proposed NBPCs significantly outperforms that of BPCs. In addition, the proposed PPB-SCL decoding obtains about a 40% complexity reduction of SCL decoding for NBPCs.展开更多
timizing the formula, the energy for every bit of the codeword is optimized to achieve the minimum BER at high SNR region. At last, an adjustable parameter is employed to compensate the degrada- tions of BER at low an...timizing the formula, the energy for every bit of the codeword is optimized to achieve the minimum BER at high SNR region. At last, an adjustable parameter is employed to compensate the degrada- tions of BER at low and moderate SNR regions. Case studies indicate that the improvements of BER for turbo codes with short frame size are significant at a wide range of SNR展开更多
A direct detection optical orthogonal frequency division multiplexing(DDO-OFDM)system using turbo codes is built,and the transmission performance comparison between coded system and uncoded system is analyzed.Three de...A direct detection optical orthogonal frequency division multiplexing(DDO-OFDM)system using turbo codes is built,and the transmission performance comparison between coded system and uncoded system is analyzed.Three decoding algorithms,which are Log-maximum a posteriori(MAP),Max-Log-MAP and threshold Max-Log-MAP,are used in the turbo coded system.By comparing three decoding algorithms,the system using Max-Log-MAP algorithm has the best bit error rate(BER)performance.At the transmission distance of 240 km,the uncoded system with transmission rate of 30 Gbit/s can get the BER performance at the degree of 8.93×10-3 with optical signal to noise ratio(OSNR)of24 d B,while the turbo coded system with transmission rate of 50 Gbit/s can achieve it within OSNR of 20 d B.展开更多
文摘This paper introduces a novel blind recognition of non-binary low-density parity-check(LDPC)codes without a candidate set,using ant colony optimization(ACO)algorithm over additive white Gaussian noise(AWGN)channels.Specifically,the scheme that effectively combines the ACO algorithm and the non-binary elements over finite fields is proposed.Furthermore,an improved,simplified elitist ACO algorithm based on soft decision reliability is introduced to recognize the parity-check matrix over noisy channels.Simulation results show that the recognition rate continuously increases with an increased signalto-noise ratio(SNR)over the AWGN channel.
基金supported by the Fundamental Research Funds for the Central Universities(FRF-TP20-062A1)Guangdong Basic and Applied Basic Research Foundation(2021A1515110070)。
文摘This paper presents a software turbo decoder on graphics processing units(GPU).Unlike previous works,the proposed decoding architecture for turbo codes mainly focuses on the Consultative Committee for Space Data Systems(CCSDS)standard.However,the information frame lengths of the CCSDS turbo codes are not suitable for flexible sub-frame parallelism design.To mitigate this issue,we propose a padding method that inserts several bits before the information frame header.To obtain low-latency performance and high resource utilization,two-level intra-frame parallelisms and an efficient data structure are considered.The presented Max-Log-Map decoder can be adopted to decode the Long Term Evolution(LTE)turbo codes with only small modifications.The proposed CCSDS turbo decoder at 10 iterations on NVIDIA RTX3070 achieves about 150 Mbps and 50Mbps throughputs for the code rates 1/6 and 1/2,respectively.
文摘Turbo code has drawn more and more attractions for high data rate transmission these years especially in W CDMA and CDMA2000 of the third generation mobile communications systems. In this paper, the simulation performance of turbo code under Rayleigh fading channel and additive white Gaussian channels are depicted. Comparison with the performance of convolutional code are made respect to different parameters, such as pilot length, interleaver size, frame length, mobile velocity and data rate, etc. Faithful results are drawn out.
基金Supported by the National High Technology Re-search and Development Program of China(2001AA123053)
文摘A new method to design interleaver based on Henon chaos model is presented. The designed interleaver is with rather random behavior. Experimental results show that the proposed S-henon interleaver make a magnitude of im provement in bit error rate （BER） performance by 0.4 dB compared with the S-random interleaver for AWGN channel respectively. The S-henon interleaver may be adapted to 3G mobile communication systems.
基金Supported by the National Natural Science Foundation of China(60372057) the Key Open laboratory on Information Science and Engineering of Railway Transportation Ministry of Beijing Jiaotong University of China(KLISAE-0103)
文摘This paper describes a new interleaver construction technique for turbo code.The technique searches as much as possible pseudo-random interleaving patterns under a certain condition using genetic algorithms(GAs).The new interleavers have the superiority of the S-random interleavers and this interleaver construction technique can reduce the time taken to generate pseudo-random interleaving patterns under a certain condition.The results obtained indicate that the new interleavers yield an equal to or better performance than the S-random interleavers.Compared to the S-random interleaver,this design requires a lower level of computational complexity.
基金Supported by the National Natural Science Foundation of China (No.90304003, No.60573112, No.60272056)the Foundation Project of China (No.A1320061262).
文摘A novel Joint Source and Channel Decoding (JSCD) scheme for Variable Length Codes (VLCs) concatenated with turbo codes utilizing a new super-trellis decoding algorithm is presented in this letter. The basic idea of our decoding algorithm is that source a priori information with the form of bit transition probabilities corresponding to the VLC tree can be derived directly from sub-state transitions in new composite-state represented super-trellis. A Maximum Likelihood (ML) decoding algorithm for VLC sequence estimations based on the proposed super-trellis is also described. Simu-lation results show that the new iterative decoding scheme can obtain obvious encoding gain especially for Reversible Variable Length Codes (RVLCs),when compared with the classical separated turbo decoding and the previous joint decoding not considering source statistical characteristics.
文摘Optimization of mapping rule of bit-interleaved Turbo coded modulation with 16 quadrature amplitude modulation (QAM) is investigated based on different impacts of various encoded bits sequence on Turbo decoding performance. Furthermore, bit-interleaved in-phase and quadrature phase (I-Q) Turbo coded modulation scheme are designed similarly with I-Q trellis coded modulation (TCM). Through performance evaluation and analysis, it can be seen that the novel mapping rule outperforms traditional one and the I-Q Turbo coded modulation can not achieve good performance as expected. Therefore, there is not obvious advantage in using I-Q method in bit-interleaved Turbo coded modulation.
基金Supported by the National Natural Science Foundation of China (No.60072013)
文摘The multilevel modulation techniques nf M-Differential Amplitude Phase Shift Keying (DAPSK) have been proposed in combination with Turbo code scheme for digital radio broadcasting bands below 30 MHz radio channel. Comparison of this modulation method with channel coding in an Additive White Gaussian Noise (AWGN) and multi-path fading channels has been presented. The analysis provides an iterative decoding of the Turbo code.
基金supported in part by the National Natural Science Foundation of China under Grant 61401407in part by the Fundamental Research Funds for the Central Universities under Grant CUC2019B067.
文摘Binary Polar Codes (BPCs) have advantages of high-efficiency and capacity-achieving but suffer from large latency due to the Successive-Cancellation List (SCL) decoding. Non-Binary Polar Codes (NBPCs) have been investigated to obtain the performance gains and reduce latency under the implementation of parallel architectures for multi-bit decoding. However, most of the existing works only focus on the Reed-Solomon matrix-based NBPCs and the probability domain-based non-binary polar decoding, which lack flexible structure and have a large computation amount in the decoding process, while little attention has been paid to general non-binary kernel-based NBPCs and Log-Likelihood Ratio (LLR) based decoding methods. In this paper, we consider a scheme of NBPCs with a general structure over GF(2m). Specifically, we pursue a detailed Monte-Carlo simulation implementation to determine the construction for proposed NBPCs. For non-binary polar decoding, an SCL decoding based on LLRs is proposed for NBPCs, which can be implemented with non-binary kernels of arbitrary size. Moreover, we propose a Perfect Polarization-Based SCL (PPB-SCL) algorithm based on LLRs to reduce decoding complexity by deriving a new update function of path metric for NBPCs and eliminating the path splitting process at perfect polarized (i.e., highly reliable) positions. Simulation results show that the bit error rate of the proposed NBPCs significantly outperforms that of BPCs. In addition, the proposed PPB-SCL decoding obtains about a 40% complexity reduction of SCL decoding for NBPCs.
基金Supported by the National High Technology Research and Development Programme of China(No.2014AA01A705)the National Natural Science Foundation of China(U1204607)
文摘timizing the formula, the energy for every bit of the codeword is optimized to achieve the minimum BER at high SNR region. At last, an adjustable parameter is employed to compensate the degrada- tions of BER at low and moderate SNR regions. Case studies indicate that the improvements of BER for turbo codes with short frame size are significant at a wide range of SNR
基金supported by the National Natural Science Foundation of China(No.61107052)the Tianjin Natural Science Foundation of China(No.11JCYBJC0010)the Tianjin Youth Foundation of China(No.13JCQNJC01800)
文摘A direct detection optical orthogonal frequency division multiplexing(DDO-OFDM)system using turbo codes is built,and the transmission performance comparison between coded system and uncoded system is analyzed.Three decoding algorithms,which are Log-maximum a posteriori(MAP),Max-Log-MAP and threshold Max-Log-MAP,are used in the turbo coded system.By comparing three decoding algorithms,the system using Max-Log-MAP algorithm has the best bit error rate(BER)performance.At the transmission distance of 240 km,the uncoded system with transmission rate of 30 Gbit/s can get the BER performance at the degree of 8.93×10-3 with optical signal to noise ratio(OSNR)of24 d B,while the turbo coded system with transmission rate of 50 Gbit/s can achieve it within OSNR of 20 d B.
