Area-efficient high-speed decoding schemes for turbo decoders
- 1 December 2002
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Very Large Scale Integration (VLSI) Systems
- Vol. 10 (6) , 902-912
- https://doi.org/10.1109/TVLSI.2002.808451
Abstract
Turbo decoders inherently have large decoding latency and low throughput due to iterative decoding. To increase the throughput and reduce the latency, high-speed decoding schemes have to be employed. In this paper, following a discussion on basic parallel decoding architectures, the segmented sliding window approach and two other types of area-efficient parallel decoding schemes are proposed. Detailed comparison on storage requirement, number of computation units, and the overall decoding latency is provided for various decoding schemes with different levels of parallelism. Hybrid parallel decoding schemes are proposed as an attractive solution for very high level parallelism implementations. To reduce the storage bottleneck for each subdecoder, a modified version of the partial storage of state metrics approach is presented. The new approach achieves a better tradeoff between storage part and recomputation part in general. The application of the pipeline-interleaving technique to parallel turbo decoding architectures is also presented. Simulation results demonstrate that the proposed area-efficient parallel decoding schemes do not cause performance degradation.Keywords
This publication has 13 references indexed in Scilit:
- VLSI implementation issues of TURBO decoder design for wireless applicationsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- A Viterbi algorithm with soft-decision outputs and its applicationsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Near Shannon limit error-correcting coding and decoding: Turbo-codes. 1Published by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Implementation and performance of a serial MAP decoder for use in an iterative turbo decoderPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- A comparison of optimal and sub-optimal MAP decoding algorithms operating in the log domainPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- A high-speed MAP architecture with optimized memory size and power consumptionPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- VLSI architectures for turbo codesIEEE Transactions on Very Large Scale Integration (VLSI) Systems, 1999
- An intuitive justification and a simplified implementation of the MAP decoder for convolutional codesIEEE Journal on Selected Areas in Communications, 1998
- Near optimum error correcting coding and decoding: turbo-codesIEEE Transactions on Communications, 1996
- Optimal decoding of linear codes for minimizing symbol error rate (Corresp.)IEEE Transactions on Information Theory, 1974