Jump to content

BCJR algorithm

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Edratzer (talk | contribs) at 01:11, 10 January 2007 (Created page with 'The '''BCJR algorithm''' is an algorithm for maximum a posteriori decoding of codes defined on trellises (principally convolutional codes). The algorithm i...'). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

The BCJR algorithm is an algorithm for maximum a posteriori decoding of codes defined on trellises (principally convolutional codes). The algorithm is named after its inventers: Bahl, Cocke, Jelinik and Raviv [1].

References

  1. ^ L.Bahl, J.Jelinek, J.Raviv, and F.Raviv, "Optimal Decoding of Linear Codes for minimising symbol error rate", IEEE Transactions on Information Theory, vol. IT-20, pp.284-287, March 1974.