ETSI TS V ( ) Technical Specification

Transcription

1 TS V ( ) Technical Specification Universal Mobile Telecommunications System (UMTS); Multiplexing and channel coding (FDD) (3GPP TS version Release 10)

2 1 TS V ( ) Reference RTS/TSGR va10 Keywords UMTS 650 Route des Lucioles F Sophia Antipolis Cedex - FRANCE Tel.: Fax: Siret N NAF 742 C Association à but non lucratif enregistrée à la Sous-Préfecture de Grasse (06) N 7803/88 Important notice Individual copies of the present document can be downloaded from: 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 printers of the PDF version kept on a specific network drive within 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 documents is available at If you find errors in the present document, please send your comment to one of the following services: 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 All rights reserved. DECT TM, PLUGTESTS TM, UMTS TM, TIPHON TM, the TIPHON logo and the logo are Trade Marks of registered for the benefit of its Members. 3GPP TM is a Trade Mark of registered for the benefit of its Members and of the 3GPP Organizational Partners. LTE is a Trade Mark of currently being registered for the benefit of its Members and of the 3GPP Organizational Partners. GSM and the GSM logo are Trade Marks registered and owned by the GSM Association.

3 2 TS V ( ) Intellectual Property Rights IPRs essential or potentially essential to the present document may have been declared to. The information pertaining to these essential IPRs, if any, is publicly available for members and non-members, and can be found in SR : "Intellectual Property Rights (IPRs); Essential, or potentially Essential, IPRs notified to in respect of standards", which is available from the Secretariat. Latest updates are available on the Web server ( Pursuant to the IPR Policy, no investigation, including IPR searches, has been carried out by. No guarantee can be given as to the existence of other IPRs not referenced in SR (or the updates on the Web server) which are, or may be, or may become, essential to the present document. Foreword This Technical Specification (TS) has been produced by 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 deliverables. The cross reference between GSM, UMTS, 3GPP and identities can be found under

4 3 TS V ( ) Contents Intellectual Property Rights... 2 Foreword... 2 Foreword Scope References Definitions, symbols and abbreviations Definitions Symbols Abbreviations Multiplexing, channel coding and interleaving General General coding/multiplexing of TrCHs CRC attachment CRC Calculation Relation between input and output of the CRC attachment block Transport block concatenation and code block segmentation Concatenation of transport blocks Code block segmentation Channel coding Convolutional coding Turbo coding Turbo coder Trellis termination for Turbo coder Turbo code internal interleaver Concatenation of encoded blocks Radio frame size equalisation st interleaving Void st interleaver operation Relation between input and output of 1 st interleaving in uplink Relation between input and output of 1 st interleaving in downlink Radio frame segmentation Relation between input and output of the radio frame segmentation block in uplink Relation between input and output of the radio frame segmentation block in downlink Rate matching Determination of rate matching parameters in uplink Determination of SF and number of PhCHs needed Determination of rate matching parameters in downlink Determination of rate matching parameters for fixed positions of TrCHs Determination of rate matching parameters for flexible positions of TrCHs Bit separation and collection in uplink Bit separation Bit collection Bit separation and collection in downlink Bit separation Bit collection Rate matching pattern determination TrCH multiplexing Insertion of discontinuous transmission (DTX) indication bits st insertion of DTX indication bits nd insertion of DTX indication bits Physical channel segmentation Relation between input and output of the physical segmentation block in uplink... 42

5 4 TS V ( ) Relation between input and output of the physical segmentation block in downlink nd interleaving nd interleaving for Secondary CCPCH with 16QAM Physical channel mapping Uplink Downlink Restrictions on different types of CCTrCHs Uplink Dedicated channel (DCH) Random Access Channel (RACH) Void Downlink Dedicated Channel (DCH) Void Broadcast channel (BCH) Forward access and paging channels (FACH and PCH) High Speed Downlink Shared Channel (HS-DSCH) associated with a DCH Enhanced Dedicated Channel (E-DCH) Multiplexing of different transport channels into one CCTrCH, and mapping of one CCTrCH onto physical channels Allowed CCTrCH combinations for one UE Allowed CCTrCH combinations on the uplink Allowed CCTrCH combinations on the downlink Transport format detection Blind transport format detection a Single transport format detection Transport format detection based on TFCI Coding of Transport-Format-Combination Indicator (TFCI) Void Mapping of TFCI words Mapping of TFCI word in normal mode Mapping of TFCI bits for Secondary CCPCH with 16QAM Mapping of TFCI word in compressed mode Uplink compressed mode Downlink compressed mode Compressed mode Frame structure in the uplink Frame structure types in the downlink A Frame structure in the downlink for F-DPCH Transmission time reduction method Void Compressed mode by reducing the spreading factor by Compressed mode by higher layer scheduling Transmission gap position Transmission gap position for E-DCH E-DPDCH Transmission Gap Position during Initial Transmissions E-DPDCH Transmission Gap Position during Retransmissions E-DPCCH Transmission Gap Position Coding for HS-DSCH CRC attachment for HS-DSCH CRC attachment method 1 for HS-DSCH CRC attachment method 2 for HS-DSCH a Bit scrambling for HS-DSCH Code block segmentation for HS-DSCH Channel coding for HS-DSCH Hybrid ARQ for HS-DSCH HARQ bit separation HARQ First Rate Matching Stage HARQ Second Rate Matching Stage HARQ bit collection Physical channel segmentation for HS-DSCH Interleaving for HS-DSCH Constellation re-arrangement for 16 QAM and 64QAM Physical channel mapping for HS-DSCH... 63

6 5 TS V ( ) 4.6 Coding for HS-SCCH type Overview HS-SCCH information field mapping Redundancy and constellation version coding Modulation scheme mapping Channelization code-set mapping UE identity mapping HARQ process identifier mapping Transport block size index mapping Multiplexing of HS-SCCH information CRC attachment for HS-SCCH Channel coding for HS-SCCH Rate matching for HS-SCCH UE specific masking for HS-SCCH Physical channel mapping for HS-SCCH A Coding for HS-SCCH type A.1 Overview A.2 HS-SCCH Type 2 information field mapping A.2.1 The first transmission A.2.2 The second and the third transmissions A Special Information mapping A Transport-block size information mapping A Pointer to the previous transmission mapping A Second or third transmission mapping A Redundancy and Constellation Version mapping A Modulation scheme mapping A Channelization code-set mapping A UE identity mapping A.3 Multiplexing of HS-SCCH Type 2 information A.4 CRC attachment for HS-SCCH Type A.5 Channel coding for HS-SCCH Type A.6 Rate matching for HS-SCCH Type A.7 UE specific masking for HS-SCCH Type A.8 Physical channel mapping for HS-SCCH Type B Coding for HS-SCCH type B.1 Overview B.2 HS-SCCH type 3 information field mapping B.2.1 Redundancy and constellation version coding B.2.2 Modulation scheme and number of transport blocks mapping B.2.3 Channelization code-set mapping B.2.4 UE identity mapping B.2.5 HARQ process identifier mapping B.2.6 Transport block size index mapping B.2.7 Precoding Weight Information mapping B.3 Multiplexing of HS-SCCH type 3 information B.4 CRC attachment for HS-SCCH type B.5 Channel coding for HS-SCCH type B.6 Rate matching for HS-SCCH type B.7 UE specific masking for HS-SCCH type B.8 Physical channel mapping for HS-SCCH type C Coding for HS-SCCH orders C.1 Overview C.2 HS-SCCH Order information field mapping C.2.1 Order type mapping C.2.2 Order mapping C Orders for activation and deactivation of DTX, DRX and HS-SCCH-less operation and for HS-DSCH serving cell change C Orders for activation and deactivation of Secondary serving HS-DSCH cells and Secondary uplink frequency C.2.3 UE identity mapping Coding for HS-DPCCH Overview... 79

7 6 TS V ( ) Channel coding for HS-DPCCH when the UE is not configured in MIMO mode in the serving HS- DSCH cell and Secondary_Cell_Enabled is 0 or 1 and Secondary_Cell_Active is Channel coding for HS-DPCCH HARQ-ACK Channel coding for HS-DPCCH channel quality indication Channel coding for HS-DPCCH when the UE is configured in MIMO mode in the serving HS- DSCH cell and Secondary_Cell_Enabled is Channel coding for HS-DPCCH HARQ-ACK Channel coding for HS-DPCCH composite precoding control indication and channel quality indication Bit mapping of Type A channel quality indication Bit mapping of Type B channel quality indication Bit mapping of precoding control indication Composite precoding control indication and channel quality indication bits Block encoding of composite precoding control indication and channel quality indication bits A Channel coding for HS-DPCCH when the UE is not configured in MIMO mode in any cell and Secondary_Cell_Enabled is 1 and Secondary_Cell_Active is A.1 Channel coding for the composite HS-DPCCH HARQ-ACK A.2 Channel coding for HS-DPCCH composite channel quality indication A.2.1 Composite channel quality indication bits A.2.2 Block encoding of composite channel quality indication bits B Channel coding for HS-DPCCH when Secondary_Cell_Enabled is 3 or when the UE is configured in MIMO mode in at least one cell and Secondary_Cell_Enabled is greater than B.1 Channel coding for the composite HS-DPCCH HARQ-ACK B.2 Channel coding for HS-DPCCH composite precoding control indication and channel quality indication C Channel coding for HS-DPCCH when the UE is not configured in MIMO mode in any cell and Secondary_Cell_Enabled is C.1 Channel coding for the composite HS-DPCCH HARQ-ACK C.2 Channel coding for HS-DPCCH channel quality indication Physical channel mapping for HS-DPCCH Physical Channel mapping for HS-DPCCH HARQ-ACK Physical Channel mapping for HS-DPCCH PCI/CQI Coding for E-DCH CRC attachment for E-DCH Code block segmentation for E-DCH Channel coding for E-DCH Physical layer HARQ functionality and rate matching for E-DCH Determination of SF, modulation scheme and number of PhCHs needed HARQ bit separation HARQ Rate Matching Stage HARQ bit collection Physical channel segmentation for E-DCH Interleaving for E-DCH Physical channel mapping for E-DCH Coding for E-DPCCH Overview E-DPCCH information field mapping Information field mapping of E-TFCI Information field mapping of retransmission sequence number Information field mapping of the "Happy" bit Multiplexing of E-DPCCH information Channel coding for E-DPCCH Physical channel mapping for E-DPCCH Coding for E-AGCH Overview A E-AGCH information field mapping A.1 Information field mapping of the Absolute Grant Value A.2 Information field mapping of the Absolute Grant Scope B Multiplexing of E-AGCH information CRC attachment for E-AGCH Channel coding for E-AGCH Rate matching for E-AGCH

8 7 TS V ( ) Physical channel mapping for E-AGCH Mapping for E-RGCH Relative Grant Overview Relative Grant mapping Mapping for E-HICH ACK/NACK Overview ACK/NACK mapping Annex A (informative): Blind transport format detection A.1 Blind transport format detection using fixed positions A.1.1 Blind transport format detection using received power ratio A.1.2 Blind transport format detection using CRC Annex B (informative): Compressed mode idle lengths B.1 Idle lengths for DL, UL and DL+UL compressed mode for DPCH Annex C (informative): Change history History

9 8 TS V ( ) Foreword This Technical Specification (TS) has been produced by the 3 rd 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.

10 9 TS V ( ) 1 Scope The present document describes the characteristics of the Layer 1 multiplexing and channel coding in the FDD mode of UTRA. 2 References The following documents contain provisions which, through reference in this text, constitute provisions of the present document. 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] 3GPP TS : "Physical layer - General Description". [2] 3GPP TS : "Physical channels and mapping of transport channels onto physical channels (FDD)". [3] 3GPP TS : "Spreading and modulation (FDD)". [4] 3GPP TS : "Physical layer procedures (FDD)". [5] 3GPP TS : "Physical layer Measurements (FDD)". [6] 3GPP TS : "Physical channels and mapping of transport channels onto physical channels (TDD)". [7] 3GPP TS : "Multiplexing and channel coding (TDD)". [8] 3GPP TS : "Spreading and modulation (TDD)". [9] 3GPP TS : "Physical layer procedures (TDD)". [10] 3GPP TS : "Physical layer Measurements (TDD)". [11] 3GPP TS : "Services Provided by the Physical Layer". [12] 3GPP TS : "Synchronisation in UTRAN, Stage 2". [13] 3GPP TS : "Radio Resource Control (RRC); Protocol Specification". [14] ITU-T Recommendation X.691 (12/97) "Information technology - ASN.1 encoding rules: Specification of Packed Encoding Rules (PER)" [15] 3GPP TS : "UE Radio Access capabilities". [16] 3GPP TS : "Medium Access Control (MAC) protocol specification". 3 Definitions, symbols and abbreviations 3.1 Definitions For the purposes of the present document, the following terms and definitions apply:

11 10 TS V ( ) Primary uplink frequency: If a single uplink frequency is configured for the UE, then it is the primary uplink frequency. In case more than one uplink frequency is configured for the UE, then the primary uplink frequency is the frequency on which the E-DCH corresponding to the serving E-DCH cell associated with the serving HS-DSCH cell is transmitted. The association between a pair of uplink and downlink frequencies is indicated by higher layers. Secondary uplink frequency: A secondary uplink frequency is a frequency on which an E-DCH corresponding to a serving E-DCH cell associated with a secondary serving HS-DSCH cell is transmitted. The association between a pair of uplink and downlink frequencies is indicated by higher layers. 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 N first and N last 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]. TrCH number: The transport channel number identifies a TrCH in the context of L1. The L3 transport channel identity (TrCH ID) maps onto the L1 transport channel number. The mapping between the transport channel number and the TrCH ID is as follows: TrCH 1 corresponds to the TrCH with the lowest TrCH ID, TrCH 2 corresponds to the TrCH with the next lowest TrCH ID and so on. 1 st secondary serving HS-DSCH cell: If the UE is configured with two uplink frequencies, the 1 st secondary serving HS-DSCH cell is the secondary serving HS-DSCH cell that is associated with the secondary uplink frequency. If the UE is configured with a single uplink frequency, the 1 st secondary serving HS-DSCH cell is a secondary serving HS- DSCH cell whose index is indicated by higher layers. 2 nd secondary serving HS-DSCH cell: If the UE is configured with more than two serving HS-DSCH cells, the 2 nd secondary serving HS-DSCH cell is a secondary serving HS-DSCH cell whose index is indicated by higher layers. 3 rd secondary serving HS-DSCH cell: If the UE is configured with four serving HS-DSCH cells, the 3rd secondary serving HS-DSCH cell is a secondary serving HS-DSCH cell whose index is indicated by higher layers. 3.2 Symbols For the purposes of the present document, the following symbols apply: x round towards, i.e. integer such that x x < x+1 x round towards -, i.e. integer such that x-1 < x x x absolute value of x sgn(x) N first N last N tr signum function, i.e. 1; sgn( x ) = 1; x 0 x < 0 The first slot in the TG, located in the first compressed radio frame if the TG spans two frames. The last slot in the TG, located in the second compressed radio frame if the TG spans two frames. 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 TrCH number j TFC number k Bit number l TF number m Transport block number n i Radio frame number of TrCH i. p PhCH number r Code block number I Number of TrCHs in a CCTrCH. C i Number of code blocks in one TTI of TrCH i. F i Number of radio frames in one TTI of TrCH i. M i Number of transport blocks in one TTI of TrCH i.

12 11 TS V ( ) N data,j Number of data bits that are available for the CCTrCH in a radio frame with TFC j. cm N data, j Number of data bits that are available for the CCTrCH in a compressed radio frame with TFC j. P Number of PhCHs used for one CCTrCH. PL Puncturing Limit for the uplink. Signalled from higher layers RM i Rate Matching attribute for TrCH i. Signalled from higher layers. Temporary variables, i.e. variables used in several (sub)clauses with different meaning. x, X y, Y z, Z 3.3 Abbreviations For the purposes of the present document, the following abbreviations apply: ARQ BCH BER BLER BS CCPCH CCTrCH CFN CRC DCH DL DPCCH DPCH DPDCH DS-CDMA DTX FACH E-AGCH E-DCH E-DPCCH E-DPDCH E-HICH E-RGCH FDD F-DPCH FER GF HARQ HS-DPCCH HS-DSCH HS-PDSCH HS-SCCH MAC MBSFN Mcps MIMO MS OVSF PCCC PCH PhCH PRACH RACH RSC RV 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 Check Dedicated Channel Downlink (Forward link) Dedicated Physical Control Channel Dedicated Physical Channel Dedicated Physical Data Channel Direct-Sequence Code Division Multiple Access Discontinuous Transmission Forward Access Channel E-DCH Absolute Grant Channel Enhanced Dedicated Channel E-DCH Dedicated Physical Control Channel E-DCH Dedicated Physical Data Channel E-DCH Hybrid ARQ Indicator Channel E-DCH Relative Grant Channel Frequency Division Duplex Fractional Dedicated Physical Channel Frame Error Rate Galois Field Hybrid Automatic Repeat request Dedicated Physical Control Channel (uplink) for HS-DSCH High Speed Downlink Shared Channel High Speed Physical Downlink Shared Channel Shared Control Channel for HS-DSCH Medium Access Control MBMS over a Single Frequency Network Mega Chip Per Second Multiple Input Multiple Output 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 Redundancy Version

13 12 TS V ( ) RX SCH SF SFN SIR SNR TF TFC TFCI TPC TrCH TTI TX UL 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 Multiplexing, channel coding and interleaving 4.1 General Data stream from/to MAC and higher layers (Transport block / Transport block set) is encoded/decoded to offer transport services over the radio transmission link. Channel coding scheme is a combination of error detection, error correcting, rate matching, interleaving and transport channels mapping onto/splitting from physical channels. 4.2 General coding/multiplexing of TrCHs This section only applies to the transport channels: DCH, RACH, BCH, FACH and PCH. Other transport channels which do not use the general method are described separately below. 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}, where 80 ms TTI for DCH shall not be used unless SF=512. 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); - radio frame equalisation (see subclause 4.2.4); - rate matching (see subclause 4.2.7); - insertion of discontinuous transmission (DTX) indication bits (see subclause 4.2.9); - interleaving (two steps, see subclauses and ); - radio frame segmentation (see subclause 4.2.6); - multiplexing of transport channels (see subclause 4.2.8); - physical channel segmentation (see subclause ); - mapping to physical channels (see subclause ). The coding/multiplexing steps for uplink and downlink are shown in figure 1 and figure 2 respectively.

14 13 TS V ( ) a, a im1, aim2, aim3, K ima i CRC attachment b, b im1, bim2, bim3, K o, o ir1, oir 2, oir 3, K imb i TrBk concatenation / Code block segmentation irk i c, c i1, ci 2, ci3, K ie i Channel coding Radio frame equalisation t, t i1, ti2, ti3, K it i 1 st interleaving d, d i1, di2, di3, K it i Radio frame segmentation e, e i1, ei 2, ei3, K in i Rate matching Rate matching f, f i1, fi2, fi3, K iv i TrCH Multiplexing s s, s,, 1, 2 3 K s S u, u p1, u p2, u p3, K v, v p1, v p2, v p3, K Physical channel segmentation pu pu 2 nd interleaving CCTrCH Physical channel mapping PhCH#2 PhCH#1 Figure 1: Transport channel multiplexing structure for uplink

15 14 TS V ( ) a, a im1, aim2, aim3, K ima i b, b im1, bim2, bim3, K o, o ir1, oir 2, oir3, K CRC attachment imb i TrBk concatenation / Code block segmentation irk i c, c i1, ci 2, ci3, K g, g i1, gi2, gi3, K ie i ig i h, h i 1, h i 2, h i 3, K Channel coding Rate matching 1 st insertion of DTX indication id i Rate matching q, q i1, qi2, qi3, K iq i 1 st interleaving Radio frame segmentation f, f i1, fi2, fi3, K s s, s,, 1, 2 3 K s S w w, w,, 1, 2 3 K p1, u p2, u p3, K p1, v p2, v p3, K w R iv i u, u v, v TrCH Multiplexing 2 nd insertion of DTX indication pu pu Physical channel segmentation 2 nd interleaving CCTrCH Physical channel mapping PhCH#2 PhCH#1 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.

16 15 TS V ( ) CRC attachment Error detection is provided on transport blocks through a Cyclic Redundancy Check (CRC). The size of the CRC is 24, 16, 12, 8 or 0 bits and it is signalled from higher layers what CRC size that should be used for each TrCH 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: - g CRC24 (D) = D 24 + D 23 + D 6 + D 5 + D + 1; - g CRC16 (D) = D 16 + D 12 + D 5 + 1; - g CRC12 (D) = D 12 + D 11 + D 3 + D 2 + D + 1; - g CRC8 (D) = D 8 + D 7 + D 4 + D 3 + D + 1. a im1, aim2, aim3, K, aima i, and the parity bits by im 1, p im 2, p im 3, K p. A iml i is the size of a transport block of TrCH i, m is the transport block number, and L i is the i Denote the bits in a transport block delivered to layer 1 by p, number of parity bits. L i can take the values 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: a A 23 A im1d i + i + + aim2d + K + aima D + pim 1D + pim2d + K+ pim23d + p i im24 yields a remainder equal to 0 when divided by g CRC24 (D), polynomial: a A 15 A im1d i + i + + aim2d + K + aima D + pim 1D + pim2d + K + pim 15D + p i im16 yields a remainder equal to 0 when divided by g CRC16 (D), polynomial: a A 11 A im1d i + i + + aim2d + K + aima D + pim 1D + pim2d + K + pim 11D + p i im12 yields a remainder equal to 0 when divided by g CRC12 (D) and polynomial: a D i + a D + K + a D + p D + p D + K + p D + p A + 7 Ai im1 im2 ima im1 im2 im7 im8 yields a remainder equal to 0 when divided by g CRC8 (D). i If no transport blocks are input to the CRC calculation (M i = 0), no CRC attachment shall be done. If transport blocks are input to the CRC calculation (M i 0) and the size of a transport block is zero (A i = 0), CRC shall be attached, i.e. all parity bits equal to zero Relation between input and output of the CRC attachment block The bits after CRC attachment are denoted by and b imk is: b im1, bim2, bim3, K, b, where B i = A i + L i. The relation between a imk imb i b imk = a imk k = 1, 2, 3,, A i b = k = A i + 1, A i + 2, A i + 3,, A i + L i imk p im ( Li + 1 ( k Ai ))

17 16 TS V ( ) 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 or turbo coding is used for the TrCH Concatenation of transport blocks b b, b,, b, 3 The bits input to the transport block concatenation are denoted by im1 im2 im K imb i where i is the TrCH number, m is the transport block number, and B i is the number of bits in each block (including CRC). The number of transport blocks on TrCH i is denoted by M i. The bits after concatenation are denoted by x i1, xi2, xi3, K, xix i, where i is the TrCH number and X i =M i B i. They are defined by the following relations: xik b i 1k x x = k = 1, 2,, B i = k = B i + 1, B i + 2,, 2B i ik b i 2,( k B ), i = k = 2B i + 1, 2B i + 2,, 3B i ik b i 3,( k 2B ) K x, i = k = (M i - 1)B i + 1, (M i - 1)B i + 2,, M i B i ik b i M,( k ( M 1) B ), i i i Code block segmentation Segmentation of the bit sequence from transport block concatenation is performed if X i >Z. The code blocks after segmentation are of the same size. The number of code blocks on TrCH i is denoted by C i. If the number of bits input to the segmentation, X i, is not a multiple of C i, filler bits are added to the beginning of the first block. If turbo coding is selected and X i < 40, filler bits are added to the beginning of the code 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 = o o, o,, o, 3 The bits output from code block segmentation, for C i 0, are denoted by ir1 ir 2 ir K irk i, where i is the TrCH number, r is the code block number, and K i is the number of bits per code block. Number of code blocks: C i = X i Z Number of bits in each code block (applicable for C i 0 only): if X i < 40 and Turbo coding is used, then K i = 40 else K i = X i / C i end if Number of filler bits: Y i = C i K i - X i for k = 1 to Y i o i1 k = 0 -- Insertion of filler bits

18 17 TS V ( ) end for for k = Y i +1 to K i o end for = x i1k i i,( k Y ) r = 2 -- Segmentation while r C i for k = 1 to K i o end for r = r+1 end while irk = x i ( k+ ( r 1) K i Y ) I, i Channel coding o o, o,, o, 3 Code blocks are delivered to the channel coding block. They are denoted by ir1 ir 2 ir K irk i, where i is the TrCH number, r is the code block number, and K i is the number of bits in each code block. The number of code blocks on TrCH i is denoted by C i. After encoding the bits are denoted by y ir1, yir 2, yir3, K, y, where Y i is the number of encoded bits. The relation between o irk and y irk and between K i and Y i is dependent on the channel coding scheme. The following channel coding schemes can be applied to TrCHs: - convolutional coding; - turbo coding. Usage of coding scheme and coding rate for the different types of TrCH is shown in table 1. The values of Y i in connection with each coding scheme: - convolutional coding with rate 1/2: Y i = 2*K i + 16; rate 1/3: Y i = 3*K i + 24; - turbo coding with rate 1/3: Y i = 3*K i Table 1: Usage of channel coding scheme and coding rate Type of TrCH Coding scheme Coding rate BCH PCH 1/2 Convolutional coding RACH DCH, FACH 1/3, 1/2 Turbo coding 1/3 iry i 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.

19 18 TS V ( ) 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 (a) Rate 1/2 convolutional coder Output 0 G 0 = 561 (octal) Output 1 G 1 = 753 (octal) Input D D D D D D D D (b) Rate 1/3 convolutional coder Output 0 G 0 = 557 (octal) Output 1 G 1 = 663 (octal) Output 2 G 2 = 711 (octal) Figure 3: Rate 1/2 and rate 1/3 convolutional coders 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) = g 1, g 1 0 ( D), ( D) where g 0 (D) = 1 + D 2 + D 3, g 1 (D) = 1 + D + D 3. 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 x 1, z 1, z' 1, x 2, z 2, z' 2,, x K, z K, z' K, where x 1, x 2,, x K 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 z 1, z 2,, z K 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.

20 19 TS V ( ) x k 1st constituent encoder z k Input x k D D D Input Turbo code internal interleaver Output 2nd constituent encoder z k Output x k D D D x k Figure 4: Structure of rate 1/3 Turbo coder (dotted lines apply for trellis termination only) 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: x K+1, z K+1, x K+2, z K+2, x K+3, z K+3, x' K+1, z' K+1, x' K+2, z' K+2, x' K+3, z' K Turbo code internal interleaver The Turbo code internal interleaver consists of bits-input to a rectangular matrix with padding, 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 x 1, x2, x3, K, xk, where K is the integer number of the bits and takes one value of 40 K The relation between the bits input to the Turbo code internal interleaver and the bits input to the channel coding is defined by x = o and K = K i. k The following subclause specific symbols are used in subclauses to : irk K R C p v Number of bits input to Turbo code internal interleaver Number of rows of rectangular matrix Number of columns of rectangular matrix Prime number Primitive root ( j) j { 0,1,, p 2} s L Base sequence for intra-row permutation q i r i Minimum prime integers Permuted prime integers

21 20 TS V ( ) T() i i { 0,1,, R 1} L Inter-row permutation pattern U i ( j) L { 0,1,, 1} j C Intra-row permutation pattern of i-th row i j k Index of row number of rectangular matrix Index of column number of rectangular matrix Index of bit sequence Bits-input to rectangular matrix with padding The bit sequence as follows. x, 1, x2, x3, K xk input to the Turbo code internal interleaver is written into the rectangular matrix (1) Determine the number of rows of the rectangular matrix, R, such that: 5, if (40 K 159) R = 10, if ((160 K 200) or (481 K 530)). 20, if ( K = any other value) The rows of rectangular matrix are numbered 0, 1,, R - 1 from top to bottom. (2) Determine the prime number to be used in the intra-permutation, p, and the number of columns of rectangular matrix, C, such that: if (481 K 530) then else p = 53 and C = p. Find minimum prime number p from table 2 such that ( p +1) K R, and determine C such that p 1 C = p p + 1 end if if if if K R ( p 1) R ( p 1) < K R p. R p < K The columns of rectangular matrix are numbered 0, 1,, C - 1 from left to right.

22 21 TS V ( ) Table 2: List of prime number p and associated primitive root v p v p v p v p v p v (3) Write the input bit sequence x 1, x2, x3, K, xk into the R C rectangular matrix row by row starting with bit y 1 in column 0 of row 0: y 1 y ( C+ 1) M y (( R 1) C+ 1) y y y ( C+ 2) M 2 (( R 1) C+ 2) y y y ( C+ 3) M 3 (( R 1) C+ 3) K y K y K K y C 2C M R C where y k = x k for k = 1, 2,, K and if R C > K, the dummy bits are padded such that y k = 0or1 for k = K + 1, K + 2,, R C. These dummy bits are pruned away from the output of the rectangular matrix after intra-row and inter-row permutations Intra-row and inter-row permutations After the bits-input to the R C rectangular matrix, the intra-row and inter-row permutations for the R C rectangular matrix are performed stepwise by using the following algorithm with steps (1) (6): (1) Select a primitive root v from table 2 in section , which is indicated on the right side of the prime number p. (2) Construct the base sequence ( j) j { 0,1,, p 2} s ( j) ( s( j 1) ) mod p s L for intra-row permutation as: = ν, j = 1, 2,, (p - 2), and s(0) = 1. (3) Assign q 0 = 1 to be the first prime integer in the sequence qi i { 0,1, L, R 1}, and determine the prime integer q i in the sequence qi i { 0,1, L, R 1} to be a least prime integer such that g.c.d(q i, p - 1) = 1, q i > 6, and q i > q (i - 1) for each i = 1, 2,, R 1. Here g.c.d. is greatest common divisor. (4) Permute the sequence qi i { 0,1, L, R 1} to make the sequence ri i { 0,1, L, R 1} such that r T(i) = q i, i = 0, 1,, R - 1, where T() i i { 0,1, L is the inter-row permutation pattern defined as the one of the four kind of patterns, which, R 1} are shown in table 3, depending on the number of input bits K.

23 22 TS V ( ) Table 3: Inter-row permutation patterns for Turbo code internal interleaver Number of input bits K Number of rows R Inter-row permutation patterns <T(0), T(1),, T(R - 1)> (40 K 159) 5 <4, 3, 2, 1, 0> (160 K 200) or (481 K 530) 10 <9, 8, 7, 6, 5, 4, 3, 2, 1, 0> (2281 K 2480) or (3161 K 3210) 20 <19, 9, 14, 4, 0, 2, 5, 7, 12, 18, 16, 13, 17, 15, 3, 1, 6, 11, 8, 10> K = any other value 20 <19, 9, 14, 4, 0, 2, 5, 7, 12, 18, 10, 8, 13, 17, 3, 1, 16, 6, 15, 11> (5) Perform the i-th (i = 0, 1,, R - 1) intra-row permutation as: if (C = p) then ( j) = s( ( j r ) mod( p 1) ) U i i, j = 0, 1,, (p - 2), and U i (p - 1) = 0, where U i (j) is the original bit position of j-th permuted bit of i-th row. end if if (C = p + 1) then ( j) = s( ( j r ) mod( p 1) ) U i i, j = 0, 1,, (p - 2). U i (p - 1) = 0, and U i (p) = p, where U i (j) is the original bit position of j-th permuted bit of i-th row, and if (K = R C) then Exchange U R-1 (p) with U R-1 (0). end if end if if (C = p - 1) then ( j) = s( ( j r ) mod( p 1) ) 1 U i i, j = 0, 1,, (p - 2), where U i (j) is the original bit position of j-th permuted bit of i-th row. end if (6) Perform the inter-row permutation for the rectangular matrix based on the pattern T() i i { 0,1,, R 1} where T(i) is the original row position of the i-th permuted row 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 : L, y' y' M y' 1 2 R y' y' ( R+ 1) ( R+ 2) M y' 2R y' y' (2R+ 1) (2R+ 2) M y' 3R K y' K y' K K (( C 1) R+ 1) (( C 1) R+ 2) M y' C R

24 23 TS V ( ) 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 rectangular 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 dummy bits that were padded to the input of the rectangular matrix before intra-row and inter row permutations, i.e. bits y' k that corresponds to bits y k 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 After the channel coding for each code block, if C i 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 c i1, ci2, ci3, K, cie i, where i is the TrCH number and E i = C i Y i. The output bits are defined by the following relations: cik y i 1k c c = k = 1, 2,, Y i = k = Y i + 1, Y i + 2,, 2Y i ik y i, 2,( k Yi ) = k = 2Y i + 1, 2Y i + 2,, 3Y i ik y i, 3,( k 2Yi ) K c = k = (C i - 1)Y i + 1, (C i - 1)Y i + 2,, C i Y i ik y i, Ci,( k ( Ci 1) Yi ) If no code blocks are input to the channel coding (C i = 0), no bits shall be output from the channel coding, i.e. E i = 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 F i data segments of same size as described in subclause Radio frame size equalisation is only performed in the UL. The input bit sequence to the radio frame size equalisation is denoted by c i1, ci2, ci3, K, cie i, where i is TrCH number and E i the number of bits. The output bit sequence is denoted byt i1, ti2, ti3, K, tit i, where T i is the number of bits. The output bit sequence is derived as follows: - t ik = c ik, for k = 1 E i ; and - t ik = {0, 1} for k= E i +1 T i, if E i < T i ; where - T i = F i * N i ; and - i Ei Fi N = is the number of bits per segment after size equalisation st interleaving Void st interleaver operation The 1 st interleaving is a block interleaver with inter-column permutations. The input bit sequence to the block interleaver is denoted by, x, x, K x, where i is TrCH number and X i the number of bits. Here X i is x i, 1 i,2 i,3, i, X i

25 24 TS V ( ) guaranteed to be an integer multiple of the number of radio frames in the TTI. The output bit sequence from the block interleaver is derived as follows: (1) Select the number of columns C1 from table 4 depending on the TTI. The columns are numbered 0, 1,, C1-1 from left to right. (2) Determine the number of rows of the matrix, R1 defined as R1 = X i / C1. The rows of the matrix are numbered 0, 1,, R1-1 from top to bottom. (3) Write the input bit sequence into the R1 C1 matrix row by row starting with bit x i, 1 in column 0 of row 0 and ending with bit x i, (R1 C1) in column C1-1 of row R1-1: x x x M i,1 i,(c1+ 1) i,((r1 1) C1+ 1) x x x i,2 i,(c1+ 2) M i,((r1 1) C1+ 2) x x x i,3 i,(c1+ 3) M i,((r1 1) C1+ 3) K K x K Kx x i,c1 i,(2 C1) M i,(r1 C1) P1 C1 (4) Perform the inter-column permutation for the matrix based on the pattern ( ) { 0,1,,C1 1} j shown in table j K 4, where P1 C1 (j) is the original column position of the j-th permuted column. After permutation of the columns, the bits are denoted by y ik : yi yi M yi,1,2,r1 y y y i,(r1+ 1) i,(r1+ 2) M i,(2 R1) y y i,(2 R1+ 1) i,(2 R1+ 2) y M i,(3 R1) K y K y i,((c1 1) R1+ 1) i,((c1 1) R1+ 2) K M K y i,(c1 R1) (5) Read the output bit sequence yi, 1, yi,2, yi,3, K, yi,(c1 R1) of the block interleaver column by column from the inter-column permuted R1 C1 matrix. Bit y i, 1 corresponds to row 0 of column 0 and bit y i, (R1 C1) corresponds to row R1-1 of column C1-1. Table 4 Inter-column permutation patterns for 1st interleaving TTI Number of columns C1 Inter-column permutation patterns <P1 C1(0), P1 C1(1),, P1 C1(C1-1)> 10 ms 1 <0> 20 ms 2 <0,1> 40 ms 4 <0,2,1,3> 80 ms 8 <0,4,2,6,1,5,3,7> Relation between input and output of 1 st interleaving in uplink The bits input to the 1 st interleaving are denoted by number of bits. Hence, x i,k = t i,k and X i = T i. t i, 1 ti,2, ti,3,, ti, T i, K, where i is the TrCH number and T i the The bits output from the 1 st interleaving are denoted by d i, 1 di,2, di,3,, di, T i, K, and d i,k = y i,k.

26 25 TS V ( ) Relation between input and output of 1 st interleaving in downlink If fixed positions of the TrCHs in a radio frame is used then the bits input to the 1 st interleaving are denoted by h h, h,, h i, i2 i3 1 K, where i is the TrCH number. Hence, x ik = h ik and X i = D i. id i If flexible positions of the TrCHs in a radio frame is used then the bits input to the 1 st interleaving are denoted by g g, g,, g i, i2 i3 1 K, where i is the TrCH number. Hence, x ik = g ik and X i = G i. ig i The bits output from the 1 st interleaving are denoted by q i1, qi 2, qi3, K, qiq i, where i is the TrCH number and Q i is the number of bits. Hence, q ik = y ik, Q i = F i H i if fixed positions are used, and Q i = G i if flexible positions are used Radio frame segmentation When the transmission time interval is longer than 10 ms, the input bit sequence is segmented and mapped onto consecutive F i 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 F i. The input bit sequence is denoted by x i1, xi 2, xi3, K, xix i where i is the TrCH number and X i is the number bits. The F i output bit sequences per TTI are denoted by y i, ni 1, yi, ni 2, yi, n y i 3, K, i, niy where n i i is the radio frame number in current TTI and Y i is the number of bits per radio frame for TrCH i. The output sequences are defined as follows: y, = x i, (( n 1) Y ) + k, n i = 1 F i, k = 1 Y i i nik where i i Y i = (X i / F i ) is the number of bits per segment. The n i -th segment is mapped to the n i -th radio frame of the transmission time interval Relation between input and output of the radio frame segmentation block in uplink The input bit sequence to the radio frame segmentation is denoted by number and T i the number of bits. Hence, x ik = d ik and X i = T i. The output bit sequence corresponding to radio frame n i is denoted by number and N i is the number of bits. Hence, e i k yi, nik, = and N i = Y i. d i1, di2, di3, K, d, where i is the TrCH in i it i e i1, ei 2, ei3, K, e, where i is the TrCH Relation between input and output of the radio frame segmentation block in downlink The bits input to the radio frame segmentation are denoted by the number of bits. Hence, x ik = q ik and X i = Q i. q i1, qi 2, qi3, K, q, where i is the TrCH number and Q i iq i The output bit sequence corresponding to radio frame n i is denoted by number and V i is the number of bits. Hence, f i k yi, nik, = and V i = Y i. f i1, f i2, f i3, K, f, where i is the TrCH iv i 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.