Decoding Algorithm (5/6)

Initialization:
 q0mn and q1mn are initialized to the values f0n and f1n

Horizontal Step:
 Define:
 For each m, n:
 Set:
1
Decoding Algorithm (6/6)

Vertical Step:
 For each n and m, and for x = 0, 1 we update:
, where αmn is chosen such that q0mn+ q1mn = 1
 We can also update the “pseudoposterior probabilities” q0n and
q1n, given by:
2