etsi multiplexing channel coding in FDD

etsi multiplexing channel coding in FDD - ETSI TS 125 212...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: ETSI TS 125 212 V3.2.0 (2000-03) Technical Specification Universal Mobile Telecommunications System (UMTS); Multiplexing and channel coding (FDD) (3G TS 25.212 version 3.2.0 Release 1999) 3G TS 25.212 version 3.2.0 Release 1999 1 ETSI TS 125 212 V3.2.0 (2000-03) Reference RTS/TSGR-0125212UR1 Keywords UMTS ETSI 650 Route des Lucioles F-06921 Sophia Antipolis Cedex - FRANCE Tel.: +33 4 92 94 42 00 Fax: +33 4 93 65 47 16 Siret N 348 623 562 00017 - NAF 742 C Association but non lucratif enregistre la Sous-Prfecture de Grasse (06) N 7803/88 Important notice Individual copies of the present document can be downloaded from: http://www.etsi.org The present document may be made available in more than one electronic version or in print. In any case of existing or perceived difference in contents between such versions, the reference version is the Portable Document Format (PDF). In case of dispute, the reference shall be the printing on ETSI printers of the PDF version kept on a specific network drive within ETSI Secretariat. Users of the present document should be aware that the document may be subject to revision or change of status. Information on the current status of this and other ETSI documents is available at http://www.etsi.org/tb/status/ If you find errors in the present document, send your comment to: editor@etsi.fr Copyright Notification No part may be reproduced except as authorized by written permission. The copyright and the foregoing restriction extend to reproduction in all media. European Telecommunications Standards Institute 2000. All rights reserved. ETSI 3G TS 25.212 version 3.2.0 Release 1999 2 ETSI TS 125 212 V3.2.0 (2000-03) Intellectual Property Rights IPRs essential or potentially essential to the present document may have been declared to ETSI. The information pertaining to these essential IPRs, if any, is publicly available for ETSI members and non-members, and can be found in SR 000 314: "Intellectual Property Rights (IPRs); Essential, or potentially Essential, IPRs notified to ETSI in respect of ETSI standards", which is available from the ETSI Secretariat. Latest updates are available on the ETSI Web server (http://www.etsi.org/ipr). Pursuant to the ETSI IPR Policy, no investigation, including IPR searches, has been carried out by ETSI. No guarantee can be given as to the existence of other IPRs not referenced in SR 000 314 (or the updates on the ETSI Web server) which are, or may be, or may become, essential to the present document. Foreword This Technical Specification (TS) has been produced by the ETSI 3rd Generation Partnership Project (3GPP). The present document may refer to technical specifications or reports using their 3GPP identities, UMTS identities or GSM identities. These should be interpreted as being references to the corresponding ETSI deliverables. The cross reference between GSM, UMTS, 3GPP and ETSI identities can be found under www.etsi.org/key . ETSI 3G TS 25.212 version 3.2.0 Release 1999 3 ETSI TS 125 212 V3.2.0 (2000-03) Contents Foreword ............................................................................................................................................................ 5 1 2 3 3.1 3.2 3.3 Scope........................................................................................................................................................ 6 References................................................................................................................................................ 6 Definitions, symbols and abbreviations................................................................................................... 6 Definitions ......................................................................................................................................................... 6 Symbols ............................................................................................................................................................. 7 Abbreviations..................................................................................................................................................... 7 4 Multiplexing, channel coding and interleaving........................................................................................ 8 4.1 General............................................................................................................................................................... 8 4.2 Transport-channel coding/multiplexing............................................................................................................. 8 4.2.1 Error detection............................................................................................................................................ 12 4.2.1.1 CRC Calculation................................................................................................................................... 12 4.2.1.1.1 Relation between input and output of the Cyclic Redundancy Check ............................................ 12 4.2.2 Transport block concatenation and code block segmentation .................................................................... 13 4.2.2.1 Concatenation of transport blocks ........................................................................................................ 13 4.2.2.2 Code block segmentation...................................................................................................................... 13 4.2.3 Channel coding........................................................................................................................................... 14 4.2.3.1 Convolutional coding ........................................................................................................................... 15 4.2.3.2 Turbo coding ........................................................................................................................................ 15 4.2.3.2.1 Turbo coder..................................................................................................................................... 15 4.2.3.2.2 Trellis termination for Turbo coder ................................................................................................ 16 4.2.3.2.3 Turbo code internal interleaver ....................................................................................................... 16 4.2.3.3 Concatenation of encoded blocks ......................................................................................................... 20 4.2.4 Radio frame size equalisation..................................................................................................................... 20 4.2.5 1st interleaving............................................................................................................................................ 20 4.2.5.1 Insertion of marked bits in the sequence to be input in first interleaver ............................................... 21 4.2.5.2 1st interleaver operation ........................................................................................................................ 21 4.2.5.3 Relation between input and output of 1st interleaving in uplink ........................................................... 22 4.2.5.4 Relation between input and output of 1st interleaving in downlink ...................................................... 22 4.2.6 Radio frame segmentation.......................................................................................................................... 23 4.2.6.1 Relation between input and output of the radio frame segmentation block in uplink........................... 23 4.2.6.2 Relation between input and output of the radio frame segmentation block in downlink...................... 23 4.2.7 Rate matching............................................................................................................................................. 23 4.2.7.1 Determination of rate matching parameters in uplink .......................................................................... 25 4.2.7.1.1 Determination of SF and number of PhCHs needed ....................................................................... 25 4.2.7.2 Determination of rate matching parameters in downlink...................................................................... 28 4.2.7.2.1 Determination of rate matching parameters for fixed positions of TrCHs...................................... 29 4.2.7.2.2 Determination of rate matching parameters for flexible positions of TrCHs.................................. 31 4.2.7.3 Bit separation and collection in uplink ................................................................................................. 33 4.2.7.3.1 Bit separation .................................................................................................................................. 35 4.2.7.3.2 Bit collection................................................................................................................................... 35 4.2.7.4 Bit separation and collection in downlink ............................................................................................ 36 4.2.7.4.1 Bit separation .................................................................................................................................. 37 4.2.7.4.2 Bit collection................................................................................................................................... 37 4.2.7.5 Rate matching pattern determination.................................................................................................... 38 4.2.8 TrCH multiplexing ..................................................................................................................................... 39 4.2.9 Insertion of discontinuous transmission (DTX) indication bits.................................................................. 39 4.2.9.1 1st insertion of DTX indication bits ...................................................................................................... 39 4.2.9.2 2nd insertion of DTX indication bits ..................................................................................................... 40 4.2.10 Physical channel segmentation................................................................................................................... 41 4.2.10.1 Relation between input and output of the physical segmentation block in uplink................................ 41 4.2.10.2 Relation between input and output of the physical segmentation block in downlink........................... 41 4.2.11 2nd interleaving ........................................................................................................................................... 41 4.2.12 Physical channel mapping.......................................................................................................................... 42 4.2.12.1 Uplink................................................................................................................................................... 42 ETSI 3G TS 25.212 version 3.2.0 Release 1999 4 ETSI TS 125 212 V3.2.0 (2000-03) 4.2.12.2 4.2.13 4.2.13.1 4.2.13.2 4.2.13.3 4.2.13.4 4.2.13.5 4.2.13.6 4.2.13.7 4.2.14 Downlink .............................................................................................................................................. 43 Restrictions on different types of CCTrCHs .............................................................................................. 43 Uplink Dedicated channel (DCH) ........................................................................................................ 43 Random Access Channel (RACH) ....................................................................................................... 43 Common Packet Channel (CPCH) ....................................................................................................... 44 Downlink Dedicated Channel (DCH)................................................................................................... 44 Downlink Shared Channel (DSCH) associated with a DCH ................................................................ 44 Broadcast channel (BCH) ..................................................................................................................... 44 Forward access and paging channels (FACH and PCH) ...................................................................... 44 Multiplexing of different transport channels into one CCTrCH, and mapping of one CCTrCH onto physical channels ....................................................................................................................................... 44 4.2.14.1 Allowed CCTrCH combinations for one UE........................................................................................ 45 4.2.14.1.1 Allowed CCTrCH combinations on the uplink............................................................................... 45 4.2.14.1.2 Allowed CCTrCH combinations on the downlink.......................................................................... 45 4.3 Transport format detection............................................................................................................................... 45 4.3.1 Blind transport format detection................................................................................................................. 46 4.3.2 Transport format detection based on TFCI ................................................................................................ 46 4.3.3 Coding of Transport-Format-Combination Indicator (TFCI)..................................................................... 46 4.3.4 Operation of Transport-Format-Combination Indicator (TFCI) in Split Mode.......................................... 47 4.3.5 Mapping of TFCI words............................................................................................................................. 48 4.3.5.1 Mapping of TFCI word in non compressed mode ................................................................................ 48 4.3.5.2 Mapping of TFCI in compressed mode ................................................................................................ 49 4.3.5.2.1 Uplink compressed mode................................................................................................................ 49 4.3.5.2.2 Downlink compressed mode........................................................................................................... 49 4.4 Compressed mode............................................................................................................................................ 50 4.4.1 Frame structure in the uplink...................................................................................................................... 50 4.4.2 Frame structure types in the downlink ....................................................................................................... 50 4.4.3 Transmission time reduction method ......................................................................................................... 51 4.4.3.1 Compressed mode by puncturing ......................................................................................................... 51 4.4.3.2 Compressed mode by reducing the spreading factor by 2 .................................................................... 51 4.4.3.3 Compressed mode by higher layer scheduling ..................................................................................... 51 4.4.4 Transmission gap position.......................................................................................................................... 51 4.4.5 Parameters for downlink compressed mode............................................................................................... 53 Annex A (informative): Blind transport format detection ......................................................................... 55 A.1 A.1.1 A.1.2 Blind transport format detection using fixed positions.......................................................................... 55 Blind transport format detection using received power ratio ........................................................................... 55 Blind transport format detection using CRC.................................................................................................... 55 A.2 Blind transport format detection with flexible positions ....................................................................... 56 Annex B (informative): Change history....................................................................................................... 58 ETSI 3G TS 25.212 version 3.2.0 Release 1999 5 ETSI TS 125 212 V3.2.0 (2000-03) Foreword This Technical Specification (TS) has been produced by the 3rd Generation Partnership Project (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 the present document, it will be re-released by the TSG with an identifying change of release date and an increase in version number as follows: Version x.y.z where: x the first digit: 1 presented to TSG for information; 2 presented to TSG for approval; 3 or greater 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 document. ETSI 3G TS 25.212 version 3.2.0 Release 1999 6 ETSI TS 125 212 V3.2.0 (2000-03) 1 Scope The present document describes the characteristics of the Layer 1 multiplexing and channel coding in the FDD mode of UTRA. 2 References References are either specific (identified by date of publication, edition number, version number, etc.) or non-specific. For a specific reference, subsequent revisions do not apply. For a non-specific reference, the latest version applies. [1] [2] [3] [4] [5] [6] [7] [8] [9] [10] [11] [12] 3G TS 25.201: "Physical layer General Description". 3G TS 25.211: "Physical channels and mapping of transport channels onto physical channels (FDD)". 3G TS 25.213: "Spreading and modulation (FDD)". 3G TS 25.214: "Physical layer procedures (FDD)". 3G TS 25.215: "Measurements (FDD)". 3G TS 25.221: "Physical channels and mapping of transport channels onto physical channels (TDD)". 3G TS 25.222: "Multiplexing and channel coding (TDD)". 3G TS 25.223: "Spreading and modulation (TDD)". 3G TS 25.224: "Physical layer procedures (TDD)". 3G TS 25.225: "Measurements (TDD)". 3G TS 25.302: "Services Provided by the Physical Layer". 3G TS 25.402: "Synchronisation in UTRAN, Stage 2". The following documents contain provisions which, through reference in this text, constitute provisions of the present document. 3 3.1 Definitions, symbols and abbreviations Definitions For the purposes of the present document, the following terms and definitions 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. The CFNs of the radio frames containing the first empty slot of the transmission gaps, the CFNs of the radio frames containing the last empty slot, the respective positions Nfirst and Nlast within these frames of the first and last empty slots of the transmission gaps, and the transmission gap lengths can be calculated with the compressed mode parameters described in [5]. ETSI 3G TS 25.212 version 3.2.0 Release 1999 7 ETSI TS 125 212 V3.2.0 (2000-03) TrCH number: Transport channel number represents a TrCH ID assigned to L1 by L2. Transport channels are multiplexed to the CCTrCH in the ascending order of these IDs. 3.2 x x x sgn(x) Nfirst Nlast Ntr Symbols 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 signum function, i.e. For the purposes of the present document, the following symbols apply: 1; x 0 sgn( x) = - 1; x < 0 The first slot in the TG. The last slot in the TG. Number of transmitted slots in a radio frame. Unless otherwise is explicitly stated when the symbol is used, the meaning of the following symbols is: i j k l m ni p r I Ci Fi Mi Ndata,j cm N data , j TrCH number TFC number Bit number TF number Transport block number Radio frame number of TrCH i. PhCH number Code block number Number of TrCHs in a CCTrCH. Number of code blocks in one TTI of TrCH i. Number of radio frames in one TTI of TrCH i. Number of transport blocks in one TTI of TrCH i. Number of data bits that are available for the CCTrCH in a radio frame with TFC j. Number of data bits that are available for the CCTrCH in a compressed radio frame with TFC j. Number of PhCHs used for one CCTrCH. Puncturing Limit for the uplink. Signalled from higher layers Rate Matching attribute for TrCH i. Signalled from higher layers. P PL RMi Temporary variables, i.e. variables used in several (sub)clauses with different meaning. x, X y, Y z, Z 3.3 ARQ BCH BER BLER BS CCPCH CCTrCH CFN CRC DCH DL DPCCH DPCH Abbreviations Automatic Repeat Request Broadcast Channel Bit Error Rate Block Error Rate Base Station Common Control Physical Channel Coded Composite Transport Channel Connection Frame Number Cyclic Redundancy Code Dedicated Channel Downlink (Forward link) Dedicated Physical Control Channel Dedicated Physical Channel For the purposes of the present document, the following abbreviations apply: ETSI 3G TS 25.212 version 3.2.0 Release 1999 8 ETSI TS 125 212 V3.2.0 (2000-03) DPDCH DS-CDMA DSCH DTX FACH FDD FER GF MAC Mcps MS OVSF PCCC PCH PhCH PRACH RACH RSC RX SCH SF SFN SIR SNR TF TFC TFCI TPC TrCH TTI TX UL Dedicated Physical Data Channel Direct-Sequence Code Division Multiple Access Downlink Shared Channel Discontinuous Transmission Forward Access Channel Frequency Division Duplex Frame Error Rate Galois Field Medium Access Control Mega Chip Per Second Mobile Station Orthogonal Variable Spreading Factor (codes) Parallel Concatenated Convolutional Code Paging Channel Physical Channel Physical Random Access Channel Random Access Channel Recursive Systematic Convolutional Coder Receive Synchronisation Channel Spreading Factor System Frame Number Signal-to-Interference Ratio Signal to Noise Ratio Transport Format Transport Format Combination Transport Format Combination Indicator Transmit Power Control Transport Channel Transmission Time Interval Transmit Uplink (Reverse link) 4 4.1 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, 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 subclause 4.2.1); transport block concatenation and code block segmentation (see subclause 4.2.2); channel coding (see subclause 4.2.3); rate matching (see subclause 4.2.7); insertion of discontinuous transmission (DTX) indication bits (see subclause 4.2.9); interleaving (two steps, see subclauses 4.2.4 and 4.2.11); ETSI 3G TS 25.212 version 3.2.0 Release 1999 9 ETSI TS 125 212 V3.2.0 (2000-03) - radio frame segmentation (see subclause 4.2.6); multiplexing of transport channels (see subclause 4.2.8); physical channel segmentation (see subclause 4.2.10); mapping to physical channels (see subclause 4.2.12). The coding/multiplexing steps for uplink and downlink are shown in figure 1 and figure 2 respectively. ETSI 3G TS 25.212 version 3.2.0 Release 1999 10 ETSI TS 125 212 V3.2.0 (2000-03) aim1 , aim 2 , aim3 ,, 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 1 interleaving st di1 , di 2 , di 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 CCTrCH Physical channel segmentation u p1 , u p 2 , u p 3 , , u pU 2 interleaving nd v p1 , v p 2 , v p 3 , , v pU Physical channel mapping Figure 1: Transport channel multiplexing structure for uplink PhCH#2 PhCH#1 ETSI 3G TS 25.212 version 3.2.0 Release 1999 11 ETSI TS 125 212 V3.2.0 (2000-03) aim1 , aim 2 , aim3 ,, aimAi CRC attachment bim1 , bim 2 , bim 3 , , bimBi TrBk concatenation / Code block segmentation oir1 , oir 2 , oir 3 , , oirK i Channel coding ci1 , ci 2 , ci 3 , , ciEi Rate matching Rate matching g i1 , g i 2 , g i 3 , , g iGi 1 insertion of DTX indication st hi1 , hi 2 , hi 3 , , hi ( Fi H i ) 1 interleaving st qi1 , qi 2 , qi 3 ,, qiQi Radio frame segmentation f i1 , f i 2 , f i 3 ,, f iVi TrCH Multiplexing s1 , s2 , s3 ,, sS 2 insertion of DTX indication nd w1 , w2 , w3 ,, w pR CCTrCH Physical channel segmentation u p1 , u p 2 , u p 3 ,, u pU 2 interleaving nd v p1 , v p 2 , v p 3 , , v pU Physical channel mapping PhCH#2 Figure 2: Transport channel multiplexing structure for downlink The single output data stream from the TrCH multiplexing, including DTX indication bits in downlink, is denoted Coded Composite Transport Channel (CCTrCH). A CCTrCH can be mapped to one or several physical channels. ETSI PhCH#1 3G TS 25.212 version 3.2.0 Release 1999 12 ETSI TS 125 212 V3.2.0 (2000-03) 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) = D + D7 + D4 + D3 + D + 1. 8 Denote the bits in a transport block delivered to layer 1 by p im 1 , p im 2 , p im 3 , , p imL i . 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: aim1 , a im 2 , aim 3 , , a imAi , and the parity bits by aim1 D Ai + 23 + aim 2 D Ai + 22 + + aimAi D 24 + pim1 D 23 + pim 2 D 22 + + pim 23 D 1 + pim 24 yields a remainder equal to 0 when divided by gCRC24(D), polynomial: aim1 D Ai +15 + aim 2 D Ai +14 + + aimAi D16 + pim1 D15 + pim 2 D14 + + pim15 D1 + pim16 yields a remainder equal to 0 when divided by gCRC16(D), polynomial: a im1 D Ai +11 + a im 2 D Ai +10 + + aimAi D 12 + p im1 D11 + p im 2 D 10 + + pim11 D 1 + pim12 yields a remainder equal to 0 when divided by gCRC12(D) and polynomial: aim1D Ai + 7 + aim 2 D Ai + 6 + + aimAi D8 + pim1 D 7 + pim 2 D 6 + + pim 7 D1 + pim8 yields a remainder equal to 0 when divided by gCRC8(D). If no transport blocks are input to the CRC calculation (Mi = 0), no CRC attachment shall be done. If transport blocks are input to the CRC calculation (Mi 0) and the size of a transport block is zero (Ai = 0), CRC shall be attached, i.e. all parity bits equal to zero. 4.2.1.1.1 Relation between input and output of the Cyclic Redundancy Check The bits after CRC attachment are denoted by bim1 , bim 2 , bim3 ,, 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 ETSI 3G TS 25.212 version 3.2.0 Release 1999 13 ETSI TS 125 212 V3.2.0 (2000-03) 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, the maximum size of a code block in question, then code block segmentation is performed after the concatenation of the transport blocks. The maximum size of the code blocks depends on whether convolutional coding, turbo coding or no coding is used for the TrCH. 4.2.2.1 Concatenation of transport blocks bim1 , bim 2 , bim3 ,, bimBi where i is the TrCH The bits input to the transport block concatenation are denoted by 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 4.2.2.2 Code block segmentation 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 beginning of the first 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 by 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: if Xi < 40 and Turbo coding is used, then Ki = 40 else Ki = Xi / Ci end if Number of filler bits: Yi = CiKi - Xi If Xi Z, then oir1 , oir 2 , oir 3 ,, oirK i , where i is the TrCH number, r is oi1k = 0 k = 1, 2, ..., Yi ETSI 3G TS 25.212 version 3.2.0 Release 1999 14 ETSI TS 125 212 V3.2.0 (2000-03) oi1k = xi ,( k -Yi ) k = Yi+1, Yi+2, ..., Ki end if If Xi > Z, then oi1k = 0 k = 1, 2, ..., Yi oi1k = xi ,( k -Yi ) k = Yi+1, Yi+2, ..., Ki oi 2 k = xi , ( k + K i -Yi ) k = 1, 2, ..., Ki end if oi 3k = xi , ( k + 2 K i -Yi ) k = 1, 2, ..., Ki oiCi k = xi ,( k +( Ci -1) Ki -Yi ) k = 1, 2, ..., Ki 4.2.3 Channel coding oir1 , oir 2 , oir 3 ,, oirK i , where i is the Code blocks are delivered to the channel coding block. They are denoted by 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 y ir1 , y ir 2 , y ir 3 , , y irYi , where Yi is the number of encoded bits. The relation between oirk and yirk and 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 coding. Usage of coding scheme and coding rate for the different types of TrCH is shown in table 1. The values of Yi in connection with each coding scheme: convolutional coding with rate 1/2: Yi = 2*Ki + 16; rate 1/3: Yi = 3*Ki + 24; turbo coding with rate 1/3: Yi = 3*Ki + 12; no coding: Yi = Ki. Table 1: Usage of channel coding scheme and coding rate Type of TrCH BCH PCH RACH CPCH, DCH, DSCH, FACH Coding scheme Convolutional coding Turbo coding No coding Coding rate 1/2 1/3, 1/2 1/3 ETSI 3G TS 25.212 version 3.2.0 Release 1999 15 ETSI TS 125 212 V3.2.0 (2000-03) 4.2.3.1 Convolutional coding Convolutional codes with constraint length 9 and coding rates 1/3 and 1/2 are defined. The configuration of the convolutional coder is presented in figure 3. Output from the rate 1/3 convolutional coder shall be done in the order output0, output1, output2, output0, output1, output 2, output 0,...,output2. Output from the rate 1/2 convolutional coder shall be done in the order output 0, output 1, output 0, output 1, output 0, ..., output 1. 8 tail bits with binary 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" when starting to encode the input bits. Input D D D D D D D D Output 0 G0 = 561 (octal) Output 1 G1 = 753 (octal) (a) Rate 1/2 convolutional coder Input D D D D D D D D Output 0 G0 = 557 (octal) Output 1 G1 = 663 (octal) Output 2 G2 = 711 (octal) (b) Rate 1/3 convolutional coder Figure 3: Rate 1/2 and rate 1/3 convolutional coders 4.2.3.2 4.2.3.2.1 Turbo coding Turbo coder The scheme of Turbo coder is a Parallel Concatenated Convolutional Code (PCCC) with two 8-state constituent encoders and one Turbo code internal interleaver. The coding rate of Turbo coder is 1/3. The structure of Turbo coder is illustrated in figure 4. The transfer function of the 8-state constituent code for PCCC is: G(D) = 1, where g0(D) = 1 + D2 + D3, g1(D) = 1 + D + D3. g1 ( D ) , g 0 ( D) ETSI 3G TS 25.212 version 3.2.0 Release 1999 16 ETSI TS 125 212 V3.2.0 (2000-03) The initial value of the shift registers of the 8-state constituent encoders shall be all zeros when starting to encode the input bits. Output from the Turbo coder is x1, z1, z'1, x2, z2, z'2, ..., xK, zK, z'K, where x1, x2, ..., xK are the bits input to the Turbo coder i.e. both first 8-state constituent encoder and Turbo code internal interleaver, and K is the number of bits, and z1, z2, ..., zK and z'1, z'2, ..., z'K are the bits output from first and second 8-state constituent encoders, respectively. The bits output from Turbo code internal interleaver are denoted by x'1, x'2, ..., x'K, and these bits are to be input to the second 8-state constituent encoder. xk 1st constituent encoder zk xk Input D D D Input Output 2nd constituent encoder Turbo code internal interleaver Output z'k x'k D D D x'k Figure 4: Structure of rate 1/3 Turbo coder (dotted lines apply for trellis termination only) 4.2.3.2.2 Trellis termination for Turbo coder Trellis termination is performed by taking the tail bits from the shift register feedback after all information bits are encoded. Tail bits are padded 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 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 4 in lower position) while the first constituent encoder is disabled. The transmitted bits for trellis termination shall then be: xK+1, zK+1, xK+2, zK+2, xK+3, zK+3, x'K+1, z'K+1, x'K+2, z'K+2, x'K+3, z'K+3. 4.2.3.2.3 Turbo code internal interleaver 40 K 5114. The relation between the bits input to the Turbo code internal interleaver and the bits input to the channel coding is defined by xk = oirk and K = Ki. The following subclause specific symbols are used in subclauses 4.2.3.2.3.1 to 4.2.3.2.3.3: K R Number of bits input to Turbo code internal interleaver Number of rows of rectangular matrix The Turbo code internal interleaver consists of bits-input to a rectangular matrix, intra-row and inter-row permutations of the rectangular matrix, and bits-output from the rectangular matrix with pruning. The bits input to the Turbo code internal interleaver are denoted by x1 , x2 , x3 ,, x K , where K is the integer number of the bits and takes one value of ETSI 3G TS 25.212 version 3.2.0 Release 1999 17 ETSI TS 125 212 V3.2.0 (2000-03) C p v s(i) qj rj T(j) Uj(i) i j k 4.2.3.2.3.1 Number of columns of rectangular matrix Prime number Primitive root Base sequence for intra-row permutation Minimum prime integers Permuted prime integers Inter-row permutation pattern Intra-row permutation pattern Index of matrix Index of matrix Index of bit sequence Bits-input to rectangular matrix The bit sequence input to the Turbo code internal interleaver xk is written into the rectangular matrix as follows. (1) Determine the number of rows R of the rectangular matrix such that: 5, if ( 40 K 159) R = 10, if ((160 K 200) or ( 481 K 530)) 20, if ( K = any other value) where the rows of rectangular matrix are numbered 0, 1, 2, ..., R - 1 from top to bottom. (2) Determine the number of columns C of rectangular matrix such that: if (481 K 530) then p = 53 and C = p. else Find minimum prime p such that (p + 1) - K/R 0, and determine C such that if (p - K/R 0) then 0) then if (p - 1 - K/R C = p - 1. else C = p. end if else C=p+1 end if ETSI 3G TS 25.212 version 3.2.0 Release 1999 18 ETSI TS 125 212 V3.2.0 (2000-03) end if where the columns of rectangular matrix are numbered 0, 1, 2, ..., C - 1 from left to right. (3) Write the input bit sequence xk into the R C rectangular matrix row by row starting with bit x1 in column 0 of row 0: x2 x3 x1 x( C +1) x( C + 2 ) x( C + 3 ) x(( R -1)C +1) x(( R -1)C + 2) x(( R -1)C + 3) x x x 2C RC C 4.2.3.2.3.2 Intra-row and inter-row permutations After the bits-input to the R C rectangular matrix, the intra-row and inter-row permutations are performed by using the following algorithm. (1) Select a primitive root v from table 2. (2) Construct the base sequence s(i) for intra-row permutation as: s(i) = [v s(i - 1)] mod p, i = 1, 2,..., (p - 2)., and s(0) = 1. (3) Let q0 = 1 be the first prime integer in {qj}, and select the consecutive minimum prime integers {qj} (j = 1, 2, ..., R 1) such that: g.c.d{qj, p - 1} = 1, qj > 6, and qj > q(j-1), where g.c.d. is greatest common divisor. (4) Permute {qj} to make {rj} such that rT(j) = qj , j = 0, 1, ..., R - 1, where T(j) indicates the original row position of the j-th permuted row, and T(j) is the inter-row permutation pattern defined as the one of the following four kind of patterns: Pat1, Pat2, Pat3 and Pat4 depending on the number of input bits K. Pat 4 Pat3 Pat1 Pat3 T ( j ) = Pat1 Pat 2 Pat 1 Pat 2 Pat1 if ( 40 K 159) if (160 K 200) if ( 201 K 480) if ( 481 K 530) if (531 K 2280) , if ( 2281 K 2480) if ( 2481 K 3160) if (3161 K 3210) if (3211 K 5114) where Pat1, Pat2, Pat3 and Pat4 have the following patterns respectively. Pat1: {19, 9, 14, 4, 0, 2, 5, 7, 12, 18, 10, 8, 13, 17, 3, 1, 16, 6, 15, 11} Pat2: {19, 9, 14, 4, 0, 2, 5, 7, 12, 18, 16, 13, 17, 15, 3, 1, 6, 11, 8, 10} Pat3: {9, 8, 7, 6, 5, 4, 3, 2, 1, 0} Pat4: {4, 3, 2, 1, 0} ETSI 3G TS 25.212 version 3.2.0 Release 1999 19 ETSI TS 125 212 V3.2.0 (2000-03) (5) Perform the j-th (j = 0, 1, 2, ..., R - 1) intra-row permutation as: if (C = p) then Uj(i) = s([i rj]mod(p - 1)), i = 0, 1, 2, ..., (p - 2)., and Uj(p - 1) = 0, where Uj(i) is the input bit position of i-th output after the permutation of j-th row. end if if (C = p + 1) then Uj(i) = s([i rj]mod(p - 1)), i = 0, 1, 2, ..., (p - 2)., Uj(p - 1) = 0, and Uj(p) = p, where Uj(i) is the input bit position of i-th output after the permutation of j-th row, and if (K = C R) then Exchange UR-1(p) with UR-1(0). end if end if if (C = p - 1) then Uj(i) = s([i rj]mod(p - 1)) - 1, i = 0, 1, 2, ..., (p - 2), where Uj(i) is the input bit position of i-th output after the permutation of j-th row. end if Table 2: Table of prime p and associated primitive root v p 7 11 13 17 19 23 29 31 37 41 43 v 3 2 2 3 2 5 2 3 2 6 3 p 47 53 59 61 67 71 73 79 83 89 97 v 5 2 2 2 2 7 5 3 2 3 5 p 101 103 107 109 113 127 131 137 139 149 151 v 2 5 2 6 3 3 2 3 2 2 6 p 157 163 167 173 179 181 191 193 197 199 211 v 5 2 5 2 2 2 19 5 2 3 2 p 223 227 229 233 239 241 251 257 v 3 2 6 3 7 7 6 3 4.2.3.2.3.3 Bits-output from rectangular matrix with pruning After intra-row and inter-row permutations, the bits of the permuted rectangular matrix are denoted by y'k: y '1 y '( R+1) y '( 2 R+1) y ' 2 y '( R + 2 ) y '( 2 R + 2 ) y '3 R y ' R y '2 R y' y' y' (( C -1) R + 2 ) CR (( C -1) R +1) ETSI 3G TS 25.212 version 3.2.0 Release 1999 20 ETSI TS 125 212 V3.2.0 (2000-03) The output of the Turbo code internal interleaver is the bit sequence read out column by column from the intra-row and inter-row permuted R C matrix starting with bit y'1 in row 0 of column 0 and ending with bit y'CR in row R - 1 of column C - 1. The output is pruned by deleting bits that were not present in the input bit sequence, i.e. bits y'k that corresponds to bits xk with k > K are removed from the output. The bits output from Turbo code internal interleaver are denoted by x'1, x'2, ..., x'K, where x'1 corresponds to the bit y'k with smallest index k after pruning, x'2 to the bit y'k with second smallest index k after pruning, and so on. The number of bits output from Turbo code internal interleaver is K and the total number of pruned bits is: R C K. Concatenation of encoded blocks 4.2.3.3 After the channel coding for each code block, if Ci is greater than 1, the encoded blocks are serially concatenated so that the block with lowest index r is output first from the channel coding block, otherwise the encoded block is output from channel coding block as it is. The bits output are denoted by ci1 , ci 2 , ci 3 ,, ciEi , where i is the TrCH number and Ei = CiYi. The output bits are defined by the following relations: cik = y i1k k = 1, 2, ..., Yi cik = y i , 2,( k -Yi ) k = Yi + 1, Yi + 2, ..., 2Yi cik = y i ,3,( k - 2Yi ) k = 2Yi + 1, 2Yi + 2, ..., 3Yi cik = y i ,Ci ,( k -( Ci -1)Yi ) k = (Ci - 1)Yi + 1, (Ci - 1)Yi + 2, ..., CiYI If no code blocks are input to the channel coding (Ci = 0), no bits shall be output from the channel coding, i.e. Ei = 0. 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 subclause 4.2.7. Radio frame size equalisation is only performed in the UL (DL rate matching output block length is always an integer multiple of Fi). 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 ti1 , ti 2 , ti 3 , , tiTi , 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 Fi is the number of bits per segment after size equalisation. 4.2.5 1st interleaving In Compressed Mode by puncturing, bits marked with a fourth value on top of {0, 1, } and noted p, are introduced in the radio frames to be compressed, in positions corresponding to the first bits of the radio frames. They will be removed in a later stage of the multiplexing chain to create the actual gap. Additional puncturing has been performed in the rate matching step, over the TTI containing the compressed radio frame, to create room for these p-bits. The following subclause describes this feature. ETSI 3G TS 25.212 version 3.2.0 Release 1999 21 ETSI TS 125 212 V3.2.0 (2000-03) 4.2.5.1 Insertion of marked bits in the sequence to be input in first interleaver In normal mode, compressed mode by higher layer scheduling, and compressed mode by spreading factor reduction: xik = zik and Xi = Zi. In case of compressed mode by puncturing and fixed positions, sequence xi, k which will be input to first interleaver for TrCh i and TTI m within largest TTI, is built from bits z i, k, k=1, ..Zi, plus Np TTI, m i,max bits marked p and Xi = Zi+ NpTTI, m i,max, as is described thereafter. Np TTI, m i,max is defined in the Rate Matching subclause 4.2.7. PFi[x] defines the inter column permutation function for a TTI of length Fi *10ms, as defined in Table 3 above. PFi[x] is the Bit Reversal function of x on log2(Fi) bits. NOTE 1: C[x], x= 0 to Fi 1, the number of bits p which have to be inserted in each of the Fi segments of the TTI, i.e. in each column of the first interleaver. C[x] is equal to Np x i,max for x equal 0 to Fi 1 for fixed positions . It is noted Np x i in the following initialisation step. NOTE 2: cbi[x], x=0 to Fi 1, the counter of the number of bits p inserted in each of the Fi segments of the TTI, i.e. in each column of the first interleaver. col = 0 while col < Fi do C[col] = Np col i cbi[col] = 0 end do n = 0, m = 0 while n < Xi do col = n mod Fi if cbi[col] < C[PFi (col)] do xi,n = p cbi[col] = cbi[col]+1 else xi,n = zi,m m = m+1 endif n = n +1 end do -- insert one p bit -- update counter of number of bits p inserted -- no more p bit to insert in this segment -- initialisation of number of bits p to be inserted in each of the Fi segments of the TTI -- initialisation of counter of number of bits p inserted in each of the Fi segments of the TTI 4.2.5.2 1st interleaver operation The 1st interleaving is a block interleaver with inter-column permutations. The input bit sequence to the 1st 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: (1) Select the number of columns CI from table 3. ETSI 3G TS 25.212 version 3.2.0 Release 1999 22 ETSI TS 125 212 V3.2.0 (2000-03) (2) Determine the number of rows RI defined as: RI = Xi/CI (3) Write the input bit sequence into the RI CI rectangular matrix row by row starting with bit xi ,1 in the first xi ,( RI C I ) in column CI of row RI: xi 3 xi ,( CI + 3) xi ,(( RI -1) C I + 3) xiC I xi ,( 2C I ) xi ,( RI C I ) column of the first row and ending with bit xi1 x i ,( C I +1) xi ,(( RI -1)C I +1) xi 2 xi ,( C I + 2) xi ,(( RI -1)C I + 2) (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 by yik: yi1 y i2 yiRI (5) Read the output bit sequence column permuted RI yi ,( RI +1) yi , ( R I + 2 ) yi ,( 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 ) yi1 , yi 2 , yi 3 , , yi ,( C I RI ) of the 1st interleaving column by column from the inter- CI matrix. Bit yi ,1 corresponds to the first row of the first column and bit yi ,( RI CI ) Table 3 corresponds to row RI of column CI. TTI 10 ms 20 ms 40 ms 80 ms Number of columns CI 1 2 4 8 Inter-column permutation patterns {0} {0,1} {0,2,1,3} {0,4,2,6,1,5,3,7} 4.2.5.3 Relation between input and output of 1st interleaving in uplink The bits input to the 1st interleaving are denoted by ti1 , t i 2 , t i 3 , , tiTi , where i is the TrCH number and Ti the number of bits. Hence, zik = tik and Xi = Ti. = yik. The bits output from the 1st interleaving are denoted by d i1 , d i 2 , d i 3 , , d iTi , and dik 4.2.5.4 Relation between input and output of 1st 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 hi1 , hi 2 , hi 3 ,, hi ( Fi H i ) , where i is the TrCH number. Hence, zik = hik and Zi = Fi * Hi - Np TTI, m i,max in compressed mode by puncturing, and Zi = FiHi otherwise. If flexible positions of the TrCHs in a radio frame is used then the bits input to the 1st interleaving are denoted by gi1 , gi 2 , gi 3 ,, g iGi , where i is the TrCH number. Hence, zik = gik and Zi = Gi. The bits output from the 1st interleaving are denoted by number of bits. Hence, qik qi1 , qi 2 , qi 3 ,, qiQi , where i is the TrCH number and Qi is the = yik, Qi = FiHi if fixed positions are used, and Qi = Gi if flexible positions are used. ETSI 3G TS 25.212 version 3.2.0 Release 1999 23 ETSI TS 125 212 V3.2.0 (2000-03) 4.2.6 Radio frame segmentation When the transmission time interval is longer than 10 ms, the input bit sequence is segmented and mapped onto consecutive Fi 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 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 yi ,ni 1 , yi ,ni 2 , yi ,ni 3 , , yi ,niYi where ni is the radio frame number in current output bit sequences per TTI are denoted by 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 = 1...Fi, k = 1...Yi where Yi = (Xi / Fi) is the number of bits per segment. 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 in uplink d i1 , d i 2 , d i 3 , , d iTi , where i is the TrCH ei1 , ei 2 , ei 3 ,, eiN i , where i is the TrCH number The input bit sequence to the radio frame segmentation is denoted by number and Ti the number of bits. Hence, xik = dik and Xi = Ti. The output bit sequence corresponding to radio frame ni is denoted by and Ni is the number of bits. Hence, ei ,k = yi ,ni k and Ni = Yi. 4.2.6.2 Relation between input and output of the radio frame segmentation block in downlink qi1 , qi 2 , qi 3 ,, qiQi , where i is the TrCH number and Qi f i1 , f i 2 , f i 3 , , f iVi , where i is the TrCH The bits input to the radio frame segmentation are denoted by the number of bits. Hence, xik = qik and Xi = Qi. f i ,k = yi ,ni k and Vi = Yi. The output bit sequence corresponding to radio frame ni is denoted by number and Vi is the number of bits. Hence, 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 TrCH multiplexing is identical to the total channel bit rate of the allocated dedicated physical channels. If no bits are input to the rate matching for all TrCHs within a CCTrCH, the rate matching shall output no bits for all TrCHs within the CCTrCH and no uplink DPDCH will be selected in the case of uplink rate matching. Notation used in subcaluse 4.2.7 and subclauses: Nij: For uplink: Number of bits in a radio frame before rate matching on TrCH i with transport format combination j . For downlink: An intermediate calculation variable (not an integer but a multiple of 1/8). ETSI 3G TS 25.212 version 3.2.0 Release 1999 TTI N il : 24 ETSI TS 125 212 V3.2.0 (2000-03) Number of bits in a transmission time interval before rate matching on TrCH i with transport format l. Used in downlink only. N ij : For uplink: If positive - number of bits that should be repeated in each radio frame on TrCH i with transport format combination j. If negative - number of bits that should be punctured in each radio frame on TrCH i with transport format combination j. For downlink : An intermediate calculation variable (not an integer but a multiple of 1/8). TTI N il : 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 format j. Used in downlink only. Np TTI, m i,l, m=0 to Fmax / Fi - 1 :Positive or null: number of bits to be removed in TTI number m within the largest TTI, to create the required gaps in the compressed radio frames of this TTI, in case of compressed mode by puncturing, for TrCh i with transport format l. In case of fixed positions and compressed mode by puncturing, this value is noted Np TTI, m i,max since it is calculated for all TrCh with their maximum number of bits; thus it is the same for all TFCs Used in downlink only. Np n i,l n=0 to Fmax -1:Positive or null: number of bits, in radio frame number n within the largest TTI, corresponding to the gap for compressed mode in this radio frame, for TrCH i with transport format l. The value will be null for the un-compressed radio frames. In case of fixed positions and compressed mode by puncturing, this value is noted Np n i,max since it is calculated for all TrChs with their maximum number of bits; thus it is the same for all TFCs Used in downlink only. NTGL[k], k=0 to Fi -1 : Positive or null: number of bits in each radio frame corresponding to the gap for compressed mode for the CCTrCh. RMi: PL: Ndata,j: I: Zij: Fi: Fmax Semi-static rate matching attribute for transport channel i. Signalled from higher layers. 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. Total number of bits that are available for the CCTrCH in a radio frame with transport format combination j. Number of TrCHs in the CCTrCH. Intermediate calculation variable. Number of radio frames in the transmission time interval of TrCH i. Maximum number of radio frames in a transmission time interval used in the CCTrCH : Fmax = max Fi 1 i I ni: q: IF(ni): Radio frame number in the transmission time interval of TrCH i (0 ni < Fi). Average puncturing or repetition distance (normalised to only show the remaining rate matching on top of an integer number of repetitions). Used in uplink only. 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. ETSI 3G TS 25.212 version 3.2.0 Release 1999 25 ETSI TS 125 212 V3.2.0 (2000-03) S(ni): TFi(j): TFS(i) TFCS eini eplus eminus b: The shift of the puncturing or repetition pattern for radio frame ni. Used in uplink only. Transport format of TrCH i for the transport format combination j. The set of transport format indexes l for TrCH i. The set of transport format combination indexes j. Initial value of variable e in the rate matching pattern determination algorithm of subclause 4.2.7.5. Increment of variable e in the rate matching pattern determination algorithm of subclause4.2.7.5. Decrement of variable e in the rate matching pattern determination algorithm of subclause 4.2.7.5. Indicates systematic and parity bits b=1: Systematic bit. X(t) in subclause 4.2.3.2.1. b=2: 1st parity bit (from the upper Turbo constituent encoder). Y(t) in subcaluse 4.2.3.2.1. b=3: 2nd parity bit (from the lower Turbo constituent encoder). Y'(t) in subclause 4.2.3.2.1. The * (star) notation is used to replace an index x when the indexed variable Xx does not depend on the index x. In the left wing of an assignment the meaning is that "X* = Y" is equivalent to "for all x do Xx = Y ". In the right wing of an assignment, the meaning is that "Y = X* " is equivalent to "take any x and do Y = Xx". The following relations, defined for all TFC j, are used when calculating the rate matching parameters: Z 0, j = 0 i m m =1 = I ij m =1 RM N mj N data, j Z for all i = 1 .. I (1) RM m N mj N ij = Z ij - Z i -1, j - N ij 4.2.7.1 4.2.7.1.1 for all i = 1 .. I Determination of rate matching parameters in uplink Determination of SF and number of PhCHs needed In uplink, puncturing can be applied to match the CCTrCH bit rate to the PhCH bit rate. The bit rate of the PhCH(s) is limited by the UE capability and restrictions imposed by UTRAN, through limitations on the PhCH spreading factor. 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 of one PhCH for all possible spreading factors is given in [2]. Denote these values by N256, N128, N64, N32, N16, N8, and N4, where the index refers to the spreading factor. The possible number of bits available to the CCTrCH on all PhCHs, Ndata, then are { N256, N128, N64, N32, N16, N8, N4, 2N4, 3N4, 4N4, 5N4, 6N4}. Depending on the UE capability and the restrictions from UTRAN, the allowed set of Ndata , denoted SET0, can be a subset of { N256, N128, N64, N32, N16, N8, N4, 2N4, 3N4, 4N4, 5N4, 6N4}. Ndata, j for the transport format combination j is determined by executing the following algorithm: SET1 = { Ndata in SET0 such that min RM y N data - { 1 y I } RMx N x, j x =1 I is non negative } If SET1 is not empty and the smallest element of SET1 requires just one PhCH then Ndata,j = min SET1 else ETSI 3G TS 25.212 version 3.2.0 Release 1999 26 ETSI TS 125 212 V3.2.0 (2000-03) I SET2 = { Ndata in SET0 such that min RM y N data - PL Sort SET2 in ascending order Ndata = min SET2 { 1 y I } RMx N x, j is non negative } x =1 While Ndata is not the max of SET2 and the follower of Ndata requires no additional PhCH do Ndata = follower of Ndata 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 with equation 1 for all possible transport format combinations j and selected every radio frame. Ndata,j is given from subclause 4.2.7.1.1. In compressed mode cm cm N data , j is replaced by N data , j in Equation 1. N data , j is given as follows: cm N data , j is obtained by executing the algorithm in subclause 4.2.7.1.1 In compressed mode by higher layer scheduling, but with the number of bits in one radio frame of one PhCH reduced to N tr of the value in normal mode. 15 Ntr is the number of transmitted slots in a compressed radio frame and is defined by the following relation: 15 - TGL , if Nfirst + TGL 15 N tr = N first , in first frame if Nfirst + TGL > 15 30 - TGL - N first , in second frame if Nfirst + TGL > 15 Nfirst and TGL are defined in subclause 4.4. In compressed mode by spreading factor reduction, N data , j cm = 2 N data , j - 2 N TGL , where N TGL = 15 - N tr N data , j 15 If Nij = 0 then the output data of the rate matching is the same as the input data and the rate matching algorithm of subclause 4.2.7.5 does not need to be executed. If Nij 0 the parameters listed in subclauses 4.2.7.1.2.1 and 4.2.7.1.2.2 shall be used for determining eini, eplus, and eminus (regardless if the radio frame is compressed or not). 4.2.7.1.2.1 Uncoded and convolutionally encoded TrCHs R = Nij mod Nij -- note: in this context Nij mod Nij is in the range of 0 to Nij-1 i.e. -1 mod 10 = 9. if R 0 and 2R Nij then q = Nij / R else q = Nij / (R - Nij) endif ETSI 3G TS 25.212 version 3.2.0 Release 1999 27 ETSI TS 125 212 V3.2.0 (2000-03) -- note: q is a signed quantity. 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 S(IF ( x*q' mod Fi)) = ( x*q' div Fi) end for Ni = Ni,j a=2 For each radio frame, the rate-matching pattern is calculated with the algorithm in subclause 4.2.7.5, where : Xi = Ni,j., and eini = (aS(ni)|Ni| + 1) mod (aNij). eplus = aNij eminus = a|Ni| puncturing for N<0, repetition otherwise. 4.2.7.1.2.2 Turbo encoded TrCHs If repetition is to be performed on turbo encoded TrCHs, i.e. Ni,j >0, the parameters in subclause 4.2.7.1.2.1 are used. If puncturing is to be performed, the parameters below shall be used. Index b is used to indicate systematic (b=1), 1st parity (b=2), and 2nd parity bit (b=3). a=2 when b=2 a=1 when b=3 N i , j 2 , b = 2 N i = N i , j 2 , b = 3 If N i is calculated as 0 for b=2 or b=3, then the following procedure and the rate matching algorithm of subclause 4.2.7.5 don't need to be performed for the corresponding parity bit stream. Xi = Ni,j /3 , q = Xi /|Ni| if(q 2) for x=0 to Fi-1 S[IF[(3x+b-1) mod Fi]] = x mod 2; end for else ETSI 3G TS 25.212 version 3.2.0 Release 1999 28 ETSI TS 125 212 V3.2.0 (2000-03) 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 endif for x=0 to Fi -1 r = x*q' mod Fi; S[IF[(3r+b-1) mod Fi]] = x*q' div Fi; endfor endif For each radio frame, the rate-matching pattern is calculated with the algorithm in subclause 4.2.7.5, where: Xi is as above: eini = (aS(ni)|Ni| + Xi) mod (aXi), if eini =0 then eini = aXi. eplus = aXi eminus = aNi q' = q 4.2.7.2 Determination of rate matching parameters in downlink For downlink Ndata,j does not depend on the transport format combination j. Ndata,* is given by the channelization code(s) assigned by higher layers. Denote the number of physical channels used for the CCTrCH by P. Ndata,* is the number of bits available to the CCTrCH in one radio frame and defined as Ndata,*=P(15Ndata1+15Ndata2), where Ndata1 and Ndata2 are defined in [2]. Note that contrary to the uplink, the same rate matching patterns are used in normal and compressed mode by spreading factor reduction or higher layer scheduling. In the following, the total amount of puncturing or repetition for the TTI is calculated. Additional calculations for compressed mode by puncturing in case of fixed positions are performed to determine this total amount of rate matching needed. For compressed mode by puncturing, in TTIs where some compressed radio frames occur, the puncturing is increased or the repetition is decreased compared to what is calculated according to the rate matching parameters provided by higher layers. This allows to create room for later insertion of marked bits, noted p-bits, which will identify the positions of the gaps in the compressed radio frames. The amount of additional puncturing corresponds to the number of bits to create the gap in the TTI for TrCh i . In case of fixed positions, it is calculated in addition to the amount of rate matching indicated by higher layers. It is noted NpTTI, m i,max. In fixed positions case, to obtain the total rate matching N iTTI ,cm ,m to be performed on the TTI m, NpTTI, m i,max is , max sub-stracted from N TTI, m i,max (calculated based on higher layers RM parameters as for normal rate matching). This allows to create room for the NpTTI, m i,max bits p to be inserted later. If the result is null, i.e. the amount of repetition matches exactly the amount of additional puncturing needed, then no rate matching is necessary. In case of compressed mode by puncturing and fixed positions, for some calculations, N'data,* is used for radio frames with gap instead of ' ' ' ' ' N data ,* , where N data ,* = P(15 N data1 + 15 N data 2 ) . N data1 and N data 2 are the number of bits in the data fields of the slot format used for the current compressed mode, i.e. slot format A or B as defined in [2] corresponding to the Spreading Factor and the number of transmitted slots in use. ETSI 3G TS 25.212 version 3.2.0 Release 1999 29 ETSI TS 125 212 V3.2.0 (2000-03) The number of bits corresponding to the gap for TrCh i, in each radio frame of its TTI is calculated using the number of bits to remove on each Physical Channel NTGL[k], where k is the radio frame number in the TTI. For each radio frame k of the TTI, NTGL[k] is given by the relation: TGL ' N data ,* , if Nfirst + TGL 15 15 NTGL = 15 - N first 15 ' N data ,* , in first radio frame of the gap if Nfirst + TGL > 15 TGL - (15 - N first ) 15 ' N data ,* , in second radio frame of the gap if Nfirst + TGL > 15 Nfirst and TGL are defined in subclause 4.4. Note that N TGL [k] = 0 if radio frame k is not compressed. 4.2.7.2.1 4.2.7.2.1.1 Determination of rate matching parameters for fixed positions of TrCHs Calculation of Nmax for normal mode and compressed mode by higher layer scheduling and spreading factor reduction First an intermediate calculation variable N i ,* is calculated for all transport channels i by the following formula: N i ,* = 1 max N iTTI ,l Fi lTFS (i ) The computation of the where N iTTI parameters is then performed in for all TrCH i and all TF l by the following formula, ,l N i ,* is derived from N i ,* by the formula given at subclause 4.2.7: N max = Fi N i ,* If N max = 0 then, for TrCH i, the output data of the rate matching is the same as the input data and the rate matching l TFS (i ) N iTTI = 0 ,l algorithm of subclause 4.2.7.5 does not need to be executed. In this case we have : If N max eminus. 0 the parameters listed in subclauses 4.2.7.2.1.3 and 4.2.7.2.1.4 shall be used for determining eini, eplus, and 4.2.7.2.1.2 Calculations for compressed mode by puncturing Calculations of N TTI,m i,max, for all TTI m within largest TTI, for all TrCh i First an intermediate calculation variable N n i,* is calculated for all transport channels i and all frames n in TTI m within the largest TTI, using the same formula as for normal mode above by replacing N TTI i,l by N TTI,m i,l , the number of bits in TTI m. The computation of the N TTI,m i,max parameters is then performed for all TrCH i by the following formula, N TTI,m i,max = n=0n=Fi N n i,* ETSI 3G TS 25.212 version 3.2.0 Release 1999 30 ETSI TS 125 212 V3.2.0 (2000-03) where all N n i,* are derived from N n i,* for all TrCh i and all frames n in TTI m , from the formula given at subclause 4.2.7 using Ndata,*, for the non compressed frames of TTI m and using N'data,* instead of Ndata,* , for the compressed frames of TTI m. Calculations of Np n i,max and Np TTI, m i,max Let Np n i,max be the number of bits to eliminate on TrCh i to create the gap for compressed mode, in each radio frame k of the TTI, calculated for the Transport Format Combination of TrCh i, in which the number of bits of TrCh i is at its maximum. Np n i,max is calculated for each radio frame k of the TTI in the following way. Intermediate variables Zi for i = 1 to I are calculated using the formula (1) in 4.2.7, by replacing N data,j by NTGL[k]. Then Np n i,max = (Zi Zi-1) for i = 1 to I The total number of bits Np TTI, m i,max corresponding to the gaps for compressed mode for TrCh i in the TTI is calculated as: Np TTI, m i,max = n=0Fi-1 Np n i,max If Nmax = Np TTI, m i,max , then, for TrCH i, the output data of the rate matching is the same as the input data and the rate matching algorithm of subclause 4.2.7.5 does not need to be executed. If Nmax Np TTI, m i,max , then, for TrCH i, the rate matching algorithm of subclause 4.2.7.5 needs to be executed. N iTTI ,cm ,m = N TTI,m i,max - Np TTI, m i,max , max 4.2.7.2.1.3 Determination of rate matching parameters for uncoded and convolutionally encoded TrCHs N i = N max For compressed mode by puncturing, Ni is defined as: Ni = a=2 TTI N max = max N il l TFS (i ) N iTTI ,cm ,m , instead of the previous relation. , max For each transmission time interval of TrCH i with TF l, the rate-matching pattern is calculated with the algorithm in subclause 4.2.7.5. The following parameters are used as input: TTI X i = N il eini = 1 e plus = a N max emin us = a N i Puncturing if N i < 0 , repetition otherwise. The values of N iTTI may be computed by counting repetitions or ,l N iTTI can be represented with ,l puncturing when the algorithm of subclause 4.2.7.5 is run. The resulting values of following expression. N max X i N iTTI = ,l sgn( N max ) N max ETSI 3G TS 25.212 version 3.2.0 Release 1999 31 ETSI TS 125 212 V3.2.0 (2000-03) 4.2.7.2.1.4 Determination of rate matching parameters for Turbo encoded TrCHs If repetition is to be performed on turbo encoded TrCHs, i.e. used. N max > 0 , the parameters in subclause 4.2.7.2.1.3 are If puncturing is to be performed, the parameters below shall be used. Index b is used to indicate systematic (b=1), 1st parity (b=2), and 2nd parity bit (b=3). a=2 when b=2 a=1 when b=3 The bits indicated by b=1 shall not be punctured. N max 2 , b = 2 N i = N max 2 , b = 3 In Compressed Mode by puncturing, the following relations are used instead of the previous ones: Ni = N i ,max TTI ,cm , m /2 , b=2 /2 , b=3 Ni = N i ,max TTI ,cm , m TTI N max = max ( N il / 3) lTFS (i ) For each transmission time interval of TrCH i with TF l, the rate-matching pattern is calculated with the algorithm in subcaluse 4.2.7.5. The following parameters are used as input: TTI X i = N il / 3 eini = N max e plus = a N max emin us = a N i The values of N iTTI may be computed by counting puncturing when the algorithm of subclause 4.2.7.5 is run. The ,l N iTTI can be represented with following expression. ,l resulting values of N max / 2 X i N iTTI = - + 0.5 - ,l N max N max / 2 X i N max In the above equation, the first term of the right hand side represents the amount of puncturing for b=2 and the second term represents the amount of puncturing for b=3. 4.2.7.2.2 4.2.7.2.2.1 Determination of rate matching parameters for flexible positions of TrCHs Calculations for normal mode, compressed mode by higher layer scheduling, and compressed mode by spreading factor reduction First an intermediate calculation variable combinations j by the following formula: N ij is calculated for all transport channels i and all transport format ETSI 3G TS 25.212 version 3.2.0 Release 1999 32 ETSI TS 125 212 V3.2.0 (2000-03) Ni, j = 1 N iTTI i ( j ) ,TF Fi Then rate matching ratios RFi are calculated for each the transport channel i in order to minimise the number of DTX bits when the bit rate of the CCTrCH is maximum. The RFi ratios are defined by the following formula: RFi = N data ,* jTFCS max (RM i N i , j ) i =1 i=I RM i The computation of N iTTI parameters is then performed in two phases. In a first phase, tentative temporary values of ,l N iTTI are computed, and in the second phase they are checked and corrected. The first phase, by use of the RFi ratios, ,l ensures that the number of DTX indication bits inserted is minimum when the CCTrCH bit rate is maximum, but it does not ensure that the maximum CCTrCH bit rate is not greater than Ndata,*. per 10ms. The latter condition is ensured through the checking and possible corrections carried out in the second phase. At the end of the second phase, the latest value of The first phase defines the tentative temporary of the following formula: TTI TTI RF i N i ,l - TTI = N data ,* RM i N i ,l N i ,l F i = Fi I max Fi F i jTFCS RM i N i , j i =1 TTI - N i ,l N iTTI is the definitive value. ,l N iTTI for all transport channel i and any of its transport format l by use ,l N i ,l TTI ( ) The second phase is defined by the following algorithm: for all j in TFCS do i=I -- for all TFC D= i =1 N iTTI i ( j ) + N iTTI i ( j ) ,TF , TF Fi -- CCTrCH bit rate (bits per 10ms) for TFC l if D > N data ,* then for i = 1 to I do -- for all TrCH -- N = Fi N i , j if N i , j is derived from N i , j by the formula given at subclause 4.2.7. N iTTI i ( j ) > N then ,TF N iTTI i ( j ) = N ,TF end-if end-for end-if end-for NOTE: If The order in which the transport format combinations are checked does not change the final result. N iTTI = 0 then, for TrCH i at TF l, the output data of the rate matching is the same as the input data and the rate ,l matching algorithm of subclause 4.2.7.5 does not need to be executed. ETSI 3G TS 25.212 version 3.2.0 Release 1999 33 ETSI TS 125 212 V3.2.0 (2000-03) If N iTTI 0 the parameters listed in subclauses 4.2.7.2.2.2 and 4.2.7.2.2.3 shall be used for determining eini, eplus, and ,l eminus. 4.2.7.2.2.2 TTI N i = N il Determination of rate matching parameters for uncoded and convolutionally encoded TrCHs a=2 For each transmission time interval of TrCH i with TF l, the rate-matching pattern is calculated with the algorithm in subclause 4.2.7.5. The following parameters are used as input: TTI X i = N il eini = 1 TTI e plus = a N il emin us = a N i puncturing for 4.2.7.2.2.3 N i < 0 , repetition otherwise. Determination of rate matching parameters for Turbo encoded TrCHs TTI N il > 0 , the parameters in subclause 4.2.7.2.2.2 are If repetition is to be performed on turbo encoded TrCHs, i.e. used. If puncturing is to be performed, the parameters below shall be used. Index b is used to indicate systematic (b=1), 1st parity (b=2), and 2nd parity bit (b=3). a=2 when b=2 a=1 when b=3 The bits indicated by b=1 shall not be punctured. TTI N il 2, b = 2 N i = TTI N il 2, b = 3 For each transmission time interval of TrCH i with TF l, the rate-matching pattern is calculated with the algorithm in subclause 4.2.7.5. The following parameters are used as input: TTI X i = N il / 3 , eini = X i , e plus = a X i emin us = a N i 4.2.7.3 Bit separation and collection in uplink The systematic bits (excluding bits for trellis termination) of turbo encoded TrCHs shall not be punctured. The systematic bit, first parity bit, and second parity bit in the bit sequence input to the rate matching block are therefore separated from each other. Puncturing is only applied to the parity bits and systematic bits used for trellis termination. ETSI 3G TS 25.212 version 3.2.0 Release 1999 34 ETSI TS 125 212 V3.2.0 (2000-03) The bit separation function is transparent for uncoded TrCHs, convolutionally encoded TrCHs, and for turbo encoded TrCHs with repetition. The bit separation and bit collection are illustrated in figures 5 and 6. Rate matching x1ik y1ik Radio frame segmentation eik Bit separation x2ik Rate matching algorithm y2ik collection fik Bit TrCH Multiplexing x3ik Rate matching algorithm y3ik Figure 5: Puncturing of turbo encoded TrCHs in uplink Rate matching Radio frame segmentation eik Bit separation x1ik Rate matching algorithm y1ik Bit collection fik TrCH Multiplexing Figure 6: Rate matching for uncoded TrCHs, convolutionally encoded TrCHs, and for turbo encoded TrCHs with repetition in uplink The bit separation is dependent on the 1st interleaving and offsets are used to define the separation for different TTIs. The offsets b for the systematic (b=1) and parity bits (b{2, 3}) are listed in table 4. Table 4: TTI dependent offset needed for bit separation TTI (ms) 10, 40 20, 80 1 0 0 2 1 2 3 2 1 ETSI 3G TS 25.212 version 3.2.0 Release 1999 35 ETSI TS 125 212 V3.2.0 (2000-03) The bit separation is different for different radio frames in the TTI. A second offset is therefore needed. The radio frame number for TrCH i is denoted by ni. and the offset by ni . Table 5: Radio frame dependent offset needed for bit separation TTI (ms) 10 20 40 80 0 0 0 0 0 1 NA 1 1 1 2 NA NA 2 2 3 NA NA 0 0 4 NA NA NA 1 5 NA NA NA 2 6 NA NA NA 0 7 NA NA NA 1 4.2.7.3.1 Bit separation The bits input to the rate matching are denoted by ei1 , ei 2 , ei 3 ,, eiN i , where i is the TrCH number and Ni is the number of bits input to the rate matching block. Note that the transport format combination number j for simplicity has been left out in the bit numbering, i.e. Ni=Nij. The bits after separation are denoted by xbi1 , xbi 2 , xbi 3 ,, xbiX i . For turbo encoded TrCHs with puncturing, b indicates systematic, first parity, or second parity bit. For all other cases b is defined to be 1. Xi is the number of bits in each separated bit sequence. The relation between eik and xbik is given below. For turbo encoded TrCHs with puncturing: x1,i ,k = ei ,3( k -1) +1+ (1 + n ) mod 3 i x1,i ,Ni / 3+ k = ei ,3 N i / 3 + k x2,i ,k = ei ,3( k -1)+1+ ( 2 + n ) mod 3 i x3,i ,k = ei ,3( k -1)+1+ ( 3 + n ) mod 3 i k = 1, 2, 3, ..., Xi k = 1, ..., Ni mod 3 k = 1, 2, 3, ..., Xi k = 1, 2, 3, ..., Xi Xi = Ni /3 Note: When (Ni mod 3) = 0 this row is not needed. Xi = Ni /3 Xi = Ni /3 For uncoded TrCHs, convolutionally encoded TrCHs, and turbo encoded TrCHs with repetition: x1,i ,k = ei ,k 4.2.7.3.2 k = 1, 2, 3, ..., Xi Xi = Ni Bit collection The bits xbik are input to the rate matching algorithm described in subclause 4.2.7.5. The bits output from the rate matching algorithm are denoted ybi1 , ybi 2 , ybi 3 ,, ybiYi . z bi1 , z bi 2 , z bi 3 ,, z biYi . f i1 , f i 2 , f i 3 ,, f iVi , Bit collection is the inverse function of the separation. The bits after collection are denoted by After bit collection, the bits indicated as punctured are removed and the bits are then denoted by where i is the TrCH number and Vi= Nij+Nij. The relations between ybik, zbik, and fik are given below. For turbo encoded TrCHs with puncturing (Yi=Xi): z i ,3( k -1)+1+ (1 + n ) mod 3 = y1,i ,k i z i ,3 Ni / 3+ k = y1,i ,Ni / 3+ k z i ,3( k -1)+1+ ( 2 + n ) mod 3 = y 2,i ,k i zi ,3( k -1) +1+ ( 3 + n ) mod 3 = y3,i , k i k = 1, 2, 3, ..., Yi k = 1, ..., Ni mod 3 k = 1, 2, 3, ..., Yi k = 1, 2, 3, ..., Yi Note: When (Ni mod 3) = 0 this row is not needed. ETSI 3G TS 25.212 version 3.2.0 Release 1999 36 ETSI TS 125 212 V3.2.0 (2000-03) After the bit collection, bits zi,k with value , where {0, 1}, are removed from the bit sequence. Bit fi,1 corresponds to the bit zi,k with smallest index k after puncturing, bit fi,2 corresponds to the bit zi,k with second smallest index k after puncturing, and so on. For uncoded TrCHs, convolutionally encoded TrCHs, and turbo encoded TrCHs with repetition: zi ,k = y1,i ,k k = 1, 2, 3, ..., Yi When repetition is used, fi,k=zi,k and Yi=Vi. When puncturing is used, Yi=Xi and bits zi,k with value , where {0, 1}, are removed from the bit sequence. Bit fi,1 corresponds to the bit zi,k with smallest index k after puncturing, bit fi,2 corresponds to the bit zi,k with second smallest index k after puncturing, and so on. 4.2.7.4 Bit separation and collection in downlink The systematic bits (excluding bits for trellis termination) of turbo encoded TrCHs shall not be punctured. The systematic bit, first parity bit, and second parity bit in the bit sequence input to the rate matching block are therefore separated from each other. Puncturing is only applied to the parity bits and systematic bits used for trellis termination. The bit separation function is transparent for uncoded TrCHs, convolutionally encoded TrCHs, and for turbo encoded TrCHs with repetition. The bit separation and bit collection are illustrated in figures 7 and 8. Rate matching x1ik y1ik Channel coding cik Bit separation x2ik Rate matching algorithm y2ik Bit collection gik 1st insertion of DTX indication x3ik Rate matching algorithm y3ik Figure 7: Puncturing of turbo encoded TrCHs in downlink ETSI 3G TS 25.212 version 3.2.0 Release 1999 37 ETSI TS 125 212 V3.2.0 (2000-03) Rate matching Channel coding Bit separation cik x1ik Rate matching algorithm y1ik Bit collection gik 1st insertion of DTX indication Figure 8: Rate matching for uncoded TrCHs, convolutionally encoded TrCHs, and for turbo encoded TrCHs with repetition in downlink 4.2.7.4.1 Bit separation The bits input to the rate matching are denoted by ci1 , ci 2 , ci 3 ,, ciEi , where i is the TrCH number and Ei is the number of bits input to the rate matching block. Note that Ei is a multiple of 3 for turbo encoded TrCHs and that the transport format combination number j for simplicity has been left out in the bit numbering, i.e. Ei=Nij. The bits after separation are denoted by xbi1 , xbi 2 , xbi 3 ,, xbiX i . For turbo encoded TrCHs with puncturing, b indicates systematic, first parity, or second parity bit. For all other cases b is defined to be 1. Xi is the number of bits in each separated bit sequence. The relation between cik and xbik is given below. For turbo encoded TrCHs with puncturing: x1,i ,k = ci ,3( k -1)+1 x2,i ,k = ci ,3( k -1)+ 2 x3,i ,k = ci ,3( k -1) +3 k = 1, 2, 3, ..., Xi k = 1, 2, 3, ..., Xi k = 1, 2, 3, ..., Xi Xi = Ei /3 Xi = Ei /3 Xi = Ei /3 For uncoded TrCHs, convolutionally encoded TrCHs, and turbo encoded TrCHs with repetition: x1,i ,k = ci ,k 4.2.7.4.2 k = 1, 2, 3, ..., Xi X i = Ei Bit collection The bits xbik are input to the rate matching algorithm described in subclause 4.2.7.5. The bits output from the rate matching algorithm are denoted ybi1 , ybi 2 , ybi 3 ,, ybiYi . z bi1 , z bi 2 , z bi 3 ,, z biYi . Bit collection is the inverse function of the separation. The bits after collection are denoted by After bit collection, the bits indicated as punctured are removed and the bits are then denoted by g i1 , g i 2 , g i 3 ,, g iGi , where i is the TrCH number and Gi= Nij+Nij. The relations between ybik, zbik, and gik are given below. For turbo encoded TrCHs with puncturing (Yi=Xi): z i ,3( k -1)+1 = y1,i ,k z i ,3( k -1)+ 2 = y 2,i ,k k = 1, 2, 3, ..., Yi k = 1, 2, 3, ..., Yi ETSI 3G TS 25.212 version 3.2.0 Release 1999 38 ETSI TS 125 212 V3.2.0 (2000-03) zi ,3( k -1)+ 3 = y3,i ,k k = 1, 2, 3, ..., Yi After the bit collection, bits zi,k with value , where {0, 1}, are removed from the bit sequence. Bit gi,1 corresponds to the bit zi,k with smallest index k after puncturing, bit gi,2 corresponds to the bit zi,k with second smallest index k after puncturing, and so on. For uncoded TrCHs, convolutionally encoded TrCHs, and turbo encoded TrCHs with repetition: zi ,k = y1,i ,k k = 1, 2, 3, ..., Yi When repetition is used, gi,k=zi,k and Yi=Gi. When puncturing is used, Yi=Xi and bits zi,k with value , where {0, 1}, are removed from the bit sequence. Bit gi,1 corresponds to the bit zi,k with smallest index k after puncturing, bit gi,2 corresponds to the bit zi,k with second smallest index k after puncturing, and so on. 4.2.7.5 Rate matching pattern determination Denote the bits before rate matching by: xi1 , xi 2 , xi 3 ,, xiX i , where i is the TrCH number and the sequence is defined in 4.2.7.3 for uplink or in 4.2.7.4 for downlink. Parameters Xi, eini, eplus, and eminus are given in 4.2.7.1 for uplink or in 4.2.7.2 for downlink. The rate matching rule is as follows: if puncturing is to be performed e = eini m=1 -- initial error between current and desired puncturing ratio -- index of current bit do while m <= Xi e = e eminus if e <= 0 then -- update error -- check if bit number m should be punctured set bit xi,m to where {0, 1} e = e + eplus end if m=m+1 end do else e = eini m=1 do while m <= Xi e = e eminus do while e <= 0 repeat bit xi,m e = e + eplus -- update error end do -- update error -- check if bit number m should be repeated -- initial error between current and desired puncturing ratio -- index of current bit -- next bit -- update error ETSI 3G TS 25.212 version 3.2.0 Release 1999 39 ETSI TS 125 212 V3.2.0 (2000-03) m=m+1 end do end if -- next bit A repeated bit is placed directly after the original one. 4.2.8 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 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 i s1 , s2 , s3 ,, sS , where S is the number of bits, i.e. S = Vi . The TrCH 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 +V2 )) k = (V1+V2)+1, (V1+V2)+2, ..., (V1+V2)+V3 sk = f I , ( k - (V1 +V2 ++VI -1 )) k = (V1+V2+...+VI-1)+1, (V1+V2+...+VI-1)+2, ..., (V1+V2+...+VI-1)+VI 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 1st insertion of DTX indication bits 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 by gi1 , gi 2 , gi 3 ,, g iGi , where Gi is the number of bits in one TTI of TrCH i. Denote the number of bits in one radio frame of TrCH i by Hi. Denote Di the number of bits output of the first DTX insertion block. In normal or compressed mode by spreading factor reduction, Hi is constant and corresponds to the maximum number of bits from TrCH i in one radio frame for any transport format of TrCH i. and Di = Fi * Hi. In compressed mode by puncturing, additional puncturing is performed in the rate matching block. The empty positions resulting from the additional puncturing are used to insert p-bits in the first interleaving block, the DTX insertion is therefore limited to allow for later insertion of p-bits. Thus DTX bits are inserted until the total number of bits is Di where D i =F i * Hi,* + N TTI cm, i, max , and Hi = Ni,* + Ni,*. The bits output from the DTX insertion are denoted by h i1, h i2, h i3, ..., h iDi Note that these bits are three valued. They are defined by the following relations: hik = g ik k = 1, 2, 3, ..., Gi ETSI 3G TS 25.212 version 3.2.0 Release 1999 40 ETSI TS 125 212 V3.2.0 (2000-03) hik = k = Gi+1, Gi+2, Gi+3, ..., Di where DTX indication bits are denoted by . Here gik {0, 1} and {0, 1}. 4.2.9.2 2nd insertion of DTX indication bits The DTX indication bits inserted in this step 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 by s1 , s2 , s3 ,, sS ,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 R.. In normal mode R= N data ,* P = 15 N data1 + 15 N data 2 , where Ndata1 and Ndata2 are defined in [2]. ' ' ' ' ' N data ,* = P(15 N data1 + 15 N data 2 ) . N data1 and N data 2 are the number of For compressed mode, N'data,* is defined as bits in the data fields of the slot format used for the current compressed mode, i.e. slot format A or B as defined in [2] corresponding to the Spreading Factor and the number of transmitted slots in use. In case of compressed mode by puncturing and fixed positions, DTX shall be inserted until N'data,*, bits, since the exact room for the gap is already reserved thanks to the earlier insertion of the p-bits. Therefore R is defined as R = N'data,* / P. In compressed mode by SF reduction and by higher layer scheduling, additional DTX shall be inserted if the transmission time reduction method does not exactly create a transmission gap of the desired TGL. The number of bits available to the CCTrCH in one radio frame in compressed mode by SF reduction and by higher layer scheduling is denoted by N cm data ,* and R= cm N data,* P . The exact value of cm N data ,* is dependent on the TGL and the transmission time reduction method, which are signalled from higher layers. For transmission time reduction by SF/2 method in compressed mode cm N data ,* = N ' data ,* 2 , and for other methods it can be calculated as N data ,* cm ' = N data ,* - N TGL . For every transmission time reduction method ' ' ' ' ' N data ,* = P(15 N data1 + 15 N data 2 ) , where N data1 and N data 2 are the number of bits in the data fields of a slot for slot format A or B as defined in [2]. NTGL is the number of bits that are located within the transmission gap and defined as: TGL ' N data ,* , if Nfirst + TGL 15 15 NTGL = 15 - N first 15 ' N data ,* , in first frame if Nfirst + TGL > 15 TGL - (15 - N first ) 15 ' N data ,* , in second frame if Nfirst + TGL > 15 Nfirst and TGL are defined in subclause 4.4. NOTE : In compressed mode by SF/2 method DTX is also added in physical channel mapping stage (subclause 4.2.12.2). During 2nd DTX insertion the number of CCTrCH bits is kept the same as in normal mode. The bits output from the DTX insertion block are denoted by w1 , w2 , w3 , , w( PR ) . Note that these bits are four valued in case of compressed mode by puncturing, and three valued otherwise. They are defined by the following relations: wk = sk k = 1, 2, 3, ..., S ETSI 3G TS 25.212 version 3.2.0 Release 1999 41 ETSI TS 125 212 V3.2.0 (2000-03) wk = k = S+1, S+2, S+3, ..., PR where DTX indication bits are denoted by . Here sk {0,1, p}and {0,1}. 4.2.10 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 x1 , x2 , x3 ,, xY , where Y 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 , where p is PhCH number and U is the number of bits in one radio frame for each PhCH, i.e. U= (Y NTGL) / P for compressed mode by puncturing, and Y U = otherwise. The relation between xk and upk is given below. P For all modes, some bits of the input flow are mapped to each code until the number of bits on the code is V. For modes other than compressed mode by puncturing, all bits of the input flow are taken to be mapped to the codes. For compressed mode by puncturing, only the bits of the input flow not corresponding to bits p are taken to be mapped to the codes, each bit p is removed to ensure creation the gap required by the compressed mode, as described below. Bits on first PhCH after physical channel segmentation: u1, k = xi, f(k) k = 1, 2 , ..., U Bits on second PhCH after physical channel segmentation: u2, k = xi, f(k+U) k = 1, 2 , ..., U ... Bits on the Pth PhCH after physical channel segmentation: uP, k = xi, f(k+(P-1) U) k = 1, 2 , ..., U where f is such that : for modes other than compressed mode by puncturing, xi, f(k) = xi, k , i.e. f(k) = k, for all k. for compressed mode by puncturing, bit u1,1 corresponds to the bit xi,k with smallest index k when the bits p are not counted, bit u1,2 corresponds to the bit xi,k with second smallest index k when the bits p are not counted, and so on for bits u1,3, ... u1,V, u2, 1, u2, 2, ...u2, V, ...uP,1, uP,2,... uP,V , 4.2.10.1 Relation between input and output of the physical segmentation block in uplink s1 , s2 , s3 ,, sS . Hence, xk = sk and Y = S. The bits input to the physical segmentation are denoted by 4.2.10.2 Relation between input and output of the physical segmentation block in downlink w1 , w2 , w3 ,, w( PU ) . Hence, xk = wk and Y = PU. The bits input to the physical segmentation are denoted by 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 u p1 , u p 2 , u p 3 ,, u pU , where p is PhCH number and U is 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. ETSI 3G TS 25.212 version 3.2.0 Release 1999 42 ETSI TS 125 212 V3.2.0 (2000-03) (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. u p 30 u p 60 u p , ( R2 30 ) u p1 u p 31 u p , (( R2 -1)30 +1) u p2 u p 32 u p , (( R2 -1) 30 + 2) u p3 u p 33 u p , (( R2 -1)30 + 3) (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 the j-th permuted column. After permutation of the columns, the bits are denoted by ypk. y p1 y p2 y pR2 y p , ( R2 +1) y p , ( R2 + 2) y p , ( 2 R2 ) y p , ( 2 R2 +1) y p , ( 29 R2 +1) y p , ( 2 R2 + 2) y p , ( 29 R2 + 2 ) y p , (3 R2 ) y p , ( 30 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 ypk that corresponds to bits upk with k>U are removed from the output. The bits after 2nd interleaving are denoted by v p1 , v p 2 ,, v pU , where vp1 corresponds to the bit ypk with smallest index k after pruning, vp2 to the bit ypk with second smallest index k after pruning, and so on. Table 6 Number of column C2 30 Inter-column permutation pattern {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 v p1 , v p 2 ,, v pU , where p is the PhCH number and U is the number of bits in one radio frame for one PhCH. The bits vpk are mapped to the PhCHs so that the bits for each PhCH are transmitted over the air in ascending order with respect to k. In compressed mode, no bits are mapped to certain slots of the PhCH(s). If Nfirst + TGL 15, no bits are mapped to slots Nfirst to Nlast. If Nfirst + 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 slots Nfirst, Nfirst+1, Nfirst+2, ..., 14. In the second radio frame, no bits are mapped to the slots 0, 1, 2, ..., Nlast. TGL, Nfirst, and Nlast are defined in subclause 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 off during consecutive slots of the radio frame. ETSI 3G TS 25.212 version 3.2.0 Release 1999 43 ETSI TS 125 212 V3.2.0 (2000-03) 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. During compressed mode by reducing the spreading factor by 2, no bits are mapped to the DPDCH field as follows: If Nfirst + TGL 15, i.e. the transmission gap spans one radio frame, if Nfirst + 7 14 no bits are mapped to slots Nfirst,Nfirst + 1, Nfirst +2,..., Nlast + (7 - TGL) no bits are mapped to the first (NData1+ NData2)/2 bit positions of slot Nlast + (8 - TGL) else no bits are mapped to slots Nfirst, Nfirst + 1, Nfirst + 2,..., 14 no bits are mapped to slots Nfirst - 1, Nfirst - 2, Nfirst - 3, ..., Nfirst - (7 - TGL - (14 - Nlast)) no bits are mapped to the last (NData1+ NData2)/2 bit positions of slot Nfirst - (8 - TGL - (14 - Nlast)) end if If Nfirst + TGL > 15, i.e. the transmission gap spans two consecutive radio frames, In the first radio frame, no bits are mapped to last (NData1+ NData2)/2 bit positions in slot 7 as well as to slots 8, 9, 10, ..., 14. In the second radio frame, no bits are mapped to slots 0, 1, 2, ..., 6 as well as to first (NData1+ NData2)/2 bit positions in slot 7. NData1and NData2 are defined in [2]. 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 positions of 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 the transport 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 subclause those restrictions are given with layer 1 notation. 4.2.13.1 Uplink Dedicated channel (DCH) The maximum value of the number of TrCHs I in 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.2 - Random Access Channel (RACH) There can only be one TrCH in each RACH CCTrCH, i.e. I=1, sk = f1k and S = V1. The maximum value of the number of transport blocks M1 on the transport channel is given from the UE capability class. The transmission time interval is either 10 ms or 20 ms. Only one PRACH is used, i.e. P=1, u1k = sk, and U = S. ETSI 3G TS 25.212 version 3.2.0 Release 1999 44 ETSI TS 125 212 V3.2.0 (2000-03) 4.2.13.3 - Common Packet Channel (CPCH) The maximum value of the number of TrCHs I in 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. Only the data part of the CPCH can be mapped on multiple physical channels (this note is taken from TS 25.302). NOTE: 4.2.13.4 Downlink Dedicated Channel (DCH) The maximum value of the number of TrCHs I in 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. The maximum value of the number of TrCHs I in a CCTrCH, the maximum value of the number of transport blocks MI 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 TrCHs I in a CCTrCH and the maximum value of the number of transport blocks Mi 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, and mapping 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 shall have co-ordinated timings. When the TFCS of a CCTrCH is changed because one or more transport channels are added to the CCTrCH or reconfigured within the CCTrCH, or removed from the CCTrCH, the change may only be made at the start of a radio frame with CFN fulfilling the relation CFN mod Fmax = 0, where Fmax denotes the maximum number of radio frames within the transmission time intervals of all transport channels which are multiplexed into the same CCTrCH, including any transport channels i which are added, reconfigured or have been removed, and CFN denotes the connection frame number of the first radio frame of the changed CCTrCH. After addition or reconfiguration of a transport channel i within a CCTrCH, the TTI of transport channel i may only start in radio frames with CFN fulfilling the relation: CFNi mod Fi = 0. ETSI 3G TS 25.212 version 3.2.0 Release 1999 45 ETSI TS 125 212 V3.2.0 (2000-03) 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 4.2.14.1.1 Allowed CCTrCH combinations for one UE 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 typeThe allowed combination of CCTrCHs of dedicated and common type are given from UE radio access capabilities. There can be a maximum on one CCTrCH of common type for DSCH and a maximum of one CCTrCH of common type for FACH. With one CCTrCH of common type for DSCH, there shall be at least one CCTrCH of dedicated type. 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.3 Transport format detection If the transport format set of a TrCH i contains more than one transport format, the transport format can be detected according to one of the following methods: TFCI based detection: This method is applicable when the transport format combination is signalled using the TFCI field; explicit blind detection: This method typically consists of detecting the TF of TrCH i by use of channel decoding and CRC check; guided detection: This method is applicable when there is at least one other TrCH i', hereafter called guiding TrCH, such that: the guiding TrCH has the same TTI duration as the TrCH under consideration, i.e. Fi' = Fi; different TFs of the TrCH under consideration correspond to different TFs of the guiding TrCH; explicit blind detection is used on the guiding TrCH. ETSI 3G TS 25.212 version 3.2.0 Release 1999 46 ETSI TS 125 212 V3.2.0 (2000-03) If the transport format set for a TrCH i contains one transport format only, no transport format detection needs to be performed for this TrCH. For uplink, blind transport format detection is a network controlled option. For downlink, the UE shall be capable of performing blind transport format detection, if certain restrictions on the configured transport channels are fulfilled. For a DPCH associated with a PDSCH, the DPCCH shall include TFCI. 4.3.1 Blind transport format detection When no TFCI is available then explicit blind detection or guided detection shall be performed on all TrCHs within the CCTrCH that have more than one transport format. The UE shall only be required to support blind transport format detection if all of the following restrictions are fulfilled: 1. the number of CCTrCH bits received per radio frame is 600 or less; 2. the number of transport format combinations of the CCTrCH is 64 or less; 3. fixed positions of the transport channels is used on the CCTrCH to be detected; 4. convolutional coding is used on all explicitely detected TrCHs; 5. CRC is appended to all transport blocks on all explicitely detected TrCHs; 6. the number of explicitely detected TrCHs is 3 or less; 7. for all explicitely detected TrCHs i, the number of code blocks in one TTI (Ci) shall not exceed 1; 8. the sum of the transport format set sizes of all explicitely detected TrCHs, is 16 or less. The transport format set size is defined as the number of transport formats within the transport format set; 9. there is at least one TrCH that can be used as the guiding transport channel for all transport channels using guided detection. Examples of blind transport format detection methods are given in annex A. 4.3.2 Transport format detection based on TFCI If a TFCI is available, then TFCI based detection shall be applicable to all TrCHs within the CCTrCH. The TFCI informs the receiver about the transport format combination of the CCTrCHs. As soon as the TFCI is detected, the transport format combination, and hence the transport formats of the individual transport channels are known. 4.3.3 Coding of Transport-Format-Combination Indicator (TFCI) 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 9. TFCI (10 bits) a 0 ...a 9 (32,10) sub-code of second order Reed-Muller code TFCI code word b 0 ...b 3 1 Figure 9: 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 length of the TFCI code word is 32 bits. The code words of the (32,10) sub-code of second order Reed-Muller code are linear combination of 10 basis sequences. The basis sequences are as in the following table 7. ETSI 3G TS 25.212 version 3.2.0 Release 1999 47 ETSI TS 125 212 V3.2.0 (2000-03) 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 a0 , 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: bi = (an M i ,n) mod 2 n =0 9 where i=0...31. The output bits are denoted by bk, k = 0, 1, 2, ..., 31. In downlink, when the SF <128 the encoded TFCI code words are repeated yielding 8 encoded TFCI bits per slot in normal mode and 16 encoded TFCI bits per slot in compressed mode. Mapping of repeated bits to slots is explained in subclause 4.3.5. 4.3.4 Operation of Transport-Format-Combination Indicator (TFCI) in Split Mode If one of the DCH is associated with a DSCH, the TFCI code word may be split in such a way that the code word relevant for TFCI activity indication is not transmitted from every cell. The use of such a functionality shall be indicated by higher layer signalling. 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 10. ETSI 3G TS 25.212 version 3.2.0 Release 1999 48 ETSI TS 125 212 V3.2.0 (2000-03) TFCI (5 bits) a 1,0 ...a 1,4 (16,5) bi-orthgonal code TFCI code word b 0 ,b 2 ...b 3 0 TFCI (5 bits) a 2,0 ...a 2,4 (16,5) bi-orthgonal code TFCI code word b 1 ,b 3 ...b 3 1 Figure 10: Channel coding of split mode 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 a first set of TFCI information bits as a1,0 , a1,1 , a1,2 , a1,3 , a1,4 (a1,0 is LSB and a1,4 is MSB). This set of 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 DCH CCTrCH in the associated DPCH radio frame. Let's define a second set of TFCI information bits as a2,0 , a2,1 , a2,2 , a2,3 , a2,4 (a2,0 is LSB and a2,4 is MSB). This set of 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 associated DSCH CCTrCH in the corresponding PDSCH radio frame. The output code word bits bk are given by: b2i = (a1,n M i,n) mod 2 ; n=0 4 b2i+1 = (a2,n M i,n) mod 2 n=0 4 where i=0...15, j=0,1. The output bits are denoted by bk, k = 0, 1, 2, ..., 31. 4.3.5 4.3.5.1 Mapping of TFCI words Mapping of TFCI word in non compressed mode The bits of the code word are directly mapped to the slots of the radio frame. Within a slot the bit with lower index is transmitted before the bit with higher index. The coded bits bk, are mapped to the transmitted TFCI bits dk, according to the following formula: dk = bk mod 32 ETSI 3G TS 25.212 version 3.2.0 Release 1999 49 ETSI TS 125 212 V3.2.0 (2000-03) For uplink physical channels regardless of the SF and downlink physical channels, if SF128, k = 0, 1, 2, ..., 29. NOTE: This means that bits b30 and b31 are not transmitted. For downlink physical channels whose SF<128, k = 0, 1, 2, ..., 119. Note that this means that bits b0 to b23 are transmitted four times and bits b24 to b31 are transmitted three times. 4.3.5.2 Mapping of TFCI in compressed mode The mapping of the TFCI bits in compressed mode is different for uplink, downlink with SF128 and downlink with SF<128. 4.3.5.2.1 Uplink compressed mode For uplink compressed mode, the slot format is changed so that no TFCI bits are lost. The different slot formats in compressed mode do 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 and the number of bits in the TFCI field in a slot by NTFCI. Denote by E the first bit to be repeated, E=NfirstNTFCI. If Nlast14, then E corresponds to the number of the first TFCI bit in the slot directly after the TG. The following relations then define the mapping. dk = bk mod 32 where k = 0, 1, 2, ..., min (31, D-1). If D > 32, the remaining positions are filled by repetition (in reversed order): dD-k-1 = b(E+k) mod 32 where k = 0, ..., D-33. 4.3.5.2.2 Downlink compressed mode For downlink compressed mode, the slot format is changed so that no TFCI bits are lost. The different slot formats in compressed mode do not match the exact number of TFCI bits for all possible TGLs. DTX is therefore used if the number of TFCI fields exceeds the number of TFCI bits. The block of fields, where DTX is used, starts on the first field after the gap. If there are fewer TFCI fields after the gap than DTX bits, the last fields before of the gap are also filled with DTX. Denote the number of bits available in the TFCI fields of one compressed radio frame by D and the number of bits in the TFCI field in a slot by NTFCI. Denote by E the first bit to be repeated. E = NfirstNTFCI, if Nfirst + TGL 15, else E = 0 If the transmission gap does not extend to the end of the frame then E corresponds to the number of the first TFCI bit in the slot directly after the TG. Denote the total number of TFCI bits to be transmitted by Ntot. If SF 128 then Ntot = 32, else Ntot = 128. The following relations then define the mapping: dk = b(k mod 32) where k = 0, 1, 2, ..., min (E, Ntot)-1 and, if E< Ntot, dk+D-Ntot = b(k mod 32) where k = E, ..., Ntot -1. DTX bits are sent on dk where k = min (E, Ntot), ..., min (E, Ntot) +D - Ntot -1. ETSI 3G TS 25.212 version 3.2.0 Release 1999 50 ETSI TS 125 212 V3.2.0 (2000-03) 4.4 Compressed mode In compressed mode, TGL slots from Nfirst to Nlast are not used for transmission of data. As illustrated in figure 11, the instantaneous transmit power is increased in the compressed frame in order to keep the quality (BER, FER, etc.) unaffected by the reduced processing gain. The amount of power increase depends on the transmission time reduction method (see subclause 4.4.3). What frames are compressed, are decided by the network. When in compressed mode, compressed frames can occur periodically, as illustrated in figure 11, or requested on demand. The rate and type of compressed frames is variable and depends on the environment and the measurement requirements. One frame (10 ms) Transmission gap available for inter-frequency measurements Figure 11: Compressed mode transmission 4.4.1 Frame structure in the uplink The frame structure for uplink compressed mode is illustrated in figure 12. Slot # (Nfirst 1) transmission gap Slot # (Nlast + 1) Data Data Pilot TFCI FBI TPC Pilot TFCI FBI TPC Figure 12: Frame structure in uplink compressed transmission 4.4.2 Frame structure types in the downlink There are two different types of frame structures defined for downlink compressed mode. Type A maximises the transmission gap length and type B is optimised for power control. With frame structure of type A, the pilot field of the last slot in the transmission gap is transmitted. Transmission is turned off during the rest of the transmission gap (figure 13(a)). With frame structure of type B, the TPC field of the first slot in the transmission gap and the pilot field of the last slot in the transmission gap is transmitted. Transmission is turned off during the rest of the transmission gap (figure 13(b)). ETSI 3G TS 25.212 version 3.2.0 Release 1999 51 ETSI TS 125 212 V3.2.0 (2000-03) Slot # (Nfirst - 1) T TF Data1 P CI C transmission gap Slot # (Nlast + 1) T TF PL Data1 P CI C Data2 PL Data2 PL (a) Frame structure type A Slot # (Nfirst - 1) T TF Data1 P CI C transmission gap T P C Slot # (Nlast + 1) T TF PL Data1 P CI C Data2 PL Data2 PL (b) Frame structure type B Figure 13: Frame structure types in downlink compressed transmission 4.4.3 Transmission time reduction method When in compressed mode, the information normally transmitted during a 10 ms frame is compressed in time. The mechanisms provided for achieving this are puncturing, reduction of the spreading factor by a factor of two , and higher layer scheduling. In the downlink, all methods are supported while compressed mode by puncturing is not used in the uplink. The maximum idle length is defined to be 7 slots per one 10 ms frame. The slot formats that are used in compressed mode are listed in [2]. 4.4.3.1 Compressed mode by puncturing During compressed mode, rate matching (puncturing) is applied for creating transmission gap in one frame. The algorithm for rate matching (puncturing) as described in subclause 4.2.7 is used. 4.4.3.2 Compressed mode by reducing the spreading factor by 2 During compressed mode, the spreading factor (SF) can be reduced by 2 during one radio frame to enable the transmission of the information bits in the remaining time slots of a compressed frame. On the downlink, UTRAN can also order the UE to use a different scrambling code in compressed mode than in normal mode. If the UE is ordered to use a different scrambling code in compressed mode, then there is a one-to-one mapping between the scrambling code used in normal mode and the one used in compressed mode, as described in TS 25.213[3] subclause 5.2.1. 4.4.3.3 Compressed mode by higher layer scheduling Compressed mode can be obtained by higher layer scheduling. Higher layers then set restrictions so that only a subset of the allowed TFCs are used in compressed mode. The maximum number of bits that will be delivered to the physical layer during the compressed radio frame is then known and a transmission gap can be generated. Note that in the downlink, the TFCI field is expanded on the expense of the data fields and this shall be taken into account by higher layers when setting the restrictions on the TFCs. Compressed mode by higher layer scheduling shall not be used with fixed starting positions of the TrCHs in the radio frame. 4.4.4 Transmission gap position Transmission gaps can be placed at different positions as shown in figures 14 and 15 for each purpose such as interfrequency power measurement, acquisition of control channel of other system/carrier, and actual handover operation. When using single frame method, the transmission gap is located within the compressed frame depending on the transmission gap length (TGL) as shown in figure 14 (1). When using double frame method, the transmission gap is located on the center of two connected frames as shown in figure 14 (2). ETSI 3G TS 25.212 version 3.2.0 Release 1999 52 ETSI TS 125 212 V3.2.0 (2000-03) Transmission gap Radio frame #0 #Nfirst-1 #Nlast+1 #14 (1) Single-frame method Transmission gap First radio frame Second radio frame #0 #Nfirst-1 #Nlast+1 (2) Double-frame method Figure 14: Transmission gap position #14 Parameters of the transmission gap positions are calculated as follows. TGL is the number of consecutive idle slots during the compressed mode transmission gap: TGL = 3, 4, 5, 7, 10, 14 Nfirst specifies the starting slot of the consecutive idle slots, Nfirst = 0,1,2,3,...,14. Nlast shows the number of the final idle slot and is calculated as follows; If Nfirst + TGL 15, then Nlast = Nfirst + TGL 1 ( in the same frame ), If Nfirst + TGL > 15, then Nlast = (Nfirst + TGL 1) mod 15 ( in the next frame ). When the transmission gap spans two consecutive radio frames, Nfirst and TGL must be chosen so that at least 8 slots in each radio frame are transmitted. ETSI 3G TS 25.212 version 3.2.0 Release 1999 53 ETSI TS 125 212 V3.2.0 (2000-03) Transmission gap Transmission gap Transmission gap Radio frame (1) Single-frame method Transmission gap First radio frame Second radio frame : : Transmission gap : : Transmission gap Radio frame (2) Double-frame method Figure 15: Transmission gap positions with different Nfirst 4.4.5 Parameters for downlink compressed mode Table 9 shows the detailed parameters for each transmission gap length for the different transmission time reduction methods. ETSI 3G TS 25.212 version 3.2.0 Release 1999 54 ETSI TS 125 212 V3.2.0 (2000-03) Table 9: Parameters for compressed mode TGL 3 4 5 Frame Type A B A B A B A B A B A B Spreading Factor 512 4 256 - 4 512 - 4 256 - 4 512 - 4 256 - 4 512 -4 256 - 4 512 - 4 256 - 4 512 - 4 256 - 4 Idle length [ms] 1.73-1.99 1.60-1.86 2.40-2.66 2.27-2.53 3.07-3.33 2.94-3.20 4.40-4.66 4.27-4.53 6.40-6.66 6.27-6.53 9.07-9.33 8.93-9.19 Transmission time Reduction method Puncturing, Spreading factor division by 2 or Higher layer scheduling Idle frame Combining (S) (D) =(1,2) or (2,1) (S) (D) =(1,3), (2,2) or (3,1) (S) (D) = (1,4), (2,3), (3, 2) or (4,1) (S) (D)=(1,6), (2,5), (3,4), (4,3), (5,2) or (6,1) (D)=(3,7), (4,6), (5,5), (6,4) or (7,3) (D) =(7,7) 7 10 14 (S): (D): Single-frame method as shown in figure 14 (1). Double-frame method as shown in figure 14 (2). (x,y) indicates x: the number of idle slots in the first frame, y: the number of idle slots in the second frame. Compressed mode by spreading factor reduction is not supported when SF=4 is used in normal mode. NOTE: ETSI 3G TS 25.212 version 3.2.0 Release 1999 55 ETSI TS 125 212 V3.2.0 (2000-03) Annex A (informative): Blind transport format detection A.1 A.1.1 Blind transport format detection using fixed positions Blind transport format detection using received power ratio For the dual transport format case (the possible data rates are 0 and full rate, and CRC is only transmitted for full rate), blind transport format detection using received power ratio can be used. The transport format detection is then done using average received power ratio of DPDCH to DPCCH. Define the following: Pc: Received power per bit of DPCCH calculated from all pilot and TPC bits per slot over a radio frame; Pd: Received power per bit of DPDCH calculated from X bits per slot over a radio frame; X: the number of DPDCH bits per slot when transport format corresponds to full rate; T: Threshold of average received power ratio of DPDCH to DPCCH for transport format detection. The decision rule can then be formulated as: If Pd/Pc >T then: else zero rate transport format detected. full rate transport format detected; A.1.2 Blind transport format detection using CRC For the multiple transport format case (the possible data rates are 0, ..., (full rate)/r, ..., full rate, and CRC is transmitted for all transport formats), blind transport format detection using CRC can be used. At the transmitter, the data stream with variable number of bits from higher layers is block-encoded using a cyclic redundancy check (CRC) and then convolutionally encoded. CRC parity bits are attached just after the data stream with variable number of bits as shown in figure A.1. The receiver knows only the possible transport formats (or the possible end bit position {nend}) by Layer-3 negotiation. The receiver performs Viterbi-decoding on the soft decision sample sequence. The correct trellis path of the Viterbidecoder ends at the zero state at the correct end bit position. The blind transport format detection method using CRC traces back the surviving trellis path ending at the zero state (hypothetical trellis path) at each possible end bit position to recover the data sequence. For each recovered data sequence error-detection is performed by checking the CRC, and if there is no error, the recovered sequence is declared to be correct. The following variable is defined: s(nend) = - 10 log ( (a0(nend) amin(nend) ) / (amax(nend)-amin(nend) ) ) [dB] (Eq. 1) where amax(nend) and amin(nend) are the maximum and minimum path-metric values among all survivors at end bit position nend, and a0(nend) is the path-metric value at zero state. ETSI 3G TS 25.212 version 3.2.0 Release 1999 56 ETSI TS 125 212 V3.2.0 (2000-03) In order to reduce the probability of false detection (this happens if the selected path is wrong but the CRC misses the error detection), a path selection threshold D is introduced. The threshold D determines whether the hypothetical trellis path connected to the zero state should be traced back or not at each end bit position nend. If the hypothetical trellis path connected to the zero state that satisfies: s(nend) D (Eq. 2) is found, the path is traced back to recover the frame data, where D is the path selection threshold and a design parameter. If more than one end bit positions satisfying Eq. 2 is found, the end bit position which has minimum value of s(nend) is declared to be correct. If no path satisfying Eq. 2 is found even after all possible end bit positions have been exhausted, the received frame data is declared to be in error. Figure A-2 shows the procedure of blind transport format detection using CRC. Possible end bit positions nend nend = 1 nend = 2 nend = 3 nend = 4 Data with variable number of bits CRC Empty Figure A.1: An example of data with variable number of bits. Four possible transport formats, and transmitted end bit position nend = 3 A.2 Blind transport format detection with flexible positions In certain cases where the CCTrCH consists of multiple transport channels and a small number of transport format combinations are allowed, it is possible to allow blind transport format detection with flexible positions. Several examples for how the blind transport format detection with flexible positions might be performed are: the blind transport format detection starts at a fixed position and identifies the transport format of the first present transport channel and stops. The position of the other transport channels and their transport format being derived on the basis of the allowed transport format combinations, assuming that there is a one to one relationship between the transport format combination and the transport format of the first present transport channel; the blind rate detection evaluates all transport format combinations and picks the most reliable one. - ETSI 3G TS 25.212 version 3.2.0 Release 1999 57 ETSI TS 125 212 V3.2.0 (2000-03) START nend = 1 Smin = D nend' = 0 Viterbi decoding (ACS operation) to end bit position nend Calculation of S(nend) nend = nend + 1 No Is nend the maximum value? Yes Path selection S(nend) =< D Tracing back from end bit position nend Calculation of CRC parity for recovered data S(nend) > D Output detected end bit position nend' * END CRC OK Comparison of S(nend) NG * If the value of detected nend' is "0", the received frame data is declared to be in error. Smin =< S(nend) Smin > S(nend) Smin = S(nend) nend' = nend Figure A.2: Basic processing flow of blind transport format detection ETSI 3G TS 25.212 version 3.2.0 Release 1999 58 ETSI TS 125 212 V3.2.0 (2000-03) Annex B (informative): Change history Change history Date 14/01/00 14/01/00 14/01/00 14/01/00 14/01/00 14/01/00 14/01/00 14/01/00 14/01/00 14/01/00 14/01/00 14/01/00 14/01/00 14/01/00 14/01/00 14/01/00 14/01/00 31/03/00 31/03/00 31/03/00 31/03/00 31/03/00 31/03/00 31/03/00 31/03/00 31/03/00 31/03/00 31/03/00 31/03/00 31/03/00 31/03/00 31/03/00 31/03/00 31/03/00 31/03/00 31/03/00 31/03/00 31/03/00 31/03/00 31/03/00 TSG # RAN_05 RAN_06 RAN_06 RAN_06 RAN_06 RAN_06 RAN_06 RAN_06 RAN_06 RAN_06 RAN_06 RAN_06 RAN_06 RAN_06 RAN_06 RAN_06 RAN_06 RAN_07 RAN_07 RAN_07 RAN_07 RAN_07 RAN_07 RAN_07 RAN_07 RAN_07 RAN_07 RAN_07 RAN_07 RAN_07 RAN_07 RAN_07 RAN_07 RAN_07 RAN_07 RAN_07 RAN_07 TSG Doc. RP-99588 RP-99680 RP-99680 RP-99681 RP-99679 RP-99680 RP-99680 RP-99680 RP-99680 RP-99679 RP-99680 RP-99681 RP-99680 RP-99680 RP-99680 RP-99679 RP-99681 RP-000061 RP-000061 RP-000061 RP-000061 RP-000061 RP-000061 RP-000061 RP-000061 RP-000061 RP-000061 RP-000061 RP-000061 RP-000061 RP-000061 RP-000061 RP-000061 RP-000061 RP-000061 RP-000061 RP-000061 CR Rev Subject/Comment Approved at TSG RAN #5 and placed under Change Control 001 3 Correction of rate matching parameters for repetition after 1st unterleaving in 25.212 004 - Changing the initial offset value for convolutional code rate matching 005 1 Introduction of compressed mode by higher layer scheduling 008 - Editorial corrections to TS 25.212 009 - Removal of SFN multiplexing 010 1 Clarification of bit separation and collection 011 2 Connection between TTI and CFN 012 2 Zero length transport blocks 014 - Update of channel coding sections 016 - Removal of TrCH restriction in DSCH CCTrCH 017 - 20 ms RACH message length 018 - Minimum SF in UL 024 - Rate matching parameter determination in DL and fixed positions 026 1 Corrections to TS 25.212 027 - Modification of BTFD description in 25.212 Annex 028 - TFCI coding and mapping including compressed mode Change history was added by the editor 025 2 CR for parity bit attachment to 0 bit transport block 029 1 Limitations of blind transport format detection 034 1 Clarification of fixed position rate matching 035 1 Clarification of DL compressed mode 036 - Reconfiguration of TFCS 037 1 Removal of fixed gap position in 25.212 038 2 Definition clarification for TS 25.212 039 1 Clarification on TFCI coding input 041 2 Correction of UL compressed mode by higher layer scheduling 042 5 Downlink Compressed Mode by puncturing 044 - Modification of Turbo code internal interleaver 045 - Editorial corrections 046 - SF/2 method: DTX insertion after 2nd interleaver 047 1 TFCI coding for FDD 048 - Mapping of TFCI in downlink compressed mode 049 - Editorial changes to Annex A 050 - Removal of rate matching attribute setting for RACH 052 - Padding Function for Turbo coding of small blocks 055 2 Clarifications relating to DSCH 056 - Editorial modification of uplink shifting parameter calculation for turbo code puncturing 059 1 Revision: Editorial correction to the calculation of Rate Matching parameters 060 1 Editorial changes of channel coding section 061 - Removal of DL compressed mode by higher layer scheduling with fixed positions Old 3.0.0 3.0.0 3.0.0 3.0.0 3.0.0 3.0.0 3.0.0 3.0.0 3.0.0 3.0.0 3.0.0 3.0.0 3.0.0 3.0.0 3.0.0 3.0.0 3.1.0 3.1.1 3.1.1 3.1.1 3.1.1 3.1.1 3.1.1 3.1.1 3.1.1 3.1.1 3.1.1 3.1.1 3.1.1 3.1.1 3.1.1 3.1.1 3.1.1 3.1.1 3.1.1 3.1.1 3.1.1 3.1.1 3.1.1 3.1.1 New 3.0.0 3.1.0 3.1.0 3.1.0 3.1.0 3.1.0 3.1.0 3.1.0 3.1.0 3.1.0 3.1.0 3.1.0 3.1.0 3.1.0 3.1.0 3.1.0 3.1.0 3.1.1 3.2.0 3.2.0 3.2.0 3.2.0 3.2.0 3.2.0 3.2.0 3.2.0 3.2.0 3.2.0 3.2.0 3.2.0 3.2.0 3.2.0 3.2.0 3.2.0 3.2.0 3.2.0 3.2.0 3.2.0 3.2.0 3.2.0 3.2.0 RAN_07 RP-000062 RAN_07 RP-000062 RAN_07 RP-000062 ETSI 3G TS 25.212 version 3.2.0 Release 1999 59 ETSI TS 125 212 V3.2.0 (2000-03) History Document history V3.2.0 March 2000 Publication ETSI ...
View Full Document

This note was uploaded on 04/20/2008 for the course COMM 125563 taught by Professor Anwar during the Spring '08 term at Air Force Institute of Technology, Ohio.

Ask a homework question - tutors are online