<?xml version="1.0"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="en">
	<id>https://en.formulasearchengine.com/w/index.php?action=history&amp;feed=atom&amp;title=Hitachi_DX07</id>
	<title>Hitachi DX07 - Revision history</title>
	<link rel="self" type="application/atom+xml" href="https://en.formulasearchengine.com/w/index.php?action=history&amp;feed=atom&amp;title=Hitachi_DX07"/>
	<link rel="alternate" type="text/html" href="https://en.formulasearchengine.com/w/index.php?title=Hitachi_DX07&amp;action=history"/>
	<updated>2026-08-05T15:57:20Z</updated>
	<subtitle>Revision history for this page on the wiki</subtitle>
	<generator>MediaWiki 1.47.0-wmf.7</generator>
	<entry>
		<id>https://en.formulasearchengine.com/w/index.php?title=Hitachi_DX07&amp;diff=15998&amp;oldid=prev</id>
		<title>en&gt;Hmainsbot1: AWB general fixes and delink dates per :WP:DATELINK, :WP:YEARLINK and :MOS:UNLINKYEARS using AWB (8097)</title>
		<link rel="alternate" type="text/html" href="https://en.formulasearchengine.com/w/index.php?title=Hitachi_DX07&amp;diff=15998&amp;oldid=prev"/>
		<updated>2012-07-28T17:37:46Z</updated>

		<summary type="html">&lt;p&gt;AWB general fixes and delink dates per &lt;a href=&quot;/w/index.php?title=WP:DATELINK&amp;amp;action=edit&amp;amp;redlink=1&quot; class=&quot;new&quot; title=&quot;WP:DATELINK (page does not exist)&quot;&gt;WP:DATELINK&lt;/a&gt;, &lt;a href=&quot;/w/index.php?title=WP:YEARLINK&amp;amp;action=edit&amp;amp;redlink=1&quot; class=&quot;new&quot; title=&quot;WP:YEARLINK (page does not exist)&quot;&gt;WP:YEARLINK&lt;/a&gt; and &lt;a href=&quot;/w/index.php?title=MOS:UNLINKYEARS&amp;amp;action=edit&amp;amp;redlink=1&quot; class=&quot;new&quot; title=&quot;MOS:UNLINKYEARS (page does not exist)&quot;&gt;MOS:UNLINKYEARS&lt;/a&gt; using &lt;a href=&quot;/w/index.php?title=Testwiki:AWB&amp;amp;action=edit&amp;amp;redlink=1&quot; class=&quot;new&quot; title=&quot;Testwiki:AWB (page does not exist)&quot;&gt;AWB&lt;/a&gt; (8097)&lt;/p&gt;
&lt;p&gt;&lt;b&gt;New page&lt;/b&gt;&lt;/p&gt;&lt;div&gt;The &amp;#039;&amp;#039;&amp;#039;BCJR algorithm&amp;#039;&amp;#039;&amp;#039; 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.&amp;lt;ref name=&amp;quot;bcjr&amp;quot;&amp;gt;L.Bahl, J.Cocke, F.Jelinek, and J.Raviv, &amp;quot;Optimal Decoding of Linear Codes for minimizing symbol error rate&amp;quot;, IEEE Transactions on Information Theory, vol. IT-20(2), pp.284-287, March 1974.&amp;lt;/ref&amp;gt;  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;
* Compute Forward probabilities  &amp;lt;math&amp;gt;\alpha&amp;lt;/math&amp;gt;&lt;br /&gt;
* Compute Backward probabilities &amp;lt;math&amp;gt;\beta&amp;lt;/math&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.&amp;lt;ref&amp;gt;Sichun Wang and François Patenaude, &amp;quot;A Systematic Approach to Modified BCJR MAP Algorithms for Convolutional Codes,&amp;quot; &amp;#039;&amp;#039;EURASIP Journal on Applied Signal Processing&amp;#039;&amp;#039;, vol. 2006, Article ID 95360, 15 pages, 2006. {{doi|10.1155/ASP/2006/95360}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
===Log-Map BCJR ===&lt;br /&gt;
&amp;lt;ref&amp;gt;P. Robertson, P. Hoeher and E. Villebrun, &amp;quot;Optimal and Sub-Optimal Maximum A Posteriori Algorithms Suitable for Turbo Decoding&amp;quot;, European Transactions on Telecommunications, Vol. 8, 1997.&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
===Max-Log-Map BCJR ===&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;
==References==&lt;br /&gt;
&lt;br /&gt;
&amp;lt;references/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
==External links==&lt;br /&gt;
* [http://www.inference.phy.cam.ac.uk/mackay/itila/ The on-line textbook: Information Theory, Inference, and Learning Algorithms], by [[David J.C. MacKay]], discusses the BCJR algorithm in chapter 25.&lt;br /&gt;
&lt;br /&gt;
{{DEFAULTSORT:Bcjr Algorithm}}&lt;br /&gt;
[[Category:Error detection and correction]]&lt;/div&gt;</summary>
		<author><name>en&gt;Hmainsbot1</name></author>
	</entry>
</feed>