Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

IEEE Communications Letters

Layered Decoding for Protograph-Based Low-Density Parity-Check Hadamard Codes

Peng-Wei Zhang, Francis C. M. Lau, Chiu‐Wing Sham

Published Feb 8, 2021• 5 citations
Publisher

Abstract

In this letter, we propose a layered decoding algorithm for protograph-based low-density parity-check Hadamard codes (PLDPC-HCs), which have been shown to be ultimate-Shannon-limit approaching. Compared with the standard decoding algorithm, the layered decoding algorithm improves the convergence rate by about two times. At a bit error rate of 2.0×10-5, the layered decoder using 20 decoding iterations shows a very small degradation of 0.03 dB compared with the standard decoder using 40 decoding iterations. Moreover, the layered decoder using 21 decoding iterations shows the same error performance as the standard decoder using 41 decoding iterations.

DOI
10.1109/lcomm.2021.3057717

Related papers

Hardware Architecture of Layered Decoders for PLDPC-Hadamard Codes

Peng-Wei Zhang, Sheng Jiang, Francis C. M. Lau +1 more

Protograph-based low-density parity-check Hadamard codes (PLDPC-HCs) are a new type of ultimate-Shannon-limit-approaching codes. In this paper, we propose a hardware architecture for the PLDPC-HC layered decoders. The decoders consist mainly of random address memories, Hadamard sub-decoders and control logics. Two types of pipelined structures are presented and the latency and throughput of these two structures are derived. Implementation of the decoder design on an FPGA board shows that a throughput of 1.48 Gbps is achieved with a bit error rate (BER) of$10^{-5}$at around$E_{b}/N_{0}=-0.40$dB. The decoder can also achieve the same BER at$E_{b}/N_{0}=-1.14$dB with a reduced throughput of 0.20 Gbps.

arXiv:2110.07906•IEEE Transactions on Circuits and Systems I Regular Papers•Aug 29, 2022•2 citations

Protograph-Based LDPC Hadamard Codes

Peng-Wei Zhang, Francis C. M. Lau, Chiu‐Wing Sham

In this paper, we propose a new method to design low-density parity-check Hadamard (LDPC-Hadamard) codes — a type of ultimate-Shannon-limit approaching channel codes. The technique is based on applying Hadamard constraints to the check nodes in a generalized protograph-based LDPC code, followed by lifting the generalized protograph. We name the codes formedprotograph-basedLDPC Hadamard (PLDPC-Hadamard) codes. We also propose a modified Protograph Extrinsic Information Transfer (PEXIT) algorithm for analyzing and optimizing PLDPC-Hadamard code designs. The proposed algorithm further allows the analysis of PLDPC-Hadamard codes with degree- 1 and/or punctured nodes. We find codes with decoding thresholds ranging from −1.53 dB to −1.42 dB. At a BER of 10−5, the gaps of our codes to the ultimate-Shannon-limit range from 0.40 dB (for rate = 0.0494) to 0.16 dB (for rate = 0.003). Moreover, the error performance of our codes is comparable to that of the traditional LDPC-Hadamard codes. Finally, the BER performances of our codes after puncturing are simulated and compared.

arXiv:2010.08285•IEEE Transactions on Communications•May 6, 2021•18 citations

Protograph-based LDPC-Hadamard Codes

P. W. Zhang, Francis C. M. Lau, Chiu‐Wing Sham

We propose a novel type of ultimate-Shannon-limit-approaching codes, namely protograph-based low-density parity-check Hadamard (PLDPC-Hadamard) codes in this paper. We also propose a systematic way of analyzing such codes using Protograph EXtrinsic Information Transfer (PEXIT) charts. Using the analytical technique we have found a code of rate about 0.05 having a theoretical threshold of -1.42dB. At a BER of 10-5, the gaps of our code to the Shannon capacity for R=0.05 and to the ultimate Shannon limit are 0.25 dB and 0.40 dB, respectively.

IEEE Wireless Communications and Networking Conference•May 1, 2020•5 citations

Spatially Coupled PLDPC-Hadamard Convolutional Codes

Peng-Wei Zhang, Francis C. M. Lau, Chiu‐Wing Sham

We propose a new type of ultimate-Shannon-limit-approaching codes called spatially coupled protograph-based low-density parity-check Hadamard convolutional codes (SC-PLDPCH-CCs), which are constructed by spatially coupling PLDPC-Hadamard block codes. We develop an efficient decoding algorithm that combines pipeline decoding and layered scheduling for the decoding of SC-PLDPCH-CCs, and analyze the latency and complexity of the decoder. To estimate the decoding thresholds of SC-PLDPCH-CCs, we first propose a layered protograph extrinsic information transfer (PEXIT) algorithm to evaluate the thresholds of spatially coupled PLDPC-Hadamard terminated codes (SC-PLDPCH-TDCs) with a moderate coupling length. With the use of the proposed layered PEXIT method, we develop a genetic algorithm to find good SC-PLDPCH-TDCs in a systematic way. Then we extend the coupling length of these SC-PLDPCH-TDCs to form good SC-PLDPCH-CCs. Results show that our constructed SC-PLDPCH-CCs can achieve comparable thresholds to the block code counterparts. Simulations illustrate the superiority of the SC-PLDPCH-CCs over the block code counterparts and other state-of-the-art low-rate codes in terms of error performance. For the rate-0.00295 SC-PLDPCH-CC, a bit error rate of 10−5is achieved at$E_{b}/N_{0} = -1.465$dB, which is only 0.125 dB from the ultimate Shannon limit.

arXiv:2109.14210•IEEE Transactions on Communications•Jul 27, 2022•6 citations

An improved-performance decoding algorithm of LDPC codes for layered decoding

Jia Li, Gaigai Yang, Zhiqiang Zhao

In order to reduce the bit error rate of low-density parity-check codes for layered decoding algorithm and improve the decoding convergence speed, an improved layered decoding algorithm is proposed. In layered decoding algorithm, updated bit nodes information can be used by check nodes in the iteration process while in dynamic decoding algorithm check nodes update in order according to the reliability. The proposed algorithm combines advantages of the layered and dynamic decoding algorithm. Moreover, compared with the definition of remaining information for check nodes in the dynamic decoding algorithm, a new method to evaluate the reliability is defined in the proposed algorithm. Based on 1/2 code rate china mobile multimedia broadcasting standard, simulation and comparison between the conventional layered decoding algorithm and the proposed layered decoding algorithm have been carried out. The simulation results show that under the same bit error rate, the signal to noise ratio of the improved algorithm reduces nearly 0.4dB as well as convergence speed improves obviously. The proposed layered decoding algorithm reduces the bit error rate and improves the reliability of data in communication system which uses LDPC codes as the channel coding.

IEEE International Conference on Communication Problem-Solving•Dec 1, 2014•1 citation

Improved Algorithm Based on Confidence Propagation Decoding Algorithm

Xiuyang Li, Yanfeng Tang, Cheng Zhang +1 more

Low-density parity-check codes(LDPC) have the advantages of high performance, flexibility, parallelized processing and iterative decoding, which make them one of the widely used error correction code schemes in communication and storage systems. In order to improve the decoding convergence speed of low-density parity-check codes, the idea of layered decoding is added to the log-likelihood ratio confidence propagation decoding algorithm, and an improved algorithm based on layered decoding strategy is proposed, which solves the problem of low decoding rate caused by vertical iteration after the completion of horizontal iteration by using the log-likelihood ratio confidence propagation decoding algorithm in each layer, at the same time. The results show that the average decoding rate of the algorithm is improved by about 25.5% compared with that before the improvement without losing or almost losing the error correction performance, and the performance of the improved layered decoding algorithm with log-likelihood ratio confidence propagation decoding is optimal when the signal-to-noise ratio is greater than 4, and the decoding performance is improved.

International Seminar on Artificial Intelligence, Networking and Information Technology (AINIT)•Jun 16, 2023•0 citations
In this letter, we propose a layered decoding algorithm for protograph-based low-density parity-check Hadamard codes (PLDPC-HCs), which have been shown to be ultimate-Shannon-limit approaching. Compared with the standard decoding algorithm, the layered decoding algorithm improves the convergence rate by about two times. At a bit error rate of 2.0×10-5, the layered decoder using 20 decoding iterations shows a very small degradation of 0.03 dB compared with the standard decoder using 40 decoding iterations. Moreover, the layered decoder using 21 decoding iterations shows the same error performance as the standard decoder using 41 decoding iterations.
Protograph-based low-density parity-check Hadamard codes (PLDPC-HCs) are a new type of ultimate-Shannon-limit-approaching codes. In this paper, we propose a hardware architecture for the PLDPC-HC layered decoders. The decoders consist mainly of random address memories, Hadamard sub-decoders and control logics. Two types of pipelined structures are presented and the latency and throughput of these two structures are derived. Implementation of the decoder design on an FPGA board shows that a throughput of 1.48 Gbps is achieved with a bit error rate (BER) of10−510^{-5}10−5at aroundEb/N0=−0.40E_{b}/N_{0}=-0.40Eb​/N0​=−0.40dB. The decoder can also achieve the same BER atEb/N0=−1.14E_{b}/N_{0}=-1.14Eb​/N0​=−1.14dB with a reduced throughput of 0.20 Gbps.
In this paper, we propose a new method to design low-density parity-check Hadamard (LDPC-Hadamard) codes — a type of ultimate-Shannon-limit approaching channel codes. The technique is based on applying Hadamard constraints to the check nodes in a generalized protograph-based LDPC code, followed by lifting the generalized protograph. We name the codes formedprotograph-basedLDPC Hadamard (PLDPC-Hadamard) codes. We also propose a modified Protograph Extrinsic Information Transfer (PEXIT) algorithm for analyzing and optimizing PLDPC-Hadamard code designs. The proposed algorithm further allows the analysis of PLDPC-Hadamard codes with degree- 1 and/or punctured nodes. We find codes with decoding thresholds ranging from −1.53 dB to −1.42 dB. At a BER of 10−5, the gaps of our codes to the ultimate-Shannon-limit range from 0.40 dB (for rate = 0.0494) to 0.16 dB (for rate = 0.003). Moreover, the error performance of our codes is comparable to that of the traditional LDPC-Hadamard codes. Finally, the BER performances of our codes after puncturing are simulated and compared.
We propose a novel type of ultimate-Shannon-limit-approaching codes, namely protograph-based low-density parity-check Hadamard (PLDPC-Hadamard) codes in this paper. We also propose a systematic way of analyzing such codes using Protograph EXtrinsic Information Transfer (PEXIT) charts. Using the analytical technique we have found a code of rate about 0.05 having a theoretical threshold of -1.42dB. At a BER of 10-5, the gaps of our code to the Shannon capacity for R=0.05 and to the ultimate Shannon limit are 0.25 dB and 0.40 dB, respectively.
We propose a new type of ultimate-Shannon-limit-approaching codes called spatially coupled protograph-based low-density parity-check Hadamard convolutional codes (SC-PLDPCH-CCs), which are constructed by spatially coupling PLDPC-Hadamard block codes. We develop an efficient decoding algorithm that combines pipeline decoding and layered scheduling for the decoding of SC-PLDPCH-CCs, and analyze the latency and complexity of the decoder. To estimate the decoding thresholds of SC-PLDPCH-CCs, we first propose a layered protograph extrinsic information transfer (PEXIT) algorithm to evaluate the thresholds of spatially coupled PLDPC-Hadamard terminated codes (SC-PLDPCH-TDCs) with a moderate coupling length. With the use of the proposed layered PEXIT method, we develop a genetic algorithm to find good SC-PLDPCH-TDCs in a systematic way. Then we extend the coupling length of these SC-PLDPCH-TDCs to form good SC-PLDPCH-CCs. Results show that our constructed SC-PLDPCH-CCs can achieve comparable thresholds to the block code counterparts. Simulations illustrate the superiority of the SC-PLDPCH-CCs over the block code counterparts and other state-of-the-art low-rate codes in terms of error performance. For the rate-0.00295 SC-PLDPCH-CC, a bit error rate of 10−5is achieved atEb/N0=−1.465E_{b}/N_{0} = -1.465Eb​/N0​=−1.465dB, which is only 0.125 dB from the ultimate Shannon limit.
In order to reduce the bit error rate of low-density parity-check codes for layered decoding algorithm and improve the decoding convergence speed, an improved layered decoding algorithm is proposed. In layered decoding algorithm, updated bit nodes information can be used by check nodes in the iteration process while in dynamic decoding algorithm check nodes update in order according to the reliability. The proposed algorithm combines advantages of the layered and dynamic decoding algorithm. Moreover, compared with the definition of remaining information for check nodes in the dynamic decoding algorithm, a new method to evaluate the reliability is defined in the proposed algorithm. Based on 1/2 code rate china mobile multimedia broadcasting standard, simulation and comparison between the conventional layered decoding algorithm and the proposed layered decoding algorithm have been carried out. The simulation results show that under the same bit error rate, the signal to noise ratio of the improved algorithm reduces nearly 0.4dB as well as convergence speed improves obviously. The proposed layered decoding algorithm reduces the bit error rate and improves the reliability of data in communication system which uses LDPC codes as the channel coding.
Low-density parity-check codes(LDPC) have the advantages of high performance, flexibility, parallelized processing and iterative decoding, which make them one of the widely used error correction code schemes in communication and storage systems. In order to improve the decoding convergence speed of low-density parity-check codes, the idea of layered decoding is added to the log-likelihood ratio confidence propagation decoding algorithm, and an improved algorithm based on layered decoding strategy is proposed, which solves the problem of low decoding rate caused by vertical iteration after the completion of horizontal iteration by using the log-likelihood ratio confidence propagation decoding algorithm in each layer, at the same time. The results show that the average decoding rate of the algorithm is improved by about 25.5% compared with that before the improvement without losing or almost losing the error correction performance, and the performance of the improved layered decoding algorithm with log-likelihood ratio confidence propagation decoding is optimal when the signal-to-noise ratio is greater than 4, and the decoding performance is improved.