A New Early Termination Scheme of Iterative Turbo Decoding Using Decoding Threshold

Li, Fan-Min; Lin, Cheng-Hung; Wu, An-Yeu

doi:10.1109/sips.2006.352561

Cited by 2 publications

(2 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Practical codes failed to reach Shannon's capacity limit until the discovery of turbo code in 1990s by Claude Berrou et al [14], [15]. Due to its excellent error correction capability, turbo code finds wide applications in mobile communication, short-range communication, deep space communication, and wireless networks [3], [16], [17].…”

Section: Turbo Code Principles and Iterative Decodingmentioning

confidence: 99%

An Efficient Early Iteration Termination for Turbo Decoder

Salija,

Yamuna

2016

JTIT

View full text Add to dashboard Cite

Turbo code finds wide applications in mobile communication, deep space communication, satellite communication and short-range communication despite its high computational complexity and iterative nature. Realizing capacity approaching turbo code is a great achievement in the field of communication systems due to its efficient error correction capability. The high computational complexity associated with the iterative process of decoding turbo code consumes large power, introducing decoding delay, and reducing the throughput. Hence, efficient iteration control techniques are required to make the turbo code more power efficient. In this paper, a simple and efficient early iteration termination technique is introduced based on absolute value of the mean of extrinsic information at the component decoders of turbo code. The simulation results presented clearly show that the proposed method is capable of reducing the average number of iterations while maintaining performance close to that of fixed iteration termination. The significant reduction in iteration achieved by the method reduces decoding delay and complexity while maintaining Bit Error Rate performance close to standard fixed iteration turbo decoder.

show abstract

Section: Turbo Code Principles and Iterative Decodingmentioning

confidence: 99%

An Efficient Early Iteration Termination for Turbo Decoder

Salija,

Yamuna

2016

JTIT

View full text Add to dashboard Cite

show abstract

“…In this paper, we will demonstrate that the presence of these degreeone variable nodes prevents the application of conventional EXtrinsic Information Transfer (EXIT) chart analysis [4] for characterising the iterative decoding convergence of the NR LDPC code. It also prevents the use of EXIT charts as a powerful tool of characterising the capacity-approaching capability [5] of the NR LDPC code, or for designing the iterative decoding activation order [6] or the control of early termination strategies [7], for example.…”

Section: Introductionmentioning

confidence: 99%

3D EXIT Charts for Analyzing the 5G 3GPP New Radio LDPC Decoder

et al. 2020

View full text Add to dashboard Cite

Low Density Parity Check (LDPC) codes have been selected to provide channel coding for data in the next generation of wireless communication standard referred to in practice as the 3GPP New Radio (NR). In contrast to the LDPC codes adopted in previous standards, the NR LDPC code can be considered to be a concatenation of a core LDPC code and a Low Density Generator Matrix (LDGM) code. This particular feature has the advantage of offering flexible coding rate, but it prevents the application of conventional extrinsic information transfer (EXIT) chart analysis. This paper characterizes this problem and addresses it using a novel reinterpretation of the NR LDPC factor graph. Based on this factor graph, a novel 3D EXIT chart technique is conceived for our three-stage scheme, which facilitates the visual characterisation of the NR LDPC decoder's iterative decoding convergence process for the first time. The proposed EXIT chart analysis accurately visualizes the mutual information exchange amongst the components of the NR LDPC decoder, which was not facilitated by the conventional 2D EXIT chart. We demonstrate the power of this technique by using it to design a novel iterative decoding activation order for the NR LDPC decoder, which reduces the decoding complexity by approximately 17% compared to a conventional flooding decoder. This is achieved without degrading its error correction capability. We conclude by discussing several other opportunities for exploiting the proposed 3D EXIT chart technique to improve the design of concatenated LDPC and LDGM codes. INDEX TERMS NR LDPC code, EXIT chart analysis, NR LDPC Decoder design.

show abstract

A New Early Termination Scheme of Iterative Turbo Decoding Using Decoding Threshold

Cited by 2 publications

References 15 publications

An Efficient Early Iteration Termination for Turbo Decoder

An Efficient Early Iteration Termination for Turbo Decoder

3D EXIT Charts for Analyzing the 5G 3GPP New Radio LDPC Decoder

Contact Info

Product

Resources

About