PPT Slide

frame

size

decoding delay

?

calculation

(forward

recursion)

? and Lext

calculation

(backward

recursion)

additions, comparisons

and selections

?

?

L(u) = log ?1?1?1

?0?0?0

?t = f (?t+1)

?t+1 = f (?t)

?t = f (P(coded),P(uncoded),extr)

t

The MAP algorithm is a hard nut to crack

P(coded 1)

P(coded 2)

P(uncoded)

Previous slide

Next slide

Back to first slide

View graphic version