IEEE Communications Letters

Finite-Length Puncturing Pattern Design for LDPC Codes With Hadamard Constraints

Junyi Du, Peng Kang, Lei Xiao

Published Feb 17, 2025• 0 citations

Abstract

In this letter, we propose a two-stage method to design finite-length puncturing patterns for LDPC codes with Hadamard constraints. At the first stage, we propose the distribution of puncturing patterns and develop extrinsic information transfer functions for distribution optimization in terms of the lowest decoding threshold. At the second stage, we analyze the iterative update process of a Hadamard check node (HCN) and find that the Euclidean distance determines the reliability of its output extrinsic information. Based on this, we propose a greedy algorithm to design puncturing patterns to maximize the number of punctured variable nodes with reliable input information. Simulations verify the good performance of the Hadamard-LDPC code with our designed puncturing patterns, compared to the 5G new radio LDPC code and the same Hadamard-LDPC code with other puncturing patterns.

DOI: 10.1109/lcomm.2025.3543011

Related papers

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.

IEEE Transactions on CommunicationsMay 6, 202115 citations

Protograph-Based Low-Density Parity-Check 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 formed protograph-based LDPC 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 1e-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.08285Oct 16, 20205 citations

Novel intentional puncturing schemes for finite-length irregular LDPC codes

Jingjing Liu, Rodrigo C. de Lamare

In this paper, we investigate rate-compatible (RC) short/ moderate length irregular low-density parity-check (LDPC) codes and propose three different novel puncturing schemes to determine the preferred puncturing positions so as to achieve less performance degradation. The first one is based on a short cycle counting algorithm as well as grouping variable nodes which have the equal length of short cycles in the Tanner Graph; the second scheme can be seen as an improved version of the first one by means of introducing another metric called Extrinsic Message Degree (EMD); and the last scheme relies on a simulation-based exhaustive search in order to find the best puncturing pattern among several random puncturing patterns. The simulation results show that all three proposed schemes can achieve the rate flexibility and minimize the performance loss over the additive white Gaussian noise (AWGN) channel.

IEEE International Conference on Digital Signal Processing (DSP)Jul 1, 20119 citations

Results on Punctured Low-Density Parity-Check Codes and Improved Iterative Decoding Techniques

Hossein Pishro-Nik, Faramarz Fekri

This paper first introduces an improved decoding algorithm for low-density parity-check (LDPC) codes over binary-input-output-symmetric memoryless channels. Then some fundamental properties of punctured LDPC codes are presented. It is proved that for any ensemble of LDPC codes, there exists a puncturing threshold. It is then proved that for any rates R1and R2satisfying 0121to R2resulting in asymptotically good codes for all rates R1lesRlesR2. Specifically, this implies that rates arbitrarily close to one are achievable via puncturing. Bounds on the performance of punctured LDPC codes are also presented. It is also shown that punctured LDPC codes are as good as ordinary LDPC codes. For BEC and arbitrary positive numbers R121lesRlesR2is shown. Based on the above observations, a method is proposed to design good punctured LDPC codes over a broad range of rates. Finally, it is shown that the results of this paper may be used for the proof of the existence of the capacity-achieving LDPC codes over binary-input-output-symmetric memoryless channels

IEEE Transactions on Information TheoryJan 23, 2007100 citations

Layered PEXIT-based Optimization of Puncturing Patterns for 5G-LDPC Codes in Few-Iteration Decoding

Qiushi Xu, Ming Jiang, Qiang Wang

In this paper, an innovative method to optimize the puncturing patterns of the 5G low-density parity-check codes, which leverages layered protograph-based extrinsic information transfer (PEXIT) analysis to evaluate decoding performance and the progressive multi-path search (PMPS) algorithm to optimizing puncturing patterns. Compared with existing methods, layered PEXIT analysis is faster and more accurate, while the PMPS algorithm effectively addresses the local optimum trap commonly encountered by greedy algorithms. Simulation results demonstrate that using optimized puncturing patterns significantly improve the few-iteration decoding performance, thereby enhancing the reliability of resource-constrained communication systems without introducing any additional complexity.

IEEE/CIC International Conference on Communications in China (ICCC)Aug 10, 20250 citations

Rate-compatible Puncturing Algorithm for Finite-length LDPC Codes

Niu He-ha

This paper propose a rate-compatible puncturing scheme for finite-length low-density parity-check(LDPC) codes over the additive white Gaussian noise(AWGN)channel.The method can applicable to both regular and irregular LDPC code.The scheme selects bits to be punctured base on a sequence of criteria.An important selection criterion is the number of short cycles with low approximate cycle extrinsic message degree(ACE)in which a candidate bit node participates.Simulation results demonstrate that the ACE plays an important role in the performance of the codes,these results also show that the scheme is superior to the existing puncturing methods in a wide range of code rates.

Jan 1, 20130 citations