<?xml version="1.0"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="en">
	<id>http://en.zaoniao.it/index.php?action=history&amp;feed=atom&amp;title=BCJR_algorithm</id>
	<title>BCJR algorithm - Revision history</title>
	<link rel="self" type="application/atom+xml" href="http://en.zaoniao.it/index.php?action=history&amp;feed=atom&amp;title=BCJR_algorithm"/>
	<link rel="alternate" type="text/html" href="http://en.zaoniao.it/index.php?title=BCJR_algorithm&amp;action=history"/>
	<updated>2026-05-15T14:38:52Z</updated>
	<subtitle>Revision history for this page on the wiki</subtitle>
	<generator>MediaWiki 1.32.0</generator>
	<entry>
		<id>http://en.zaoniao.it/index.php?title=BCJR_algorithm&amp;diff=2937&amp;oldid=prev</id>
		<title>Admin: Created page with &quot;The '''BCJR algorithm''' is an algorithm for maximum a posteriori decoding of error correcting codes defined on trellises (principally convolutional codes). The al...&quot;</title>
		<link rel="alternate" type="text/html" href="http://en.zaoniao.it/index.php?title=BCJR_algorithm&amp;diff=2937&amp;oldid=prev"/>
		<updated>2019-04-05T03:59:33Z</updated>

		<summary type="html">&lt;p&gt;Created page with &amp;quot;The &amp;#039;&amp;#039;&amp;#039;BCJR algorithm&amp;#039;&amp;#039;&amp;#039; is an algorithm for &lt;a href=&quot;/index.php?title=Maximum_a_posteriori&amp;amp;action=edit&amp;amp;redlink=1&quot; class=&quot;new&quot; title=&quot;Maximum a posteriori (page does not exist)&quot;&gt;maximum a posteriori&lt;/a&gt; decoding of &lt;a href=&quot;/index.php?title=Error_correcting_code&amp;amp;action=edit&amp;amp;redlink=1&quot; class=&quot;new&quot; title=&quot;Error correcting code (page does not exist)&quot;&gt;error correcting codes&lt;/a&gt; defined on trellises (principally &lt;a href=&quot;/Convolutional_code&quot; title=&quot;Convolutional code&quot;&gt;convolutional codes&lt;/a&gt;). The al...&amp;quot;&lt;/p&gt;
&lt;p&gt;&lt;b&gt;New page&lt;/b&gt;&lt;/p&gt;&lt;div&gt;The '''BCJR algorithm''' is an algorithm for [[maximum a posteriori]] decoding of [[error correcting code]]s defined on trellises (principally [[convolutional code]]s). The algorithm is named after its inventors: Bahl, Cocke, [[Frederick Jelinek|Jelinek]] and Raviv. This algorithm is critical to modern iteratively-decoded error-correcting codes including [[turbo code]]s and [[low-density parity-check code]]s.&lt;br /&gt;
&lt;br /&gt;
==Steps involved==&lt;br /&gt;
Based on the [[convolutional code|trellis]]:&lt;br /&gt;
&lt;br /&gt;
* Compute forward probabilities &amp;amp;lt;math&amp;amp;gt;\alpha&amp;amp;lt;/math&amp;amp;gt;&lt;br /&gt;
* Compute backward probabilities &amp;amp;lt;math&amp;amp;gt;\beta&amp;amp;lt;/math&amp;amp;gt;&lt;br /&gt;
* Compute smoothed probabilities based on other information (i.e. noise variance for [[AWGN]], bit crossover probability for [[binary symmetric channel]])&lt;br /&gt;
&lt;br /&gt;
==Variations==&lt;br /&gt;
&lt;br /&gt;
===SBGT BCJR===&lt;br /&gt;
Berrou, Glavieux and Thitimajshima simplification.&lt;br /&gt;
&lt;br /&gt;
===Log-Map BCJR===&lt;br /&gt;
&lt;br /&gt;
===Max-Log-Map BCJR ===&lt;br /&gt;
&lt;br /&gt;
==Implementations==&lt;br /&gt;
* [http://susalib.org/ Susa] framework implements BCJR algorithm for [[forward error correction]] codes and channel equalization in C++.&lt;br /&gt;
&lt;br /&gt;
==See also==&lt;br /&gt;
* [[Forward-backward algorithm]]&lt;br /&gt;
* [[Maximum a posteriori|Maximum a posteriori (MAP) estimation]]&lt;br /&gt;
* [[Hidden Markov model]]&lt;br /&gt;
&lt;br /&gt;
==External links==&lt;br /&gt;
* [http://www.inference.phy.cam.ac.uk/mackay/itila/ The online textbook: Information Theory, Inference, and Learning Algorithms], by [[David J.C. MacKay]], discusses the BCJR algorithm in chapter 25.&lt;br /&gt;
* [https://github.com/behrooza/susa/blob/master/inc/susa/channel.h#L360 The implementation of BCJR algorithm in Susa signal processing framework]&lt;br /&gt;
&lt;br /&gt;
==Source==&lt;br /&gt;
&lt;br /&gt;
[http://wikipedia.org/ http://wikipedia.org/]&lt;/div&gt;</summary>
		<author><name>Admin</name></author>
		
	</entry>
</feed>