Journal Article10.1109/TWC.2007.060386
Efficient Puncturing Method for Rate-Compatible Low-Density Parity-Check Codes
56
TL;DR: The proposed algorithm provides the order of variable nodes for puncturing based on the proposed cost function and prevents the formation of a stopping set from the punctured variable nodes even when the amount of puncturing is quite large.
read more
Abstract: In this paper, we propose an efficient puncturing method for LDPC codes. The proposed algorithm provides the order of variable nodes for puncturing based on the proposed cost function. The proposed cost function tries to maximize the minimum reliability among those provided from all check nodes. Also, it tries to allocate survived check nodes evenly to all punctured variable nodes. Furthermore, the proposed algorithm prevents the formation of a stopping set from the punctured variable nodes even when the amount of puncturing is quite large. Simulation results show that the proposed punctured LDPC codes perform better than existing punctured LDPC codes.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
The Design of Rate-Compatible Protograph LDPC Codes
TL;DR: This paper presents a simple yet powerful method for designing embedded rate-compatible families of LDPC codes based on successively extending a high-rate protograph, which not only inherit the advantages of protograph codes, but also cover a wide range of rates and have very good performance with thresholds that are all within 0.15 dB of their capacity limits.
The design of rate-compatible protograph LDPC codes
Thuy Van Nguyen,Aria Nosratinia,Dariush Divsalar +2 more
- 01 Sep 2010
TL;DR: This paper presents a simple yet powerful method for designing embedded rate-compatible families of LDPC codes based on successively extending a high-rate protograph, which not only inherit the advantages of protograph codes, but also cover a wide range of rates and have very good performance with thresholds that are all within 0.15 dB of their capacity limits.
Patent
Method and apparatus for channel encoding and decoding in a communication system using low-density parity-check codes
Seho Myung,Hwan-Joon Kwon,Jae-Yoel Kim,Yeon-Ju Lim,Sung-Ryul Yun,Hak-Ju Lee,Hong-Sil Jeong +6 more
- 11 Feb 2009
TL;DR: In this article, an apparatus and method for encoding a channel in a communication system using a Low-Density Parity-Check (LDPC) code is presented, which includes determining a number of parity bits to be subjected to puncturing; dividing the parity bits at predetermined intervals; determining positions of puncturing parity bits; and repeatedly performing puncturing on the puncturing bits corresponding to the determined positions at the predetermined intervals.
61
Reconfigurable rateless codes
TL;DR: A reconfigurable rateless code designed for the transmission of 9,500 information bits that achieves a performance that is approximately 1 dB away from the discrete-input continuous-output memoryless channel's (DCMC) capacity over a diverse range of channel signal-to-noise (SNR) ratios.
Rate-Compatible Short-Length Protograph LDPC Codes
Thuy Van Nguyen,Aria Nosratinia +1 more
TL;DR: This paper produces a rate-compatible protograph LDPC code at 1k information blocklength with superior performance in both waterfall and error floor regions.
53
References
Analysis of sum-product decoding of low-density parity-check codes using a Gaussian approximation
TL;DR: By using the Gaussian approximation for message densities under density evolution, the sum-product decoding algorithm can be visualize and the optimization of degree distributions can be understood and done graphically using the visualization.
Progressive edge-growth Tanner graphs
Xiao-Yu Hu,Evangelos Eleftheriou,D.M. Arnold +2 more
- 25 Nov 2001
TL;DR: It is shown how to exploit the PEG graph construction to obtain LDPC codes that allow linear time encoding and the advantages of PEG Tanner graphs over randomly constructed graphs are demonstrated by extensive simulation results on code performance.
565
Rate-compatible puncturing of low-density parity-check codes
TL;DR: It is shown that good puncturing patterns exist and that the puncturing can be performed in a rate-compatible fashion, which allows one to implement a single "mother" encoder and decoder that is good across a wide range of rates.
Rate-compatible punctured low-density parity-check codes with short block lengths
TL;DR: A procedure for determining the puncturing distributions for LDPC codes with short block lengths is given and it is shown that careful puncturing can produce good performance.
237
On construction of rate-compatible low-density Parity-check codes
M.R. Yazdani,Amir H. Banihashemi +1 more
TL;DR: Application of the proposed construction of rate-compatible low-density parity-check codes to a type-II hybrid automatic repeat request (ARQ) scheme with information block length k=1024 and code rates 8/19 to 8/10, results in a throughput which is only about 0.7 dB away from Shannon limit.
236