chanel coding ts25

8/4/2019 Chanel Coding TS25

1/53

TS 25.212 V2.3.0 (1999-10)Technical Specification

3rd Generation Partnership Project (3GPP);Technical Specification Group (TSG)

Radio Access Network (RAN);Working Group 1 (WG1);

Multiplexing and channel coding (FDD)

The present document has been developed within the 3rd

Generation Partnership Project (3GPPTM

) and may be further elaborated for the purposes of 3GPP.

The present document has not been subject to any approval process by the 3GPP Organisational Partners and shall not be implemented.

This Specification is provided for future development work within 3GPP only. The Organisational Partners accept no liability for any use of this Specification.

Specifications and reports for implementation of the 3GPP TM system should be obtained via the 3GPP Organisational Partners' Publications Offices.

TSGR1#7(99) 09

TSG RAN#5 (99)476TSG RAN Meeting No.5OCTOBER

Kyongju, Korea


2/53

Multiplexing and channel coding (FDD) TS 25.212 V2.2.1 (1999-10)2

Reference (.PDF)

Keywords

3GPP

Postal address

Office address

Internet

[email protected] copies of this deliverable

can be downloaded from

http://www.3gpp.org


3/53

Multiplexing and channel coding (FDD) 3 TS 25.212 V2.2.1 (1999-10)

Contents

Intellectual Property Rights .......................................................................................................................... 5

Foreword...................................................................................................................................................... 5

1 Scope ................................................................................................................................................. 6

2 References.......................................................................................................................................... 6

3 Definitions, symbols and abbreviations ............................................................................................... 63.1 Definitions...................................................................................................................................................6

3.2 Symbols.......................................................................................................................................................7

3.3 Abbreviations ..............................................................................................................................................7

4 Multiplexing, channel coding and interleaving ..................................................................................... 94.1 General........................................................................................................................................................9

4.2 Transport-channel coding/multiplexing .......................................................................................................9

4.2.1 Error detection .....................................................................................................................................12

4.2.1.1 CRC Calculation.............................................................................................................................124.2.1.2 Relation between input and output of the Cyclic Redundancy Check ...............................................12

4.2.2 Transport block concatenation and code block segmentation ................................................................12

4.2.2.1 Concatenation of transport blocks ...................................................................................................13

4.2.2.2 Code block segmentation ................................................................................................................13

4.2.3 Channel coding ....................................................................................................................................13

4.2.3.1 Convolutional coding......................................................................................................................14

4.2.3.2 Turbo coding ..................................................................................................................................15

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

4.2.5 1st

interleaving ..................................................................................................................................... 19

4.2.5.1 Relation between input and output of 1st

interleaving in uplink ....................................................... 20


interleaving in downlink................................................... 20

4.2.6 Radio frame segmentation....................................................................................................................204.2.6.1 Relation between input and output of the radio frame segmentation block in uplink........................20

4.2.6.2 Relation between input and output of the radio frame segmentation block in downlink....................21

4.2.7 Rate matching ......................................................................................................................................21

4.2.7.1 Determination of rate matching parameters in uplink......................................................................22

4.2.7.2 Determination of rate matching parameters in downlink .................................................................25

4.2.7.3 Bit separation for rate matching ......................................................................................................28

4.2.7.4 Rate matching pattern determination ..............................................................................................29

4.2.7.5 Relation between input and output of the rate matching block in uplink ..........................................30

4.2.7.6 Relation between input and output of the rate matching block in downlink......................................30

4.2.8 TrCH multiplexing...............................................................................................................................30

4.2.9 Insertion of discontinuous transmission (DTX) indication bits..............................................................31

4.2.9.1 Insertion of DTX indication bits with fixed positions ......................................................................31

4.2.9.2 Insertion of DTX indication bits with flexible positions...................................................................31

4.2.10 Physical channel segmentation .............................................................................................................31

4.2.10.1 Relation between input and output of the physical segmentation block in uplink .............................32

4.2.10.2 Relation between input and output of the physical segmentation block in downlink.........................32

4.2.11 2nd

interleaving.....................................................................................................................................32

4.2.12 Physical channel mapping ....................................................................................................................33

4.2.12.1 Uplink ............................................................................................................................................33

4.2.12.2 Downlink........................................................................................................................................33

4.2.13 Restrictions on different types of CCTrCHs ..........................................................................................33

4.2.13.1 Uplink Dedicated channel (DCH)....................................................................................................33

4.2.13.2 Random Access Channel (RACH)...................................................................................................34

4.2.13.3 Common Packet Channel (CPCH) ..................................................................................................34

4.2.13.4 Downlink Dedicated Channel (DCH)..............................................................................................344.2.13.5 Downlink Shared Channel (DSCH) associated with a DCH.............................................................34

4.2.13.6 Broadcast channel (BCH)................................................................................................................34

4.2.13.7 Forward access and paging channels (FACH and PCH) ..................................................................34


4/53


4.2.14 Multiplexing of different transport channels into one CCTrCH, and mapping of one CCTrCH onto

physical channels ................................................................................................................................. 34

4.2.14.1 Allowed CCTrCH combinations for one UE....................................................................................35

4.2.15 System Frame Number (SFN)...............................................................................................................35

4.3 Transport format detection.........................................................................................................................36

4.3.1 Blind transport format detection...........................................................................................................36

4.3.2 Explicit transport format detection based on TFCI................................................................................364.3.3 Coding of Transport-format-combination indicator (TFCI)...................................................................36

4.3.4 Operation of Transport-format-combination indicator (TFCI) in Split Mode.........................................37

4.3.5 Mapping of TFCI words .......................................................................................................................38

4.3.5.1 Mapping of TFCI word...................................................................................................................38

4.3.5.2 Mapping of TFCI word in Split Mode.............................................................................................39

4.3.5.3 Mapping of TFCI in compressed mode............................................................................................40

4.4 Compressed mode......................................................................................................................................42

4.4.1 Frame structure in the uplink ...............................................................................................................42

4.4.2 Frame structure types in the downlink..................................................................................................42

4.4.3 Transmission time reduction method....................................................................................................43

4.4.3.1 Method A: By puncturing ...............................................................................................................43

4.4.3.2 Method B: By reducing the spreading factor by 2 ............................................................................454.4.4 Transmission gap position....................................................................................................................46

4.4.4.1 Fixed transmission gap position ......................................................................................................46

4.4.4.2 Adjustable transmission gap position ..............................................................................................47

4.4.4.3 Parameters for downlink compressed mode.....................................................................................48

Annex A (informative): Blind transport format detection........................................................................................... 50

A.1 Blind transport format detection using fixed positions...................................................................................... 50

A.1.1 Blind transport format detection using received power ratio.......................................................................50

A.1.2 Blind transport format detection using CRC ..............................................................................................50

A.2 Blind transport format detection with flexible positions.................................................................................... 51

5 History............................................................................................................................................. 53


5/53


Intellectual Property Rights

ForewordThis Technical Specification has been produced by the 3GPP.

The contents of the present document are subject to continuing work within the TSG and may change following

formal TSG approval. Should the TSG modify the contents of this TS, it will be re-released by the TSG with an

identifying change of release date and an increase in version number as follows:

Version 3.y.z

where:

x the first digit:

1 presented to TSG for information;

2 presented to TSG for approval;

3 Indicates TSG approved document under change control.

y the second digit is incremented for all changes of substance, i.e. technical enhancements, corrections,

updates, etc.

z the third digit is incremented when editorial only changes have been incorporated in the specification.


6/53


1 Scope

This specification describes the documents being produced by the 3GPP TSG RAN WG1and first complete versions

expected to be available by end of 1999. This specification describes the characteristics of the Layer 1 multiplexing

and channel coding in the FDD mode of UTRA.

The 25.2series specifies Um point for the 3G mobile system. This series defines the minimum level of specifications

required for basic connections in terms of mutual connectivity and compatibility.

2 References

The following documents contain provisions which, through reference in this text, constitute provisions of the present

document.

[1] 3GPP RAN TS 25.201: Physical layer General Description

[2] 3GPP RAN TS 25.211: Transport channels and physical channels (FDD)

[3] 3GPP RAN TS 25.213: Spreading and modulation (FDD)

[4] 3GPP RAN TS 25.214: Physical layer procedures (FDD)

[5] 3GPP RAN TS 25.215: Measurements (FDD)

[6] 3GPP RAN TS 25.221: Transport channels and physical channels (TDD)

[7] 3GPP RAN TS 25.222: Multiplexing and channel coding (TDD)

[8] 3GPP RAN TS 25.223: Spreading and modulation (TDD)

[9] 3GPP RAN TS 25.224: Physical layer procedures (TDD)

[10] 3GPP RAN TS 25.225: Measurements (TDD)

[11] 3GPP RAN TS 25.302: Services Provided by the Physical Layer

3 Definitions, symbols and abbreviations

3.1 Definitions

For the purposes of the present document, the [following] terms and definitions [given in ... and the following] apply.

: .

TG: Transmission Gap is consecutive empty slots that have been obtained with a transmission time reduction

method. The transmission gap can be contained in one or two consecutive radio frames.

TGL: Transmission Gap Length is the number of consecutive empty slots that have been obtained with a

transmission time reduction method. 0 TGL 14


7/53


3.2 Symbols

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

x

round towards

, i.e. integer such thatx

x

< x+1x round towards -, i.e. integer such thatx-1 < x xx absolute value ofx

Nfirst The first slot in the TG.

Nlast The last slot in the TG.Nlast is either a slot in the same radio frame as Nfirstor a slot in the radio frame

immediately following the slot that containsNfirst.

Unless otherwise is explicitly stated when the symbol is used, the meaning of the following symbols is:

i TrCH number

j TFC number

k Bit number

l TF number

m Transport block numberni Radio frame number of TrCH i.

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.

PL Puncturing Limit for the uplink. Signalled from higher layers

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

Temporary variables, i.e. variables used in several (sub)sections with different meaning.

x, Xy, Y

z, Z

3.3 Abbreviations

For the purposes of the present document, the following abbreviations apply:

ACS Add, Compare, Select

ARQ Automatic Repeat RequestBCH Broadcast Channel

BER Bit Error Rate

BLER Block Error Rate

BS Base Station

CCPCH Common Control Physical Channel

CCTrCH Coded Composite Transport Channel

CRC Cyclic Redundancy Code

DCH Dedicated Channel

DL Downlink (Forward link)

DPCH Dedicated Physical Channel

DPCCH Dedicated Physical Control Channel

DPDCH Dedicated Physical Data ChannelDS-CDMA Direct-Sequence Code Division Multiple Access

DSCH Downlink Shared Channel

DTX Discontinuous Transmission


8/53


FACH Forward Access Channel

FDD Frequency Division Duplex

FER Frame Error Rate

GF Galois Field

MAC Medium Access Control

Mcps Mega Chip Per Second

MS Mobile StationOVSF Orthogonal Variable Spreading Factor (codes)

PCCC Parallel Concatenated Convolutional Code

PCH Paging Channel

PRACH Physical Random Access Channel

PhCH Physical Channel

QoS Quality of Service

RACH Random Access Channel

RX Receive

SCH Synchronisation Channel

SF Spreading Factor

SFN System Frame NumberSIR Signal-to-Interference Ratio

SNR Signal to Noise Ratio

TF Transport Format

TFC Transport Format Combination

TFCI Transport Format Combination Indicator

TPC Transmit Power Control

TrCH Transport Channel

TTI Transmission Time Interval

TX Transmit

UL Uplink (Reverse link)


9/53


4 Multiplexing, channel coding and interleaving

4.1 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, rate matching, interleaving and transport channels mapping onto/splitting from physical channels.

4.2 Transport-channel coding/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 4.2.1) Transport block concatenation and code block segmentation (see Section 4.2.2) Channel coding (see Section 4.2.3) Rate matching (see Section 4.2.7) Insertion of discontinuous transmission (DTX) indication bits (see Section 4.2.9) Interleaving (two steps, see Section 4.2.4 and 4.2.11) Radio frame segmentation (see Section 4.2.6) Multiplexing of transport channels (see Section 4.2.8) Physical channel segmentation (see Section 4.2.10) Mapping to physical channels (see Section 4.2.12)

The coding/multiplexing steps for uplink and downlink are shown in Figure 1 and Figure 2 respectively.


10/53


Rate

matching

Physical channel

segmentation

PhCH#1

PhCH#2

iiTiiidddd ,,,, 321 K

iiNiiieeee ,,,,

321 K

Radio frame segmentation

iiViiiffff ,,,, 321 K

Sssss ,,,, 321 K

pUpppuuuu ,,,, 321 K

pUpppvvvv ,,,, 321 K

2nd

interleaving

Physical channel mapping

iiEiiicccc ,,,, 321 K

iirKiririroooo ,,,, 321 K

Channel coding

iimAimimimaaaa ,,,, 321 K

Rate matching

iimBimimim bbbb ,,,, 321 KTrBk concatenation /

Code block segmentation

CRC attachment

iiTiiitttt ,,,, 321 K

Radio frame equalisation

1st interleaving

TrCH Multiplexing

Figure 1: Transport channel multiplexing structure for uplink


11/53


PhCH#1

PhCH#2

TrCH Multiplexing

iiGiiigggg ,,,, 321 K

)(321 ,,,, iiHFiiii hhhh K

iiViii

ffff ,,,,321

K

Sssss ,,,, 321 K

PUwwww ,,,, 321 K

pUpppvvvv ,,,, 321 K

iiEiiicccc ,,,, 321 K

iimBimimim bbbb ,,,, 321K

iimAimimimaaaa ,,,,

321 K

CRC attachment

Rate matchingRate

matching

Insertion of DTX indicationwith fixed positions

iiQiiiqqqq ,,,, 321 K

1st interleaving

Radio frame segmentation

Insertion of DTX indication

with flexible positions

pUpppuuuu ,,,,

321 K

2nd interleaving

Physical channel

segmentation

Physical channel mapping

iirKiririroooo ,,,, 321 K

TrBk concatenation /

Code block segmentation

Channel coding

Figure 2: Transport channel multiplexing structure for downlink


12/53


The single output data stream from the TrCH multiplexing is denoted Coded Composite Transport Channel

(CCTrCH). A CCTrCH can be mapped to one or several physical channels.

4.2.1 Error detection

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

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

4.2.1.1 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

gCRC12(D) = D12

+ D11

+ D3

+ D2

+ D + 1

gCRC8(D) = D8 + D7 + D4 + D3+ D + 1

Denote the bits in a transport block delivered to layer 1 byiimAimimim

aaaa ,,,, 321 K , and the parity bits by

iimLimimimpppp ,,,, 321 K .Ai is the length of a transport block of TrCH i, m is the transport block number, and Li is

24, 16, 12, 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

24

1

23

22

2

23

1

2422

2

23

1 imimimimimA

A

im

A

im pDpDpDpDaDaDa iii ++++++++ ++ KK

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

16

1

15

14

2

15

1

1614

2

15

1 imimimimimA

A

im

A

im pDpDpDpDaDaDa iii

++++++++

++KK

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

12

1

11

10

2

11

1

1210

2

11

1 imimimimimA

A

im

A


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

8

1

7

6

2

7

1

86

2

7

1 imimimimimA

A

im

A


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

4.2.1.2 Relation between input and output of the Cyclic Redundancy Check

The bits after CRC attachment are denoted byiimBimimim

bbbb ,,,,321

K , where Bi=Ai+Li. The relation between aimk

and bimkis:

imkimkab = k= 1, 2, 3, ,Ai

))(1( ii AkLimimkpb += k=Ai + 1,Ai + 2,Ai + 3, ,Ai +Li

4.2.2 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.


13/53


4.2.2.1 Concatenation of transport blocks

The bits input to the transport block concatenation are denoted byiimBimimim

bbbb ,,,, 321 K where i is the TrCH

number, m is the transport block number, andBi is the number of bits in each block (including CRC). The number of

transport blocks on TrCH i is denoted byMi. The bits after concatenation are denoted byiiXiii

xxxx ,,,, 321 K , where i

is the TrCH number andXi=MiBi. They are defined by the following relations:

kiik bx 1= k = 1, 2, , Bi

)(,2, iBkiikbx = k = Bi+ 1, Bi+ 2, , 2Bi

)2(,3, iBkiikbx = k = 2Bi+ 1, 2Bi+ 2, , 3Bi

K

))1((,, iii BMkMiikbx = k = (Mi - 1)Bi+ 1, (Mi - 1)Bi+ 2, , MiBi

4.2.2.2 Code block segmentation

Segmentation of the bit sequence from transport block concatenation is performed ifXi>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 ofCi, 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= 504

turbo coding:Z= 5114

no channel coding:Z = unlimited

The bits output from code block segmentation are denoted byiirKiririr

oooo ,,,, 321 K , where i is the TrCH 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

IfXiZ, then oi1k = xik, and Ki= Xi.IfXiZ, then

ikki xo =1 k = 1, 2, , Ki

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

)2(,3 iKkikixo += k = 1, 2, , Ki

K

))1(( iii KCkikiCxo += k = 1, 2, , Ki- Yi

0=kiCio k = (Ki- Yi) + 1, (Ki- Yi) + 2, , KI

4.2.3 Channel coding

Code blocks are delivered to the channel coding block. They are denoted byiirKiririr

oooo ,,,, 321 K , where i is the

TrCH number, ris 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 byiirYiririr

yyyy ,,,, 321 K . The encoded blocks are

serially multiplexed so that the block with lowest index ris output first from the channel coding block. The bits output

are denoted byiiEiii

cccc ,,,, 321 K , where i is the TrCH number andEi = CiYi. The output bits are defined by the

following relations:

kiikyc

1= k = 1, 2, , Y

i

),2 iYkikyc k = i 1, i 2 , , Yi

)2(,3, iYkiikyc = k = 2 i 1, 2Y+ , , 3 i


14/53


K

))1((,, iii YCkCiikyc = k = (Ci - 1)Yi+ 1, (Ci - 1)Yi+ 2, , CiYi

The relation between oirkandyirkand between Ki and Yi is dependent on the channel coding scheme.

The following channel coding schemes can be applied to TrCHs:

Convolutional coding Turbo coding No channel coding

The values ofYi in connection with each coding scheme:

Convolutional coding, rate: Yi= 2*Ki + 16; 1/3 rate: Yi= 3*Ki + 24

Turbo coding, 1/3 rate: Yi= 3*Ki + 12

No channel coding, Yi= Ki

Table 1: Error Correction Coding Parameters

Transport channel type Coding scheme Coding rate

BCH

PCH

FACH

RACH

1/2

CPCH

DCH

Convolutional code

1/3, 1/2 or no coding

CPCH

DCHTurbo Code 1/3 or no coding

4.2.3.1 Convolutional coding

4.2.3.1.1 Convolutional coder

Constraint length K=9. Coding rate 1/3 and . The configuration of the convolutional coder is presented in Figure 3. The output from the convolutional coder shall be done in the order output0, output1, output2, output0, output1,

,output2. (When coding rate is 1/2, output is done up to output 1).

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


15/53


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

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

D

D

D

D

D

D

D

D

D

D

D

D

D

D

D

D

+

+

+

+

input

input

output 0G0=557 OCT

add MOD.2

output 1G1=753 OCT

output 1G1=663 O C T

+ output 2G2=711 OCT

output 0G0=561 OCT

Figure 3: Convolutional Coder

4.2.3.2 Turbo coding

4.2.3.2.1 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.


16/53


X(t)

X(t)

Y(t)

Interleaver

X(t)

Y(t)

Figure 4: 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.

4.2.3.2.2 Trellis termination for Turbo coding

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.

The first three tail bits shall be used to terminate the first constituent encoder (upper switch of Figure 4 in lowerposition) 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 4 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).

4.2.3.2.3 Turbo code internal interleaver

Figure 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 4.2.3.2.3.1. After the mother interleaver generation, l-bits are pruned in order to adjust themother interleaver to the block length K. The definition ofl is shown in section 4.2.3.2.3.2.

Mother

interleaver

Source Coded sequence

K bit

(K + l) bit

(3K+T1+T

2) bit

RSC2

RSC1

Pruning

K bit

Figure 5: Overall 8 State PCCC Turbo Coding


17/53


4.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

Csae-2;

(i) find minimum primep such that,

0 =< (p+1)-K/R,

(ii) if (0 = q(j-1)

where g.c.d. is greatest common divider. And q0 = 1.

(A-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.

(A-5) Perform thej-th (j = 0, 1, 2, , R-1) intra-row permutation as:))1mod(]([)( = ppicic jj , i =0, 1,2,, (p-2)., and cj(p-1) = 0,

where cj(i) is the input bit position ofi-th output after the permutation ofj-th row.

B. If C =p+1

(B-1) Same as case A-1.




(B-5) Perform thej-th (j = 0,1, 2, , R-1) intra-row permutation as:

))1mod(]([)( = ppicic jj , i =0,1,2,, (p-2)., cj(p-1) = 0, and cj(p) =p,

(B-6) If (K = C x R) then exchange cR-1(p) with cR-1(0).



18/53


C. If C =p-1

(C-1) Same as case A-1.




(C-5) Perform thej-th (j = 0,1, 2, , R-1) intra-row permutation as:

))1mod(]([)( = ppicic jj -1, i =0,1,2,, (p-2),


Third Stage:

(1) 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 thej-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 Cmatrix.

Table 2: Table of prime p and associated primitive root

p go P go p go P go p go

17 3 59 2 103 5 157 5 211 2

19 2 61 2 107 2 163 2 223 3

23 5 67 2 109 6 167 5 227 2

29 2 71 7 113 3 173 2 229 6

31 3 73 5 127 3 179 2 233 337 2 79 3 131 2 181 2 239 7

41 6 83 2 137 3 191 19 241 7

43 3 89 3 139 2 193 5 251 6

47 5 97 5 149 2 197 2 257 3

53 2 101 2 151 6 199 3

4.2.3.2.3.2 Definition of 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 = RC K,where R is the row number and C is the column number defined in section 4.2.3.2.3.1.


19/53


4.2.4 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 section 4.2.6. Radio frame size equalisation is only performed in the UL

(DL rate matching output block length is always an integer multiple ofFi)

The input bit sequence to the radio frame size equalisation is denoted byiiEiii cccc ,,,, 321 K , where i is TrCH number

andEi the number of bits. The output bit sequence is denoted byiiTiii

tttt ,,,, 321 K , 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, ifEi < Ti

where

Ti = Fi * Ni and

( ) 11 += iii FEN is the number of bits per segment after size equalisation.

4.2.5 1st interleaving

The 1st

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

interleaver is denoted byiiXiii

xxxx ,,,, 321 K , where i is TrCH number andXi the number of bits (at this stageXi

is assumed and guaranteed to be an integer multiple of TTI). The output bit sequence is derived as follows:

(1) Select the number of columns CIfrom Table 3.

(2) Determine the number of rowsRIdefined as

RI=Xi/CI

(3) Write the input bit sequence into theRI CI rectangular matrix row by row starting with bit 1,ix in the first

column of the first row and ending with bit )(, IICRix in column CIof rowRI:

+++

+++

)(,

)2(,

)3)1((,)2)1((,)1)1((,

)3(,)2(,)1(,

321

II

I

I

IIIIII

III

CRi

Ci

iC

CRiCRiCRi

CiCiCi

iii

x

x

x

xxx

xxx

xxx

M

K

KMMM

K

K

(4) Perform the inter-column permutation based on the pattern {P1 (j)} (j=0,1, ..., C-1) shown in Table 3, where

P1(j) is the original column position of the j-th permuted column. After permutation of the columns, the bits

are denoted byyik:

+

+

++

++

)(,

)2)1((,

)1)1((,

)3(,)2(,

)22(,)2(,2

)12(,)1(,1

II

II

II

III

II

II

RCi

RCi

RCi

RiRiiR

RiRii

RiRii

y

y

y

yyy

yyy

yyy

M

K

KMMM

K

K

(5) Read the output bit sequence )(,321 ,,,, IIRCiiii yyyy K of the 1st interleaving column by column from the

inter-column permuted RI CI matrix. Bit 1,iy corresponds to the first row of the first column and bit

)(, IICRi

y corresponds to rowRIof column CI.


20/53


Table 3

TTI Number of columns CI Inter-column permutation patterns

10 ms 1 {0}

20 ms 2 {0,1}

40 ms 4 {0,2,1,3}

80 ms 8 {0,4,2,6,1,5,3,7}


interleaving in uplink

The bits input to the 1st

interleaving are denoted byiiTiii

tttt ,,,, 321 K , where i is the TrCH number andEi the number

of bits. Hence,xik = tikandXi = Ti.

The bits output from the 1st

interleaving are denoted byiiTiii

dddd ,,,, 321 K , and dik = yik.


interleaving in downlink

If fixed positions of the TrCHs in a radio frame is used then the bits input to the 1st

interleaving are denoted by

)(321 ,,,, iiHFiiii hhhh K , where i is the TrCH number. Hence,xik = hikandXi = FiHi.

If flexible positions of the TrCHs in a radio frame is used then the bits input to the 1st


iiGiiigggg ,,,, 321 K , where i is the TrCH number. Hence,xik = hikandXi = Gi.

The bits output from the 1st

interleaving are denoted byiiQiii

qqqq ,,,, 321 K , where i is the TrCH number and Qi is

the number of bits. Hence, qik = yik, Qi = FiHi if fixed positions are used, and Qi = Gi if flexible positions are used.

4.2.6 Radio frame segmentation

When the transmission time interval is longer than 10 ms, the input bit sequence is segmented and mapped ontoconsecutive radio frames. Following rate matching in the DL and radio frame size equalisation in the UL the input bit

sequence length is guaranteed to be an integer multiple ofFi.

The input bit sequence is denoted byiiXiii

xxxx ,,,, 321 K where i is the TrCH number andXi is the number bits. The

Fi output bit sequences per TTI are denoted byiiiii Ynininini

yyyy ,3,2,1, ,,,, K 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:

kni iy , = ( )( ) kYni iix +1, , ni = 1Fi,j = 1Yi

where

Yi= (X

i/F

i) is the number of bits per segment,

ikx is the kth bit of the input bit sequence and

kni iy , is the k

th 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.

4.2.6.1 Relation between input and output of the radio frame segmentation block inuplink

The input bit sequence to the radio frame segmentation is denoted byiiTiii

dddd ,,,, 321 K , where i is the TrCH

number and Ti the number of bits. Hence,xik = dikandXi = Ti.


21/53


The output bit sequence corresponding radio frame ni is denoted byiiNiii

eeee ,,,, 321 K , where i is the TrCH number

andNi is the number of bits. Hence, kniki iye ,, = andNi = Yi.

4.2.6.2 Relation between input and output of the radio frame segmentation block in

downlink

The bits input to the radio frame segmentation are denoted byiiQiii

qqqq ,,,, 321 K , where i is the TrCH number and

Qi the number of bits. Hence,xik = qikandXi = Qi.

The output bit sequence corresponding to radio frame ni is denoted byiiViii

ffff ,,,, 321 K , where i is the TrCH

number and Vi is the number of bits. Hence, kniki iyf ,, = and Vi = Yi.

4.2.7 Rate matching

Rate matching means that bits on a transport channel are repeated or punctured. Higher layers assign a rate-matching

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. In the downlink the

transmission is interrupted if the number of bits is lower than maximum. When the number of bits between different

transmission time intervals in uplink is changed, bits are repeated or punctured 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 4.2.7 and subsections:

Nij: For uplink: Number of bits in a radio frame before rate matching on TrCH i with transport format

combinationj .

For downlink : An intermediate calculation variable (not a integer but a multiple of 1/8).TTI

ilN : Number of bits in a transmission time interval before rate matching on TrCH i with transport format l. Used

in downlink only.

ijN : For uplink: If positive - number of bits that should be repeated in each radio frame on TrCH i with transport

format combinationj.

If negative - number of bits that should be punctured in each radio frame on TrCH i with

transport format combinationj.

For downlink : An intermediate calculation variable (not integer but a multiple of 1/8).

TTI

ilN : If positive - number of bits to be repeated in each transmission time interval on TrCH i with transport format

j.If negative - number of bits to be punctured in each transmission time interval on TrCH i with transport

formatj.

Used in downlink only.

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 avoid

multicode or to enable the use of a higher spreading factor. Signalled from higher layers.

Ndata,j: Total number of bits that are available for the CCTrCH in a radio frame with transport format combinationj.

I: Number of TrCHs in the CCTrCH.

Zij: Intermediate calculation variable.

Fi: Number of radio frames in the transmission time interval of TrCH i.

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


22/53


q: Average puncturing distance. Used in uplink only.

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). Used in uplink only.

S(ni): The shift of the puncturing pattern for radio frame ni. Used in uplink only.

TFi(j):

Transport format of TrCHi

for the transport format combinationj

.TFS(i) The set of transport format indexes l for TrCH i.

TFCS The set of transport format combination indexesj.

eini Initial value of variable e in the rate matching pattern determination algorithm of section 4.2.7.4.

eplus Increment of variable e in the rate matching pattern determination algorithm of section 4.2.7.4.

eminus Decrement of variable e in the rate matching pattern determination algorithm of section 4.2.7.4.

X: Systematic bit in section 4.2.3.2.1.

Y: 1st

parity bit (from the upper Turbo constituent encoder) in section 4.2.3.2.1.

Y: 2nd

parity bit (from the lower Turbo constituent encoder) in section 4.2.3.2.1.

Note: Time index t in section 4.2.3.2.1 is omitted for simplify the rate matching description.

The * (star) notation is used to replace an indexx when the indexed variableXx does not depend on the indexx. In the

left wing of an assignment the meaning is that X* = Y is equivalent to for allxdoXx = Y. In the right wing of an

assignment, the meaning is that Y=X* is equivalent to take anyxand doY = Xx

The following relations, defined for all TFCj, are used when calculating the rate matching parameters:

0,0 =jZ

=

=

= jdataI

m

mjm

i

m

mjm

ij NNRM

NRM

Z ,

1

1 for all i = 1 .. I (1)

ijjiijij NZZN = ,1 for all i = 1 .. I

4.2.7.1 Determination of rate matching parameters in uplink

4.2.7.1.1 Determination of SF and number of PhCHs needed

In uplink puncturing can be used to avoid multicode or to enable the use of a higher spreading factor when this isneeded because the UE does not support SF down to 4. The maximum amount of puncturing that can be applied is

signalled from higher layers and denoted by PL. The number of available bits in the radio frames for all possible

spreading factors is given in [2]. Denote these values byN256, N128, N64, N32, N16, N8, and N4, where the index refers to

the spreading factor. The possible values ofNdata then are { N256, N128, N64, N32, N16, N8, N4, 2N4, 3N4, 4N4, 5N4,

6N4}.Depending on the UE capabilities, the supported set of Ndata , denoted SET0, can be a subset of{ N256, N128, N64,

N32, N16, N8, N4, 2N4, 3N4, 4N4, 5N4, 6N4}.Ndata, jfor the transport format combination j is determined by executing the

following algorithm:

SET1 = {Ndata in SET0 such that { } jxI

x yIy

x

data NRM

RMN ,

11

,

min

=

is non negative }

If SET1 is not empty and the smallest element of SET1 requires just one PhCH thenNdata,j = min SET1

else


23/53


SET2 = {Ndata in SET0 such that { } jxI

x yIy

x

dataN

RM

RMPLN ,

11min

=

is non negative }

Sort SET2 in ascending order

Ndata = min SET2

WhileNdata is not the max of SET2 and the follower ofNdata requires no additional PhCH do

Ndata = follower ofNdata in SET2

End while

Ndata,j =Ndata

End if

4.2.7.1.2 Determination of parameters needed for calculating the rate matching pattern

The number of bits to be repeated or punctured, Nij, within one radio frame for each TrCH i is calculated withequation 1 forall possible transport format combinationsj and selected every radio frame.Ndata,j is given from section

4.2.7.1.1. In compressed mode jdataN , is replaced bycm

jdataN , in Equation 1.cm

jdataN , is given from the following

relation:

TGLjdata

cm

jdata NNN = ,, 2 , where

jdataN

TGL,2

15, ifNfirst+ TGL 15

jdata

firstN

N,2

15

15 , in first frame ifNfirst+ TGL > 15

jdata

firstNNTGL ,2

15)15( , in second frame ifNfirst+ TGL > 15

Nfirstand TGL are defined in Section 4.4.

IfNij = 0 then the output data of the rate matching is the same as the input data and the rate matching algorithm ofsection 4.2.7.4 does not need to be executed.

Otherwise, for determining eini , eplus, eminus, andN the following parameters are needed (regardless if the radio frame

is compressed or not):

For convolutional codes,

q=Nij/(Nij)

ifq is even

then q' =q gcd(q, Fi)/Fi -- where gcd (q, Fi) means greatest common divisor ofq and Fi

-- note that q'is not an integer, but a multiple of 1/8

else

q' = q

endif

for x = 0to Fi-1

S(IF(x*q'mod Fi)) = (x*q'div Fi)

end for

=TGLN


24/53


N = Ni,j

a = 2

For each radio frame, the rate-matching pattern is calculated with the algorithm in Section 4.2.7.4, where :

N = Ni,j., and

eini = (aS(ni)|N| + N) mod aN, if eini = 0 then eini = aN.

eplus = aN

eminus=a|N|

puncturing for N0, parameters for turbo codes are the same as parameterfor convolutional codes.

If puncturing is to be performed, parameters are as follows.

a=2 for Ysequence, and

a=1 for Y sequence.

N =

sequenceY'for2/

sequenceYfor2/

,

,

ji

ji

N

N

N = Ni,j/3 ,

q = N/|N|

if(q 2)

forx=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;

end for

else

ifq is even

then q'= q gcd(q,Fi)/Fi -- where gcd (q, Fi) means greatest common divisor ofq and Fi-- note that q'is not an integer, but a multiple of 1/8

else q = q

endif

forx=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


25/53


For each radio frame, the rate-matching pattern is calculated with the algorithm in section 4.2.7.4, where:

Nis as above,

eini = (aS(ni)|N| + N) mod a N, if eini =0 then eini = aN.

eplus = aN

eminus=aN

puncturing for N


26/53


parameter for convolutional codes. If puncturing is to be performed, parameters are as follows.

a=2 for Ysequence,

a=1 for Y sequence.

The X bits shall not be punctured.

N =

sequenceY'for2/

sequenceYfor2/

,*

,*

TTIi

TTIi

N

N

( ) 3/maxTTI

iliTFSl

maxNN

=

For each transmission time interval of TrCH i with TF l, the rate-matching pattern is calculated with the algorithm in

Section 4.2.7.4. The following parameters are used as input:

3/TTIilNN=

maxiniNe =

maxplus Nae =

Nae us =min

Puncturing if 0


27/53


TTI

li

i

TTI

lii

i

TTI

li NF

NRFFN ,

,

,

=

The second phase is defined by the following algorithm :

for all j in TFCS do -- for all TFC

( ) ( )=

=

+=

Ii

i i

TTI

jTFi

TTI

jTFi

F

NND ii

1

,,-- CCTrCH bit rate (bits per 10ms) for TFC l

if,*dataND > then

for i = 1 toIdo -- for all TrCH

jii NFN ,= -- jiN, is derived from jiN, by the formula given at section 4.2.7

if ( ) NNTTI

jTFi i> , then

( ) NNTTI

jTFi i= ,

end-if

end-forend-if

end-for

Note : the order in which the transport format combinations are checked does not change the final result.

If 0, =TTI

liN then, for TrCH i at TF l, the output data of the rate matching is the same as the input data and the rate

matching algorithm of section 4.2.7.4 does not need to be executed.

Otherwise, for determining eini , eplus, eminus, andN the following parameters are needed:

For convolutional codes,

TTI

ilNN =

a=2



TTI

ilNN=

Neini =

Naeplus =

Nae us =minpuncturing for 0 TTIilN , parameters for turbo codes are the same asparameter for convolutional codes. If puncturing is to be performed, parameters are as follows.

a=2 for Ysequence,

a=1 for Y sequence.

Xbits shall not be punctured.

N =

sequenceY'for2

sequenceYfor2

/N

/NTTIil

TTIil


28/53




N = 3/NTTIil ,eini = N,

Naeplus =Nae us =min

puncturing for 0


29/53


In addition, each radio frame of a TrCH starts with different initial parity type. Table 5 shows the initial parity type of

each radio frame of a TrCH with TTI = {10, 20, 40, 80} msec.

Table 5: Initial parity type of radio frames of TrCH in uplink

Radio frame indexes (ni)TTI

(msec) 0 1 2 3 4 5 6 7

10 X NA NA NA NA NA NA NA

20 X Y NA NA NA NA NA NA

40 X Y Y X NA NA NA NA

80 X Y Y X Y Y X Y

Table 4 and Table 5 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 alternation

pattern specified in Table 4 and Table 5 according to the TTI and ni of a TrCH.

Rate matching puncturing for Turbo codes in downlink is applied separately to Y and Ys sequences. No puncturing is

applied to X sequence. Therefore, it is necessary to separate X, Y, and Y sequences before rate matching is applied.

For downlink, output bit sequence pattern from Turbo encoder is always X, Y, Y, X, Y, Y, . Therefore, bit

separation is achieved with the alternative selection of bits from Turbo encoder.

4.2.7.4 Rate matching pattern determination

Denote the bits before rate matching by:

iNiiixxxx ,,,, 321 K , where i is the TrCH number andNis the parameter given in section 4.2.7.2.

The rate matching rule is as follows:

if puncturing is to be performed

e = eini -- initial error between current and desired puncturing ratio

m = 1 -- index of current bit

do while m


30/53


do while m


31/53


4.2.9 Insertion of discontinuous transmission (DTX) indication bits

In the downlink, DTX is used to fill up the radio frame with bits. The insertion point of DTX indication bits depends

on whether fixed or flexible positions of the TrCHs in the radio frame are used. It is up to the UTRAN to decide for

each CCTrCH whether fixed or flexible positions are used during the connection. DTX indication bits only indicate

when the transmission should be turned off, they are not transmitted.

4.2.9.1 Insertion of DTX indication bits with fixed positions

This step of inserting DTX indication bits is used only if the positions of the TrCHs in the radio frame are fixed. With

fixed position scheme a fixed number of bits is reserved for each TrCH in the radio frame.

The bits from rate matching are denoted byiiGiii

gggg ,,,, 321 K , where Gi is the number of bits in one TTI of TrCH

i. Denote the number of bits reserved for one radio frame of TrCH i byHi, i.e. the maximum number of bits in a radio

frame for any transport format of TrCH i. The number of radio frames in a TTI of TrCH i is denoted by Fi. The bits

output from the DTX insertion are denoted by )(321 ,,,, iiHFiiii hhhh K . Note that these bits are three valued. They are

defined by the following relations:

ikik gh = k = 1, 2, 3, , Gi

=ikh k = Gi+1, Gi+2, Gi+3, , FiHiwhere DTX indication bits are denoted by . Here gik{0, 1}and {0, 1}.

4.2.9.2 Insertion of DTX indication bits with flexible positions

Note: Below, it is assumed that all physical channels belonging to the same CCTrCH use the same SF. Hence,

Up=U=constant.

This step of inserting DTX indication bits is used only if the positions of the TrCHs in the radio frame are flexible.

The DTX indication bits shall be placed at the end of the radio frame. Note that the DTX will be distributed over all

slots after 2nd interleaving.

The bits input to the DTX insertion block are denoted byS

ssss ,,,, 321 K ,where S is the number of bits from TrCH

multiplexing. The number of PhCHs is denoted by P and the number of bits in one radio frame, including DTX

indication bits, for each PhCH by U.

The bits output from the DTX insertion block are denoted by )(321 ,,,, PUwwww K . Note that these bits are

threevalued. They are defined by the following relations:

kksw = k = 1, 2, 3, , S

=k

w k = S+1, S+2, S+3, , PU

where DTX indication bits are denoted by .. Here sk{0,1}and {0,1}.

4.2.10 Physical channel segmentation

Note: Below, it is assumed that all physical channels belonging to the same CCTrCH use the same SF. Hence,

Up=U=constant.

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 byY

xxxx ,,,, 321 K , where Yis 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 pUppp uuuu ,,,, 321 K , wherep is PhCH number and Uis

the number of bits in one radio frame for each PhCH, i.e.P

YU= . The relation betweenxkand upk is given below.

Bits on first PhCH after physical channel segmentation:


32/53


kk xu =1 k = 1, 2 , , U

Bits on second PhCH after physical channel segmentation:

)(2 Ukk xu += k = 1, 2 , , U

Bits on the Pth PhCH after physical channel segmentation:

))1(( UPkPk xu += k = 1, 2 , , U

4.2.10.1 Relation between input and output of the physical segmentation block in uplink

The bits input to the physical segmentation are denoted by Sssss ,,,, 321 K . Hence,xk = skand Y = S.

4.2.10.2 Relation between input and output of the physical segmentation block indownlink

If fixed positions of the TrCHs in a radio frame are used then the bits input to the physical segmentation are denoted

by Sssss ,,,, 321 K . Hence,xk = skand Y = S.

If flexible positions of the TrCHs in a radio frame are used then the bits input to the physical segmentation are denoted

by )(321 ,,,, PUwwww K . Hence,xk = wkand Y = PU.

4.2.11 2nd interleaving

The 2nd interleaving is a block interleaver with inter-column permutations. The bits input to the 2nd interleaver are

denoted pUppp uuuu ,,,, 321 K , wherep is PhCH number and Uis the number of bits in one radio frame for one

PhCH.

(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 rowsR2 by finding minimum integerR2such that

U R2C2.

(3) The bits input to the 2nd interleaving are written into theR2 C2 rectangular matrix row by row.

+++ )30(,

60

30

)330)1((,)230)1((,)130)1((,

333231

321

2222 Rp

p

p

RpRpRp

ppp

ppp

u

u

u

uuu

uuu

uuu

M

K

KMMM

K

K

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

bits are denoted byypk.

+

+

++

++

)30(,

)229(,

)129(,

)3(,)2(,

)22(,)2(,2

)12(,)1(,1

2

2

2

222

22

22

Rp

Rp

Rp

RpRppR

RpRpp

RpRpp

y

y

y

yyy

yyy

yyy

M

K

KMMM

K

K

(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. bitsypk

that corresponds to bits upkwith k>Uare removed from the output. The bits after 2nd



33/53


pUpp vvv ,,, 21 K , where vp1 corresponds to the bitypkwith smallest index kafter pruning, vp2 to the bitypkwith

second smallest index kafter pruning, and so on.

Table 6

Number of column C2 Inter-column permutation pattern

30{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}

4.2.12 Physical channel mapping

The PhCH for both uplink and downlink is defined in [2]. The bits input to the physical channel mapping are denoted

by pUpp vvv ,,, 21 K , wherep is the PhCH number and Uis the number of bits in one radio frame for one PhCH. The

bits vpkare mapped to the PhCHs so that the bits for each PhCH are transmitted over the air in ascending order withrespect to k.

In compressed mode, no bits are mapped to certain slots of the PhCH(s). IfNfirst+ TGL 15, no bits are mapped toslotsNfirst toNlast. IfNfirst+ TGL > 15, i.e. the transmission gap spans two consecutive radio frames, the mapping is as

follows:

In the first radio frame, no bits are mapped to slotsNfirst, Nfirst+1,Nfirst+2, , 14. In the second radio frame, no bits are mapped to the slots 0, 1, 2, ,Nlast.TGL, Nfirst, andNlastare defined in Section 4.4.

4.2.12.1 Uplink

In uplink, the PhCHs used during a radio frame are either completely filled with bits that are transmitted over the air

or not used at all. The only exception is when the UE is in compressed mode. The transmission can then be turned offduring consecutive slots of the radio frame.

4.2.12.2 Downlink

In downlink, the PhCHs do not need to be completely filled with bits that are transmitted over the air. Bits vpk{0, 1}are not transmitted.

The following rules should be used for the selection of fixed or flexible positions of the TrCHs in the radio frame:

For TrCHs not relying on TFCI for transport format detection (blind transport format detection), the positionsof the transport channels within the radio frame should be fixed. In a limited number of cases, where there

are a small number of transport format combinations, it is possible to allow flexible positions.

For TrCHs relying on TFCI for transport format detection, higher layer signal whether the positions of thetransport channels should be fixed or flexible.

4.2.13 Restrictions on different types of CCTrCHs

Restrictions on the different types of CCTrCHs are described in general terms in TS 25.302[11]. In this section those

restrictions are given with layer 1 notation.

4.2.13.1 Uplink Dedicated channel (DCH)

The maximum value of the number of TrCHsIin a CCTrCH, the maximum value of the number of transport blocksMi on each transport channel, and the maximum value of the number of DPDCHs P are given from the UE capability

class.


34/53


4.2.13.2 Random Access Channel (RACH)

There can only be one TrCH in each RACH CCTrCH, i.e.I=1, sk= f1kand S = V1. The maximum value of the number of transport blocksM1 on the transport channel is given from the UE

capability class.

The transmission time interval is always 10 ms, i.e. e1k= c1kandN1 =E1.

At initial RACH transmission the rate matching attribute has a predefined value.

Only one PRACH is used, i.e. P=1, u1k= sk, and U= S.

4.2.13.3 Common Packet Channel (CPCH)

The maximum value of the number of TrCHsIin a CCTrCH, the maximum value of the number of transportblocksMi on each transport channel, and the maximum value of the number of DPDCHs P are given from the UE

capability class.

Note: Only the data part of the CPCH can be mapped on multiple physical channels (this note is taken from TS

25.302).

4.2.13.4 Downlink Dedicated Channel (DCH)The maximum value of the number of TrCHsIin a CCTrCH, the maximum value of the number of transport blocks

Mi on each transport channel, and the maximum value of the number of DPDCHs P are given from the UE capability

class.

4.2.13.5 Downlink Shared Channel (DSCH) associated with a DCH

The spreading factor is indicated with the TFCI or with higher layer signalling on DCH.

There can only be one TrCH in each DSCH CCTrCH, i.e.I=1, sk= f1kand S = V1. The maximum value of the number of transport blocksM1 on the transport channel and the maximum value of the

number of PDSCHs P are given from the UE capability class.

4.2.13.6 Broadcast channel (BCH)

There can only be one TrCH in the BCH CCTrCH, i.e.I=1, sk= f1k, and S = V1. There can only be one transport block in each transmission time interval, i.e.M1 = 1. All transport format attributes have predefined values. Only one primary CCPCH is used, i.e. P=1.

4.2.13.7 Forward access and paging channels (FACH and PCH)

The maximum value of the number of TrCHsIin a CCTrCH and the maximum value of the number of transportblocksMi on each transport channel are given from the UE capability class.

The transmission time interval for TrCHs of PCH type is always 10 ms. Only one secondary CCPCH is used per CCTrCH, i.e. P=1.

4.2.14 Multiplexing of different transport channels into one CCTrCH, andmapping of one CCTrCH onto physical channels

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 transportblocks arriving from higher layers on different transport channels of potentially different transmission time

intervals shall have aligned transmission time instants as shown in Figure 8.


35/53


10 ms

20 ms

40 ms

80 ms

0 ms 10 ms 20 ms 30 ms 40 ms 50 ms 60 ms 70 ms 80 ms 90 ms100 ms 110 ms 120 ms 130 ms 140 ms 150 ms160 ms

Possible transmission time instantsTransmission-

time intervals

: Allowed transmission time instants

Figure 8: Possible transmission time instants regarding CCTrCH

2) Only transport channels with the same active set can be mapped onto the same CCTrCH.

3) Different CCTrCHs cannot be mapped onto the same PhCH.

4) One CCTrCH shall be mapped onto one or several PhCHs. These physical channels shall all have the same SF.

5) Dedicated Transport channels and common transport channels cannot be multiplexed into the same CCTrCH

6) For the common transport channels, only the FACH and PCH may belong to the same CCTrCH

There are hence two types of CCTrCH

1) CCTrCH of dedicated type, corresponding to the result of coding and multiplexing of one or several DCHs.

2) CCTrCH of common type, corresponding to the result of the coding and multiplexing of a common channel,RACH in the uplink, DSCH ,BCH, or FACH/PCH for the downlink.

4.2.14.1 Allowed CCTrCH combinations for one UE

4.2.14.1.1 Allowed CCTrCH combinations on the uplink

A maximum of one CCTrCH is allowed for one UE on the uplink. It can be either

1) one CCTrCH of dedicated type

2) one CCTrCH of common type

4.2.14.1.2 Allowed CCTrCH combinations on the downlink

The following CCTrCH combinations for one UE are allowed :

x CCTrCH of dedicated type + y CCTrCH of common type

The allowed combination of CCTrCHs of dedicated and common type are FFS.

Note 1 : There is only one DPCCH in the uplink, hence one TPC bits flow on the uplink to control possibly the

different DPDCHs on the downlink, part of the same or several CCTrCHs.

Note 2 : There is only one DPCCH in the downlink, even with multiple CCTrCHs. With multiple CCTrCHs, the

DPCCH is transmitted on one of the physical channels of that CCTrCH which has the smallest SF among the multiple

CCTrCHs. Thus there is only one TPC command flow and only one TFCI word in downlink even with multiple

CCTrCHs.

4.2.15 System Frame Number (SFN)

SFN indicates super frame synchronisation. It is broadcasted in BCH. (See TS 25.211[2])

SFN is multiplexed with a BCH transport block (see Figure 9). SFN is applied CRC calculation and FEC with BCH transport block.

SFN BCH trans ort block

MSB LSB MSB LSB


36/53


Figure 9: SFN multiplexing

4.3 Transport format detection

Transport format detection can be performed both with and without Tansport Format Combination Indicator (TFCI).

If a TFCI is transmitted, the receiver detects the transport format combination from the TFCI. When no TFCI istransmitted, so called blind transport format detection is used, i.e. the receiver side detects the transport formatcombination using some information, e.g. received power ratio of DPDCH to DPCCH, CRC check results.

For uplink, the blind transport format detection is an operator option. For downlink, the blind transport formatdetection can be applied with convolutional coding, the maximum number of different transport formats andmaximum data rates allowed shall be specified.

4.3.1 Blind transport format detection

Examples of blind transport format detection methods are given in Annex A.

4.3.2 Explicit transport format detection based on TFCIThe Transport Format Combination Indicator (TFCI) informs the receiver of the transport format combination of theCCTrCHs. As soon as the TFCI is detected, the transport format combination, and hence the individual transportchannels' transport formats are known, and decoding of the transport channels can be performed.

4.3.3 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. For improved

TFCI detection reliability, in downlink, repetition is used by increasing the number of TFCI bits within a slot.

The TFCI bits are encoded using (30, 10) punctured sub-code of the second order Reed-Muller code. The coding

procedure is as shown in Figure 10.

TFCI (1-10 bits)

(32,10) sub-code of

the second order

Reed Muller code

Puncture to

(30,10) codeTFCI code word

Figure 10: Channel coding of TFCI bits

If the TFCI consist of less than 10 bits, it is padded with zeros to 10 bits, by setting the most significant bits to zero.

The receiver can use the information that not all 10 bits are used for the TFCI, thereby reducing the error rate in the

TFCI decoder. The length of the TFCI code word is 30 bits. Thus there are 2 bits of (encoded) TFCI in every slot of

the radio frame.

Firstly, TFCI is encoded by the (32,10) sub-code of second order Reed-Muller code. The code words of the (32,10)

sub-code of second order Reed-Muller code are linear combination of 10 basis sequences: all 1s, 5 OVSF codes (C 32,1 ,

C32,2 , C32,4 , C32,8 , C32,16 ), and 4 masks (Mask1, Mask2, Mask3, Mask4). The 4 mask sequences are as following

Table 7.

Table 7: Mask sequences

Mask 1 00101000011000111111000001110111

Mask 2 00000001110011010110110111000111

Mask 3 00001010111110010001101100101011

Mask 4 00011100001101110010111101010001

For information bits a0 , a1 , a2 , a3 , a4 , a5 , a6 , a7 , a8 , a9 (a0 is LSB and a9 is MSB), the encoder structure is as

following Figure 11.


37/53


a0

a1

a2

a3

a4

a5

a6

a7

a8

a9

All 1's

C32,1

C32,2

C32,4

C32,8C

32,16

Mask 2

Mask 3

Mask 4

Mask 1

( 32, 6) Bi - or t hogonal Code

Figure 11: Encoder structure for (32,10) sub-code of second order Reed-Muller code

Then, the code words of the (32,10) sub-code of second order Reed-Muller code are punctured into length 30 by

puncturing 1st and 17th bits. The remaining bits are denoted by bk, k= 0, 1, 2, , 29 (k= 29 corresponds to the MSB

bit).

In downlink, when the SF is lower then 128 the encoded and punctured TFCI code words are repeated four times

yielding 8 encoded TFCI bits per slot. Mapping of repeated bits to slots is explained in section 4.3.5.

4.3.4 Operation of Transport-format-combination indicator (TFCI) in SplitMode

In the case of DCH in Split Mode, the UTRAN shall operate with as follows:

If one of the links is associated with a DSCH, the TFCI code word may be split in such a way that the code wordrelevant for TFCI activity indication is not transmitted from every cell. The use of such a functionality shall beindicated by higher layer signalling.

TFCI information is encoded by biorthogonal (16, 5) block code. The code words of the biorthogonal (16, 5) code are

from two mutually biorthogonal sets, { }15,161,160,16 ,...,,16 CCCSC = and its binary complement,{ }

15,161,160,16 ,...,,16 CCCSC = . Code words of set 16CS are from the level 16 of the code three of OVSF codes defined in

document TS 25.213. The mapping of information bits to code words is shown in the Table 8.


38/53


Table 8: Mapping of information bits to code words for biorthogonal (16, 5) code

Information bits Code word

00000 0,16C

00001 0,16C

00010 1,16C

... ...

11101 14,16C

11110 15,16C

11111 15,16C

Biorthogonal code words, iC ,16 and iC ,16 , are then punctured into length 15 by puncturing the 1st bit. The bits in the

code words are denoted by kjb , , where subscriptj indicates the code word and subscript kindicates bit position in the

code word (k=14 corresponds to the MSB bit).

4.3.5 Mapping of TFCI words

4.3.5.1 Mapping of TFCI word

As only one code word for TFCI is needed no channel interleaving for the encoded bits are done. Instead, the bits of

the code word are directly mapped to the slots of the radio frame as depicted in the Figure 12. Within a slot the more

significant bit is transmitted before the less significant bit.

Slot 0 Slot 1 Slot 14

29 28 27 26 1 0

MSB LSB

Radio frame 10 ms

TFCI codeword

Figure 12: Mapping of TFCI code words to the slots of the radio frame

For downlink physical channels whose SF is lower than 128, bits of the TFCI code words are repeated and mapped to

slots as shown in the Table 9. Code word bits are denoted asl

kb , where subscript k, indicates bit position in the code

word (k=29 is the MSB bit) and superscript l indicates bit repetition. In each slot transmission order of the bits is from

left to right in the Table 9.


39/53


Table 9: Mapping order of repetition encoded TFCI code word bits into slots.

Slot TFCI code word bits

0 129b

2

29b3

29b4

29b1

28b2

28b3

28b4

28b

1 127b

2

27b3

27b4

27b1

26b2

26b3

26b4

26b

2 125b

225b

325b

425b

124b

224b

324b

424b

3 123b

2

23b3

23b4

23b1

22b2

22b3

22b4

22b

4 121b

2

21b3

21b4

21b1

20b2

20b3

20b4

20b

5 119b

2

19b3

19b4

19b1

18b2

18b3

18b4

18b

6 117b

2

17b3

17b4

17b1

16b2

16b3

16b4

16b

7 115b

2

15b3

15b4

15b1

14b2

14b3

14b4

14b

8 113b

2

13b3

13b4

13b1

12b2

12b3

12b4

12b

9 1

11

b2

11

b3

11

b4

11

b1

10

b2

10

b3

10

b4

10

b

10 19b

2

9b3

9b4

9b1

8b2

8b3

8b4

8b

11 17

b 27

b 37

b 47

b 16

b 26

b 36

b 46

b

12 15b

2

5b3

5b4

5b1

4b2

4b3

4b4

4b

13 13b

2

3b3

3b4

3b1

2b2

2b3

2b4

2b

14 11

b 21

b 31

b 41

b 10b2

0b3

0b4

0b

4.3.5.2 Mapping of TFCI word in Split Mode

After channel encoding of the two 5 bit TFCI words there are two code words of length 15 bits. They are mapped to

DPCCH as shown in the Figure 13. Note that kb ,1 and kb ,2 denote the bit k of code word 1 and code word 2,

respectively.

LSBMSBWrite

Readb1,14 b1,13 b1,0

b2,14 b2,13 b2,0

b2,14b1,14

Slot 0

b2,13b1,13

Slot 1

b2,0b1,0

Slot 14DPCCH

Figure 13: Mapping of TFCI code words to the slots of the radio frame in Split Mode

For downlink physical channels whose SF is lower than 128, bits of the extended TFCI code words are repeated and

mapped to slots as shown in the Table 10. Code word bits are denoted asl

kjb , , where subscript j indicates the code

word, subscript k indicates bit position in the code word (k=14 is the MSB bit) and superscript l indicates bit

repetition. In each slot transmission order of the bits is from left to right in the Table 10.


40/53


Table 10: Mapping order of repetition encoded TFCI code word bits to slots in Split Mode

Slot TFCI code word bits in split mode

0 114,1b

2

14,1b3

14,1b4

14,1b1

14,2b2

14,2b3

14,2b4

14,2b

1 113,1b

2

13,1b3

13,1b4

13,1b1

13,2b2

13,2b3

13,2b4

13,2b

2 112,1b

2

12,1b3

12,1b4

12,1b1

12,2b2

12,2b3

12,2b4

12,2b

3 111,1b

2

11,1b3

11,1b4

11,1b1

11,2b2

11,2b3

11,2b4

11,2b

4 110,1b

2

10,1b3

10,1b4

10,1b1

10,2b2

10,2b3

10,2b4

10,2b

5 19,1b

2

9,1b3

9,1b4

9,1b1

9,2b2

9,2b3

9,2b4

9,2b

6 18,1b

2

8,1b3

8,1b4

8,1b1

8,2b2

8,2b3

8,2b4

8,2b

7 17,1b

2

7,1b3

7,1b4

7,1b1

7,2b2

7,2b3

7,2b4

7,2b

8 16,1b

2

6,1b3

6,1b4

6,1b1

6,2b2

6,2b3

6,2b4

6,2b

9 15,1b 25,1b 35,1b 45,1b 1 5,2b 2 5,2b 3 5,2b 4 5,2b10 1

4,1b2

4,1b3

4,1b4

4,1b1

4,2b2

4,2b3

4,2b4

4,2b

11 13,1b

2

3,1b3

3,1b4

3,1b1

3,2b2

3,2b3

3,2b4

3,2b

12 12,1b

2

2,1b3

2,1b4

2,1b1

2,2b2

2,2b3

2,2b4

2,2b

13 11,1b

2

1,1b3

1,1b4

1,1b1

1,2b2

1,2b3

1,2b4

1,2b

14 10,1b

2

0,1b3

0,1b4

0,1b1

0,2b2

0,2b3

0,2b4

0,2b

4.3.5.3 Mapping of TFCI in compressed mode

The mapping of the TFCI bits in compressed mode is dependent on the transmission time reduction method. Denote

the TFCI bits by c0, c1, c2, c3, c4, , cC, where:

kk bc = , C= 29, when there are 2 TFCI bit in each slot.

1

14119

3

15

4

14

1

03

2

02

3

01

4

00 ,,,,,,, bcbcbcbcbcbcbc ======= K , when there are 8 TFCI bits in each slot.

14,1291,141,230,110,20 ,,,,, bcbcbcbcbc ===== K , in split mode when there are 2 TFCI bits in each slot.

1

14,1119

3

0,15

4

0,14

1

0,23

2

0,22

3

0,21

4

0,20 ,,,,,,, bcbcbcbcbcbcbc ======= K , in split mode when there are 8

TFCI bits in each slot.

The TFCI mapping for each transmission method is given in the sections below.

4.3.5.3.1 Compressed mode method A

For compressed mode by method A, all the TFCI bits are mapped to the remaining slots. The number of bits per slot in

uncompressed mode is denoted byZandZ= (C+ 1)/15. The mapping to slots for different TGLs are defined below.

4.3.5.3.1.1 TGL of 3 slots

Slot number 3 + 2x contain bits)1

2

3()

2

5(1)

2

5()

2

5(

,,, ZxZCxZCxZC

ccc K , wherex = 0, 1, 2, 3, 4, 5

Slot number 4 + 2x contain bits)1()

25(

231)

25(

23)

25(

23 ,,, ZxZZCxZZCxZZC ccc

K , wherex = 0, 1, 2, 3, 4, 5

The case when C= 29 is illustrated in Figure 14.


41/53


TFCI code word c29 c28 c27 c26 c2 c1 c0c25 c24 c3c4c23 c22

slot 0

Radio frame 10 ms

slot 1 slot 2 slot 3 slot 4 slot 5 slot 6 slot 7 slot 8 slot 9 slot 10slot 11slot 12slot 13slot 14

Figure 14: Mapping of TFCI code with TGL of 3 slots.

4.3.5.3.1.2 TGL of 4 slots

Slot number 4 does not contain any TFCI bits.

Slot number 5 +x contain bits)1

2

3()

2

3(1)

2

3()

2

3(

,,, ZxZCxZCxZC

ccc K , wherex = 0, 1, 2, 3, , 9

The case when C= 29 is illustrated in Figure 15.

TFCI code word c29 c28 c27 c26 c2 c1 c0c25 c24 c3c4c23 c22

slot 0

Radio frame 10 ms

slot 1 slot 2 slot 3 slot 4 slot 5 slot 6 slot 7 slot 8 slot 9 slot 10slot 11slot 12slot 13slot 14

c23 c5

Figure 15: Mapping of TFCI code with TGL of 4 slots.

4.3.5.3.2 Compressed mode method B

4.3.5.3.2.1 Uplink

For uplink compressed mode by method B the frame format is changed so that no TFCI bits are lost. The different

frame formats in compressed mode can not match the exact number of TFCI bits for all possible TGLs. Repetition of

the TFCI bits is therefore used.

Denote the number of bits available in the TFCI fields of one compressed radio frame by D, the repeated bits by dk,

and the number of bits in the TFCI field in a slot byNTFCI. LetE=30-1-(NfirstNTFCI)mod 30. IfNlast14, thenEcorresponds to the number of the first TFCI bit in the slot directly after the TG. The following relations then define the

repetition.

30mod))31((030mod)2(3330mod)1(3230mod31 ,,,, ==== DEEDEDED cdcdcdcd K


42/53


43/53


With frame structure of type A, BTS transmission is off from the beginning of TFCI field in slot Nfirst, until

chanel coding ts25

Documents