Documenti di Didattica
Documenti di Professioni
Documenti di Cultura
101
Legend:
102
103
104
105
1.0
1.5
2.0
2.5
3.0
101
Legend:
102
103
104
105
1.0
1.5
2.0
2.5
3.0
bi = 0 and u
bi = 1.
coding path into two paths: try both u
0
bi = 0 and u
bi = 1.
coding path into two paths: try both u
0
bi = 0 and u
bi = 1.
coding path into two paths: try both u
0
bi = 0 and u
bi = 1.
coding path into two paths: try both u
0
L=4
When the number of paths grows beyond a prescribed threshold L, discard the worst (least probable) paths, and keep only the L best paths.
bi = 0 and u
bi = 1.
coding path into two paths: try both u
0
1 0
L=4
1 0
When the number of paths grows beyond a prescribed threshold L, discard the worst (least probable) paths, and keep only the L best paths.
bi = 0 and u
bi = 1.
coding path into two paths: try both u
0
1 0
L=4
1 0
When the number of paths grows beyond a prescribed threshold L, discard the worst (least probable) paths, and keep only the L best paths.
At the end, select the single most likely path.
Our contribution
We consider list decoding of polar codes.
However, in a naive implementation, the time would be
O ( L n2 ) .
We show that this can be done in O(L n log n) time and
O(L n) space.
We will return to the complexity issue later. For now, lets see how
decoding performance is affected.
Approaching ML performance
Legend:
n = 2048, L = 1
101
102
103
104
1.0
1.5
2.0
2.5
3.0
Approaching ML performance
Legend:
n = 2048, L = 1
n = 2048, L = 2
101
102
103
104
1.0
1.5
2.0
2.5
3.0
Approaching ML performance
Legend:
n = 2048, L = 1
n = 2048, L = 2
n = 2048, L = 4
101
102
103
104
1.0
1.5
2.0
2.5
3.0
Approaching ML performance
Legend:
n = 2048, L = 1
n = 2048, L = 2
n = 2048, L = 4
n = 2048, L = 8
101
102
103
104
1.0
1.5
2.0
2.5
3.0
Approaching ML performance
Legend:
n = 2048, L = 1
n = 2048, L = 2
n = 2048, L = 4
n = 2048, L = 8
n = 2048, L = 16
101
102
103
104
1.0
1.5
2.0
2.5
3.0
Approaching ML performance
Legend:
n = 2048, L = 1
n = 2048, L = 2
n = 2048, L = 4
n = 2048, L = 8
n = 2048, L = 16
n = 2048, L = 32
101
102
103
104
1.0
1.5
2.0
2.5
3.0
Approaching ML performance
Legend:
n = 2048, L = 1
n = 2048, L = 2
n = 2048, L = 4
n = 2048, L = 8
n = 2048, L = 16
n = 2048, L = 32
n = 2048, ML bound
101
102
103
104
1.0
1.5
2.0
2.5
3.0
Approaching ML performance
Legend:
n = 2048, L = 1
n = 2048, L = 2
n = 2048, L = 4
n = 2048, L = 8
n = 2048, L = 16
n = 2048, L = 32
n = 2048, ML bound
101
102
103
104
1.0
1.5
2.0
2.5
3.0
Approaching ML performance
Legend:
n = 2048, L = 1
n = 2048, L = 2
n = 2048, L = 4
n = 2048, L = 8
n = 2048, L = 16
n = 2048, L = 32
n = 2048, ML bound
101
102
103
104
1.0
1.5
2.0
2.5
3.0
101
Successive cancellation
List-decoding ( L = 32)
102
103
104
105
106
1.0
1.5
2.0
2.5
3.0
101
Successive cancellation
List-decoding ( L = 32)
102
103
104
105
106
1.0
1.5
2.0
2.5
3.0
101
Successive cancellation
List-decoding ( L = 32)
102
103
104
105
106
1.0
1.5
2.0
2.5
3.0
It turns out (as we shall see) that each decoding path has (n)
memory associated with it.
When a path is split in two, one decoding path is left with the
original variables while the other must be handed a copy of them.
Each copy operation takes O(n) time.
Thus, the overall time complexity is O(L n2 ).
u0
x0 y0
u1
x1 y1
u0
x0 y0
u1
x1 y1
u0
ub0
u1
ub1
( P ( y0 | x0 = 0), P ( y0 | x0 = 1))
x0 y0
xb0
( P ( y1 | x1 = 0), P ( y1 | x1 = 1))
x1 y1
xb1
x0 y0
u0
ub0
ub1
u1
( P ( y0 | x0 = 0), P ( y0 | x0 = 1))
? xb0
?
( P ( y1 | x1 = 0), P ( y1 | x1 = 1))
x1 y1
? xb1
u0
ub0
ub1
u1
X ( P ( y | x = 0), P ( y | x
x0 y0
0
? xb0
X ( P ( y | x = 0), P ( y | x
x1 y1
? xb1
= 1))
= 1))
u0
ub0
ub1
u1
X ( P ( y | x = 0), P ( y | x
x0 y0
0
? xb0
X ( P ( y | x = 0), P ( y | x
x1 y1
? xb1
= 1))
= 1))
u0
ub0
ub1
u1
X ( P ( y | x = 0), P ( y | x
x0 y0
0
? xb0
X ( P ( y | x = 0), P ( y | x
x1 y1
? xb1
= 1))
= 1))
u0
ub0
ub1
u1
X ( P ( y | x = 0), P ( y | x
x0 y0
0
? xb0
X ( P ( y | x = 0), P ( y | x
x1 y1
? xb1
= 1))
= 1))
u0
ub0
X
X
u1
ub1
X ( P ( y | x = 0), P ( y | x
x0 y0
0
? xb0
X ( P ( y | x = 0), P ( y | x
x1 y1
? xb1
= 1))
= 1))
u0
ub0
X
X
u1
ub1
X ( P ( y | x = 0), P ( y | x
x0 y0
0
? xb0
X ( P ( y | x = 0), P ( y | x
x1 y1
? xb1
= 1))
= 1))
u0
ub0
X
X
u1
ub1
X ( P ( y | x = 0), P ( y | x
x0 y0
0
? xb0
X ( P ( y | x = 0), P ( y | x
x1 y1
? xb1
= 1))
= 1))
u0
ub0
X
X
u1
ub1
X ( P ( y | x = 0), P ( y | x
x0 y0
0
? xb0
X ( P ( y | x = 0), P ( y | x
x1 y1
? xb1
= 1))
= 1))
u0
ub0
X ( P ( y | x = 0), P ( y | x
x1 y1
u1
ub1
X ( P ( y | x = 0), P ( y | x
x0 y0
xb0
xb1
= 1))
= 1))
u0
ub0
X ( P ( y | x = 0), P ( y | x
x1 y1
u1
ub1
X ( P ( y | x = 0), P ( y | x
x0 y0
xb0
xb1
= 1))
= 1))
A larger example
4
Key point
The memory
needed to hold
the variables at
level t is O(n/2t ).
u0
y0
u1
y1
u2
y2
u3
y3
u4
y4
u5
y5
u6
y6
u7
y7
u8
y8
u9
y9
u10
y10
u11
y11
u12
y12
u13
y13
u14
y14
u15
y15
A larger example
4
Key point
The memory
needed to hold
the variables at
level t is O(n/2t ).
u0
y0
u1
y1
u2
y2
u3
y3
u4
y4
u5
y5
u6
y6
u7
y7
u8
y8
u9
y9
u10
y10
u11
y11
u12
y12
u13
y13
u14
y14
u15
y15
A larger example
4
Key point
The memory
needed to hold
the variables at
level t is O(n/2t ).
u0
y0
u1
y1
u2
y2
u3
y3
u4
y4
u5
y5
u6
y6
u7
y7
u8
y8
u9
y9
u10
y10
u11
y11
u12
y12
u13
y13
u14
y14
u15
y15
A larger example
4
Key point
The memory
needed to hold
the variables at
level t is O(n/2t ).
u0
y0
u1
y1
u2
y2
u3
y3
u4
y4
u5
y5
u6
y6
u7
y7
u8
y8
u9
y9
u10
y10
u11
y11
u12
y12
u13
y13
u14
y14
u15
y15
A larger example
4
Key point
The memory
needed to hold
the variables at
level t is O(n/2t ).
u0
y0
u1
y1
u2
y2
u3
y3
u4
y4
u5
y5
u6
y6
u7
y7
u8
y8
u9
y9
u10
y10
u11
y11
u12
y12
u13
y13
u14
y14
u15
y15
A larger example
4
Key point
The memory
needed to hold
the variables at
level t is O(n/2t ).
u0
y0
u1
y1
u2
y2
u3
y3
u4
y4
u5
y5
u6
y6
u7
y7
u8
y8
u9
y9
u10
y10
u11
y11
u12
y12
u13
y13
u14
y14
u15
y15
A larger example
4
Key point
The memory
needed to hold
the variables at
level t is O(n/2t ).
u0
y0
u1
y1
u2
y2
u3
y3
u4
y4
u5
y5
u6
y6
u7
y7
u8
y8
u9
y9
u10
y10
u11
y11
u12
y12
u13
y13
u14
y14
u15
y15
A larger example
4
Key point
The memory
needed to hold
the variables at
level t is O(n/2t ).
u0
y0
u1
y1
u2
y2
u3
y3
u4
y4
u5
y5
u6
y6
u7
y7
u8
y8
u9
y9
u10
y10
u11
y11
u12
y12
u13
y13
u14
y14
u15
y15
A larger example
4
Key point
The memory
needed to hold
the variables at
level t is O(n/2t ).
u0
y0
u1
y1
u2
y2
u3
y3
u4
y4
u5
y5
u6
y6
u7
y7
u8
y8
u9
y9
u10
y10
u11
y11
u12
y12
u13
y13
u14
y14
u15
y15
A larger example
4
Key point
The memory
needed to hold
the variables at
level t is O(n/2t ).
u0
y0
u1
y1
u2
y2
u3
y3
u4
y4
u5
y5
u6
y6
u7
y7
u8
y8
u9
y9
u10
y10
u11
y11
u12
y12
u13
y13
u14
y14
u15
y15
A larger example
4
Key point
The memory
needed to hold
the variables at
level t is O(n/2t ).
u0
y0
u1
y1
u2
y2
u3
y3
u4
y4
u5
y5
u6
y6
u7
y7
u8
y8
u9
y9
u10
y10
u11
y11
u12
y12
u13
y13
u14
y14
u15
y15
A larger example
4
Key point
The memory
needed to hold
the variables at
level t is O(n/2t ).
u0
y0
u1
y1
u2
y2
u3
y3
u4
y4
u5
y5
u6
y6
u7
y7
u8
y8
u9
y9
u10
y10
u11
y11
u12
y12
u13
y13
u14
y14
u15
y15
A larger example
4
Key point
The memory
needed to hold
the variables at
level t is O(n/2t ).
u0
y0
u1
y1
u2
y2
u3
y3
u4
y4
u5
y5
u6
y6
u7
y7
u8
y8
u9
y9
u10
y10
u11
y11
u12
y12
u13
y13
u14
y14
u15
y15
A larger example
4
Key point
The memory
needed to hold
the variables at
level t is O(n/2t ).
u0
y0
u1
y1
u2
y2
u3
y3
u4
y4
u5
y5
u6
y6
u7
y7
u8
y8
u9
y9
u10
y10
u11
y11
u12
y12
u13
y13
u14
y14
u15
y15
A larger example
4
Key point
The memory
needed to hold
the variables at
level t is O(n/2t ).
u0
y0
u1
y1
u2
y2
u3
y3
u4
y4
u5
y5
u6
y6
u7
y7
u8
y8
u9
y9
u10
y10
u11
y11
u12
y12
u13
y13
u14
y14
u15
y15
A larger example
4
Key point
The memory
needed to hold
the variables at
level t is O(n/2t ).
u0
y0
u1
y1
u2
y2
u3
y3
u4
y4
u5
y5
u6
y6
u7
y7
u8
y8
u9
y9
u10
y10
u11
y11
u12
y12
u13
y13
u14
y14
u15
y15
A larger example
4
Key point
The memory
needed to hold
the variables at
level t is O(n/2t ).
u0
y0
u1
y1
u2
y2
u3
y3
u4
y4
u5
y5
u6
y6
u7
y7
u8
y8
u9
y9
u10
y10
u11
y11
u12
y12
u13
y13
u14
y14
u15
y15
A larger example
4
Key point
The memory
needed to hold
the variables at
level t is O(n/2t ).
u0
y0
u1
y1
u2
y2
u3
y3
u4
y4
u5
y5
u6
y6
u7
y7
u8
y8
u9
y9
u10
y10
u11
y11
u12
y12
u13
y13
u14
y14
u15
y15
A larger example
4
Key point
The memory
needed to hold
the variables at
level t is O(n/2t ).
u0
y0
u1
y1
u2
y2
u3
y3
u4
y4
u5
y5
u6
y6
u7
y7
u8
y8
u9
y9
u10
y10
u11
y11
u12
y12
u13
y13
u14
y14
u15
y15
A larger example
4
Key point
The memory
needed to hold
the variables at
level t is O(n/2t ).
u0
y0
u1
y1
u2
y2
u3
y3
u4
y4
u5
y5
u6
y6
u7
y7
u8
y8
u9
y9
u10
y10
u11
y11
u12
y12
u13
y13
u14
y14
u15
y15
A larger example
4
Key point
The memory
needed to hold
the variables at
level t is O(n/2t ).
u0
y0
u1
y1
u2
y2
u3
y3
u4
y4
u5
y5
u6
y6
u7
y7
u8
y8
u9
y9
u10
y10
u11
y11
u12
y12
u13
y13
u14
y14
u15
y15
A larger example
4
Key point
The memory
needed to hold
the variables at
level t is O(n/2t ).
u0
y0
u1
y1
u2
y2
u3
y3
u4
y4
u5
y5
u6
y6
u7
y7
u8
y8
u9
y9
u10
y10
u11
y11
u12
y12
u13
y13
u14
y14
u15
y15
A larger example
4
Key point
The memory
needed to hold
the variables at
level t is O(n/2t ).
u0
y0
u1
y1
u2
y2
u3
y3
u4
y4
u5
y5
u6
y6
u7
y7
u8
y8
u9
y9
u10
y10
u11
y11
u12
y12
u13
y13
u14
y14
u15
y15
A larger example
4
Key point
The memory
needed to hold
the variables at
level t is O(n/2t ).
u0
y0
u1
y1
u2
y2
u3
y3
u4
y4
u5
y5
u6
y6
u7
y7
u8
y8
u9
y9
u10
y10
u11
y11
u12
y12
u13
y13
u14
y14
u15
y15
A larger example
4
Key point
The memory
needed to hold
the variables at
level t is O(n/2t ).
u0
y0
u1
y1
u2
y2
u3
y3
u4
y4
u5
y5
u6
y6
u7
y7
u8
y8
u9
y9
u10
y10
u11
y11
u12
y12
u13
y13
u14
y14
u15
y15
A larger example
4
Key point
The memory
needed to hold
the variables at
level t is O(n/2t ).
u0
y0
u1
y1
u2
y2
u3
y3
u4
y4
u5
y5
u6
y6
u7
y7
u8
y8
u9
y9
u10
y10
u11
y11
u12
y12
u13
y13
u14
y14
u15
y15
A larger example
4
Key point
The memory
needed to hold
the variables at
level t is O(n/2t ).
u0
y0
u1
y1
u2
y2
u3
y3
u4
y4
u5
y5
u6
y6
u7
y7
u8
y8
u9
y9
u10
y10
u11
y11
u12
y12
u13
y13
u14
y14
u15
y15
A larger example
4
Key point
The memory
needed to hold
the variables at
level t is O(n/2t ).
u0
y0
u1
y1
u2
y2
u3
y3
u4
y4
u5
y5
u6
y6
u7
y7
u8
y8
u9
y9
u10
y10
u11
y11
u12
y12
u13
y13
u14
y14
u15
y15
A larger example
4
Key point
The memory
needed to hold
the variables at
level t is O(n/2t ).
u0
y0
u1
y1
u2
y2
u3
y3
u4
y4
u5
y5
u6
y6
u7
y7
u8
y8
u9
y9
u10
y10
u11
y11
u12
y12
u13
y13
u14
y14
u15
y15
A larger example
4
Key point
The memory
needed to hold
the variables at
level t is O(n/2t ).
u0
y0
u1
y1
u2
y2
u3
y3
u4
y4
u5
y5
u6
y6
u7
y7
u8
y8
u9
y9
u10
y10
u11
y11
u12
y12
u13
y13
u14
y14
u15
y15
A larger example
4
Key point
The memory
needed to hold
the variables at
level t is O(n/2t ).
u0
y0
u1
y1
u2
y2
u3
y3
u4
y4
u5
y5
u6
y6
u7
y7
u8
y8
u9
y9
u10
y10
u11
y11
u12
y12
u13
y13
u14
y14
u15
y15
A larger example
4
Key point
The memory
needed to hold
the variables at
level t is O(n/2t ).
u0
y0
u1
y1
u2
y2
u3
y3
u4
y4
u5
y5
u6
y6
u7
y7
u8
y8
u9
y9
u10
y10
u11
y11
u12
y12
u13
y13
u14
y14
u15
y15
A larger example
4
Key point
Level t is written
to once every
O(2mt ) stages.
u0
y0
u1
y1
u2
y2
u3
y3
u4
y4
u5
y5
u6
y6
u7
y7
u8
y8
u9
y9
u10
y10
u11
y11
u12
y12
u13
y13
u14
y14
u15
y15
A larger example
4
Key point
Level t is written
to once every
O(2mt ) stages.
u0
y0
u1
y1
u2
y2
u3
y3
u4
y4
u5
y5
u6
y6
u7
y7
u8
y8
u9
y9
u10
y10
u11
y11
u12
y12
u13
y13
u14
y14
u15
y15
A larger example
4
Key point
Level t is written
to once every
O(2mt ) stages.
u0
y0
u1
y1
u2
y2
u3
y3
u4
y4
u5
y5
u6
y6
u7
y7
u8
y8
u9
y9
u10
y10
u11
y11
u12
y12
u13
y13
u14
y14
u15
y15
A larger example
4
Key point
Level t is written
to once every
O(2mt ) stages.
u0
y0
u1
y1
u2
y2
u3
y3
u4
y4
u5
y5
u6
y6
u7
y7
u8
y8
u9
y9
u10
y10
u11
y11
u12
y12
u13
y13
u14
y14
u15
y15
A larger example
4
Key point
Level t is written
to once every
O(2mt ) stages.
u0
y0
u1
y1
u2
y2
u3
y3
u4
y4
u5
y5
u6
y6
u7
y7
u8
y8
u9
y9
u10
y10
u11
y11
u12
y12
u13
y13
u14
y14
u15
y15
A larger example
4
Key point
Level t is written
to once every
O(2mt ) stages.
u0
y0
u1
y1
u2
y2
u3
y3
u4
y4
u5
y5
u6
y6
u7
y7
u8
y8
u9
y9
u10
y10
u11
y11
u12
y12
u13
y13
u14
y14
u15
y15
A larger example
4
Key point
Level t is written
to once every
O(2mt ) stages.
u0
y0
u1
y1
u2
y2
u3
y3
u4
y4
u5
y5
u6
y6
u7
y7
u8
y8
u9
y9
u10
y10
u11
y11
u12
y12
u13
y13
u14
y14
u15
y15
A larger example
4
Key point
Level t is written
to once every
O(2mt ) stages.
u0
y0
u1
y1
u2
y2
u3
y3
u4
y4
u5
y5
u6
y6
u7
y7
u8
y8
u9
y9
u10
y10
u11
y11
u12
y12
u13
y13
u14
y14
u15
y15
A larger example
4
Key point
Level t is written
to once every
O(2mt ) stages.
u0
y0
u1
y1
u2
y2
u3
y3
u4
y4
u5
y5
u6
y6
u7
y7
u8
y8
u9
y9
u10
y10
u11
y11
u12
y12
u13
y13
u14
y14
u15
y15
A larger example
4
Key point
Level t is written
to once every
O(2mt ) stages.
u0
y0
u1
y1
u2
y2
u3
y3
u4
y4
u5
y5
u6
y6
u7
y7
u8
y8
u9
y9
u10
y10
u11
y11
u12
y12
u13
y13
u14
y14
u15
y15
A larger example
4
Key point
Level t is written
to once every
O(2mt ) stages.
u0
y0
u1
y1
u2
y2
u3
y3
u4
y4
u5
y5
u6
y6
u7
y7
u8
y8
u9
y9
u10
y10
u11
y11
u12
y12
u13
y13
u14
y14
u15
y15
A larger example
4
Key point
Level t is written
to once every
O(2mt ) stages.
u0
y0
u1
y1
u2
y2
u3
y3
u4
y4
u5
y5
u6
y6
u7
y7
u8
y8
u9
y9
u10
y10
u11
y11
u12
y12
u13
y13
u14
y14
u15
y15
A larger example
4
Key point
Level t is written
to once every
O(2mt ) stages.
u0
y0
u1
y1
u2
y2
u3
y3
u4
y4
u5
y5
u6
y6
u7
y7
u8
y8
u9
y9
u10
y10
u11
y11
u12
y12
u13
y13
u14
y14
u15
y15
A larger example
4
Key point
Level t is written
to once every
O(2mt ) stages.
u0
y0
u1
y1
u2
y2
u3
y3
u4
y4
u5
y5
u6
y6
u7
y7
u8
y8
u9
y9
u10
y10
u11
y11
u12
y12
u13
y13
u14
y14
u15
y15
A larger example
4
Key point
Level t is written
to once every
O(2mt ) stages.
u0
y0
u1
y1
u2
y2
u3
y3
u4
y4
u5
y5
u6
y6
u7
y7
u8
y8
u9
y9
u10
y10
u11
y11
u12
y12
u13
y13
u14
y14
u15
y15
A larger example
4
Key point
Level t is written
to once every
O(2mt ) stages.
u0
y0
u1
y1
u2
y2
u3
y3
u4
y4
u5
y5
u6
y6
u7
y7
u8
y8
u9
y9
u10
y10
u11
y11
u12
y12
u13
y13
u14
y14
u15
y15
A larger example
4
Key point
Level t is written
to once every
O(2mt ) stages.
u0
y0
u1
y1
u2
y2
u3
y3
u4
y4
u5
y5
u6
y6
u7
y7
u8
y8
u9
y9
u10
y10
u11
y11
u12
y12
u13
y13
u14
y14
u15
y15
A larger example
4
Key point
Level t is written
to once every
O(2mt ) stages.
u0
y0
u1
y1
u2
y2
u3
y3
u4
y4
u5
y5
u6
y6
u7
y7
u8
y8
u9
y9
u10
y10
u11
y11
u12
y12
u13
y13
u14
y14
u15
y15
A larger example
4
Key point
Level t is written
to once every
O(2mt ) stages.
u0
y0
u1
y1
u2
y2
u3
y3
u4
y4
u5
y5
u6
y6
u7
y7
u8
y8
u9
y9
u10
y10
u11
y11
u12
y12
u13
y13
u14
y14
u15
y15
A larger example
4
Key point
Level t is written
to once every
O(2mt ) stages.
u0
y0
u1
y1
u2
y2
u3
y3
u4
y4
u5
y5
u6
y6
u7
y7
u8
y8
u9
y9
u10
y10
u11
y11
u12
y12
u13
y13
u14
y14
u15
y15
A larger example
4
Key point
Level t is written
to once every
O(2mt ) stages.
u0
y0
u1
y1
u2
y2
u3
y3
u4
y4
u5
y5
u6
y6
u7
y7
u8
y8
u9
y9
u10
y10
u11
y11
u12
y12
u13
y13
u14
y14
u15
y15
A larger example
4
Key point
Level t is written
to once every
O(2mt ) stages.
u0
y0
u1
y1
u2
y2
u3
y3
u4
y4
u5
y5
u6
y6
u7
y7
u8
y8
u9
y9
u10
y10
u11
y11
u12
y12
u13
y13
u14
y14
u15
y15
A larger example
4
Key point
Level t is written
to once every
O(2mt ) stages.
u0
y0
u1
y1
u2
y2
u3
y3
u4
y4
u5
y5
u6
y6
u7
y7
u8
y8
u9
y9
u10
y10
u11
y11
u12
y12
u13
y13
u14
y14
u15
y15
A larger example
4
Key point
Level t is written
to once every
O(2mt ) stages.
u0
y0
u1
y1
u2
y2
u3
y3
u4
y4
u5
y5
u6
y6
u7
y7
u8
y8
u9
y9
u10
y10
u11
y11
u12
y12
u13
y13
u14
y14
u15
y15
A larger example
4
Key point
Level t is written
to once every
O(2mt ) stages.
u0
y0
u1
y1
u2
y2
u3
y3
u4
y4
u5
y5
u6
y6
u7
y7
u8
y8
u9
y9
u10
y10
u11
y11
u12
y12
u13
y13
u14
y14
u15
y15
A larger example
4
Key point
Level t is written
to once every
O(2mt ) stages.
u0
y0
u1
y1
u2
y2
u3
y3
u4
y4
u5
y5
u6
y6
u7
y7
u8
y8
u9
y9
u10
y10
u11
y11
u12
y12
u13
y13
u14
y14
u15
y15
A larger example
4
Key point
Level t is written
to once every
O(2mt ) stages.
u0
y0
u1
y1
u2
y2
u3
y3
u4
y4
u5
y5
u6
y6
u7
y7
u8
y8
u9
y9
u10
y10
u11
y11
u12
y12
u13
y13
u14
y14
u15
y15
A larger example
4
Key point
Level t is written
to once every
O(2mt ) stages.
u0
y0
u1
y1
u2
y2
u3
y3
u4
y4
u5
y5
u6
y6
u7
y7
u8
y8
u9
y9
u10
y10
u11
y11
u12
y12
u13
y13
u14
y14
u15
y15
A larger example
4
Key point
Level t is written
to once every
O(2mt ) stages.
u0
y0
u1
y1
u2
y2
u3
y3
u4
y4
u5
y5
u6
y6
u7
y7
u8
y8
u9
y9
u10
y10
u11
y11
u12
y12
u13
y13
u14
y14
u15
y15
A larger example
4
Key point
Level t is written
to once every
O(2mt ) stages.
u0
y0
u1
y1
u2
y2
u3
y3
u4
y4
u5
y5
u6
y6
u7
y7
u8
y8
u9
y9
u10
y10
u11
y11
u12
y12
u13
y13
u14
y14
u15
y15
A larger example
4
Key point
Level t is written
to once every
O(2mt ) stages.
u0
y0
u1
y1
u2
y2
u3
y3
u4
y4
u5
y5
u6
y6
u7
y7
u8
y8
u9
y9
u10
y10
u11
y11
u12
y12
u13
y13
u14
y14
u15
y15
A larger example
4
Key point
Level t is written
to once every
O(2mt ) stages.
u0
y0
u1
y1
u2
y2
u3
y3
u4
y4
u5
y5
u6
y6
u7
y7
u8
y8
u9
y9
u10
y10
u11
y11
u12
y12
u13
y13
u14
y14
u15
y15
101
Successive cancellation
List-decoding ( L = 32)
102
103
104
105
106
1.0
1.5
2.0
2.5
3.0
101
Successive cancellation
List-decoding ( L = 32)
102
103
104
105
106
1.0
1.5
2.0
2.5
3.0