3GPP TS 36.212, "Multiplexing and channel coding"

Release 8
18
3GPP TS 36.212 V8.1.0 (2007-11)
Figure 5.1.4-2. Rate matching for convolutionally coded transport channels and control information
The bit stream
(0)
d
k
is interleaved according to the sub-block interleaver defined in subclause 5.1.4.2.1 with an output
(0) (0) (0) (0)
, v KΠ −1
sequence defined as v
0
v1
, v2
,..., and where K Π is defined in subclause 5.1.4.2.1.
The bit stream
(1)
d
k
is interleaved according to the sub-block interleaver defined in subclause 5.1.4.2.1 with an output
(1) (1) (1) (1)
, v KΠ −1
sequence defined as v
0
v1
, v2
,..., .
The bit stream
(2)
d
k
is interleaved according to the sub-block interleaver defined in subclause 5.1.4.2.1 with an output
(2) (2) (2) (2)
, v KΠ −1
sequence defined as v
0
v1
, v2
,..., .
The sequence of bits e k for transmission is generated according to subclause 5.1.4.2.2.
5.1.4.2.1 Sub-block interleaver
The bits input to the block interleaver are denoted by d0 , d1
, d
2
,..., d
bit sequence from the block interleaver is derived as follows:
CC
subblock
CC
subblock −
( i)
( i)
( i)
( i)
D− 1
, where D is the number of bits. The output
(1) Assign C = 32 to be the number of columns of the matrix. The columns of the matrix are numbered 0, 1,
2,…, C 1from left to right.
(2) Determine the number of rows of the matrix R
CC
subblock
, by finding minimum integer
CC CC
( R subblock C )
D ≤ ×
subblock
CC
The rows of rectangular matrix are numbered 0, 1, 2,…, R −1from top to bottom.
subblock
CC CC
CC CC
(3) If ( R × C ) D , then N ( R × C − D)
subblock subblock >
D
subblock
subblock
for k = 0, 1,…, N D - 1. Then, write the input bit sequence, i.e.
CC CC
the ( C )
subblock
subblock
CC
R subblock such that:
= dummy bits are padded such that y k =
N
k
(i)
k
y D + = d , k = 0, 1,…, D-1, into
R × matrix row by row starting with bit y 0 in column 0 of row 0:
⎡
⎢
⎢
⎢
⎢
⎢y
⎣
y
y
0
CC
C
subblock
M
CC
CC
( R
subblock
−1)
× C
subblock
y
y
y
1
CC
C
subblock
+ 1
M
CC
CC
( R
subblock
−1)
× C
subblock
+ 1
y
y
y
2
CC
C
subblock
+ 2
M
CC
CC
( R
subblock
−1)
× C
subblock
+ 2
L
L
O
L
y
y
y
CC
C
subblock
−1
CC
2C
subblock
−1
M
CC CC
( R
subblock
× C
subblock
−1)
⎤
⎥
⎥
⎥
⎥
⎥
⎦
(4) Perform the inter-column permutation for the matrix based on the pattern ( j) CC
j∈{ 0,1,...,
−1}
P that is shown in
C subblock
table 5.1.4-2, where P(j) is the original column position of the j-th permuted column. After permutation of the
CC CC
R × C matrix is equal to
columns, the inter-column permuted ( )
subblock
subblock
⎡
⎢
⎢
⎢
⎢
⎢y
⎣
y
y
P(0)
CC
P(0)
+ Csubblock
M
CC
CC
P(0)
+ ( Rsubblock
−1)
× Csubblock
y
y
y
P(1)
CC
P(1)
+ Csubblock
M
CC
CC
P(1)
+ ( Rsubblock
−1)
× Csubblock
y
y
y
P(2)
CC
P(2)
+ Csubblock
M
CC
CC
P(2)
+ ( Rsubblock
−1)
× Csubblock
L
L
O
L
y
y
y
CC
P(
Csubblock
−1)
CC
CC
P(
Csubblock
−1)
+ Csubblock
M
CC
CC
CC
P(
Csubblock
−1)
+ ( Rsubblock
−1)
× Csubblock
⎤
⎥
⎥
⎥
⎥
⎥
⎦
(5) The output of the block interleaver is the bit sequence read out column by column from the inter-column
CC CC
permuted ( C )
( i)
0
R subblock × subblock matrix. The bits after sub-block interleaving are denoted by v0 , v1
, v2
,..., v
( i)
1
where v corresponds to y P(0)
, v to y CC
P(0)+
C subblock
CC CC
… and K = ( R subblock × C )
Π
subblock
( i)
( i)
( i)
( i)
KΠ
−1
,
3GPP