3GPP TS 36.212, "Multiplexing and channel coding"
3GPP TS 36.212, "Multiplexing and channel coding"
3GPP TS 36.212, "Multiplexing and channel coding"
Create successful ePaper yourself
Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.
Release 8<br />
16<br />
<strong>3GPP</strong> <strong>TS</strong> <strong>36.212</strong> V8.1.0 (2007-11)<br />
TC TC<br />
TC TC<br />
(3) If ( R × C ) D , then N ( R × C − D)<br />
subblock subblock ><br />
D<br />
= dummy bits are padded such that y k = <br />
subblock<br />
subblock<br />
for k = 0, 1,…, N D - 1. Then, write the input bit sequence, i.e. y N D + k = d , k = 0, 1,…, D-1, into<br />
TC TC<br />
the ( C )<br />
R × matrix row by row starting with bit y 0 in column 0 of row 0:<br />
subblock<br />
subblock<br />
(i)<br />
k<br />
⎡<br />
⎢<br />
⎢<br />
⎢<br />
⎢<br />
⎢y<br />
⎣<br />
y<br />
y<br />
0<br />
TC<br />
Csubblock<br />
M<br />
TC<br />
TC<br />
( Rsubblock<br />
−1)<br />
× Csubblock<br />
y<br />
y<br />
y<br />
1<br />
TC<br />
Csubblock<br />
+ 1<br />
M<br />
TC<br />
TC<br />
( Rsubblock<br />
−1)<br />
× Csubblock<br />
+ 1<br />
y<br />
y<br />
y<br />
2<br />
TC<br />
Csubblock<br />
+ 2<br />
M<br />
TC<br />
TC<br />
( Rsubblock<br />
−1)<br />
× Csubblock<br />
+ 2<br />
L<br />
L<br />
O<br />
L<br />
y<br />
y<br />
y<br />
TC<br />
Csubblock<br />
−1<br />
TC<br />
2Csubblock<br />
−1<br />
M<br />
TC TC<br />
( Rsubblock×<br />
Csubblock<br />
−1)<br />
⎤<br />
⎥<br />
⎥<br />
⎥<br />
⎥<br />
⎥<br />
⎦<br />
For<br />
(0)<br />
d<br />
k<br />
(1)<br />
k<br />
<strong>and</strong> d :<br />
(4) Perform the inter-column permutation for the matrix based on the pattern ( j) TC<br />
j∈{ 0,1,...,<br />
−1}<br />
P that is shown in<br />
C subblock<br />
table 5.1.4-1, where P(j) is the original column position of the j-th permuted column. After permutation of the<br />
TC TC<br />
R × C matrix is equal to<br />
columns, the inter-column permuted ( )<br />
subblock<br />
subblock<br />
⎡<br />
⎢<br />
⎢<br />
⎢<br />
⎢<br />
⎢y<br />
⎣<br />
y<br />
y<br />
P(0)<br />
TC<br />
P(0)<br />
+ Csubblock<br />
M<br />
TC<br />
TC<br />
P(0)<br />
+ ( Rsubblock<br />
−1)<br />
× Csubblock<br />
y<br />
y<br />
y<br />
P(1)<br />
TC<br />
P(1)<br />
+ Csubblock<br />
M<br />
TC<br />
TC<br />
P(1)<br />
+ ( Rsubblock<br />
−1)<br />
× Csubblock<br />
y<br />
y<br />
y<br />
P(2)<br />
TC<br />
P(2)<br />
+ Csubblock<br />
M<br />
TC<br />
TC<br />
P(2)<br />
+ ( Rsubblock<br />
−1)<br />
× Csubblock<br />
L<br />
L<br />
O<br />
L<br />
y<br />
y<br />
y<br />
TC<br />
P(<br />
Csubblock<br />
−1)<br />
TC<br />
TC<br />
P(<br />
Csubblock<br />
−1)<br />
+ Csubblock<br />
M<br />
TC<br />
TC<br />
TC<br />
P(<br />
Csubblock<br />
−1)<br />
+ ( Rsubblock<br />
−1)<br />
× Csubblock<br />
⎤<br />
⎥<br />
⎥<br />
⎥<br />
⎥<br />
⎥<br />
⎦<br />
(5) The output of the block interleaver is the bit sequence read out column by column from the inter-column<br />
TC TC<br />
permuted ( C )<br />
( i)<br />
0<br />
R subblock × subblock matrix. The bits after sub-block interleaving are denoted by v0 , v1<br />
, v2<br />
,..., v<br />
( i)<br />
1<br />
where v corresponds to y P(0)<br />
, v to y TC<br />
(2)<br />
k<br />
For d :<br />
P(0)+<br />
C subblock<br />
TC TC<br />
… <strong>and</strong> K = ( R subblock × C )<br />
( i)<br />
( i)<br />
K .<br />
Π subblock Π = ( R × C)<br />
(2) (2) (2) (2)<br />
, v KΠ −1<br />
(4) The output of the sub-block interleaver is denoted by v<br />
0<br />
v1<br />
, v2<br />
,..., , where v = yπ<br />
( k)<br />
<strong>and</strong> where<br />
⎞<br />
TC<br />
( k mod R ) + ⎟<br />
subblock 1 mod Π<br />
⎛ ⎛<br />
⎜<br />
⎢ ⎞<br />
⎜ k ⎥<br />
⎟ TC<br />
π ( k)<br />
= P<br />
+ ×<br />
⎜ ⎜<br />
⎢ ⎥ C<br />
K<br />
TC<br />
subblock<br />
⎟<br />
⎟<br />
⎝ ⎝ ⎢⎣<br />
Rsubblock<br />
⎥⎦<br />
⎠<br />
⎠<br />
The permutation function P is defined in Table 5.1.4-1.<br />
Table 5.1.4-1 Inter-column permutation pattern for sub-block interleaver<br />
(2)<br />
k<br />
( i)<br />
( i)<br />
KΠ<br />
−1<br />
,<br />
Number of columns<br />
TC<br />
C subblock<br />
32<br />
Inter-column permutation pattern<br />
TC<br />
< P (0), P(1),...,<br />
P(<br />
−1)<br />
><br />
C subblock<br />
< 0, 16, 8, 24, 4, 20, 12, 28, 2, 18, 10, 26, 6, 22, 14, 30,<br />
1, 17, 9, 25, 5, 21, 13, 29, 3, 19, 11, 27, 7, 23, 15, 31 ><br />
5.1.4.1.2 Bit collection, selection <strong>and</strong> transmission<br />
The circular buffer of length<br />
(0)<br />
k v k<br />
w = for k = 0,…, K −1<br />
K w = 3 K Π for the r-th coded block is generated as follows:<br />
Π<br />
(1)<br />
K 2k<br />
v<br />
Π + k<br />
w =<br />
for k = 0,…, K −1<br />
Π<br />
<strong>3GPP</strong>