CWTS STD-TDD-103 V3.1.

0 2000-9
Technical Specification

CWTS

China Wireless Telecommunication Standard

(CWTS);
Working Group 1 (WG1);
Multiplexing and channel coding

Contents
1

INTELLECTUAL PROPERTY RIGHTS.......................................................................................................4

FOREWORD.......................................................................................................................................................4

SCOPE..................................................................................................................................................................4

REFERENCES....................................................................................................................................................4

DEFINITIONS, SYMBOLS AND ABBREVIATIONS...................................................................................5

5.1
5.2
5.3

Definitions.................................................................................................................................................5
Symbols.....................................................................................................................................................5
Abbreviations.............................................................................................................................................5

Multiplexing and Channel Coding

MULTIPLEXING, CHANNEL CODING AND INTERLEAVING..............................................................8

6.1
General.......................................................................................................................................................8
6.2
Transport-channel coding/multiplexing....................................................................................................8
6.2.1
Error detection.............................................................................................................................11
6.2.1.1
6.2.1.2

6.2.2
6.2.2.1
6.2.2.2

6.2.3
6.2.3.1
6.2.3.2
6.2.3.2.1
6.2.3.2.2
6.2.3.2.3

6.2.4
6.2.5
6.2.6
6.2.7
6.2.7.1
6.2.7.2
6.2.7.3

6.2.8
6.2.9
6.2.10
6.2.10.1
6.2.10.2

6.2.11
6.2.12
6.2.12.1

CRC calculation.......................................................................................................................................11
Relation between input and output of the Cyclic Redundancy Check......................................................11

Transport block concatenation and code block segmentation....................................................11

Concatenation of transport blocks............................................................................................................11
Code block segmentation.........................................................................................................................12

Channel coding............................................................................................................................12
Convolutional Coding.............................................................................................................................13
Turbo coding...........................................................................................................................................14
Turbo Coder................................................................................................................................14
Trellis termination in Turbo code................................................................................................15
Turbo code internal interleaver...................................................................................................15

Radio frame size equalisation.....................................................................................................19

1st interleaving.............................................................................................................................19
Radio frame segmentation...........................................................................................................20
Rate matching..............................................................................................................................20
Determination of rate matching parameters.............................................................................................21
Bit separation for rate matching...............................................................................................................23
Rate matching pattern determination.......................................................................................................24

TrCH multiplexing.......................................................................................................................25
Physical channel segmentation...................................................................................................25
2nd interleaving.............................................................................................................................26
Frame related 2nd interleaving................................................................................................................26
Timeslot related 2nd interleaving............................................................................................................26

Sub-frame segmentation..............................................................................................................27
Physical channel mapping...........................................................................................................28
Mapping scheme...................................................................................................................................29

6.2.13
Multiplexing of different transport channels onto one CCTrCH, and mapping of one CCTrCH
onto physical channels........................................................................................................................................30
6.2.13.1
6.2.13.1.1
6.2.13.1.2

6.2.14
6.2.14.1
6.2.14.2
6.2.14.2.1

Allowed CCTrCH combinations for one UE.........................................................................................31

Allowed CCTrCH combinations on the uplink.........................................................................31
Allowed CCTrCH combinations on the downlink....................................................................31

Transport format detection..........................................................................................................31

Blind transport format detection............................................................................................................31
Explicit transport format detection based on TFCI................................................................................31
Transport Format Combination Indicator..................................................................................31

6.3
Coding for layer 1 control.......................................................................................................................31
6.3.1
Coding of transport format combination indicator (TFCI)........................................................32
6.3.1.1
6.3.1.1.1
6.3.1.1.2
6.3.1.2
6.3.1.2.1
6.3.1.2.2

6.3.2
6.3.3
7

Coding of transport format combination indicator (TFCI) for QPSK......................................................32

Coding of long TFCI lengths......................................................................................................32
Coding of short TFCI lengths......................................................................................................33
Coding of transport format combination indicator (TFCI) for 8PSK.......................................................34
Coding of long TFCI for 8PSK...................................................................................................34
Coding of short TFCI lengths......................................................................................................36

Coding of Transmit Power Control (TPC)..................................................................................36

Coding of Synchronization shift (SS)...........................................................................................37

HISTORY...........................................................................................................................................................38

Intellectual Property Rights

<Editors note: this section will be completed when an official format for the document is agreed>

Foreword
This Technical Specification has been produced by the CWTS, Working Group 1 (CWTS WG1).

Multiplexing and Channel Coding

The contents of this TS may be subject to continuing work within the CWTS WG1and may change following formal
TSG approval. Should the TSG modify the contents of this TS, it will be re-released with an identifying change of
release date and an increase in version number as follows:

Version m.x.y
where:
m indicates [major version number]
x the second digit is incremented for all changes of substance, i.e. technical enhancements, corrections,
updates, etc.
y the third digit is incremented when editorial only changes have been incorporated into the specification.

Scope
This CWTS Report describes multiplexing, channel coding and interleaving for CWTS Physical Layer TDSCDMA mode.

References
[1] CWTS TS C102 (V3.2.0): Physical channels and mapping of transport channels onto physical channels

[2] CWTS TS C101 (V3.1.0): Physical layer general description

[3] CWTS TS C104 (V3.2.0): Spreading and modulation
[4] CWTS TS C105 (V2.0.0): Physical layer procedures
[5] CWTS TS C002 (V2.0.0): Service provided by physical layer
[6] 3GPP TS25.222 (V3.2.0): Multiplexing and channel coding (TDD)

Definitions, symbols and abbreviations

Definitions
For the purposes of the present document, the following definitions apply:
<defined term>: <definition>.

Symbols
For the purposes of the present document, the following symbols apply:

x
x
x

round towards , i.e. integer such that x x < x+1

round towards -, i.e. integer such that x-1 < x x
absolute value of x

Unless otherwise is explicitly stated when the symbol is used, the meaning of the following symbols are:
i
TrCH number
j
TFC number
k
Bit number
l
TF number
m Transport block number
n
Radio frame number
p
PhCH number
r
Code block number
I
Number of TrCHs in a CCTrCH.
Ci Number of code blocks in one TTI of TrCH i.
Fi Number of radio frames in one TTI of TrCH i.
Mi Number of transport blocks in one TTI of TrCH i.
P Number of PhCHs used for one CCTrCH.

Multiplexing and Channel Coding

PL Puncturing Limit for the uplink. Signalled from higher layers

RMi Rate Matching attribute for TrCH i. Signalled from higher layers.

Abbreviations
ARQ

Automatic Repeat on Request

BCH
BER
BPSK
BS
BSS

Broadcast Channel
Bit Error Rate
Binary Phase Shift Keying
Base Station
Base Station Subsystem

CA
CAA
CBR
CCCH
CCTrCH
CD
CDA
CDMA
CTDMA
CRC

Capacity Allocation
Capacity Allocation Acknowledgement
Constant Bit Rate
Common Control Channel
Coded Composite Transport Channel
Capacity Deallocation
Capacity Deallocation Acknowledgement
Code Division Multiple Access
Code Time Division Multiple Access
Cyclic Redundancy Check

DCA
DCCH
DL
DRX
DSCH
DTX

Dynamic Channel Allocation

Dedicated Control Channel
Downlink
Discontinuous Reception
Downlink Shared Channel
Discontinuous Transmission

FACH
FPACH
FDD
FDMA
FEC
FER

Forward Access Channel

Fast Physical Access CHannel
Frequency Division Duplex
Frequency Division Multiple Access
Forward Error Control
Frame Error Rate

GF

Galois Field

HCS

Hierarchical Cell Structure

JD

Joint Detection

L1
L2
LLC

Layer 1
Layer 2
Logical Link Control

MA
MAC
MAHO
MO
MOHO
MS
MT

Multiple Access
Medium Access Control
Mobile Assisted Handover
Mobile Originated
Mobile Originated Handover
Mobile Station
Mobile Terminated

NRT

Non-Real Time

Multiplexing and Channel Coding

PC
PCCC
PCH

Power Control
Parallel Concatenated Convolutional Code
Paging Channel

ODMA
QoS
QPSK

Opportunity Driven Multiple Access

Quality of Service
Quaternary Phase Shift Keying

RACH
RF
RLC
RRC
RRM
RT
RU

Random Access Channel

Radio Frequency
Radio Link Control
Radio Resource Control
Radio Resource Management
Real Time
Resource Unit

SCH
SDCCH
SFN
SNR
SP
SS

Synchronisation Channel
Stand-alone Dedicated Control Channel
System Frame Number
Signal to Noise Ratio
Switching Point
Synchronization shift

TCH
TDD
TDMA
TFCI
TPC
TrCH

Traffic channel
Time Division Duplex
Time Division Multiple Access
Transport Format Combination Indicator
transmit power control
Transport Channel

UL
UMTS

Uplink
Universal Mobile Telecommunications System

VBR

Variable Bit Rate

Multiplexing and Channel Coding

Multiplexing, channel coding and interleaving

General
Data stream from/to MAC and higher layers (Transport block / Transport block set) is encoded/decoded to offer
transport services over the radio transmission link. Channel coding scheme is a combination of error detection,
error correcting (including rate matching), and interleaving and transport channels mapping onto/splitting from
physical channels.
In the TD-SCDMA mode, the total number of basic physical channels (a certain time slot one spreading code on a
certain carrier frequency) per subframe is given by the maximum number of time slots and the maximum number
of CDMA codes per time slot.

Transport-channel coding/multiplexing
Figure 6-1 illustrates the overall concept of transport-channel coding and multiplexing. Data arrives to the
coding/multiplexing unit in form of transport block sets, once every transmission time interval. The transmission
time interval is transport-channel specific from the set {10 ms, 20 ms, 40 ms, 80 ms}.
The following coding/multiplexing steps can be identified:

Add CRC to each transport block (see section 6.2.1)

TrBk concatenation / Code block segmentation (see section 6.2.2)
Channel coding (see section 6.2.3)
Radio frame size equalization (see section 6.2.4)
Interleaving (two steps, see sections 6.2.5 and 6.2.10)
Radio frame segmentation (6.2.6)
Rate matching (see section 6.2.7)
Multiplexing of transport channels (see sections 6.2.8)
Physical channel segmentation (see section 6.2.9)
Subframe segmentation(see section 6.2.11)
Mapping to physical channels (see section 6.2.12)

The coding/multiplexing steps for uplink and downlink are shown in Figure 6-1.

Multiplexing and Channel Coding

aim1 , aim 2 , aim 3 , , aimAi

CRC attachment

bim1 , bim 2 , bim 3 , , bimBi

TrBk concatenation /
Code block segmentation

oir1 , oir 2 , oir 3 , , oirKi

Channel coding

ci1 , ci 2 , ci 3 , , ciEi
Radio frame equalisation

ti1 , ti 2 , ti 3 , , tiTi
1st interleaving

di1 , di 2 , d i 3 , , d iTi
Radio frame segmentation

ei1 , ei 2 , ei 3 , , eiN i
Rate matching

Rate
matching

f i1 , f i 2 , f i 3 , , f iVi
TrCH Multiplexing

s1 , s2 , s3 , , sS
Physical channel
segmentation
u p1 , u p 2 , u p3 , , u pU p
2nd interleaving

v(t )1 , v(t ) 2 , v(t )3 , , v( t )U ( t )

Subframe segmentation

g p1 , g p 2 , g p 3 , , g pU p
u p1 , u p 2 , u p 3 , , Physical
u pU p channel mapping

PhCH#2
PhCH#1

w p1 , w p 2 , w p3 , , w pU p

Figure 61. Transport channel multiplexing structure for uplink and downlink
Primarily, transport channels are multiplexed as described above, i.e. into one data stream mapped on one or
several physical channels. However, an alternative way of multiplexing services is to use multiple CCTrCHs
(Coded Composite Transport Channels), which corresponds to having several parallel multiplexing chains as in
Figure 6-1, resulting in several data streams, each mapped to one or several physical channels.

Error detection
Error detection is provided on transport blocks through a Cyclic Redundancy Check. The CRC is 24, 16, 8 or 0

Multiplexing and Channel Coding

bits and it is signalled from higher layers what CRC length that should be used for each transport channel.

CRC calculation
The entire transport block is used to calculate the CRC parity bits for each transport block. The parity bits are
generated by one of the following cyclic generator polynomials:
gCRC24(D) = D24 + D23 + D6 + D5 + D + 1
gCRC16(D) = D16 + D12 + D5 + 1
gCRC8(D) = D8 + D7 + D4 + D3 + D + 1
Denote the bits in a transport block delivered to layer 1 by a im1 , a im 2 , a im 3 , , a imAi , and the parity bits by

pim1 , pim 2 , pim 3 , , pimLi . Ai is the length of a transport block of TrCH i, m is the transport block number, and
Li is 24, 16, 8, or 0 depending on what is signalled from higher layers.
The encoding is performed in a systematic form, which means that in GF(2), the polynomial

aim1 D Ai 23 aim 2 D Ai 22 aimAi D 24 pim1 D 23 pim 2 D 22 pim 23 D1 pim 24

yields a remainder equal to 0 when divided by gCRC24(D), polynomial

aim1D Ai 15 aim 2 D Ai 14 aimAi D16 pim1D15 pim 2 D14 pim15 D1 pim16

yields a remainder equal to 0 when divided by gCRC16(D), and polynomial

aim1D Ai 7 aim 2 D Ai 6 aimAi D8 pim1D 7 pim 2 D 6 pim7 D1 pim8

yields a remainder equal to 0 when divided by gCRC8(D).

Relation between input and output of the Cyclic Redundancy Check

Bits delivered to layer 1 are denoted bim1 , bim 2 , bim 3 , , bimBi , where Bi=Ai+Li. The relation between aimk and
bimk is:
bimk aimk

k = 1, 2, 3, , Ai

bimk pim ( Li 1 ( k Ai ))

k = Ai + 1, Ai + 2, Ai + 3, , Ai + Li

Transport block concatenation and code block segmentation

All transport blocks in a TTI are serially concatenated. If the number of bits in a TTI is larger than Z, then code
block segmentation is performed after the concatenation of the transport blocks. The maximum size of the code
blocks depend on if convolutional or turbo coding is used for the TrCH.

Concatenation of transport blocks

The bits input to the transport block concatenation are denoted by bim1 , bim 2 , bim 3 , , bimBi where i is the
TrCH number, m is the transport block number, and Bi is the number of bits in each block (including CRC). The
number of transport blocks on TrCH i is denoted by Mi. The bits after concatenation are denoted by
xi1 , xi 2 , xi 3 , , xiX i , where i is the TrCH number and Xi=MiBi. They are defined by the following relations:

xik bi1k

k = 1, 2, , Bi

xik bi , 2, ( k Bi )

k = Bi + 1, Bi + 2, , 2Bi

xik bi ,3, ( k 2 Bi )

k = 2Bi + 1, 2Bi + 2, , 3Bi

xik bi , M i , ( k ( M i 1) Bi )

k = (Mi 1)Bi + 1, (Mi 1)Bi + 2, , MiBi

Code block segmentation

< Note: It is assumed that filler bits are set to 0 >
Segmentation of the bit sequence from transport block concatenation is performed if Xi>Z. The code blocks after
segmentation are of the same size. The number of code blocks on TrCH i is denoted by Ci. If the number of bits
input to the segmentation, Xi, is not a multiple of Ci, filler bits are added to the last block. The filler bits are
transmitted and they are always set to 0. The maximum code block sizes are:
convolutional coding: Z = 512 Ktail
turbo coding: Z = 5120 Ktail
The bits output from code block segmentation are denoted by oir1 , oir 2 , oir 3 , , oirK i , where i is the TrCH

Multiplexing and Channel Coding

number, r is the code block number, and Ki is the number of bits.

Number of code blocks: Ci = Xi / Z
Number of bits in each code block: Ki = Xi / Ci
Number of filler bits: Yi = CiKi Xi
If Xi Z, then oi1k = xik, and Ki = Xi.
If Xi Z, then
oi1k xik
k = 1, 2, , Ki

oi 2 k xi , ( k K i )

k = 1, 2, , Ki

oi 3k xi , ( k 2 K i )

k = 1, 2, , Ki

oiCi k xi ( k (Ci 1) K i )

k = 1, 2, , Ki Yi

oiCi k 0

k = (Ki Yi) + 1, (Ki Yi) + 2, , Ki

Channel coding
Code blocks are delivered to the channel coding block. They are denoted by oir1 , oir 2 , oir 3 , , oirK i , where i is
the TrCH number, r is the code block number, and Ki is the number of bits in each code block. The number of
code blocks on TrCH i is denoted by Ci. After encoding the bits are denoted by xir 1 , xir 2 , xir 3 , , xirX i . The
encoded blocks are serially multiplexed so that the block with lowest index r is output first from the channel
coding block. The bits output are denoted by ci1 , ci 2 , ci 3 , , ciEi , where i is the TrCH number and Ei = CiXi.
The output bits are defined by the following relations:
cik xi1k
k = 1, 2, , Xi

cik xi , 2,( k X i )

k = Xi + 1, Xi + 2, , 2Xi

cik xi ,3,( k 2 X i )

k = 2Xi + 1, 2Xi + 2, , 3Xi

cik xi ,Ci ,( k (Ci 1) X i )

k = (Ci 1)Xi + 1, (Ci 1)Xi + 2, , CiXi

The relation between oirk and xirk and between Ki and Xi is dependent on the channel coding scheme.
The following channel coding schemes can be applied to transport channels.
Convolutional coding
Turbo coding
No channel coding
Table 0-1 Error Correction Coding Parameters
Type of TrCH
BCH,PCH

Coding scheme
Convolutional coding

RACH

Convolutional coding

DCH, DSCH, FACH, USCH

Turbo coding

Coding rate
1/3
1/2
1/3, 1/2
1/3

No coding

Convolutional Coding
Constraint length K=9. Coding rates 1/2, 1/3.
The configuration of the convolutional coder is presented in Fig. 6-2.
The output from the convolutional coder shall be done in the order starting from output0, output1 and output2,
output0, output1,, output2. (When coding rate is 1/2, output is done up to output 1).

Multiplexing and Channel Coding

10

The initial value of the shift register of the coder shall be all 0.
K-1 tail bits (value 0) shall be added to the end of the code block before encoding.

output 0
G0=561 OCT
+
input

output 1
G1=753 OCT

(a) Coding rate =1/2 constraint length=9

add MOD.2

input

output 0
G0=557 OCT

+
D

output 1
G1=663 OCT

output 2
G2=711 OCT

(b) Coding rate =1/3 constraint length=9

Fig. 6-2 Convolutional Coder

Turbo coding
Turbo Coder
For data services requiring quality of service between 10 -3 and 10-6 BER inclusive, parallel concatenated
convolutional code (PCCC) with 8-state constituent encoders is used.
The transfer function of the 8-state constituent code for PCCC is

G(D)= 1,

n( D)

d ( D)

where,

d(D)=1+D2+D3
n(D)=1+D+D3.

Multiplexing and Channel Coding

11

X(t)
Y(t)
X(t)

Interleaver

Y (t)
0

X?t)

Figure 6-3. Structure of the 8 state PCCC encoder (dotted lines effective for trellis termination
only)
The initial value of the shift registers of the PCCC encoder shall be all zeros.
The output of the PCCC encoder is punctured to produce coded bits corresponding to the desired code rate 1/3.
For rate 1/3, none of the systematic or parity bits are punctured, and the output sequence is X(0), Y(0), Y(0),
X(1), Y(1), Y(1), etc.

Trellis termination in Turbo code

Trellis termination is performed by taking the tail bits from the shift register feedback after all information bits are
encoded . Tail bits are added after the encoding of information bits.

Trellis termination for PCCC

The first three tail bits shall be used to terminate the first constituent encoder (upper switch of Figure 6-3 in lower
position) while the second constituent encoder is disabled. The last three tail bits shall be used to terminate the
second constituent encoder (lower switch of Figure 6-3 in lower position) while the first constituent encoder is
disabled.
The transmitted bits for trellis termination shall then be
X(t) Y(t) X(t+1) Y(t+1) X(t+2) Y(t+2) X(t) Y(t) X(t+1) Y(t+1) X(t+2) Y(t+2).

Turbo code internal interleaver

Figure 6-5 depicts the overall 8 State PCCC Turbo coding scheme including Turbo code internal interleaver. The
Turbo code internal interleaver consists of mother interleaver generation and pruning. For arbitrary given block
length K, one mother interleaver is selected from the 134 mother interleavers set. The generation scheme of
mother interleaver is described in section 6.2.3.2.3.1. After the mother interleaver generation, l-bits are pruned in
order to adjust the mother interleaver to the block length K. The definition of l is shown in section 6.2.3.2.3.2..

Source

Coded sequence

K bit
RSC1
(K + l) bit
Mother
interleaver

K bit
Pruning

RSC2

Figure 6-4. Overall 8 State PCCC Turbo Coding

(3K+T1+T2) bit

Multiplexing and Channel Coding

12

6.2.3.2.3.1 Mother interleaver generation

The interleaving consists of three stages. In first stage, the input sequence is written into the rectangular matrix
row by row. The second stage is intra-row permutation. The third stage is inter-row permutation. The three-stage
permutations are described as follows, the input block length is assumed to be K (320 to 5114 bits).
First Stage:
(1) Determine a row number R such that
R=10 (K = 481 to 530 bits; Case-1)
R=20 (K = any other block length except 481 to 530 bits; Case-2)
(2) Determine a column number C such that
Case-1; C = p = 53
Case-2;
(i) find minimum prime p such that,
0 =< (p+1)-K/R
(ii) if (0 =< p-K/R) then go to (iii)
else C = p+1.
(iii) if (0 =< p-1-K/R) then C=p-1.
else C = p.
(3) The input sequence of the interleaver is written into the RxC rectangular matrix row by row.
Second Stage:
A. If C = p
(1) Select a primitive root g0 from Table 6.2.2-2.
(2) Construct the base sequence c(i) for intra-row permutation as:
c (i ) [ g 0 c (i 1)] mod p ,
i =1,2,(p-2)., c(0) = 1.
(3) Select the minimum prime integer set {qj } (j=1,2,R-1) such that
g.c.d{qj, p-1} =1
qj > 6
qj > q(j-1)
where g.c.d. is greatest common divider. And q0 = 1.
(4) The set {qj} is permuted to make a new set {pj} such that
pP(j) = qj , j = 0, 1, . R-1,
where P(j) is the inter-row permutation pattern defined in the third stage.
(5) Perform the j-th (j = 0,1, 2, , C-1) intra-row permutation as:
c j (i ) c ([i p j ] mod( p 1)) , i =0,1,2,, (p-2)., and cj(p-1) = 0,
where cj(i) is the input bit position of i-th output after the permutation of j-th row.
B. If C = p+1
(B-1) Same as case A-1.
(B-2) Same as case A-2.
(B-3) Same as case A-3.
(B-4) Same as case A-4.
(B-5) Perform the j-th (j = 0,1, 2, , R-1) intra-row permutation as:
c j (i ) c ([i p j ] mod( p 1)) , i =0,1,2,, (p-2)., cj(p-1) = 0, and cj(p) = p,
where cj(i) is the input bit position of i-th output after the permutation of j-th row.
(B-6) If (K = C x R) then exhange cR-1(p) with cR-1(0).
C. If C = p-1
(1) Same as case A-1.
(2) Same as case A-2.
(3) Same as case A-3.
(4) Same as case A-4.
(5) Perform the j-th (j = 0,1, 2, , R-1) intra-row permutation as:
c j (i ) c ([i p j ] mod( p 1)) -1, i =0,1,2,, (p-2).,
where cj(i) is the input bit position of i-th output after the permutation of j-th row.

Multiplexing and Channel Coding

13

Third Stage:
Perform the inter-row permutation based on the following P(j) (j=0,1, ..., R-1) patterns, where P(j) is
the original row position of the j-th permuted row.
PA: {19, 9, 14, 4, 0, 2, 5, 7, 12, 18, 10, 8, 13, 17, 3, 1, 16, 6, 15, 11} for R=20
PB: {19, 9, 14, 4, 0, 2, 5, 7, 12, 18, 16, 13, 17, 15, 3, 1, 6, 11, 8, 10} for R=20
PC: {9, 8, 7, 6, 5, 4, 3, 2, 1, 0} for R=10
The usage of these patterns is as follows:
Block length K: P(j)
320 to 480-bit:
PA
481 to 530-bit:
PC
531 to 2280-bit:
PA
2281 to 2480-bit: PB
2481 to 3160-bit:
PA
3161 to 3210-bit:
PB
3211 to 5114-bit: PA
(2) The output of the mother interleaver is the sequence read out column by column from the permuted R
matrix.

Table 6.2.2-2. Table of prime p and associated primitive root

p
17
19
23
29
31
37
41
43
47
53

go
3
2
5
2
3
2
6
3
5
2

P
59
61
67
71
73
79
83
89
97
101

go
2
2
2
7
5
3
2
3
5
2

p
103
107
109
113
127
131
137
139
149
151

go
5
2
6
3
3
2
3
2
2
6

P
157
163
167
173
179
181
191
193
197
199

go
5
2
5
2
2
2
19
5
2
3

p
211
223
227
229
233
239
241
251
257

go
2
3
2
6
3
7
7
6
3

6.2.3.2.3.2 Definition of the number of pruning bits

The output of the mother interleaver is pruned by deleting the l-bits in order to adjust the mother interleaver to
the block length K, where the deleted bits are non-existent bits in the input sequence. The pruning bits number l
is defined as:
l = R C K,
where R is the row number and C is the column number defined in section 6.2.3.2.3.1.

Radio frame size equalisation

Radio frame size equalisation is padding the input bit sequence in order to ensure that the output can be segmented
in Fi data segments of same size as described in the section 6.2.6.
The input bit sequence to the radio frame size equalisation is denoted by ci1 , ci 2 , ci 3 , , ciEi , where i is TrCH
number and Ei the number of bits. The output bit sequence is denoted by t i1 , t i 2 , t i 3 , , t iTi , where Ti is the
number of bits. The output bit sequence is derived as follows:
tik = cik, for k = 1 Ei and
tik = {0 | 1} for k= Ei +1 Ti, if Ei < Ti
where
Ti = Fi * Ni and
N i Ei 1 Fi 1 is the number of bits per segment after size equalisation.

1st interleaving
The 1st interleaving is a block interleaver with inter-column permutations. The input bit sequence to the 1st

Multiplexing and Channel Coding

14

interleaver is denoted by xi1 , xi 2 , xi 3 , , xiX i , where i is TrCH number and Xi the number of bits (at this
stage Xi is assumed and guaranteed to be an integer multiple of TTI). The output bit sequence is derived as
follows:
Select the number of columns CI from Table 6.2.5-1.
1)
Determine the number of rows RI defined as RI = Xi/CI
2)
Write the input bit sequence into the RI CI rectangular matrix row by row starting with bit xi ,1 in the first
3)
column of the first row and ending with bit xi ,( RI C I ) in column CI of row RI:

xi1

xi 2

xi 3

xi ,(C I 1)

xi ,(C I 2 )

xi ,(C I 3)

xi ,(( RI 1)C I 1)

xi ,(( RI 1)C I 2 )

xi ,(( RI 1)C I 3)

4)

Perform the inter-column permutation based on the pattern {P1 (j)} (j=0,1, , C-1) shown in Table 6.2.5-1,
where P1(j) is the original column position of the j-th permuted column. After permutation of the columns, the
bits are denoted by yik:

y i1
y
i2

yiRI
5)

xiC I
xi ,( 2C I )

xi ,( RI C I )

yi ,( RI 1)
yi , ( R I 2 )

y i , ( 2 RI )

yi ,( 2 RI 1)

yi ,(( C I 1) RI 1)

yi ,( 2 RI 2 ) yi ,(( C I 1) RI 2 )

yi ,( 3 RI ) yi ,( C I RI )

Read the output bit sequence yi1 , yi 2 , yi 3 , , yi ,( C I RI ) of the 1st interleaving column by column from the
inter-column permuted RI CI matrix. Bit yi ,1 corresponds to the first row of the first column and bit

yi ,( RI CI ) corresponds to row RI of column CI.

The bits input to the 1st interleaving are denoted by t i1 , t i 2 , t i 3 , , t iTi , where i is the TrCH number and Ei the
number of bits. Hence, xik = tik and Xi = Ti.
The bits output from the 1st interleaving are denoted by d i1 , d i 2 , d i 3 , , d iTi , and dik = yik.

Interleaving span
10 ms
20 ms
40 ms
80 ms

Table 6.2.5-1
Column number C1
1
2
4
8

Inter-column permutation patterns

{0}
{0,1}
{0,2,1,3}
{0,4,2,6,1,5,3,7}

Radio frame segmentation

When the transmission time interval is longer than 10 ms, the input bit sequence is segmented and mapped onto
consecutive radio frames. Following radio frame size equalisation the input bit sequence length is guaranteed to be
an integer multiple of Fi.
The input bit sequence is denoted by xi1 , xi 2 , xi 3 , , xiX i where i is the TrCH number and Xi is the number
bits. The Fi output bit sequences per TTI are denoted by yi ,ni 1 , yi ,ni 2 , yi ,ni 3 , , yi ,niYi where ni is the radio
frame number in current TTI and Yi is the number of bits per radio frame for TrCH i. The output sequences are
defined as follows:

yi ,ni k = xi , ni 1 Yi k , ni = 1Fi, j = 1Yi

where
Yi = (Xi / Fi) is the number of bits per segment,

Multiplexing and Channel Coding

15

xik is the kth bit of the input bit sequence and

yi ,ni k is the kth bit of the output bit sequence corresponding to the nth radio frame
The ni th segment is mapped to the ni th radio frame of the transmission time interval.
The input bit sequence to the radio frame segmentation is denoted by d i1 , d i 2 , d i 3 , , d iTi , where i is the TrCH
number and Ti the number of bits. Hence, xik = dik and Xi = Ti.
The output bit sequence corresponding radio frame ni is denoted by ei1 , ei 2 , ei 3 , , eiN i , where i is the TrCH
number and Ni is the number of bits. Hence, ei ,k yi ,ni k and Ni = Yi.

Rate matching
Rate matching means that bits on a transport channel are repeated or punctured. Higher layers assign a ratematching attribute for each transport channel. This attribute is semi-static and can only be changed through higher
layer signalling. The rate-matching attribute is used when the number of bits to be repeated or punctured is
calculated.
The number of bits on a transport channel can vary between different transmission time intervals. When the
number of bits between different transmission time intervals is changed, bits are repeated to ensure that the total
bit rate after second multiplexing is identical to the total channel bit rate of the allocated dedicated physical
channels.
Notation used in Section 6.2.7 and subsections:
Nij: Number of bits in a radio frame before rate matching on transport channel i with transport format
combination j .
N ij : If positive - number of bits to be repeated in each radio frame on transport channel i with transport format

combination j.
If negative - number of bits to be punctured in each radio frame on transport channel i with transport
format combination j.
RMi:

Semi-static rate matching attribute for transport channel i. Signalled from higher layers.

PL:

Puncturing limit for uplink. This value limits the amount of puncturing that can be applied in order to
minimise the number of dedicated physical channels. Signalled from higher layers.

Ndata,j:

Total number of bits that are available for a CCTrCH in a radio frame with transport format combination
j.

I:

Number of transport channels in a CCTrCH.

Zmj:

Intermediate calculation variable.

Fi:

Number of radio frames in the transmission time interval of transport channel i.

ni :

Radio frame number in the transmission time interval of transport channel i (0 ni < Fi).

Q:

Average puncturing distance.

IF(ni):

The inverse interleaving function of the 1st interleaver (note that the inverse interleaving function is
identical to the interleaving function itself for the 1st interleaver).

S(ni): The shift of the puncturing pattern for radio frame ni .

TFi(j): Transport format of transport channel i for the transport format combination j.
TFS(i): The set of transport format indexes l for TrCH i.
Eini: Initial value of variable e in the rate matching pattern determination algorithm of section 6.2.7.3.
X: Systematic bit in 6.2.3.2.1.
Y: 1st parity bit (from the upper Turbo constituent encoder) in section 6.2.3.2.1.
Y: 2nd parity bit (from the lower Turbo constituent encoder) in section 6.2.3.2.1.
Note: Time index t in 6.2.3.2.1 is omitted for simplify the rate matching description

Determination of rate matching parameters

The following relations are used when calculating the rate-matching pattern:

Multiplexing and Channel Coding

16

Z0 0

RM

Z ij

m 1
I

RM
m 1

N mj
N mj

N data , j

N ij Z ij Z i 1, j N ij

for all i = 1 .. I

for all i = 1 .. I
Puncturing can be used to minimise the number of required transmission capacity. The maximum amount of
puncturing that can be applied is signalled at connection setup from higher layers and denoted by PL. The possible
values for Ndata in uplink and downlink depend on the dedicated physical channels which are assigned to the link,
respectively. The supported set of Ndata , denoted SET0, depends on the UE capabilities. Ndata,j for the transport
format combination j is determined by executing the following algorithm:
I

SET1 = { Ndata in SET0 such that N data PL

i 1

RM i
N ij is non negative }
m i n RM l
l

Ndata,j = min SET1

The number of bits to be repeated or punctured, Nij, within one radio frame for each transport channel i is
calculated with the relations given at the beginning of this section for all possible transport format combinations j
and selected every radio subframe. For each radio frame, the rate matching pattern is calculated with the algorithm
in Section 6.2.6.2, where N = Nij and N = Nij.
Additionally, the following parameters are needed:
For convolutional codes, a=2 for the rate matching algorithm in section 6.2.7.3.
q N ij / N ij , where means round downwards , and
means absolute value.

If q is even
Then q' = q gcd(q, Fi)/FI -- where gcd(q, FI) means greatest common divisor of q and FI
-- note that q' is not an integer, but a multiple of 1/8.
Else
q' = q
endif
for l=0 to FI -1

S I F l * q' mod Fi l * q' divFi where means rounding upwards .

end for
For each radio frame, the rate-matching pattern is calculated with the algorithm in section 6.2.7.3, where:
N = Ni,j
N = Ni,j, and
eini = (aS(ni)|N| + N) mod aN, if eini =0 then eini = aN.
For turbo codes, if repetition is to be performed, such as Ni,j >0, parameters for turbo codes are the same as
parameter for convolutional codes. If puncturing is to be performed, parameters are as follows.
A = 2 for Y parity sequence, and
a = 1 for Y parity sequence.
For each radio frame, the rate-matching pattern is calculated with the algorithm in section 6.2.7.3, where:

N i , j / 2 for Y sequence
N i , j / 2 for Y' sequence

N =

N = Ni,j /3 ,
q = N /|N|
if(q 2)
for x=0 to Fi-1
if(Y sequence)
S[IF[(3x+1) mod Fi]] = x mod 2;
if(Y sequence)
S[IF [(3x+2) mod Fi]] = x mod 2;

Multiplexing and Channel Coding

17

end for
else
if q is even
then q' = q gcd(q, Fi)/ Fi -- where gcd (q, Fi) means greatest common divisor of q and Fi
-- note that q' is not an integer, but a multiple of 1/8
else
q = q
endif
for x=0 to Fi 1
r = x*q mod Fi;
if(Y sequence)
S[IF[(3r+1) mod Fi]] = x*q div Fi;
if(Y sequence)
S[IF[(3r+2) mod Fi ]] = x*q div Fi;
endfor
endif
eini = (aS(ni)|N| + N) mod aN, if eini = 0 then eini = aN.

Bit separation for rate matching

Radio
frame
segmentation

Bit
Seperation

..111101011...

..11x11010x...

Rate matching
algorithm

Y'

..11x11010x...

Figure 6-5. Overall rate matching block diagram after first interleaving where x denotes punctured bit.
Rate matching puncturing for Turbo codes is applied separately to Y and Y sequences. No puncturing is applied to
X sequence. Therefore, it is necessary to separate X, Y, and Y sequences before rate matching is applied.
There are two different alternation patterns in bit stream from Radio frame segmentation according to the TTI of a
TrCH as shown in Table 6.2.7-1.
Table 6.2.7-1 Alternation patterns of bits from radio frame segmentation
TTI (msec)
Alternation patterns
10, 40
X,Y,Y,
20, 80
X,Y,Y,
In addition, each radio frame of a TrCH starts with different initial parity type. Table
parity type of each radio frame of a TrCH with TTI = {10, 20, 40, 80} msec.
Table 6.2.7-2 Initial parity type of radio frames of TrCH
TTI
Radio frame indexes (ni)
(msec)
0
1
2
3
4
5
10
X
NA
NA
NA
NA
NA
20
X
Y
NA
NA
NA
NA
40
X
Y
Y
X
NA
NA
80
X
Y
Y
X
Y
Y

6.2.7-2 shows the initial

6
NA
NA
NA
X

7
NA
NA
NA
Y

Table 6.2.7-1 and 6.2.7-2 defines a complete output bit pattern from Radio frame segmentation.
Ex. 1.
TTI = 40 msec, ni = 2
Radio frame pattern: Y, Y, X, Y, Y, X, Y, Y, X,
Ex. 2
TTI = 40 msec, ni = 3
Radio frame pattern: X, Y, Y, X, Y, Y, X, Y, Y, X,
Therefore, bit separation is achieved with the alternative selection of bits with the initial parity type and

Multiplexing and Channel Coding

18

alternation pattern specified in Table 6.2.7-1 and 6.2.7-2 according to the TTI and ni of a TrCH.

Rate matching pattern determination

The bits input to the rate matching are denoted by ei1 , ei 2 , e13 , , eiN i , where i is the TrCH with N = Nij = Ni.
Here N is the parameter given in section 6.2.7.1.The bits output from the rate matching are denoted by
f i1 , f i 2 , f13 , , f iVi , where i is the TrCH number and Vi=N+N = Nij+Nij .
Note that the transport format combination number j for simplicity has been left out in the bit numbering.
The rate matching rule is as follows:
if puncturing is to be performed
y = -N

e = eini
-- initial error between current and desired puncturing ratio
m=1
-- index of current bit
do while m <= N
e=ea*y
-- update error
if e <= 0 then
-- check if bit number m should be punctured
puncture bit xi,m
e = e + a*N
-- update error
end if
m=m+1
-- next bit
end do
else
y = N
e = eini
-- initial error between current and desired puncturing ratio
m=1
-- index of current bit
do while m <= N
e=ea*y
-- update error
do while e <= 0
-- check if bit number m should be repeated
repeat bit xi,m
e = e + a*N -- update error
enddo
m=m+1
-- next bit
end do
end if
A repeated bit is placed directly after the original one.

TrCH multiplexing
Every 10 ms, one radio frame from each TrCH is delivered to the TrCH multiplexing. These radio frames are serially
multiplexed into a coded composite transport channel (CCTrCH).

The bits input to the TrCH multiplexing are denoted by f i1 , f i 2 , f i 3 , , f iVi , where i is the TrCH number and Vi
is the number of bits in the radio frame of TrCH i. The number of TrCHs is denoted by I. The bits output from
TrCH multiplexing are denoted by s1 , s2 , s3 , , sS , where S is the number of bits, i.e. S

V . The TrCH
i

multiplexing is defined by the following relations:

sk f1k
k = 1, 2, , V1

sk f 2, ( k V1 )

k = V1+1, V1+2, , V1+V2

sk f 3, ( k (V1 V 2 ))

k = (V1+V2)+1, (V1+V2)+2, , (V1+V2)+V3

sk f I , ( k (V1 V2 V I 1 )) k = (V1+V2++VI-1)+1, (V1+V2++VI-1)+2, , (V1+V2++VI-1)+VI

Multiplexing and Channel Coding

19

Physical channel segmentation

When more than one PhCH is used, physical channel segmentation divides the bits among the different PhCHs.
The bits input to the physical channel segmentation are denoted by s1 , s2 , s3 , , sS , where S is the number of
bits input to the physical channel segmentation block. The number of PhCHs is denoted by P.
The bits after physical channel segmentation are denoted u p1 , u p 2 , u p 3 , , u pU p , where p is PhCH number and
Up is the in general variable number of bits in the respective radio frame for each PhCH. The relation between sk
and upk is given below.
Bits on first PhCH after physical channel segmentation:
u1k sk
k = 1, 2 , , U1
Bits on second PhCH after physical channel segmentation:

u2 k s( k U 1 )

k = 1, 2 , , U2

Bits on the Pth PhCH after physical channel segmentation:

u Pk s( k U 1 ... U P 1 ) k = 1, 2 , , UP

2nd interleaving
The 2nd interleaving can be applied jointly to all data bits transmitted during one frame, or separately within
each timeslot, on which the CCTrCH is mapped. The selection of the 2 nd interleaving scheme is controlled by
higher layer.

Frame related 2nd interleaving

In case of frame related interleaving, the bits input to the 2nd interleaver are denoted x1 , x2 , x3 , , xU ,
where U is the total number of bits after TrCH multiplexing transmitted during the respective radio frame.
The relation between xk and the bits upk in the respective physical channels is given below:

xk u1k

k = 1, 2 , , U1

x( k U 1 ) u2 k

k = 1, 2 , , U2

x( k U 1 ... U P 1 ) u Pk

k = 1, 2 , , UP

The following steps have to be performed once for each CCTrCH:

(1) Set the number of columns C2 = 30. The columns are numbered 0, 1, 2, , C2-1 from left to right.
(2) Determine the number of rows R2 by finding minimum integer R2 such that
U R2C2.
(3) The bits input to the 2nd interleaving are written into the R2 C2 rectangular matrix row by row.

x1

x2

x3

x31

x32

x33

x( R2 1) 30 2

x( R2 1) 30 3

x( R2 1) 30 1

x30
x60

xR2 30

(4) Perform the inter-column permutation based on the pattern {P2(j)} (j = 0, 1, , C2-1) that is shown in Table
6.2.9-1, where P2(j) is the original column position of the j-th permuted column. After permutation of the
columns, the bits are denoted by yk.

Multiplexing and Channel Coding

y1
y
2

y R2 2

yR2

y2 R 2

20

y2 R2 1 y29 R2 1

y R 2 1

y2 R2 2 y29 R2 2

y3 R2

y30 R2

(5) The output of the 2nd interleaving is the bit sequence read out column by column from the inter-column
permuted R2 C2 matrix. The output is pruned by deleting bits that were not present in the input bit
sequence, i.e. bits yk that corresponds to bits xk with k>U are removed from the output. The bits after 2 nd
interleaving are denoted by v1 , v2 , , vU , where v1 corresponds to the bit yk with smallest index k after
pruning, v2 to the bit yk with second smallest index k after pruning, and so on.

Timeslot related 2nd interleaving

In case of timeslot related 2 nd interleaving, the bits input to the 2nd interleaver are denoted
xt1 , xt 2 , xt 3 , , xtU t , where t refers to a certain timeslot, and Ut is the number of bits transmitted in this
timeslot during the respective radio frame.
In each timeslot t the relation between xtk and upk is given below with Pt refering to the number of physical
channels within the respective timeslot:
xtk u1k
k = 1, 2 , , U1

xt ( k U 1 ) u2 k

k = 1, 2 , ,

U2

xt ( k U 1 ... U P 1 ) u Pt k

k = 1, 2 , , U Pt

The following steps have to be performed for each timeslot t, on which the respective CCTrCH is mapped:
(1) Set the number of columns C2 = 30. The columns are numbered 0, 1, 2, , C2-1 from left to right.
(2) Determine the number of rows R2 by finding minimum integer R2 such that
Ut R2C2.
(3) The bits input to the 2nd interleaving are written into the R2 C2 rectangular matrix row by row.

xt1

xt 2

xt 3

xt 31

xt 32

xt 33

xt 30
xt 60

xt , (( R2 1) 30 1)

xt , (( R2 1)30 2 )

xt , (( R2 1) 30 3)

xt , ( R2 30)

(4) Perform the inter-column permutation based on the pattern {P2(j)} (j = 0, 1, , C2-1) that is shown in Table
6.2.9-1, where P2(j) is the original column position of the j-th permuted column. After permutation of the
columns, the bits are denoted by ytk.

yt1
y
t2

ytR2

yt , ( R2 1)
yt , ( R2 2 )

yt , ( 2 R2 1) yt , ( 29 R2 1)

yt , ( 2 R2 2 ) yt , ( 29 R2 2 )

yt , ( 2 R 2 )

yt , ( 3 R 2 )

nd

yt , (30 R2 )

The output of the 2 interleaving is the bit sequence read out column by column from the inter-column
permuted R2 C2 matrix. The output is pruned by deleting bits that were not present in the input bit
sequence, i.e. bits ytk that corresponds to bits xtk with k>Ut are removed from the output. The bits after 2 nd
interleaving are denoted by vt1 , vt 2 , , vtU t , where vt1 corresponds to the bit ytk with smallest index k after
pruning, vt2 to the bit ytk with second smallest index k after pruning, and so on.
Table 6.2.10-1
Column number C2

Inter-column permutation pattern

Multiplexing and Channel Coding

21

{0, 20, 10, 5, 15, 25, 3, 13, 23, 8, 18, 28, 1, 11, 21,
6, 16, 26, 4, 14, 24, 19, 9, 29, 12, 2, 7, 22, 27, 17}

30

Sub-frame segmentation
In the TD_SCDMA, it is needed to add a sub-frame segmentation unit between 2nd interleaving unit and physical
channel mapping unit. The operation of rate-matching guarantees that the bit streams is a even number and can be
subdivided into 2 sub-frames. The transport channel multiplexing structure for uplink and downlink is shown in
figure 6-1
The input bit sequence is denoted by

xi1 , xi 2 , xi 3 , , xiX i

where i is the TrCH number and Xi is the number

,y

,y

, , y

i , niYi
bits. The two output bit sequences per radio frame are denoted by i ,ni 1 i ,ni 2 i ,ni 3
where ni is the
sub-frame number in current radio frame and Yi is the number of bits per radio frame for TrCH i. The output
sequences are defined as follows:

yi ,ni k

xi , ni 1Yi k

, ni = 1 or 2, k = 1Yi
where
Yi = (Xi / 2) is the number of bits per sub-frame,
xik is the kth bit of the input bit sequence and

yi ,ni k

is the kth bit of the output bit sequence corresponding to the nth sub-frame
v(t )1 , v(t ) 2 ,..., v(t )U ( t )
The input bit sequence to the radio frame segmentation is denoted by
, xik = v(t)k and Xi
= U(t).
The output bit sequence corresponding subframe ni is denoted by

g p1 , g p 2 , , g pU p

, where p is the PhCH

g y i , ni k
number and Up is the number of bits in one subframe for the respective PhCH. Hence, pk
and Up = Yi.

Physical channel mapping

The bit streams from the sub-frame segmentation unit are mapped onto code channels of time slots in sub-frames.

w ,w

, , w

p2
pU p
The bits after physical channel mapping are denoted by p1
, where p is the PhCH number and
Up is the number of bits in one sub-frame for the respective PhCH. The bits wpk are mapped to the PhCHs so that
the bits for each PhCH are transmitted over the air in ascending order with respect to k.
g , g , , g pU p
The mapping of the bits p1 p 2
is performed like block interleaving, writing the bits into columns,
but a PhCH with an odd number is filled in forward order, were as a PhCH with an even number is filled in
reverse order.
The mapping scheme, as described in the following subclause, shall be applied individually for each timeslot t

g ,g

, , g

pU p
used in the current subframe. Therefore, the bits p1 p 2
are assigned to the bits of the physical
wt1,1...U t 1 , wt 2,1...U t 2 ,..., wtPt ,1...U tP
t in each timeslot.
channels
In uplink there are at most two codes allocated (P2). If there is only one code, the same mapping as for downlink
is applied. Denote SF1 and SF2 the spreading factors used for code 1 and 2, respectively. For the number of
consecutive bits to assign per code bsk the following rule is applied:
if
SF1 >= SF2 then bs1 = 1 ; bs2 = SF1/SF2 ;
else
SF2 > SF1 then bs1 = SF2/SF1; bs2 = 1 ;
end if
In the downlink case bsp is 1 for all physical channels.

Mapping scheme
Notation used in this subclause:
P t: number of physical channels for timeslot t , Pt = 1..2 for uplink ; Pt = 1...16 for downlink

Multiplexing and Channel Coding

22

Utp: capacity in bits for the physical channel p in timeslot t

Ut.: total number of bits to be assigned for timeslot t
bsp: number of consecutive bits to assign per code
for downlink all bsp = 1
for uplink
if SF1 >= SF2 then bs1 = 1 ; bs2 = SF1/SF2 ;
if SF2 > SF1 then bs1 = SF2/SF1; bs2 = 1 ;
fbp: number of already written bits for each code
pos: intermediate calculation variable
for p=1 to P t
-- reset number of already written bits for every physical channel
fbp = 0
end for
p=1
-- start with PhCH #1
for k=1 to Ut.
do while (fbp == Utp)
-- physical channel filled up already ?
p = (p mod P t ) + 1 ;
end do
if (p mod 2) == 0
pos = Utp - fbp
-- reverse order
else
pos = fbp + 1
-- forward order
end if
wtp,pos = gt,k
-- assignment
fbp = fbp + 1
-- Increment number of already written bits
If (fbp mod bsp) == 0
-- Conditional change to the next physical channel
p = (p mod P t) + 1;
end if
end for

Multiplexing of different transport channels onto one CCTrCH, and mapping

of one CCTrCH onto physical channels
Different transport channels can be encoded and multiplexed together into one Coded Composite Transport
Channel (CCTrCH). The following rules shall apply to the different transport channels which are part of the same
CCTrCH:
1) Transport channels multiplexed into one CCTrCh should have co-ordinated timings in the sense that transport
blocks arriving from higher layers on different transport channels of potentially different transmission time
intervals shall have aligned transmission time instants as shown in figure 6-6.
2) Different CCTrCHs cannot be mapped onto the same physical channel.
3) One CCTrCH shall be mapped onto one or several physical channels.
Transmissiontime intervals

Possible transmission time instants

0 ms

10 ms 20 ms 30 ms 40 ms 50 ms 60 ms 70 ms 80 ms

90 ms 100 ms 110 ms 120 ms 130 ms 140 ms 150 ms160 ms

10 ms
20 ms
40 ms
80 ms

: Allowed transmission time instants

Figure 6-6: Possible transmission time instants regarding CCTrCH

4) Dedicated Transport channels and common transport channels cannot be multiplexed into the same CCTrCH.
5) For the common transport channels, only the FACH and PCH may belong to the same CCTrCH.
6) Each CCTrCH carrying a BCH shall carry only one BCH and shall not carry any other Transport Channel.
7) Each CCTrCH carrying a RACH shall carry only one RACH and shall not carry any other Transport Channel.
Hence, there are two types of CCTrCH
CCTrCH of dedicated type, corresponding to the result of coding and multiplexing of one or several DCH.

Multiplexing and Channel Coding

23

CCTrCH of common type, corresponding to the result of the coding and multiplexing of a common channel, i.e.
RACH and USCH in the uplink and DSCH, BCH, FACH or PCH in the downlink, respectively.
There may be one TFCI for each CCTrCH of dedicated type as well as for USCH- and DSCH-CCTrCHs.

Allowed CCTrCH combinations for one UE

Allowed CCTrCH combinations on the uplink
The following CCTrCH combinations for one UE are allowed, also simultaneously:
1) several CCTrCH of dedicated type
2) several CCTrCH of common type
Allowed CCTrCH combinations on the downlink
The following CCTrCH combinations for one UE are allowed, also simultaneously:
3) several CCTrCH of dedicated type
several CCTrCH of common type

Transport format detection

Transport format detection can be performed both with and without Transport Format Combination Indicator
(TFCI). If a TFCI is transmitted, the receiver detects the transport format combination from the TFCI. When no
TFCI is transmitted, so called blind transport format detection is used, i.e. the receiver side uses the possible
transport format combinations as a priori information or the transport format is informed to the receiver side
through higher layer signalling at connection setup.

Blind transport format detection

Blind transport format detection may be performed in the receiver by trying all possible combinations of the
transport format.

Explicit transport format detection based on TFCI

Transport Format Combination Indicator
The Transport Format Combination Indicator (TFCI) informs the receiver of the transport format combination of
the CCTrCHs . As soon as the TFCI is detected, the transport format combination, and hence the individual
transport channels' transport formats are known, and decoding of the transport channels can be performed.

Coding for layer 1 control

Coding of transport format combination indicator (TFCI)
The number of TFCI bits is variable and is set at the beginning of the call via higher layer signalling. Encoding of
the TFCI bits depends on the number of them and the modulation mode. When the modulation of QPSK is used, if
there are 6-10 bits of TFCI the channel encoding is done as described in section 6.3.1.1. Also specific coding of
less than 6 bits is possible as explained in 6.3.1.2.When 2Mbps service is transmitted, the modulation of 8PSK is
applied in low chip rate option. In this case of 2Mbps service, the channel encoding is done as described in section
6.3.1.2.

Coding of transport format combination indicator (TFCI) for QPSK

Coding of long TFCI lengths
The TFCI bits are encoded using a (32, 10) sub-code of the second order Reed-Muller code. The coding procedure
is as shown in figure 6.
T F C I (1 0 b its )
a 0 ...a 9

(3 2 ,1 0 ) s u b -c o d e o f
th e s e c o n d o rd e r
R e e d - M u lle r c o d e

Figure 6: Channel coding of TFCI bits

T F C I co d e w o rd
b 0 ...b 3 1

Multiplexing and Channel Coding

24

TFCI is encoded by the (32,10) sub-code of second order Reed-Muller code. The code words of the (32,10) subcode of second order Reed-Muller code are linear combination of some among 10 basis sequences. The basis
sequences are as follows in table 7.
Table 7: Basis sequences for (32,10) TFCI code
I
0
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31

Mi,0
1
0
1
0
1
0
1
0
1
0
1
0
1
0
1
1
0
1
0
1
0
1
0
1
0
1
0
1
0
1
0
0

Mi,1
0
1
1
0
0
1
1
0
0
1
1
0
0
1
1
0
1
1
0
0
1
1
0
0
1
1
0
0
1
1
0
0

Mi,2
0
0
0
1
1
1
1
0
0
0
0
1
1
1
1
0
0
0
1
1
1
1
0
0
0
0
1
1
1
1
0
0

Mi,3
0
0
0
0
0
0
0
1
1
1
1
1
1
1
1
0
0
0
0
0
0
0
1
1
1
1
1
1
1
1
0
0

MI,4
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
0
1

Mi,5
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1

Mi,6
0
1
0
1
0
0
0
0
1
1
0
0
0
1
1
1
1
1
0
0
0
0
0
1
1
1
0
1
1
1
0
1

Mi,7
0
0
0
0
0
0
1
1
1
0
0
1
1
0
1
1
1
0
1
1
0
1
1
1
0
0
0
1
1
1
0
0

Mi,8
0
0
0
1
0
1
0
1
1
1
1
1
0
0
1
0
0
1
1
0
1
1
0
0
1
0
1
0
1
1
0
0

Mi,9
0
0
1
1
1
0
0
0
0
1
1
0
1
1
1
0
1
0
1
1
1
1
0
1
0
1
0
0
0
1
0
0

Let's define the TFCI information bits as a 0 , a1 , a2 , a3 , a4 , a5 , a6 , a7 , a8 , a9 (a0 is LSB and a9 is MSB). The TFCI
information bits shall correspond to the TFC index (expressed in unsigned binary form) defined by the RRC layer
to reference the TFC of the CCTrCH in the associated DPCH radio frame.
The output code word bits bi are given by:

(a n M i , n ) mod 2
n 0

where i=031. NTFCI=32.

Coding of short TFCI lengths

Coding very short TFCIs by repetition

If the number of TFCI bits is 1 or 2, then repetition will be used for coding. In this case each bit is repeated to a
total of 4 times giving 4-bit transmission (N TFCI=4) for a single TFCI bit and 8-bit transmission (N TFCI=8) for 2
TFCI bits. Let's define the TFCI information bit(s) as b 0 (or b0 and b1). The TFCI information bit(s) shall
correspond to the TFC index (expressed in unsigned binary form) defined by the RRC layer to reference the TFC
of the CCTrCH in the associated DPCH radio frame. In the case of two TFCI bits denoted b 0 and b1 the TFCI
word shall be { b0, b1, b0, b1, b0, b1, b0, b1 }.
Coding short TFCIs using bi-orthogonal codes

If the number of TFCI bits is in the range 3 to 5 the TFCI bits are encoded using a (16, 5) bi-orthogonal (or first
order Reed-Muller) code. The coding procedure is as shown in figure 7.

Multiplexing and Channel Coding

25

T F C I (5 b its )
a 0 ...a 4

T F C I co d e w o rd
b 0 ...b 1 5

( 1 6 , 5 ) b i- o r t h o g o n a l
code

Figure 7: Channel coding of short length TFCI bits

The code words of the (16,5) bi-orthogonal code are linear combinations of 5 basis sequences as defined in table
8.
Table 8: Basis sequences for (16,5) TFCI code
i
0
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15

Mi,0
1
0
1
0
1
0
1
0
1
0
1
0
1
0
1
0

Mi,1
0
1
1
0
0
1
1
0
0
1
1
0
0
1
1
0

Mi,2
0
0
0
1
1
1
1
0
0
0
0
1
1
1
1
0

Mi,3
0
0
0
0
0
0
0
1
1
1
1
1
1
1
1
0

Mi,4
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1

Let's define the TFCI information bits as a 0 , a1 , a2 , a3 , a4 (a0 is LSB and a4 is MSB). The TFCI information bits
shall correspond to the TFC index (expressed in unsigned binary form) defined by the RRC layer to reference the
TFC of the CCTrCH in the associated DPCH radio frame.
The output code word bits bj are given by:

(an M i , n) mod 2
n 0

where i=015. NTFCI=16.

Coding of transport format combination indicator (TFCI) for 8PSK

When 2Mbps service is transmitted, the modulation of 8PSK is applied in TD_SCDMA. In this case, the number
of TFCI bits are 6-10bits, and the channel encoding is done as described in subclause 4.4.2.1.

Coding of long TFCI for 8PSK

In the case of 2Mbps service using the modulation of 8PSK, the TFCI bits are encoded by using a (64,10) subcode of the second order Reed-Muller code, then 16 bits out of 64 bits are punctured (Puncturing positions are 1,
5, 9,14, 17, 21, 28, 32, 35, 39, 42, 45, 51, 55, 58, 62-th bits). The coding procedure is shown in Figure 9.
TFCI
( 10 bits)
a 0 , ..., a

(64,10) sub-code 9:
of Channel coding of long TFCI bits for 8PSKTFCI code
Figure
second order
Reed-Muller code

Puncturing

word
b 0 , ..., b

TFCI is encoded by the (64,10) sub-code of second order Reed-Muller code. The code words47 of the punctured
(48,10) sub-code of second order Reed-Muller code are linear combination of 10 basis sequences. The basis
sequences are as follows in table xxx.
9

Table 11: Basis sequences for (32,10) TFCI code

Multiplexing and Channel Coding

26

Mi,0

Mi,1

Mi,2

Mi,3

Mi,4

Mi,5

Mi,6

MI,7

MI,8

Mi,9

0
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47

1
0
1
1
0
1
1
0
1
0
0
1
1
0
1
1
0
1
0
1
0
0
1
0
0
1
1
0
1
1
0
0
1
1
0
1
0
1
1
0
1
1
0
0
1
0
0
1

0
1
1
0
1
1
0
1
1
0
1
1
0
1
1
0
1
1
0
0
1
0
0
1
0
0
1
0
0
1
0
1
1
0
1
1
0
0
1
0
0
1
0
1
1
0
1
1

0
0
0
1
1
1
0
0
0
1
1
1
0
0
0
1
1
1
0
0
0
1
1
1
0
0
0
1
1
1
0
0
0
1
1
1
0
0
0
1
1
1
0
0
0
1
1
1

0
0
0
0
0
0
1
1
1
1
1
1
0
0
0
0
0
0
1
1
1
1
1
1
0
0
0
0
0
0
1
1
1
1
1
1
0
0
0
0
0
0
1
1
1
1
1
1

0
0
0
0
0
0
0
0
0
0
0
0
1
1
1
1
1
1
1
1
1
1
1
1
0
0
0
0
0
0
0
0
0
0
0
0
1
1
1
1
1
1
1
1
1
1
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
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1

1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1

0
1
1
1
0
1
1
1
0
1
1
1
0
1
0
0
1
1
0
0
0
0
1
1
1
1
1
0
1
0
0
0
1
0
1
1
1
0
1
1
1
1
1
0
0
0
0
1

1
0
0
1
1
1
1
0
1
0
0
1
1
1
0
1
0
1
0
1
1
1
0
1
0
1
1
1
0
1
0
0
1
0
1
0
1
1
1
0
0
1
1
1
1
1
0
0

0
0
1
0
0
0
1
1
0
0
1
1
1
0
1
1
0
0
1
1
0
0
1
0
1
0
1
1
1
1
1
1
1
1
0
1
0
1
1
0
0
1
1
0
0
1
1
0

Let's define the TFCI information bits as a 0 , a1 , a2 , a3 , a4 , a5 , a6 , a7 , a8 , a9 (a0 is LSB and a9 is MSB). The TFCI
information bits shall correspond to the TFC index (expressed in unsigned binary form) defined by the RRC layer
to reference the TFC of the CCTrCH in the associated DPCH radio frame.
The output code word bits bi are given by:

(a n M i , n ) mod 2
n 0

where i=047. NTFCI=48.

Multiplexing and Channel Coding

27

Coding of short TFCI lengths

Mapping of TFCI word

Denote the number of bits in the TFCI word by N TFCI, and denote the code word bits by bk, where k = 0, , NTFCI1. The mapping of the TFCI word to the TFCI bit positions in a time slot shall be as follows.

1st part of TFCI

N/4-1

N/4

N/2-1

N/2

2nd part of TFCI

3N/4-1

3rd part of TFCI

3N/4

N-1

4th part of TFCI

Figure 10: Mapping of TFCI word bits to timeslot in TD_SCDMA, where N = NTFCI.
The location of the 1st to 4th parts of TFCI in the timeslot is defined in [2].

Coding of Transmit Power Control (TPC)

The TPC command is an identifier sent both in up- and downlink, to instruct a power level adjustment which is
increase or decrease. The length of the TPC command is one symbol. The coding of the TPC command is shown
in table 6.3.2.1.
Table 6.3.2.1: Coding of the TPC
Meaning

TPC

TPC Bits

Up

11

Increase Tx Power

Down

00

Decrease Tx Power

When 2Mbps service is transmitted, the 8PSK modulation is applied. So, in this case the length of the coded TPC
command remains one symbol and therefore the number of TPC Bits is 3. The specific coding of TPC for the
case of 2Mbps service is shown in table 6.3.2.2.
Table 6.3.2.2: Coding of the TPC (Special for 2Mbps service)
TPC
TPC Bits
Meaning
Up

111

Increase TX power

Down

001

Decrease TX power

Coding of Synchronization shift (SS)

The SS command, one kind of L1 control signals, is an identifier sent in downlink, to instruct a timing
adjustment in the uplink in each M frames (the SS command is repeated within these M frames). The length of the
SS command is 1 symbol. The coding of the SS command is shown in table 6.3.3.1. M (1-8) and k (1-8) can be
adjusted during call setup or readjusted during the call.

Multiplexing and Channel Coding

28

Table 6.3.3.1: Coding of the SS

SS Bits

Meaning

11

Increase timing advance by k/8 Tc

00

Decrease timing advance by k/8 Tc

When 2Mbps service is transmitted, the modulation of 8PSK is applied. The prefered spreading factor is 1..In this case
of 2Mbps service, the numbers of the SS bits is3. The specific coding of SS for the case of 2Mbps service is shown in
table 6.3.3.2.

Table 6.3.3.2: Coding of the SS (special for 2Mbps service)

SS Bits

Meaning

111

Increase timing advance k/8 Tc

001

Decrease timing advance k/8 Tc

History
Document history
V1.0.0

1999-07-29

Document created based on the documents TS C.121(V1.10) and

TS S1.22 (V2.00).

V1.1.0

1999-08-5

Document created based on the documents TS C.121(V1.1.0) and

discussion in the CWTS WG1 Ad Hoc1 #2 conference

V2.0.0

1999-09-06

Updated based on the discussion in the CWTS WG1 Ad Hoc 1#3

conference.

V2.0.1

1999-09-28

Updated based on the consideration of new chiprate.

V2.1.0

1999-10-2

Chip rate change to 1.28Mcps

V2.2.0

1999-10-14

Document accepted by CWTS WG1 Ad Hoc #4 and CWTS

WG1#5, Beijing, Oct.14, 1999

V3.0.0

2000-5-30

Version updated based on the CWTS WG1#11 meeting.

V3.1.0

2000-9-12

The editor for CWTS TS C103 Multiplexing, channel coding and interleaving description (TD-SCDMA), is:

Multiplexing and Channel Coding

Zhang Jian
Beijing University of Posts & Telecommunications
Email: cmzhang@bupt.edu.cn
This document is written in Microsoft Word 97.

29