Documente Academic
Documente Profesional
Documente Cultură
Last Lecture
We introduced another representation of a linear
code the trellis diagram
We derived two algorithms:
- Viterbi algorithm find the most likely codeword
- BCJR algorithm find the most likely symbol
From previous lectures we know that we need large
block lengths to achieve good performance.
What about the complexity of Viterbi and BCJR
decoding?
ftw. 2004
Fred Jelinek
s1s2s3
111
011
101
001
110
010
100
000
ftw. 2004
0
1
1
0
0
0
0
0
0
1
0
0
0
0
1
0
0
0
0
0
1
1
0
0
0
0
0
0
0
0
0
0
1
1
0
0
0
0
0
1
0
0
0
0
1
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
1
1
0
0
0
0
1
0
0
0
0
0
1
0
1
1
0
1
0
1
0
1
1
1
1
0
1
0
1
1
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
const
These methods to achieve linear complexity are useless.
ftw. 2004
equation A is
always fulfilled
after this symbol
H=
1
0
0
0
0
0
0
0
0
0
1
1
0
0
0
0
0
0
0
0
1
1
1
0
0
1
0
0
0
0
0
1
1
1
0
0
1
0
0
0
0
0
1
1
1
0
0
1
0
0
0
0
0
1
1
0
0
0
1
0
0
0
0
0
1
0
0
0
0
1
A
B
C
D
E
equation E is
always fulfilled
before this symbol
H=
1
0
0
0
0
0
0
0
0
0
1
1
0
0
0
0
0
0
0
0
1
1
1
0
0
1
0
0
0
0
0
1
1
1
0
0
1
0
0
0
0
0
1
1
1
0
0
1
0
0
0
0
0
1
1
0
0
0
1
0
0
0
0
0
1
0
0
0
0
1
ftw. 2004
Convolutional Encoder
Systematic Codes
u
u
parallel
to
serial
D
+
pk = uk + uk-1 + uk-2
u0 p0 u1 p1 u2 p2 ...
H=
1
0
0
0
0
0
0
0
0
0
1
1
0
0
0
0
0
0
0
0
1
1
1
0
0
1
0
0
0
0
0
1
1
1
0
0
1
0
0
0
0
0
1
1
1
0
0
1
0
0
0
0
0
1
1
0
0
0
1
0
0
0
0
0
1
0
0
0
0
1
ftw. 2004
p(1)
parallel
to
serial
D
+
p(2)
D
+
parallel
to
serial
ftw. 2004
ftw. 2004
D1
D0
parallel
to
serial
0
1
D1D0
00
00
11
00
11
00
11
01
11
11
11
00
00
00
10
10
10
10
01
01
01
01
01
01
11
10
10
10
ftw. 2004
ch
RSC 1
p1
ch
yu
yp1
RSC 2
p2
ch
yp2
Why Turbo?
ftw. 2004
BCJR
app1 +
BCJR
app2+
extr1
extr1
yp2
yu
extr2
-1
-1
extr2
app2
ftw. 2004
ftw. 2004
Serial Concatenation
Parallel concatenation is not the only way of combining
codes.
Instead of using two codes in parallel we use two
codes that are serially concatenated (again separated
by an interleaver)
from source
outer
inner
to channel
ftw. 2004
inner
app2+
outer
app1 +
extr2
extr1
-1
extr2
extr1
app1
ftw. 2004
Dec 1
app1 +
extr1
ch
+
Dec 2
app2
+
- extr2
-1
10
Parallel Concatenation
ch
BCJR 1
app1 +
extr1
ch
+
BCJR 2
app2
+
- extr2
-1
ftw. 2004
Serial Concatenation
ch
inner
outer
app1
+
app2
+
extr1
- extr2
-1
ftw. 2004
11
LDPC Decoder
ch
var
chk
app1
+
app2
+
extr1
- extr2
-1
Factor Graphs
Factor graph of a convolutional code
B.J. Frey, F.R. Kschischang, and H.-A. Loeliger, "Factor Graphs and the SumProduct Algorithm, IEEE Trans. Inform. Theory, Feb. 2001.
ftw. 2004
12