Memory-reduced maximum a posteriori probability decoding for high-throughput parallel turbo decoders

DOI10.1007/s00034-015-0168-4zbMath1346.94047OpenAlexW2158434304MaRDI QIDQ318289

Rahul Shrestha, Roy Paily

Publication date: 4 October 2016

Published in: Circuits, Systems, and Signal Processing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00034-015-0168-4

zbMATH Keywords

bit-error-rate (BER) performancemaximum a posteriori probability (MAP) decoderparallel turbo decodersliding-window Bahl-Cocke-Jelinek-Raviv (SWBCJR) algorithmturbo codevery large scale integration (VLSI) design

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Source coding (94A29)

Cites Work

• A Mathematical Theory of Communication
• Optimal Sequence Detection and Optimal Symbol-by-Symbol Detection: Similar Algorithms
• Channel identification for high speed digital communications
• Optimal decoding of linear codes for minimizing symbol error rate (Corresp.)
• Data width requirements in SISO decoding with module normalization
• Path partitions and forward-only trellis algorithms
• Optimum soft-output detection for channels with intersymbol interference
• Low-Power Memory-Reduced Traceback MAP Decoding for Double-Binary Convolutional Turbo Decoder
• High-Throughput LDPC-Decoder Architecture Using Efficient Comparison Techniques & Dynamic Multi-Frame Processing Schedule
• High-Efficiency Processing Schedule for Parallel Turbo Decoders Using QPP Interleaver