Fast Decoding of Rate-Compatible Punctured LDPC Codes

Kwon, Jini; Kline, D.; Ha, Jeongseok; McLaughlin, S.W.

doi:10.1109/isit.2007.4557229

Cited by 7 publications

(4 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Suppose we now decode C 1 based on the Tanner graph corresponding to H eq (D) of C 2 . Conventional iterative decoding scheme with proper scheduling [15] for punctured LDPC codes can then be employed here to improve the decoding performance. Revealed by the simulation results in Fig.…”

Section: A Novel Viewpoint On Tanner Graph For Decoding Ldpc-cc With Rpcmmentioning

confidence: 99%

“…Set H eq (D) = H * (D). Once the equivalent parity-check matrix H eq (D) is obtained, we can employ the standard BP algorithm or the decoding algorithms for punctured LDPC codes which can boost the convergence speed and enhance the BER performance [15] for the decoding of LDPC-CC with RPCM. For the case that H(D) contains more rational entries, the graph transformation can also be completed by running Procedure 1 with respect to all rational entries one by one as long as every rational entry is moved to the (1, c) position with proper permutation of rows and columns.…”

Section: A Novel Viewpoint On Tanner Graph For Decoding Ldpc-cc With Rpcmmentioning

confidence: 99%

See 1 more Smart Citation

Decoding of LDPC convolutional codes with rational parity-check matrices from a new graphical perspective

Weng

Lai

Wang

2010

2010 IEEE International Symposium on Information Theory

View full text Add to dashboard Cite

Previous studies on low-density parity-check convolutional codes (LDPC-CC) reveal that LDPC-CC with rational parity-check matrices (RPCM) suffer from the unaffordable decoding latency/complexity due to the infinite memory order and the poor bit-error-rate performance due to the existence of length-4 cycles in the Tanner graph. However, in this paper, we show that every LDPC-CC with RPCM can be associated with an equivalent Tanner graph which can avoid the infinite memory order and undesired short length cycles but still implements the same constraints specified by the RPCM. Together with the iterative decoding based on belief propagation with proper scheduling, simulation results indicate that LDPC-CC with RPCM can also provide satisfactory decoding performance.

show abstract

Section: A Novel Viewpoint On Tanner Graph For Decoding Ldpc-cc With Rpcmmentioning

confidence: 99%

Section: A Novel Viewpoint On Tanner Graph For Decoding Ldpc-cc With Rpcmmentioning

confidence: 99%

Decoding of LDPC convolutional codes with rational parity-check matrices from a new graphical perspective

Weng

Lai

Wang

2010

2010 IEEE International Symposium on Information Theory

View full text Add to dashboard Cite

show abstract

“…Considering the experience with other standards, such as IEEE 802.16 [5] and IEEE 802.11 [6], it is reasonable to evaluate the possibility of future inclusion of the LDPC code family to FEC techniques used in low-resource standards and systems. Our theoretical method is in some aspects similar to the LDPC code puncturing method presented in [7] and further analyzed in [8], while being different in one key aspectthe fixed bits are always part of the information portion of the codeword, so their value is always known, thus enabling to initialize the prior Log Likelihood Ratios (LLRs) of the fixed bits to infinite confidence, instead of zero. This paper focuses on preliminary evaluation of the potential of LDPC code utilization in the context of a very resource-constrained platform.…”

Section: Introductionmentioning

confidence: 99%

Analysis of Minimal LDPC Decoder System on a Chip Implementation

Farkas¹,

Palenik²,

Rakús

et al. 2015

RADIOENGINEERING

View full text Add to dashboard Cite

This paper presents a practical method of potential replacement of several different Quasi-Cyclic Low-Density Parity-Check (QC-LDPC) codes with one, with the intention of saving as much memory as required to implement the LDPC encoder and decoder in a memory-constrained System on a Chip (SoC). The presented method requires only a very small modification of the existing encoder and decoder, making it suitable for utilization in a Software Defined Radio (SDR) platform. Besides the analysis of the effects of necessary variable-node value fixation during the Belief Propagation (BP) decoding algorithm, practical standard-defined code parameters are scrutinized in order to evaluate the feasibility of the proposed LDPC setup simplification. Finally, the error performance of the modified system structure is evaluated and compared with the original system structure by means of simulation. KeywordsLDPC code shortening, System on a Chip, fixed nodes decoder, Adaptive Coding and Modulation.

show abstract

“…A trade-off between the number of iterations and the bit error rate (BER) performance is needed. A Layered BP algorithm is a modified BP algorithm that accelerates the decoding convergence and reduces the required number of iterations for RCP-LDPC codes was introduced in [12].…”

Section: Introductionmentioning

confidence: 99%

An incremental redundancy short length LDPC codes based on random construction techniques

Baghdady

Fahmy

El-Soudani

2010

2010 17th International Conference on Telecommunications

View full text Add to dashboard Cite

In this paper, a powerful class of irregular low-density parity check (LDPC) codes based on random construction techniques is presented. The resultant codes have accurate profile with the additional features of making them suitable for incremental redundancy systems. The proposed codes also have low encoding complexity and can be decoded efficiently. Moreover, these codes show better puncturing performance than irregular LDPC codes obtained by other techniques over a wide range of code rates (0.6~0.9) and become more distinctive at higher rates.

show abstract

Fast Decoding of Rate-Compatible Punctured LDPC Codes

Cited by 7 publications

References 16 publications

Decoding of LDPC convolutional codes with rational parity-check matrices from a new graphical perspective

Decoding of LDPC convolutional codes with rational parity-check matrices from a new graphical perspective

Analysis of Minimal LDPC Decoder System on a Chip Implementation

An incremental redundancy short length LDPC codes based on random construction techniques

Contact Info

Product

Resources

About