大数逻辑可译低密度奇偶校验(LDPC)码是一类具有较大列重的码,针对此类特殊的LDPC码,提出了一种基于整数可靠度的低复杂度自适应译码算法。在译码的过程中,算法对每个校验节点分别引入不同的自适应修正因子对外信息进行修正。仿真表明...大数逻辑可译低密度奇偶校验(LDPC)码是一类具有较大列重的码,针对此类特殊的LDPC码,提出了一种基于整数可靠度的低复杂度自适应译码算法。在译码的过程中,算法对每个校验节点分别引入不同的自适应修正因子对外信息进行修正。仿真表明提出的自适应译码算法的性能与和积译码算法的性能相当,在误码率(BER)约为10-5时两种算法性能之间仅有0.1 d B的差异。所提算法具有复杂度低、可并行操作、全整数的信息传递等优点,十分有利于工程实现。展开更多
In this paper,we present a new class of spatially coupled codes obtained by using both non-recursive and recursive block-oriented superposition.The resulting codes are termed as bidirectional block Markov superpositio...In this paper,we present a new class of spatially coupled codes obtained by using both non-recursive and recursive block-oriented superposition.The resulting codes are termed as bidirectional block Markov superposition transmission(BiBMST)codes.Firstly,we perform an iterative decoding threshold analysis according to protograph-based extrinsic information transfer(PEXIT)charts for the BiBMST codes over the binary erasure channels(BECs).Secondly,we derive the generator and parity-check matrices of the BiBMST codes.Thirdly,extensive numerical results are presented to show the advantages of the proposed BiBMST codes.Particularly,our numerical results show that,under the constraint of an equal decoding latency,the BiBMST codes perform better than the recursive BMST(rBMST)codes.However,the simulation results show that,in finite-length regime,negligible performance gain is obtained by increasing the encoding memory.We solve this limitation by introducing partial superposition,and the resulting codes are termed as partially-connected BiBMST(PC-BiBMST)code.Analytical results have confirmed the advantages of the PC-BiBMST codes over the original BiBMST codes.We also present extensive simulation results to show the performance advantages of the PC-BiBMST codes over the spatially coupled low-density parity-check(SC-LDPC)codes,spatially coupled generalized LDPC(SC-GLDPC)codes,and the original BiBMST codes in the finite-length regime.展开更多
In this paper,we aim to design a practical low complexity low-density parity-check(LDPC)coded scheme to build a secure open channel and protect information from eavesdropping.To this end,we first propose a punctured L...In this paper,we aim to design a practical low complexity low-density parity-check(LDPC)coded scheme to build a secure open channel and protect information from eavesdropping.To this end,we first propose a punctured LDPC coded scheme,where the information bits in a codeword are punctured and only the parity check bits are transmitted to the receiver.We further propose a notion of check node type distribution and derive multi-edge type extrinsic information transfer functions to estimate the security performance,instead of the well-known weak metric bit error rate.We optimize the check node type distribution in terms of the signal-to-noise ratio(SNR)gap and modify the progressive edge growth algorithm to design finite-length codes.Numerical results show that our proposed scheme can achieve a lower computational complexity and a smaller security gap,compared to the existing scrambling and puncturing schemes.展开更多
Two modified BP algorithms related to vertical and horizontal processes are proposed to accelerate iterative low-density parity- check （LDPC） decoding over an additive white Gaussian noise （AWGN） channel, where th...Two modified BP algorithms related to vertical and horizontal processes are proposed to accelerate iterative low-density parity- check （LDPC） decoding over an additive white Gaussian noise （AWGN） channel, where the newly updated extrinsic information is immediately used in the current decoding round. Theoretical analysis and simulation results demonstrate that both the modified approaches provide significant performance improvements over the traditional BP algorithm with almost no additional decoding complexity. The proposed algorithm with modified horizontal process offers even better performance than another algorithm with the modified horizontal process. The two modified BP algorithms are very promising in practical communications since both can achieve an excellent trade-off between the performance and decoding complexity.展开更多
Iterative demodulation and decoding scheme is analyzed and modulation labeling is considered to be one of the crucial factors to this scheme. By analyzing the existent mapping design criterion, four aspects are found ...Iterative demodulation and decoding scheme is analyzed and modulation labeling is considered to be one of the crucial factors to this scheme. By analyzing the existent mapping design criterion, four aspects are found as the key techniques for choosing a label mapping. Based on this discovery, a novel mapping design criteflon is proposed and two label mappings are searched according to it. Simulation results show that the performance of BICM-ID using the novel mappings is better than the former ones. The extrinsic information transfer （EXIT） chart is introduced and it is used to evaluate the proposed mapping design criteria.展开更多
It is well known that turbo decoding always begins from the first component decoder and supposes that the apriori information is '0' at the first iterative decoding. To alternatively start decoding at two comp...It is well known that turbo decoding always begins from the first component decoder and supposes that the apriori information is '0' at the first iterative decoding. To alternatively start decoding at two component decoders, we can gain two soft output values for the received observation of an input bit. It is obvious that two soft output values comprise more sufficient extrinsic information than only one output value obtained in the conventional scheme since different start points of decoding result in different combinations of the a priori information and the input codewords with different symbol orders due to the permutation of an interleaver. Summarizing two soft output values for erery bit before making hard decisions, we can correct more errors due to their complement. Consequently, turbo codes can achieve better error correcting performance than before in this way. Simulation results show that the performance of turbo codes using the novel proposed decoding scheme can get a growing improvement with the increment of SNR in general compared to the conventional scheme. When the bit error probability is 10-5 , the proposed scheme can achieve 0.5 dB asymptotic coding gain or so under the given simulation conditions.展开更多
文摘大数逻辑可译低密度奇偶校验(LDPC)码是一类具有较大列重的码,针对此类特殊的LDPC码,提出了一种基于整数可靠度的低复杂度自适应译码算法。在译码的过程中,算法对每个校验节点分别引入不同的自适应修正因子对外信息进行修正。仿真表明提出的自适应译码算法的性能与和积译码算法的性能相当,在误码率(BER)约为10-5时两种算法性能之间仅有0.1 d B的差异。所提算法具有复杂度低、可并行操作、全整数的信息传递等优点,十分有利于工程实现。
基金supported by the National Natural Science Foundation of China(Nos.62271233,12271215,and 62261003)the Basic Research Program of Guangzhou Municipal Science and Technology Bureau(No.202201020036)the Guangdong Provincial Natural Science Foundation(Nos.2022A1515010029 and 2021A1515011906).
文摘In this paper,we present a new class of spatially coupled codes obtained by using both non-recursive and recursive block-oriented superposition.The resulting codes are termed as bidirectional block Markov superposition transmission(BiBMST)codes.Firstly,we perform an iterative decoding threshold analysis according to protograph-based extrinsic information transfer(PEXIT)charts for the BiBMST codes over the binary erasure channels(BECs).Secondly,we derive the generator and parity-check matrices of the BiBMST codes.Thirdly,extensive numerical results are presented to show the advantages of the proposed BiBMST codes.Particularly,our numerical results show that,under the constraint of an equal decoding latency,the BiBMST codes perform better than the recursive BMST(rBMST)codes.However,the simulation results show that,in finite-length regime,negligible performance gain is obtained by increasing the encoding memory.We solve this limitation by introducing partial superposition,and the resulting codes are termed as partially-connected BiBMST(PC-BiBMST)code.Analytical results have confirmed the advantages of the PC-BiBMST codes over the original BiBMST codes.We also present extensive simulation results to show the performance advantages of the PC-BiBMST codes over the spatially coupled low-density parity-check(SC-LDPC)codes,spatially coupled generalized LDPC(SC-GLDPC)codes,and the original BiBMST codes in the finite-length regime.
文摘In this paper,we aim to design a practical low complexity low-density parity-check(LDPC)coded scheme to build a secure open channel and protect information from eavesdropping.To this end,we first propose a punctured LDPC coded scheme,where the information bits in a codeword are punctured and only the parity check bits are transmitted to the receiver.We further propose a notion of check node type distribution and derive multi-edge type extrinsic information transfer functions to estimate the security performance,instead of the well-known weak metric bit error rate.We optimize the check node type distribution in terms of the signal-to-noise ratio(SNR)gap and modify the progressive edge growth algorithm to design finite-length codes.Numerical results show that our proposed scheme can achieve a lower computational complexity and a smaller security gap,compared to the existing scrambling and puncturing schemes.
基金National Mobile Communication Research Laboratory,Southeast University(No.W200704),ChinaNatural Science foundation of Jiangsu Province (No.BK2006188),ChinaQuebec-China Joint Research Foundation by McGill University,Montreal,Quebec,Canada
文摘Two modified BP algorithms related to vertical and horizontal processes are proposed to accelerate iterative low-density parity- check （LDPC） decoding over an additive white Gaussian noise （AWGN） channel, where the newly updated extrinsic information is immediately used in the current decoding round. Theoretical analysis and simulation results demonstrate that both the modified approaches provide significant performance improvements over the traditional BP algorithm with almost no additional decoding complexity. The proposed algorithm with modified horizontal process offers even better performance than another algorithm with the modified horizontal process. The two modified BP algorithms are very promising in practical communications since both can achieve an excellent trade-off between the performance and decoding complexity.
文摘Iterative demodulation and decoding scheme is analyzed and modulation labeling is considered to be one of the crucial factors to this scheme. By analyzing the existent mapping design criterion, four aspects are found as the key techniques for choosing a label mapping. Based on this discovery, a novel mapping design criteflon is proposed and two label mappings are searched according to it. Simulation results show that the performance of BICM-ID using the novel mappings is better than the former ones. The extrinsic information transfer （EXIT） chart is introduced and it is used to evaluate the proposed mapping design criteria.
文摘It is well known that turbo decoding always begins from the first component decoder and supposes that the apriori information is '0' at the first iterative decoding. To alternatively start decoding at two component decoders, we can gain two soft output values for the received observation of an input bit. It is obvious that two soft output values comprise more sufficient extrinsic information than only one output value obtained in the conventional scheme since different start points of decoding result in different combinations of the a priori information and the input codewords with different symbol orders due to the permutation of an interleaver. Summarizing two soft output values for erery bit before making hard decisions, we can correct more errors due to their complement. Consequently, turbo codes can achieve better error correcting performance than before in this way. Simulation results show that the performance of turbo codes using the novel proposed decoding scheme can get a growing improvement with the increment of SNR in general compared to the conventional scheme. When the bit error probability is 10-5 , the proposed scheme can achieve 0.5 dB asymptotic coding gain or so under the given simulation conditions.
