空间耦合低密度奇偶校验(spatially coupled low density parity check,SC-LDPC)码在次最优迭代译码算法下能够达到最大后验概率(maximum a posterior,MAP)译码性能,但其优异的性能需要在码长很长迭代次数很多时才能实现。当采用传统迭...空间耦合低密度奇偶校验(spatially coupled low density parity check,SC-LDPC)码在次最优迭代译码算法下能够达到最大后验概率(maximum a posterior,MAP)译码性能,但其优异的性能需要在码长很长迭代次数很多时才能实现。当采用传统迭代译码算法时,实现的复杂度将以指数增加,无法应用。为有效降低译码复杂度,滑窗译码算法被应用于空间耦合LDPC码的译码,但由于引入窗口截断,会造成译码性能的损失。针对上述问题,结合深度学习技术提出了一种空间耦合LDPC码的深度迭代译码算法。通过在消息传递过程中引入权重系数并采用深度神经网络对其进行训练获取权重系数,以此优化消息的可靠性度量值,从而加快译码收敛速度,提升译码性能。仿真结果表明:当传输在加性高斯白噪声信道时,所提的深度迭代译码算法在相同迭代次数下的译码性能均优于传统迭代译码算法和滑窗译码算法。展开更多
This paper studies the decoding performance of low-density parity-check(LDPC)codes in a serial concatenation system with polar codes employing the successive cancellation(SC)decoding.It is known that the absolute inco...This paper studies the decoding performance of low-density parity-check(LDPC)codes in a serial concatenation system with polar codes employing the successive cancellation(SC)decoding.It is known that the absolute incorrect log-likelihood ratio(LLR)values from the SC decoding can be very large.This phenomenon dramatically deteriorates the error correcting performance of the outer LDPC codes.In this paper,the LLR values of polar codes are regulated by a log processing before being sent to the LDPC decoder.Simulation results show that the log processing is an efficient approach with a low optimization complexity compared with the existing procedures to improve the performance of the serial concatenation systems.展开更多
In this paper, we conclude five kinds of methods for construction of the regular low-density parity matrix H and three kinds of methods for the construction of irregular low-density parity-check matrix H. Through the ...In this paper, we conclude five kinds of methods for construction of the regular low-density parity matrix H and three kinds of methods for the construction of irregular low-density parity-check matrix H. Through the analysis of the code rate and parameters of these eight kinds of structures, we find that the construction of low-density parity-check matrix tends to be more flexible and the parameter variability is enhanced. We propose that the current development cost should be lower with the progress of electronic technology and we need research on more practical Low-Density Parity-Check Codes (LDPC). Combined with the application of the quantum distribution key, we urgently need to explore the research direction of relevant theories and technologies of LDPC codes in other fields of quantum information in the future.展开更多
In this paper,based on the block Markov superposition transmission(BMST)technique,we present a new class of coupled low-density parity-check(LDPC)codes for the transport block(TB)-based transmission to improve the err...In this paper,based on the block Markov superposition transmission(BMST)technique,we present a new class of coupled low-density parity-check(LDPC)codes for the transport block(TB)-based transmission to improve the error-correcting performance.For encoding,the previous LDPC codewords corresponding to a TB(at prior time slot)are interleaved and superimposed onto the current LDPC codewords,resulting in the transmitted codewords.For decoding,the sliding window decoding algorithm with sum-product or min-sum implementations can be employed,inheriting a relatively low-latency decoding.A distinguished advantage of the proposed coded transmission over spatially coupled LDPC(SC-LDPC)codes is that the encoder/decoder of the proposed codes can be designed by reusing the encoder/decoder architecture of component block LDPC codes.To analyze the waterfall performance of BMST-LDPC code ensembles,we present the protograph-based EXIT chart analysis,which can efficiently predict the error-correcting performance in waterfall region.To analyze the error-floor performance of BMST-LDPC codes,we employ the genie-aided(GA)lower bound,which can efficiently predict the error-correcting performance in error-floor region.For ease of implementation,the BMST-LDPC codes are constructed by taking the(2,4)-raptor-like LDPC codes or the 5G LDPC codes as the basic components.The numerical results reveal that the proposed codes can have capacity-approaching performance,exhibiting a gap of 0.007 dB away from the corresponding Shannon limit.They also reveal that,by using the proposed BMST construction,the error-correcting performance of the original 5G block LDPC codes can be significantly improved,achieving coding gains up to one dB over the AWGN channels and two dB over the fast fading channels.展开更多
This paper presents a new coding scheme called semi-low-density parity-check convolutional code(semi-LDPC-CC),whose parity-check matrix consists of both sparse and dense sub-matrices,a feature distinguished from the c...This paper presents a new coding scheme called semi-low-density parity-check convolutional code(semi-LDPC-CC),whose parity-check matrix consists of both sparse and dense sub-matrices,a feature distinguished from the conventional LDPC-CCs.We propose sliding-window list(SWL)decoding algorithms with a fixed window size of two,resulting in a low decoding latency but a competitive error-correcting performance.The performance can be predicted by upper bounds derived from the first event error probability and by genie-aided(GA)lower bounds estimated from the underlying LDPC block codes(LDPC-BCs),while the complexity can be reduced by truncating the list with a threshold on the difference between the soft metrics in the serial decoding implementation.Numerical results are presented to validate our analysis and demonstrate the performance advantage of the semi-LDPC-CCs over the conventional LDPC-CCs.展开更多
文摘空间耦合低密度奇偶校验(spatially coupled low density parity check,SC-LDPC)码在次最优迭代译码算法下能够达到最大后验概率(maximum a posterior,MAP)译码性能,但其优异的性能需要在码长很长迭代次数很多时才能实现。当采用传统迭代译码算法时,实现的复杂度将以指数增加,无法应用。为有效降低译码复杂度,滑窗译码算法被应用于空间耦合LDPC码的译码,但由于引入窗口截断,会造成译码性能的损失。针对上述问题,结合深度学习技术提出了一种空间耦合LDPC码的深度迭代译码算法。通过在消息传递过程中引入权重系数并采用深度神经网络对其进行训练获取权重系数,以此优化消息的可靠性度量值,从而加快译码收敛速度,提升译码性能。仿真结果表明:当传输在加性高斯白噪声信道时,所提的深度迭代译码算法在相同迭代次数下的译码性能均优于传统迭代译码算法和滑窗译码算法。
基金supported in part by National Natural Science Foundation of China through grant 61501002in part by Natural Science Project of Ministry of Education of Anhui through grant KJ2015A102+1 种基金in part by Talents Recruitment Program of Anhui Universityin part by the Key Laboratory Project of the Key Laboratory of Intelligent Computing and Signal Processing of the Ministry of Education of China, Anhui University
文摘This paper studies the decoding performance of low-density parity-check(LDPC)codes in a serial concatenation system with polar codes employing the successive cancellation(SC)decoding.It is known that the absolute incorrect log-likelihood ratio(LLR)values from the SC decoding can be very large.This phenomenon dramatically deteriorates the error correcting performance of the outer LDPC codes.In this paper,the LLR values of polar codes are regulated by a log processing before being sent to the LDPC decoder.Simulation results show that the log processing is an efficient approach with a low optimization complexity compared with the existing procedures to improve the performance of the serial concatenation systems.
文摘In this paper, we conclude five kinds of methods for construction of the regular low-density parity matrix H and three kinds of methods for the construction of irregular low-density parity-check matrix H. Through the analysis of the code rate and parameters of these eight kinds of structures, we find that the construction of low-density parity-check matrix tends to be more flexible and the parameter variability is enhanced. We propose that the current development cost should be lower with the progress of electronic technology and we need research on more practical Low-Density Parity-Check Codes (LDPC). Combined with the application of the quantum distribution key, we urgently need to explore the research direction of relevant theories and technologies of LDPC codes in other fields of quantum information in the future.
基金supported in part by the National Key R&D Program of China(2020YFB1807100)in part by the National Natural Science Foundation of China(61971454)in part by the Guangdong Basic and Applied Basic Research Foundation(2023A1515011056).
文摘In this paper,based on the block Markov superposition transmission(BMST)technique,we present a new class of coupled low-density parity-check(LDPC)codes for the transport block(TB)-based transmission to improve the error-correcting performance.For encoding,the previous LDPC codewords corresponding to a TB(at prior time slot)are interleaved and superimposed onto the current LDPC codewords,resulting in the transmitted codewords.For decoding,the sliding window decoding algorithm with sum-product or min-sum implementations can be employed,inheriting a relatively low-latency decoding.A distinguished advantage of the proposed coded transmission over spatially coupled LDPC(SC-LDPC)codes is that the encoder/decoder of the proposed codes can be designed by reusing the encoder/decoder architecture of component block LDPC codes.To analyze the waterfall performance of BMST-LDPC code ensembles,we present the protograph-based EXIT chart analysis,which can efficiently predict the error-correcting performance in waterfall region.To analyze the error-floor performance of BMST-LDPC codes,we employ the genie-aided(GA)lower bound,which can efficiently predict the error-correcting performance in error-floor region.For ease of implementation,the BMST-LDPC codes are constructed by taking the(2,4)-raptor-like LDPC codes or the 5G LDPC codes as the basic components.The numerical results reveal that the proposed codes can have capacity-approaching performance,exhibiting a gap of 0.007 dB away from the corresponding Shannon limit.They also reveal that,by using the proposed BMST construction,the error-correcting performance of the original 5G block LDPC codes can be significantly improved,achieving coding gains up to one dB over the AWGN channels and two dB over the fast fading channels.
基金This work was supported by the National Key R&D Program of China under Grant 2020YFB1807100the NSF of China under Grant 61971454 and Grant 62071498 and Guangdong Basic and Applied Basic Research Foundation under Grant 2020A1515010687.
文摘This paper presents a new coding scheme called semi-low-density parity-check convolutional code(semi-LDPC-CC),whose parity-check matrix consists of both sparse and dense sub-matrices,a feature distinguished from the conventional LDPC-CCs.We propose sliding-window list(SWL)decoding algorithms with a fixed window size of two,resulting in a low decoding latency but a competitive error-correcting performance.The performance can be predicted by upper bounds derived from the first event error probability and by genie-aided(GA)lower bounds estimated from the underlying LDPC block codes(LDPC-BCs),while the complexity can be reduced by truncating the list with a threshold on the difference between the soft metrics in the serial decoding implementation.Numerical results are presented to validate our analysis and demonstrate the performance advantage of the semi-LDPC-CCs over the conventional LDPC-CCs.
