Iterative Decoding Threshold Analysis for LDPC Convolutional Codes

Lentmaier, Michael; Sridharan, Arvind; Costello, Daniel J.; Zigangirov, Kamil Sh.

doi:10.1109/tit.2010.2059490

Cited by 359 publications

(381 citation statements)

References 24 publications

Supporting

Mentioning

370

Contrasting

Unclassified

Order By: Relevance

“…and the decoding threshold achieves the Shannon limit, (3) and (4), obviously the single-layer code {l 1 + l 2 , r, L, w} has the same rate as in (7) and achieves the same limit as in (8). Therefore, the theorem is proven.…”

Section: Theorem 2 [10] We Denote a Bilayer Ldpc Convolutional Code mentioning

confidence: 73%

“…Consequently, bilayer LDPC convolutional codes of different rates are constructed. Note that rate loss is inevitable for finite L [8]. We compare the decoding thresholds of both the single-layer code and the bilayer codes with the corresponding Shannon limits.…”

Section: Numerical Resultsmentioning

confidence: 99%

“…A regular (l, r) time-varying binary LDPC convolutional code can be defined by a syndrome former matrix [8] …”

Section: A Ldpc Convolutional Codesmentioning

confidence: 99%

“…LDPC convolutional codes were first proposed in [6] as a time-varying periodic LDPC code variation. Then the idea was further developed in, e.g., [7], [8]. Recently, it has been proven This work was supported in part by the European Community's Seventh Framework Programme under grant agreement no 257626 (ACROPOLIS) and the Swedish Foundation for Strategic Research. analytically in [9] that the belief-propagation (BP) decoding threshold of an LDPC convolutional code achieves the optimal maximum a posteriori probability (MAP) threshold of the corresponding LDPC block code with the same variable and check degrees.…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Bilayer LDPC convolutional codes for half-duplex relay channels

Thobaben

Skoglund

2011

2011 IEEE International Symposium on Information Theory Proceedings

View full text Add to dashboard Cite

Abstract-In this paper we present regular bilayer LDPC convolutional codes for half-duplex relay channels. For the binary erasure relay channel, we prove that the proposed code construction achieves the capacities for the source-relay link and the source-destination link provided that the channel conditions are known when designing the code. Meanwhile, this code enables the highest transmission rate with decode-and-forward relaying. In addition, its regular degree distributions can easily be computed from the channel parameters, which significantly simplifies the code optimization. Numerical results are provided for both binary erasure channels (BEC) and AWGN channels. In BECs, we can observe that the gaps between the decoding thresholds and the Shannon limits are impressively small. In AWGN channels, the bilayer LDPC convolutional code clearly outperforms its block code counterpart in terms of bit error rate.

show abstract

Section: Theorem 2 [10] We Denote a Bilayer Ldpc Convolutional Code mentioning

confidence: 73%

Section: Numerical Resultsmentioning

confidence: 99%

“…A regular (l, r) time-varying binary LDPC convolutional code can be defined by a syndrome former matrix [8] …”

Section: A Ldpc Convolutional Codesmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Bilayer LDPC convolutional codes for half-duplex relay channels

Thobaben

Skoglund

2011

2011 IEEE International Symposium on Information Theory Proceedings

View full text Add to dashboard Cite

show abstract

“…The convergence behavior of iteratively decoded systems can be accurately analyzed by using the density evolution (DE) algorithm [16]. However, as DE tracks the evolution of probability density functions (pdfs) of soft information, its computational complexity is very high.…”

Section: Threshold Analysis Via Three-dimensional Exit Chartmentioning

confidence: 99%

High rate serially concatenated codes with low error floors

Liu¹,

Tong

Guo³

et al. 2015

2015 9th International Conference on Signal Processing and Communication Systems (ICSPCS)

View full text Add to dashboard Cite

Serial concatenation of Hamming codes and an accumulator has been shown to achieve near capacity performance at high code rates. However, these codes usually exhibit poor error floor performance due to their small minimum distances. To overcome this weakness, we propose to replace the outer Hamming codes by product codes constructed from Hamming codes and single-parity-check codes. In this way, the minimum distance of the outer code can be doubled, which is expected to increase the minimum distance of the serially concatenated code and thus to improve error floor performance. Three-dimensional EXIT chart is used for their convergence analysis and the derived thresholds are shown to be close to Shannon limit. Low weight distance spectrum of the proposed code is also calculated and compared with the original code. Simulation results show that the proposed codes can lower the error floor by two orders of magnitudes without waterfall performance degradation at short block length. Abstract-Serial concatenation of Hamming codes and an accumulator has been shown to achieve near capacity performance at high code rates. However, these codes usually exhibit poor error floor performance due to their small minimum distances. To overcome this weakness, we propose to replace the outer Hamming codes by product codes constructed from Hamming codes and single-parity-check codes. In this way, the minimum distance of the outer code can be doubled, which is expected to increase the minimum distance of the serially concatenated code and thus to improve error floor performance. Three-dimensional EXIT chart is used for their convergence analysis and the derived thresholds are shown to be close to Shannon limit. Low weight distance spectrum of the proposed code is also calculated and compared with the original code. Simulation results show that the proposed codes can lower the error floor by two orders of magnitudes without waterfall performance degradation at short block length.

show abstract

References

2015

Fundamentals of Convolutional Coding

View full text Add to dashboard Cite

Iterative Decoding Threshold Analysis for LDPC Convolutional Codes

Cited by 359 publications

References 24 publications

Bilayer LDPC convolutional codes for half-duplex relay channels

Bilayer LDPC convolutional codes for half-duplex relay channels

High rate serially concatenated codes with low error floors

References

Contact Info

Product

Resources

About