Content deleted Content added
→See also: added BCJR algorithm |
Major mistake corrected for the backward message formula. But someone should recompute the final results in the example, as I don't have time to do it. |
||
Line 35:
We can describe the backward computation <math>\mathbf{b_{k+1:t}}</math> that starts at the end of the sequence in a similar manner. Let the end of the sequence be described by the index k, starting at 0. Therefore running from k down to t=0 and calculating each backward probability can be described by the following formula:
<math>\mathbf{b_{k+1:t}} =
Note that we use the non-transposed matrix of <math>\mathbf{T}</math> and that the order of the terms has changed. Also note that as a final product we have not a usual matrix multiplication, but a point product. This operation multiplies each value in one matrix with the corresponding value of the other. Finally note that the description in [[#RusselNorvig03|Russel & Norvig 2003 pp. 550]] excludes the point product, thought the procedure is required earlier.
Line 83:
Now that we have defined the forward probabilities, we continue to compute the backward probabilities. Again the matrices appear in the order as in the backward formula above.
=> Someone should recompute the final results because the formula for the backward message was previously wrong and was corrected in the following equations, but not the final matrix.
<math>
\mathbf{b_{5:5}} =
</math>
<math>
\mathbf{b_{4:5}} =
</math>
<math>
\mathbf{b_{3:5}} =
</math>
<math>
\mathbf{b_{2:5}} =
</math>
<math>
\mathbf{b_{1:5}} =
</math>
|