Skip to main content

Table 3 Updates of the open stack and close table during heuristic searches of the two-phase ML decoder

From: A low-complexity maximum likelihood decoder for tail-biting trellis

Step

Open stack

Close table

Complexity

1

{(1, 1, 0, 0.291)}

∅

{(6, 4)}

2

{(1, 2, 1, 0.291)}

{(1, 1, 0)}

{(6, 7)}

3

{(1, 3, 2, 0.986), (1, 1, 2, 1.234)}

{(1, 1, 0), (1, 2, 1)}

{(6, 10)}

4

{(1, 1, 2, 1.234), (1, 3, 3, 1.277)}

{(1, 1, 0), (1, 2, 1), (1, 3, 2)}

{(6, 13)}

5

{(1, 2, 3, 1.234), (1, 3, 3, 1.277)}

{(1, 1, 0), (1, 2, 1), (1, 3, 2), (1, 1, 2)}

{(6, 16)}

6

{(1, 3, 3, 1.277)}

{(1, 1, 0), (1, 2, 1), (1, 3, 2), (1, 1, 2), (1, 2, 3)}

{(6, 19)}