2012/01/31 by Yonghui Li, Qimin You, Soung Chang Liew +2 · 2 citations
Computer Science · Engineering · Mathematics · #Advanced Wireless Communication Techniques #Algorithm #Arithmetic #Artificial intelligence #BCJR algorithm #Binary number #Block code #Coding theory and cryptography #Computer science #Concatenated error correction code #Convolutional code #Decoding methods #Dual (grammatical number) #Encoder #Encoding (memory) #Error Correcting Code Techniques #Mathematics #Sequential decoding #Serial concatenated convolutional codes #Theoretical computer science #Turbo code #cs.IT #math.IT
paper · pdf · doi:10.1002/ett.3018
32 pages, 20 figures, to appear in ETT
openalex publication_date 2016/01/20 · arxiv created 2016/11/11 · arxiv updated 2016/11/14 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/05
Abstract In this paper, we revisit the forward, backward and bidirectional Bahl–Cocke–Jelinek–Raviv (BCJR) soft‐input soft‐output (SISO) maximum a posteriori probability (MAP) decoding process of rate‐1 binary convolutional codes. From this, we establish some interesting explicit relationships between encoding and decoding of rate‐1 convolutional codes. We observe that the forward and backward BCJR SISO MAP decoders can be simply represented by their dual SISO channel encoders using shift registers in the complex number field. Similarly, the bidirectional MAP decoding can be implemented by linearly combining the shift register contents of the dual SISO encoders of the respective forward and backward decoders. The dual encoder structures for various recursive and non‐recursive rate‐1 convolutional codes are derived. Copyright © 2016 John Wiley & Sons, Ltd.