Abstract
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 sub-optimal symbol-by-symbol MAP decoder that performs much less computation than the true MAP decoder. The decoder has both iterative and non-iterative realizations. We formally justify the algorithm and develop its properties. Storage of the entire recursion outcome is not required and we relate the needed length to the encoder memory and the encoder decision depth parameter. By tests of actual decoders, the bit error rate of the algorithm is compared to that of true MAP, maximum likelihood, and circular Viterbi decoders. For a given encoder, the BER of these decoders depends on the ratio of the tailbiting circle size to the encoder memory. We argue that there exists a certain practical optimum ratio of circle size to memory, and at this ratio the BER of the tailbiting BCJR decoder is essentially that of the true MAP decoder.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
L.R. Bahl, et al., “Optimal decoding of linear codes for minimizing symbol error rate,” IEEE Trans. Information Theory, 20, pp. 284–287, Mar. 1974.
J.B. Anderson and S.M. Hladik, “Tailbiting MAP decoders,” IEEE J. Sel. Areas Commun., 16, pp. 297–302, Feb. 1998.
G. Solomon and H.C.A. Van Tilborg, “A connection between block and convolutional codes,” SIAM J. Appl. Math., 37, Oct. 1979.
H.H. Ma and J.K. Wolf, “On tailbiting convolutional codes,” IEEE Trans. Communications, 34, pp. 104–111, Feb. 1986.
P. Stahl, J.B. Anderson and R. Johannesson, “Optimal and near-optimal encoders for short and moderate-length tailbiting trellises,” IEEE Trans. Information Theory, 45, pp. 2562–2571, Nov. 1999.
J.B. Anderson and R. Johannesson, “A condition for feedback tailbiting convolutional encoders and a short list of allowed feedback polynomials,” Proceedings, Conf. on Information Systems and Sciences, Princeton Univ., Princeton, NJ, Mar. 1998.
J. Hagenauer, “Source-controlled channel decoding,” IEEE Trans. Communications, 43, pp. 2449–2457, Sept. 1995.
S.M. Aji, G.B. Horn and R.J. Mceliece, “On the convergence of iterative decoding on graphs with a single cycle,” Proceedings, Conf. on Information Systems and Sciences, Princeton Univ., Princeton, NJ, Mar. 1998.
R.J. Mceliece, D.J.C. MacKay and J.-F. Cheng, “Thrbo decoding as an instance of Pearl’s ‘Belief Propagation’ Algorithm,” IEEE J. Sel. Areas Commun., 16, pp. 140–152, Feb. 1998.
G.D. Forney, Jr., F.R. Kschischang and B. Marcus, “Iterative decoding of tail-biting trellises,” unpublished manuscript (25pp), July 1998; summary in Proceedings, IEEE Information Theory Society Workshop, San Diego, CA , Feb. 1998.
R. BELLMAN, Introduction to Matrix Analysis, 2nd Ed., McGraw-Hill, New York, 1970.
J.B. Anderson, “Best short rate 1/2 tailbiting codes for the bit error rate criterion,” IEEE Trans. Communications, 48, Apr. 2000.
J.B. Anderson and K. Balachandran, “Decision depths of convolutional codes,” IEEE Trans. Information Theory, 35, pp. 455–459, Mar. 1989.
K. SH. Zigangirov and V.V. Chepyzhov, “Study of tailbiting convolutional codes,” Proceedings, 4th Joint Swedish-Soviet Intern. Workshop Information Theory, Gotland, Sweden, pp. 52–55, 1989.
R.V. Cox and C.-E. Sundberg, “An efficient adaptive circular Viterbi algorithm for decoding generalized tailbiting convolutional codes,” IEEE Trans. Vehicular Tech., 43, pp. 57–68, Feb. 1994.
J.B. Anderson and S.M. Hladik, “An optimal circular Viterbi decoder,” in submission, IEEE J. Sel. Areas Commun., Mar. 2000.
V. Franz and J.B. Anderson, “Concatenated decoding with a reduced-search BCJR algorithm,” IEEE J. Sel. Areas Commun., 16, pp. 186–195, Feb. 1998.
R. Johannesson and K.SH. Zigangirov, Introduction to Convolutional Coding, IEEE Press, Piscataway, NJ, 1999.
R. Ramesh, E. Wong and H. Koorapathy, “On tailbiting recursive systematic convolutional encoders,” in submission, IEEE Trans. Communications, 1998.
G. Horn, Ph.D. Thesis, “Iterative decoding and pseudo-codewords,” Dept. Electrical Eng., Calif. Inst. Technology, Pasadena, May 1999.
P. Lancaster and M. Tismenetsky, The Theory of Matrices, 2nd Ed., Academic Press, San Diego, 1985.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag New York, Inc.
About this paper
Cite this paper
Anderson, J.B., Tepe, K.E. (2001). Properties of the Tailbiting BCJR Decoder. In: Marcus, B., Rosenthal, J. (eds) Codes, Systems, and Graphical Models. The IMA Volumes in Mathematics and its Applications, vol 123. Springer, New York, NY. https://doi.org/10.1007/978-1-4613-0165-3_12
Download citation
DOI: https://doi.org/10.1007/978-1-4613-0165-3_12
Publisher Name: Springer, New York, NY
Print ISBN: 978-0-387-95173-7
Online ISBN: 978-1-4613-0165-3
eBook Packages: Springer Book Archive