BCJR algorithm
From Wikipedia, the free encyclopedia
The BCJR algorithm is an algorithm for maximum a posteriori decoding of error correcting codes defined on trellises (principally convolutional codes). The algorithm is named after its inventers: Bahl, Cocke, Jelinek and Raviv [1]. This algorithm is critical to modern iteratively-decoded error-correcting codes including turbo codes and low-density parity-check codes.
[edit] References
- ^ L.Bahl, J.Cocke, F.Jelinek, and J.Raviv, "Optimal Decoding of Linear Codes for minimizing symbol error rate", IEEE Transactions on Information Theory, vol. IT-20(2), pp.284-287, March 1974.
[edit] External links
- The on-line textbook: Information Theory, Inference, and Learning Algorithms, by David J.C. MacKay, discusses the BCJR algorithm in chapter 25.
 |
This mathematics-related article is a stub. You can help Wikipedia by expanding it. |
