Home - News ( United States | United Kingdom | Italy | Germany ) - Football scores

Showing content from http://en.wikipedia.org/wiki/BCJR_algorithm below:

BCJR algorithm - Wikipedia

From Wikipedia, the free encyclopedia

Error correction algorithm

The Bahl-Cocke-Jelinek-Raviv (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 inventors: 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.

Based on the trellis:

Berrou, Glavieux and Thitimajshima simplification.^[2]

This section

. You can help by

.

^[3]

• Susa framework implements BCJR algorithm for forward error correction codes and channel equalization in C++.

• Forward-backward algorithm
• Maximum a posteriori (MAP) estimation
• Hidden Markov model

• The online textbook: Information Theory, Inference, and Learning Algorithms, by David J.C. MacKay, discusses the BCJR algorithm in chapter 25.
• The implementation of BCJR algorithm in Susa signal processing framework

RetroSearch is an open source project built by @garambo | Open a GitHub Issue

Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo

HTML: 3.2 | Encoding: UTF-8 | Version: 0.7.4