200 likes | 353 Views
III. Turbo Codes. An Example of MAP Algorithm. -1-1. -1-1. -1-1. -1-1. -1-1. s 0 (0 0). 11. 11. 11. 11. 11. 11. s 1 (1 0). -1-1. 1-1. 1-1. 1-1. s 2 (0 1). -1 1. -1 1. -1 1. -1 1. s 3 (1 1). 1-1.
E N D
An Example of MAP Algorithm -1-1 -1-1 -1-1 -1-1 -1-1 s0 (0 0) 11 11 11 11 11 11 s1 (1 0) -1-1 1-1 1-1 1-1 s2 (0 1) -1 1 -1 1 -1 1 -1 1 s3 (1 1) 1-1 Note: The decoding in this example is done after 5 transitions over the trellis. The paths drawn on the trellis are the paths that starts at state s0 and end at state s0
An Example of MAP Algorithm Assume equi-probable bits, σ2=1
An Example of MAP Algorithm Assume equi-probable bits, σ2=1
An Example of MAP Algorithm Assume equi-probable bits, σ2=1
An Example of MAP Algorithm Assume equi-probable bits, σ2=1
An Example of MAP Algorithm Assume equi-probable bits, σ2=1
An Example of MAP Algorithm The trellis starts at s0
An Example of MAP Algorithm Note: is not used in computations
An Example of MAP Algorithm The trellis ends at s0
An Example of MAP Algorithm The trellis ends at s0
An Example of MAP Algorithm Note: is not used in computations