Turbo Coding with Iterative Decoding
Also known as: iterative decoding, concatenated codes
Turbo codes, introduced by Berrou, Glavieux, and Thitimajshima in 1993, are a landmark in channel coding history. They achieve performance within 0.5 dB of the Shannon limit—the theoretical boundary for reliable communication—a feat previously thought impossible with practical complexity. Turbo codes use concatenated convolutional codes with an interleaver and iterative decoding via belief propagation. They were adopted in 3G (UMTS) and remain important in 4G/5G systems alongside LDPC codes.
Read the full method
Sign in with a free account to read this section.
Method map
The neighbourhood of related methods — select a node to explore.
When to use it
Turbo codes excel in deep-fading or noisy channels where strong error correction is needed (e.g., satellite, deep space, underwater). Use turbo coding when low bit-error rates (BER < 10^-6) are critical and latency permits iterative decoding (few milliseconds). Turbo codes are less suited to rate-critical applications or very short packets (interleaver and decoder state dominate overhead). With the rise of LDPC and polar codes (slightly better performance, simpler), turbo codes are now legacy in many new standards, though still used in compatibility layers.
Strengths & limitations
- Performance within 0.5 dB of Shannon limit with practical complexity
- Works well over a wide range of signal-to-noise ratios without threshold phenomenon (unlike classical codes)
- Iterative decoding improves performance with each iteration, allowing rate control via iteration count
- Separable design: any convolutional code can be used, enabling flexibility
- Robust to burst errors due to interleaver spreading
- Iterative decoding introduces latency (tens of milliseconds for long interleavers)
- Performance is sensitive to interleaver design; poor choice undermines the turbo effect
- Errors tend to propagate in clusters (error floor) at very low BERs; requires code tailoring to mitigate
- Decoding complexity is proportional to information length (not exponential, but still high)
- Short packets suffer from interleaver overhead and insufficient iteration depth for convergence
Frequently asked
What is the 'turbo' in turbo codes?
The name refers to the iterative decoding process resembling a turbo engine: each decoder 'boosts' the signal for the next decoder. The exponential performance gain per iteration is sometimes called the turbo effect. It is not literally related to turbochargers.
Why is the interleaver so important?
The interleaver breaks correlations in the error patterns from the first decoder before the second decoder sees them. Without it, both decoders would make the same mistakes repeatedly. A good interleaver ensures that errors from one decoder are spread out randomly, giving the second decoder a fresh perspective and enabling productive iteration.
What is the turbo cliff?
Turbo codes exhibit a sharp threshold: below a critical SNR, iterative decoding fails to converge, and BER is poor. Above the threshold, BER drops sharply. This is the turbo cliff. For system design, SNR must be safely above the cliff; operating just below causes catastrophic failure despite seeming SNR.
How many iterations are needed?
Typical turbo decoders use 8-20 iterations; more iterations improve performance but increase latency. At high SNR, few iterations suffice (convergence is fast). At low SNR, more iterations are needed. Adaptive iteration (check convergence, stop early if done) balances latency and performance.
Sources
- Berrou, C., Glavieux, A., & Thitimajshima, P. (1993). Near Shannon limit error-correcting coding and decoding: Turbo-codes. In Proceedings of the IEEE International Conference on Communications (ICC), 1064-1070. DOI: 10.1109/ICC.1993.397441 ↗
- Richardson, T. J., & Urbanke, R. L. (2002). The capacity of low-density parity-check codes under message-passing decoding. IEEE Transactions on Information Theory, 47(2), 599-618. DOI: 10.1109/18.910577 ↗
How to cite this page
ScholarGate. (2026, June 3). Turbo Coding with Iterative Decoding. ScholarGate. https://scholargate.app/en/telecommunications/turbo-code
Which method?
Set this method beside its closest kin and read them side by side — the library lays the books on the table; the choice is yours.
- LDPC CodesTelecommunications↔ compare
- MIMOTelecommunications↔ compare
- OFDMTelecommunications↔ compare
- Polar CodesTelecommunications↔ compare
- Shannon CapacityTelecommunications↔ compare