3GPP TS 36.212, "Multiplexing and channel coding"
3GPP TS 36.212, "Multiplexing and channel coding"
3GPP TS 36.212, "Multiplexing and channel coding"
You also want an ePaper? Increase the reach of your titles
YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.
Release 8<br />
17<br />
<strong>3GPP</strong> <strong>TS</strong> <strong>36.212</strong> V8.1.0 (2007-11)<br />
(2)<br />
K 2k<br />
1 v<br />
Π + + k<br />
w =<br />
for k = 0,…, K −1<br />
Π<br />
Denoting by E the rate matching output sequence length for the r-th coded block, <strong>and</strong> rv idx the redundancy version<br />
number for this transmission, the rate matching output bit sequence is e k , k = 0,1,..., E −1<br />
.<br />
Define by G the total number of bits available for the transmission of one transport block.<br />
′ N L Q m where Q m is equal to 2 for QPSK, 4 for 16QAM <strong>and</strong> 6 for 64QAM, <strong>and</strong> where N L is equal to 1 for<br />
blocks mapped onto one transmission layer <strong>and</strong> is equal to 2 for blocks mapped onto two or four transmission layers.<br />
Set G = G ( ⋅ )<br />
Set γ = G′<br />
mod C , where C is the number of code blocks computed in subclause 5.1.2.<br />
if r ≤ C − γ −1<br />
else<br />
end if<br />
set E = N L ⋅Qm<br />
⋅ ⎣G<br />
′ / C⎦<br />
set E = N L ⋅Qm<br />
⋅ ⎡G<br />
′ / C⎤<br />
TC<br />
Set k R subblock<br />
⋅( 24⋅<br />
rv 2)<br />
0<br />
=<br />
idx<br />
+<br />
Set k = 0 <strong>and</strong> j = 0<br />
while { k < E }<br />
if w k + j)<br />
mod ≠< NULL ><br />
K w<br />
end if<br />
( 0<br />
ek = w( k0<br />
+ j)<br />
mod Kw<br />
k = k +1<br />
j = j +1<br />
end while<br />
5.1.4.2 Rate matching for convolutionally coded transport <strong>channel</strong>s <strong>and</strong> control<br />
information<br />
The rate matching for convolutionally coded transport <strong>channel</strong>s <strong>and</strong> control information consists of interleaving the<br />
(0) (1) (2)<br />
three bit streams, d<br />
k<br />
, d<br />
k<br />
<strong>and</strong> d<br />
k<br />
, followed by the collection of bits <strong>and</strong> the generation of a circular buffer as<br />
depicted in Figure 5.1.4-2. The output bits are transmitted as described in subclause 5.1.4.2.2.<br />
(0)<br />
d k<br />
(0)<br />
v k<br />
(1)<br />
d k<br />
(1)<br />
v k<br />
w k<br />
e k<br />
(2)<br />
d k<br />
(2)<br />
v k<br />
<strong>3GPP</strong>