Properties of the tailbiting BCJR decoder

MaRDI QIDQ2776528zbMATH OpenFDO

Authors John B. Anderson, Kemal E. Tepe

Publication date 7 March 2003

zbMATH Keywords

maximum a posteriori decodingtailbiting convolutional codestailbiting trellis codes

Mathematics Subject Classification ID

Convolutional codes (94B10) Combined modulation schemes (including trellis codes) in coding theory (94B12) Decoding (94B35)

Review text

The tailbiting BCJR algorithm extends the maximum a posteriori (MAP) decoder of Bahl et al. to the case of tailbiting trellis codes. The algorithm consists of forward and backward recursions that start from the left and right principal eigenvectors of the product of the trellis gamma matrices. The result is a slightly suboptimal symbol-by-symbol MAP decoder that performs much less computation than the true MAP decoder. The algorithm is formally justified and its properties developed. For the entire collection see [Zbl 0960.00082].

Recommendations

• Iterative decoding of tail-biting trellises and connections with symbolic dynamics
• Code construction and decoding of parallel concatenated tail-biting codes
• On Tail Biting Convolutional Codes
• scientific article; zbMATH DE number 910962
• The BCJR trellis and trellis decoders for some BCH codes

Cited in

(4)

• The BCJR trellis and trellis decoders for some BCH codes
• A systematic approach to modified BCJR MAP algorithms for convolutional codes
• Iterative decoding of tail-biting trellises and connections with symbolic dynamics
• On memory redundancy in the BCJR algorithm for nonrecursive shift register processes

This page was built for publication: Properties of the tailbiting BCJR decoder

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2776528)