ETSI TS V ( ) Technical Specification

Transcription

1 TS V.. (2-4) Technical Specification LTE; Evolved Universal Terrestrial Radio Access (E-UTRA); Multiplexing and channel coding (3GPP TS version.. Release )

2 TS V.. (2-4) Reference RTS/TSGR-3622va Kewords LTE 65 Route des Lucioles F-692 Sophia Antipolis Cedex - FRANCE Tel.: Fax: Siret N NAF 742 C Association à but non lucratif enregistrée à la Sous-Préfecture de Grasse (6) N 783/88 Important notice Individual copies of the present document can be downloaded from: The present document ma be made available in more than one electronic version or in print. In an 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 ept on a specific networ drive within Secretariat. Users of the present document should be aware that the document ma be subject to revision or change of status. Information on the current status of this and other documents is available at If ou find errors in the present document, please send our comment to one of the following services: Copright Notification No part ma be reproduced except as authorized b written permission. The copright and the foregoing restriction extend to reproduction in all media. European Telecommunications Standards Institute 2. All rights reserved. DECT TM, PLUGTESTS TM, UMTS TM, TIPHON TM, the TIPHON logo and the logo are Trade Mars of registered for the benefit of its Members. 3GPP TM is a Trade Mar of registered for the benefit of its Members and of the 3GPP Organizational Partners. LTE is a Trade Mar of currentl being registered for the benefit of its Members and of the 3GPP Organizational Partners. GSM and the GSM logo are Trade Mars registered and owned b the GSM Association.

3 2 TS V.. (2-4) Intellectual Propert Rights IPRs essential or potentiall essential to the present document ma have been declared to. The information pertaining to these essential IPRs, if an, is publicl available for members and non-members, and can be found in SR 34: "Intellectual Propert Rights (IPRs); Essential, or potentiall 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 Polic, no investigation, including IPR searches, has been carried out b. No guarantee can be given as to the existence of other IPRs not referenced in SR 34 (or the updates on the Web server) which are, or ma be, or ma become, essential to the present document. Foreword This Technical Specification (TS) has been produced b 3rd Generation Partnership Project (3GPP). The present document ma 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.. (2-4) Contents Intellectual Propert Rights... 2 Foreword... 2 Foreword... 5 Scope References Definitions, smbols and abbreviations Definitions Smbols Abbreviations Mapping to phsical channels Uplin Downlin Channel coding, multiplexing and interleaving Generic procedures CRC calculation Code bloc segmentation and code bloc CRC attachment Channel coding Tail biting convolutional coding Turbo coding Turbo encoder Trellis termination for turbo encoder Turbo code internal interleaver Rate matching Rate matching for turbo coded transport channels Sub-bloc interleaver Bit collection, selection and transmission Rate matching for convolutionall coded transport channels and control information Sub-bloc interleaver Bit collection, selection and transmission Code bloc concatenation Uplin transport channels and control information Random access channel Uplin shared channel Transport bloc CRC attachment Code bloc segmentation and code bloc CRC attachment Channel coding of UL-SCH Rate matching Code bloc concatenation Channel coding of control information Channel qualit information formats for wideband CQI reports Channel qualit information formats for higher laer configured subband CQI reports Channel qualit information formats for UE selected subband CQI reports Channel coding for CQI/PMI information in PUSCH Channel coding for more than bits of HARQ- information Data and control multiplexing Channel interleaver Uplin control information on PUCCH Channel coding for UCI HARQ Channel coding for UCI scheduling request Channel coding for UCI channel qualit information Channel qualit information formats for wideband reports Channel qualit information formats for UE-selected sub-band reports Channel coding for UCI channel qualit information and HARQ

5 4 TS V.. (2-4) Uplin control information on PUSCH without UL-SCH data Channel coding of control information Control information mapping Channel interleaver Downlin transport channels and control information Broadcast channel Transport bloc CRC attachment Channel coding Rate matching Downlin shared channel, Paging channel and Multicast channel Transport bloc CRC attachment Code bloc segmentation and code bloc CRC attachment Channel coding Rate matching Code bloc concatenation Downlin control information DCI formats Format Format Format A A Format B Format C A Format D Format A Format 2A B Format 2B C Format 2C Format Format 3A Format CRC attachment Channel coding Rate matching Control format indicator Channel coding HARQ indicator (HI) Channel coding Annex A (informative): Change histor Histor... 77

6 5 TS V.. (2-4) Foreword This Technical Specification has been produced b the 3 rd Generation Partnership Project (3GPP). The contents of the present document are subject to continuing wor within the TSG and ma change following formal TSG approval. Should the TSG modif the contents of the present document, it will be re-released b the TSG with an identifing change of release date and an increase in version number as follows: Version x..z where: x the first digit: 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 onl changes have been incorporated in the document.

7 6 TS V.. (2-4) Scope The present document specifies the coding, multiplexing and mapping to phsical channels for E-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 b date of publication, edition number, version number, etc.) or non-specific. For a specific reference, subsequent revisions do not appl. For a non-specific reference, the latest version applies. In the case of a reference to a 3GPP document (including a GSM document), a non-specific reference implicitl refers to the latest version of that document in the same Release as the present document. [] 3GPP TR 2.95: "Vocabular for 3GPP Specifications". [2] 3GPP TS 36.2: "Evolved Universal Terrestrial Radio Access (E-UTRA); Phsical channels and modulation". [3] 3GPP TS 36.23: "Evolved Universal Terrestrial Radio Access (E-UTRA); Phsical laer procedures". [4] 3GPP TS 36.36: "Evolved Universal Terrestrial Radio Access (E-UTRA); User Equipment (UE) radio access capabilities". [5] 3GPP TS36.32, Evolved Universal Terrestrial Radio Access (E-UTRA); Medium Access Control (MAC) protocol specification [6] 3GPP TS36.33, Evolved Universal Terrestrial Radio Access (E-UTRA); Radio Resource Control (RRC) protocol specification 3 Definitions, smbols and abbreviations 3. Definitions For the purposes of the present document, the terms and definitions given in [] and the following appl. A term defined in the present document taes precedence over the definition of the same term, if an, in []. Definition format <defined term>: <definition>. 3.2 Smbols For the purposes of the present document, the following smbols appl: DL N RB Downlin bandwidth configuration, expressed in number of resource blocs [2] UL N RB Uplin bandwidth configuration, expressed in number of resource blocs [2] RB N sc Resource bloc size in the frequenc domain, expressed as a number of subcarriers

8 7 TS V.. (2-4) PUSCH N smb Number of SC-FDMA smbols carring PUSCH in a subframe PUSCH-initial N smb Number of SC-FDMA smbols carring PUSCH in the initial PUSCH transmission subframe UL N smb Number of SC-FDMA smbols in an uplin slot N SRS Number of SC-FDMA smbols used for SRS transmission in a subframe ( or ). 3.3 Abbreviations For the purposes of the present document, the following abbreviations appl: BCH CFI CP DCI DL-SCH FDD HI MCH PBCH PCFICH PCH PDCCH PDSCH PHICH PMCH PMI PRACH PUCCH PUSCH RACH SR SRS TDD TPMI UCI UL-SCH Broadcast channel Control Format Indicator Cclic Prefix Downlin Control Information Downlin Shared channel Frequenc Division Duplexing HARQ indicator Multicast channel Phsical Broadcast channel Phsical Control Format Indicator channel Paging channel Phsical Downlin Control channel Phsical Downlin Shared channel Phsical HARQ indicator channel Phsical Multicast channel Precoding Matrix Indicator Phsical Random Access channel Phsical Uplin Control channel Phsical Uplin Shared channel Random Access channel Ran Indication Scheduling Request Sounding Reference Signal Time Division Duplexing Transmitted Precoding Matrix Indicator Uplin Control Information Uplin Shared channel 4 Mapping to phsical channels 4. Uplin Table 4.- specifies the mapping of the uplin transport channels to their corresponding phsical channels. Table 4.-2 specifies the mapping of the uplin control channel information to its corresponding phsical channel.

9 8 TS V.. (2-4) TrCH UL-SCH RACH Table 4.- Phsical Channel PUSCH PRACH Control information UCI Table 4.-2 Phsical Channel PUCCH, PUSCH 4.2 Downlin Table 4.2- specifies the mapping of the downlin transport channels to their corresponding phsical channels. Table specifies the mapping of the downlin control channel information to its corresponding phsical channel. Table 4.2- TrCH DL-SCH BCH PCH MCH Phsical Channel PDSCH PBCH PDSCH PMCH Table Control information CFI HI DCI Phsical Channel PCFICH PHICH PDCCH 5 Channel coding, multiplexing and interleaving Data and control streams from/to MAC laer are encoded /decoded to offer transport and control services over the radio transmission lin. Channel coding scheme is a combination of error detection, error correcting, rate matching, interleaving and transport channel or control information mapping onto/splitting from phsical channels. 5. Generic procedures This section contains coding procedures which are used for more than one transport channel or control information tpe. 5.. CRC calculation Denote the input bits to the CRC computation b a, a, a2, a3,..., a A, and the parit bits b p, p, p2, p3,..., p L. A is the size of the input sequence and L is the number of parit bits. The parit bits are generated b one of the following cclic generator polnomials: - g CRC24A (D) = [D 24 + D 23 + D 8 + D 7 + D 4 + D + D + D 7 + D 6 + D 5 + D 4 + D 3 + D + ] and; - g CRC24B (D) = [D 24 + D 23 + D 6 + D 5 + D + ] for a CRC length L = 24 and; - g CRC6 (D) = [D 6 + D 2 + D 5 + ] for a CRC length L = 6. - g CRC8 (D) = [D 8 + D 7 + D 4 + D 3 + D + ] for a CRC length of L = 8.

10 9 TS V.. (2-4) The encoding is performed in a sstematic form, which means that in GF(2), the polnomial: a A+ 23 A D + ad + + a A D + p D + pd p D + p ields a remainder equal to when divided b the corresponding length-24 CRC generator polnomial, g CRC24A (D) or g CRC24B (D), the polnomial: a A+ 5 A D + ad + + a A D + p D + pd p D + p ields a remainder equal to when divided b g CRC6 (D), and the polnomial: a A+ 7 A D + ad + + aa D + pd + pd p D + p ields a remainder equal to when divided b g CRC8 (D). 6 The bits after CRC attachment are denoted b b b, b2, b3,...,, where B = A+ L. The relation between a and b is: b = a for =,, 2,, A- b = for = A, A+, A+2,..., A+L-. p A 4 22, b B Code bloc segmentation and code bloc CRC attachment The input bit sequence to the code bloc segmentation is denoted b b, b, b2, b3,..., b B, where B >. If B is larger than the maximum code bloc size Z, segmentation of the input bit sequence is performed and an additional CRC sequence of L = 24 bits is attached to each code bloc. The maximum code bloc size is: - Z = 644. If the number of filler bits F calculated below is not, filler bits are added to the beginning of the first bloc. Note that if B < 4, filler bits are added to the beginning of the code bloc. The filler bits shall be set to <NULL> at the input to the encoder. Total number of code blocs C is determined b: if B Z else end if L = Number of code blocs: C = B = B L = 24 Number of code blocs: C B ( Z L) B = B + C L = /. The bits output from code bloc segmentation, for C, are denoted b c r, cr, cr2, cr3,..., cr( K r ), where r is the code bloc number, and K r is the number of bits for the code bloc number r. Number of bits in each code bloc (applicable for C onl): First segmentation size: K + = minimum K in table such that C K B

11 TS V.. (2-4) if C = the number of code blocs with length K + is C + =, K =, C = else if C > Second segmentation size: K = maximum K in table such that K < K + Δ K = K + K Number of segments of size K : C K + B C =. Δ K end if Number of segments of size K + : C = C. + C Number of filler bits: for = to F- c end for =< NULL > F C K + C K B = Insertion of filler bits = F s = for r = to C- if r < C K r = K else K r = K + end if while < K r L c r = b s = + s = s + end while if C > end if = The sequence c r, cr, cr2, cr3,..., cr( Kr L ) is used to calculate the CRC parit bits p r, pr, pr2,..., pr( L ) according to section 5.. with the generator polnomial g CRC24B (D). For CRC calculation it is assumed that filler bits, if present, have the value. while < c = K r r p r ( + L Kr ) = + end while

12 TS V.. (2-4) end for 5..3 Channel coding The bit sequence input for a given code bloc to channel coding is denoted b c, c, c2, c3,..., c K, where K is the number of bits to encode. After encoding the bits are denoted b d, d, d 2, d 3,..., d D, where D is the number of (i) encoded bits per output stream and i indexes the encoder output stream. The relation between c and d and between K and D is dependent on the channel coding scheme. The following channel coding schemes can be applied to TrCHs: - tail biting convolutional coding; - turbo coding. Usage of coding scheme and coding rate for the different tpes of TrCH is shown in table Usage of coding scheme and coding rate for the different control information tpes is shown in table The values of D in connection with each coding scheme: - tail biting convolutional coding with rate /3: D = K; - turbo coding with rate /3: D = K + 4. The range for the output stream index i is, and 2 for both coding schemes. Table 5..3-: Usage of channel coding scheme and coding rate for TrCHs. TrCH Coding scheme Coding rate UL-SCH DL-SCH PCH MCH BCH Turbo coding Tail biting convolutional coding /3 /3 Table : Usage of channel coding scheme and coding rate for control information. Control Information Coding scheme Coding rate DCI Tail biting convolutional /3 coding CFI Bloc code /6 HI Repetition code /3 Bloc code variable UCI Tail biting convolutional /3 coding Tail biting convolutional coding A tail biting convolutional code with constraint length 7 and coding rate /3 is defined. The configuration of the convolutional encoder is presented in figure The initial value of the shift register of the encoder shall be set to the values corresponding to the last 6 information bits in the input stream so that the initial and final states of the shift register are the same. Therefore, denoting the shift register of the encoder b s, s, s2,..., s5, then the initial value of the shift register shall be set to

13 2 TS V.. (2-4) s i = c( K i) c () d () d (2) d The encoder output streams d, shown in Figure Figure 5..3-: Rate /3 tail biting convolutional encoder. () Turbo coding () d and Turbo encoder (2) d correspond to the first, second and third parit streams, respectivel as The scheme of turbo encoder is a Parallel Concatenated Convolutional Code (PCCC) with two 8-state constituent encoders and one turbo code internal interleaver. The coding rate of turbo encoder is /3. The structure of turbo encoder is illustrated in figure The transfer function of the 8-state constituent code for the PCCC is: G(D) = g, g ( D), ( D) where g (D) = + D 2 + D 3, g (D) = + 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. The output from the turbo encoder is () d = x () d = z (2) = z d for =,,2,..., K. If the code bloc to be encoded is the -th code bloc and the number of filler bits is greater than zero, i.e., F >, then () the encoder shall set c, =, =,,(F-) at its input and shall set d =< NULL >, =,,(F-) and () d =< NULL >, =,,(F-) at its output. The bits input to the turbo encoder are denoted b c, c, c2, c3,..., c K, and the bits output from the first and second 8- state constituent encoders are denoted b z, z, z 2, z3,..., z K and z, z, z 2, z3,..., z K, respectivel. The bits output from the turbo code internal interleaver are denoted b c, c,..., c K, and these bits are to be the input to the second 8- state constituent encoder.

14 3 TS V.. (2-4) x z c z c x Figure : Structure of rate /3 turbo encoder (dotted lines appl for trellis termination onl) Trellis termination for turbo encoder Trellis termination is performed b taing the tail bits from the shift register feedbac 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 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 in lower position) while the first constituent encoder is disabled. The transmitted bits for trellis termination shall then be: () d K = x K () d K = z K (2) K = x K + (), K + = z K + d, d = x K (), K + = xk + 2 d, d = z K (2) K + = K + () () K + 2, d K + 3 = z K + () () K + 2, d K + 3 = x K + 2 (2) K (2) K d, d z 2, d = x K, d = z K Turbo code internal interleaver The bits input to the turbo code internal interleaver are denoted b c, c,..., c K, where K is the number of input bits. The bits output from the turbo code internal interleaver are denoted b c, c,..., c K. The relationship between the input and output bits is as follows:

15 4 TS V.. (2-4) ci = cπ() i, i=,,, (K-) where the relationship between the output index i and the input index Π (i) satisfies the following quadratic form: Π = 2 ( f i + f i ) mod K 2 The parameters f and f 2 depend on the bloc size K and are summarized in Table Table : Turbo code internal interleaver parameters. i K f f 2 i K f f 2 i K f f 2 i K f f

16 5 TS V.. (2-4) 5..4 Rate matching Rate matching for turbo coded transport channels The rate matching for turbo coded transport channels is defined per coded bloc and consists of interleaving the three () () (2) information bit streams d, d and d, followed b the collection of bits and the generation of a circular buffer as depicted in Figure The output bits for each code bloc are transmitted as described in section () d () v () d () v w e (2) d (2) v The bit stream () d Figure Rate matching for turbo coded transport channels. is interleaved according to the sub-bloc interleaver defined in section with an output () () () (), v KΠ sequence defined as v v, v2,..., and where K Π is defined in section () The bit stream d is interleaved according to the sub-bloc interleaver defined in section with an output () () () () sequence defined as v v, v2,...,., v KΠ (2) The bit stream d is interleaved according to the sub-bloc interleaver defined in section with an output (2) (2) (2) (2) sequence defined as v v, v2,...,., v KΠ The sequence of bits e for transmission is generated according to section Sub-bloc interleaver The bits input to the bloc interleaver are denoted b d, d, d 2,..., d bit sequence from the bloc interleaver is derived as follows: TC D, where D is the number of bits. The output () Assign Csubbloc = 32 to be the number of columns of the matrix. The columns of the matrix are numbered,, TC 2,, C from left to right. subbloc (2) Determine the number of rows of the matrix R subbloc TC, b finding minimum integer TC TC ( R subbloc C ) D subbloc TC subbloc The rows of rectangular matrix are numbered,, 2,, R from top to bottom. TC R subbloc such that:

17 6 TS V.. (2-4) TC TC TC TC (3) If ( R C ) D, then N ( R C D) subbloc subbloc > for =,,, N D -. Then, TC TC the ( C ) subbloc subbloc D = dumm bits are padded such that = <NULL> subbloc subbloc (i) N + d, =,,, D-, and the bit sequence is written into D = R matrix row b row starting with bit in column of row : TC Csubbloc M TC TC ( Rsubbloc ) Csubbloc TC Csubbloc + M TC TC ( Rsubbloc ) Csubbloc + 2 TC Csubbloc + 2 M TC TC ( Rsubbloc ) Csubbloc + 2 L L O L TC Csubbloc TC 2Csubbloc M TC TC ( Rsubbloc Csubbloc ) For () d () and d : (4) Perform the inter-column permutation for the matrix based on the pattern ( j) { TC j,,..., } P that is shown in C subbloc table 5..4-, where P(j) is the original column position of the j-th permuted column. After permutation of the TC TC R C matrix is equal to columns, the inter-column permuted ( ) subbloc subbloc P() TC P() + Csubbloc M TC TC P() + ( Rsubbloc ) Csubbloc P() TC P() + Csubbloc M TC TC P() + ( Rsubbloc ) Csubbloc P(2) TC P(2) + Csubbloc M TC TC P(2) + ( Rsubbloc ) Csubbloc L L O L TC P( Csubbloc ) TC TC P( Csubbloc ) + Csubbloc M TC TC TC P( Csubbloc ) + ( Rsubbloc ) Csubbloc (5) The output of the bloc interleaver is the bit sequence read out column b column from the inter-column TC TC permuted ( R subbloc Csubbloc ) matrix. The bits after sub-bloc interleaving are denoted b v, v, v2,..., v, where v corresponds to P(), v to TC KΠ Π = TC R subbloc TC Csubbloc. and K ( ) (2) For d : P()+ C subbloc (2) (2) (2) (2), v KΠ (4) The output of the sub-bloc interleaver is denoted b v v, v2,...,, where v = π ( ) and where TC π ( ) = P + C K TC subbloc Rsubbloc The permutation function P is defined in Table TC ( mod R ) + subbloc mod Π Table Inter-column permutation pattern for sub-bloc interleaver. (2) Number of columns TC C subbloc 32 Inter-column permutation pattern TC < P (), P(),..., P( C subbloc ) > <, 6, 8, 24, 4, 2, 2, 28, 2, 8,, 26, 6, 22, 4, 3,, 7, 9, 25, 5, 2, 3, 29, 3, 9,, 27, 7, 23, 5, 3 > Bit collection, selection and transmission The circular buffer of length () v w = for =,, K K w = 3 K Π for the r-th coded bloc is generated as follows: Π () K 2 v Π + w = for =,, K Π

18 7 TS V.. (2-4) (2) K 2 v Π + + w = for =,, K Π Denote the soft buffer size for the transport bloc b N IR bits and the soft buffer size for the r-th code bloc b N cb bits. The size N cb is obtained as follows, where C is the number of code blocs computed in section 5..2: N - IR N cb = min, Kw for DL-SCH and PCH transport channels C N = K for UL-SCH and MCH transport channels - cb w where N IR is equal to: where: N IR = N soft ( M M ) K MIMO min DL_HARQ, N soft is the total number of soft channel bits [4]. limit K MIMO is equal to 2 if the UE is configured to receive PDSCH transmissions based on transmission modes 3, 4, 8 or 9 as defined in section 7. of [3], and is equal to otherwise. M DL_HARQ is the maximum number of DL HARQ processes as defined in section 7 of [3]. M limit is a constant equal to 8. Denoting b E the rate matching output sequence length for the r-th coded bloc, and rv idx the redundanc version number for this transmission (rv idx =,, 2 or 3), the rate matching output bit sequence is e, =,,..., E. Define b G the total number of bits available for the transmission of one transport bloc. N L Q m where Q m is equal to 2 for QPSK, 4 for 6QAM and 6 for 64QAM, and where Set G = G ( ) - For transmit diversit: - N L is equal to 2, - Otherwise: - N L is equal to the number of laers a transport bloc is mapped onto Set γ = G mod C, where C is the number of code blocs computed in section if r C γ else end if Set set E = N L Qm G / C set E = N L Qm G / C TC N cb = R + subbloc 2 rv 2, where TC 8Rsubbloc idx Set = and j = while { < E } if w + j) mod < NULL > ( N cb TC R subbloc is the number of rows defined in section

19 8 TS V.. (2-4) e = w( + j) mod N cb = + end if j = j + end while Rate matching for convolutionall coded transport channels and control information The rate matching for convolutionall coded transport channels and control information consists of interleaving the () () (2) three bit streams, d, d and d, followed b the collection of bits and the generation of a circular buffer as depicted in Figure The output bits are transmitted as described in section () d () v () d () v w e (2) d (2) v Figure Rate matching for convolutionall coded transport channels and control information. () The bit stream d is interleaved according to the sub-bloc interleaver defined in section with an output () () () () sequence defined as v v, v2,..., and where K Π is defined in section , v KΠ () The bit stream d is interleaved according to the sub-bloc interleaver defined in section with an output () () () () sequence defined as v v, v2,...,., v KΠ (2) The bit stream d is interleaved according to the sub-bloc interleaver defined in section with an output (2) (2) (2) (2) sequence defined as v v, v2,...,., v KΠ The sequence of bits e for transmission is generated according to section Sub-bloc interleaver The bits input to the bloc interleaver are denoted b d, d, d2,..., d bit sequence from the bloc interleaver is derived as follows: CC D, where D is the number of bits. The output () Assign Csubbloc = 32 to be the number of columns of the matrix. The columns of the matrix are numbered,, CC 2,, C from left to right. subbloc (2) Determine the number of rows of the matrix R CC subbloc, b finding minimum integer CC CC ( R subbloc C ) D subbloc CC R subbloc such that:

20 9 TS V.. (2-4) CC The rows of rectangular matrix are numbered,, 2,, R from top to bottom. subbloc CC CC CC CC (3) If ( R C ) D, then N ( R C D) subbloc subbloc > for =,,, N D -. Then, CC CC the ( C ) subbloc subbloc D = dumm bits are padded such that = <NULL> subbloc subbloc (i) N + d, =,,, D-, and the bit sequence is written into D = R matrix row b row starting with bit in column of row : CC C subbloc M CC CC ( R subbloc ) C subbloc CC C subbloc + M CC CC ( R subbloc ) C subbloc + 2 CC C subbloc + 2 M CC CC ( R subbloc ) C subbloc + 2 L L O L CC C subbloc CC 2C subbloc M CC CC ( R subbloc C subbloc ) (4) Perform the inter-column permutation for the matrix based on the pattern ( j) { CC j,,..., } P that is shown in C subbloc table , where P(j) is the original column position of the j-th permuted column. After permutation of the CC CC R C matrix is equal to columns, the inter-column permuted ( ) subbloc subbloc P() CC P() + Csubbloc M CC CC P() + ( Rsubbloc ) Csubbloc P() CC P() + Csubbloc M CC CC P() + ( Rsubbloc ) Csubbloc P(2) CC P(2) + Csubbloc M CC CC P(2) + ( Rsubbloc ) Csubbloc L L O L CC P( Csubbloc ) CC CC P( Csubbloc ) + Csubbloc M CC CC CC P( Csubbloc ) + ( Rsubbloc ) Csubbloc (5) The output of the bloc interleaver is the bit sequence read out column b column from the inter-column CC CC permuted ( C ) R subbloc subbloc matrix. The bits after sub-bloc interleaving are denoted b v, v, v2,..., v where v corresponds to P(), v to CC P()+ C subbloc CC CC and K = ( R subbloc C ) Π subbloc Table Inter-column permutation pattern for sub-bloc interleaver. KΠ, Number of columns CC C subbloc 32 Inter-column permutation pattern CC < P (), P(),..., P( C subbloc ) > <, 7, 9, 25, 5, 2, 3, 29, 3, 9,, 27, 7, 23, 5, 3,, 6, 8, 24, 4, 2, 2, 28, 2, 8,, 26, 6, 22, 4, 3 > This bloc interleaver is also used in interleaving PDCCH modulation smbols. In that case, the input bit sequence consists of PDCCH smbol quadruplets [2] Bit collection, selection and transmission The circular buffer of length () v w = for =,, K K w = 3 K Π is generated as follows: Π w = v KΠ + () (2) 2K v Π + w = for =,, K Π for =,, K Π Denoting b E the rate matching output sequence length, the rate matching output bit sequence is e, =,,..., E. Set = and j = while { < E }

21 2 TS V.. (2-4) if w < NULL > j mod K w e = w j mod K w = + end if j = j + end while 5..5 Code bloc concatenation The input bit sequence for the code bloc concatenation bloc are the sequences e r, for r =,..., C and =,..., Er. The output bit sequence from the code bloc concatenation bloc is the sequence f for =,..., G. The code bloc concatenation consists of sequentiall concatenating the rate matching outputs for the different code blocs. Therefore, Set = and r = while r < C Set j = while j < Er f = e rj = + j = j + end while r = r + end while 5.2 Uplin transport channels and control information 5.2. Random access channel The sequence index for the random access channel is received from higher laers and is processed according to [2] Uplin shared channel Figure shows the processing structure for the UL-SCH transport channel on one UL cell. Data arrives to the coding unit in the form of a maximum of two transport blocs ever transmission time interval (TTI) per UL cell. The following coding steps can be identified for each transport bloc of an UL cell: Add CRC to the transport bloc Code bloc segmentation and code bloc CRC attachment Channel coding of data and control information Rate matching

22 2 TS V.. (2-4) Code bloc concatenation Multiplexing of data and control information Channel interleaver The coding steps for one UL-SCH transport bloc are shown in the figure below. The same general processing applies for each UL-SCH transport bloc on each UL cell with restrictions as specified in [3]. a a a,,..., A Transport bloc CRC attachment b b b,,..., B Code bloc segmentation Code bloc CRC attachment c, r c,..., r c r K r Channel coding d, r d,..., r dr Dr Rate matching L [ o [ o o ] o O o L o O [ o ] o L o O ] e, r e,..., r e r E r Code bloc concatenation Channel coding Channel coding Channel coding f, f,..., f G q,q,..., q QCQI q, q,..., qq q, q,..., qq Data and Control multiplexing g g g,,..., H Channel Interleaver h, h,..., h H+Q Figure : Transport bloc processing for UL-SCH Transport bloc CRC attachment Error detection is provided on each UL-SCH transport bloc through a Cclic Redundanc Chec (CRC). The entire transport bloc is used to calculate the CRC parit bits. Denote the bits in a transport bloc delivered to laer b a, a, a2, a3,..., a A, and the parit bits b p, p, p2, p3,..., p L. A is the size of the transport bloc and L is the number of parit bits. The lowest order information bit a is mapped to the most significant bit of the transport bloc as defined in section 6.. of [5].

23 22 TS V.. (2-4) The parit bits are computed and attached to the UL-SCH transport bloc according to section 5.. setting L to 24 bits and using the generator polnomial g CRC24A (D) Code bloc segmentation and code bloc CRC attachment The bits input to the code bloc segmentation are denoted b b, b, b2, b3,..., b B where B is the number of bits in the transport bloc (including CRC). Code bloc segmentation and code bloc CRC attachment are performed according to section The bits after code bloc segmentation are denoted b c r, cr, cr2, cr3,..., cr( K r ), where r is the code bloc number and K r is the number of bits for code bloc number r Channel coding of UL-SCH Code blocs are delivered to the channel coding bloc. The bits in a code bloc are denoted b c r, cr, cr2, cr3,..., cr( K r ), where r is the code bloc number, and K r is the number of bits in code bloc number r. The total number of code blocs is denoted b C and each code bloc is individuall turbo encoded according to section After encoding the bits are denoted b dr, dr, dr2, dr3,..., dr( Dr ), with i =,, and 2 and where Dr is the number of bits on the i-th coded stream for code bloc number r, i.e. D K Rate matching r = r Turbo coded blocs are delivered to the rate matching bloc. The are denoted b dr, dr, dr2, dr3,..., dr( Dr ), with i =,, and 2, and where r is the code bloc number, i is the coded stream index, and D r is the number of bits in each coded stream of code bloc number r. The total number of code blocs is denoted b C and each coded bloc is individuall rate matched according to section After rate matching, the bits are denoted b e r, er, er2, er3,..., er( ), where r is the coded bloc number, and where E r is the number of rate matched bits for code bloc number r Code bloc concatenation The bits input to the code bloc concatenation bloc are denoted b e r, er, er2, er3,..., er( E r ) for r =,..., C and where E r is the number of rate matched bits for the r-th code bloc. Code bloc concatenation is performed according to section The bits after code bloc concatenation are denoted b f, f, f2, f3,..., f G, where G is the total number of coded bits for transmission of the given transport bloc over N L transmission laers excluding the bits used for control transmission, when control information is multiplexed with the UL-SCH transmission Channel coding of control information Control data arrives at the coding unit in the form of channel qualit information (CQI and/or PMI), HARQ- and ran indication. Different coding rates for the control information are achieved b allocating different number of coded smbols for its transmission. When control data are transmitted in the PUSCH, the channel coding for HARQ-, ran indication and channel qualit information o, o, o2,..., o O is done independentl. For TDD, two HARQ- feedbac modes are supported b higher laer configuration. - HARQ- bundling, and - HARQ- multiplexing E r

24 23 TS V.. (2-4) For TDD HARQ- bundling, HARQ- consists of one or two bits information. For TDD HARQ- multiplexing, HARQ- consists of between one and four bits of information and the number of bits is determined as described in section 7.3 of [3]. When the UE transmits HARQ- bits or ran indicator bits, it shall determine the number of coded modulation smbols per laer Q for HARQ- or ran indicator as follows. For the case when onl one transport bloc is transmitted in an UL cell: PUSCH initial PUSCH initial PUSCH O M sc N smb β offset Q = min, 4 M C K r r= PUSCH sc PUSCH where O is the number of HARQ- bits or ran indicator bits, M sc is the scheduled bandwidth for PUSCH transmission in the current sub-frame for the transport bloc, expressed as a number of subcarriers in [2], and is the number of SC-FDMA smbols per subframe for initial PUSCH transmission for the same transport N PUSCH-initial smb PUSCH-initial UL bloc, respectivel, given b N ( 2 ( N ) N ) smb = smb SRS, where SRS N is equal to if UE is configured to send PUSCH and SRS in the same subframe for initial transmission, or if the PUSCH resource allocation for initial transmission even partiall overlaps with the cell-specific SRS subframe and bandwidth configuration defined in section of [2], or if the subframe for initial transmission is a UE-specific tpe- SRS subframe as defined in PUSCH initial Section 8.2 of [3]. Otherwise N SRS is equal to. M sc the same transport bloc. If there is no initial PDCCH with DCI format for the same transport bloc, C, and K r shall be determined from:, C, and K r are obtained from the initial PDCCH for PUSCH M sc initial the most recent semi-persistent scheduling assignment PDCCH, when the initial PUSCH for the same transport bloc is semi-persistentl scheduled, or, the random access response grant for the same transport bloc, when the PUSCH is initiated b the random access response grant. For the case when two transport blocs are transmitted in an UL cell: PUSCH [ min( Q, 4 M ), Q ] Q = max with temp sc min, Q O M temp = () C () Kr r = PUSCH initial() PUSCH initial () PUSCH initial (2) PUSCH initial (2) PUSCH sc N smb M sc N smb βoffset (2) C PUSCH initial(2) PUSCH initial (2) (2) PUSCH initial () PUSCH initial () M sc N smb + Kr M sc Nsmb r = where O is the number of HARQ- bits or ran indicator bits, 2 with Q = min( Q ), Q where, x = {,2} m m 2O / Qm + 2O 2 Q m m Q min = O if 2 O, Q = 2O / Q m Q x m is the modulation order of transport bloc x, and O with O = and min if 3 O PUSCH-initial( x) Q min = / if > O / 2 O2 = O O / 2. M sc, x = {,2 } are the scheduled bandwidths for PUSCH transmission in the initial sub-frame for the first and second transport bloc, PUSCH-initial(x) respectivel, expressed as a number of subcarriers in [2], and N smb, x = {,2 } are the number of SC-FDMA smbols per subframe for initial PUSCH transmission for the first and second transport bloc given b PUSCH-initial( x) UL ( x) ( ) Nsmb = ( 2 ( Nsmb ) NSRS ), x = {,2 }, where N x SRS, x = {,2 } is equal to if UE is configured to send PUSCH and SRS in the same subframe for initial transmission of transport bloc x, or if the PUSCH resource allocation for initial transmission of transport boc x even partiall overlaps with the cell-specific SRS subframe and bandwidth configuration defined in section of [2], or if the subframe for initial transmission of transport bloc x

25 24 TS V.. (2-4) is a UE-specific tpe- SRS subframe as defined in Section 8.2 of [3]. Otherwise SRS, x = {,2 } is equal to. PUSCH initial ( x) ( ) K x ( ) M sc, x = {,2}, C x, x = {,2 }, and r, x = {,2 } are obtained from the initial PDCCH for the corresponding transport bloc. If there is no initial PDCCH with DCI format or 4 for the same transport bloc, PUSCH initial ( x) ( ) M sc, x = {,2}, C x ( ), x = {,2 }, and K r x, x = {,2 } shall be determined from: the most recent semi-persistent scheduling assignment PDCCH, when the initial PUSCH for the same transport bloc is semi-persistentl scheduled, or, the random access response grant for the same transport bloc, when the PUSCH is initiated b the random access response grant. PUSCH HARQ For HARQ-, = and β offset = β offset, where Qm is the modulation order of a given HARQ transport bloc, and β offset shall be determined according to [3] depending on the number of transmission codewords for the corresponding UL cell. Q Qm Q PUSCH For ran indication, Q = Qm Q and offset offset Q is the modulation order of a given transport bloc, and β offset shall be determined according to [3] depending on the number of transmission codewords for the corresponding UL cell. For HARQ- β = β, where m ( ) N x Each positive acnowledgement () is encoded as a binar and each negative acnowledgement (N) is encoded as a binar If HARQ- feedbac consists of -bit of information, i.e., [ o ], it is first encoded according to Table If HARQ- feedbac consists of 2-bits of information, i.e., [ o o ] with o corresponding to HARQ- bit for codeword and o corresponding to that for codeword, it is first encoded according to Table where o = o + o ) mod 2. 2 ( Table : Encoding of -bit HARQ-. Encoded HARQ- 2 [ o ] Q m 4 [ o x x] 6 [ o x x x x ] Q m 2 Table : Encoding of 2-bit HARQ-. Encoded HARQ- [ o o o2 o o o2 ] 4 o o x x o o x x o o x x] [ [ o o x x x x o2 o x x x x o o 2 x x x x] If HARQ- feedbac consists of 3 O bits of information as a result of the aggregation of HARQ- bits corresponding to multiple DL cells, i.e., ~ ~ ~ q q,..., q3 is obtained b using the bit sequence O o o,..., o O q q, q2,..., qq o o,..., o coding bloc described in section In turn, the bit sequence, then a coded bit sequence as the input to the channel, is

26 25 TS V.. (2-4) obtained b the circular repetition of the bit sequence length is equal to Q. ~ ~ ~ q q,..., q3 so that the total bit sequence If HARQ- feedbac consists of < O 2 bits of information as a result of the aggregation of O o o HARQ- bits corresponding to multiple DL cells, i.e., o o,..., o q q, q2,..., qq, is obtained b using the bit sequence,..., o channel coding bloc described in section , then the coded bit sequence O as the input to the The x and in Table and are placeholders for [2] to scramble the HARQ- bits in a wa that maximizes the Euclidean distance of the modulation smbols carring HARQ- information. For the cases with FDD or TDD HARQ- multiplexing when HARQ- consists of one or two bits of information, the bit sequence q, q, q2,..., qq is obtained b concatenation of multiple encoded HARQ- blocs where Q is the total number of coded bits for all the encoded HARQ- blocs. The last concatenation of the encoded HARQ- bloc ma be partial so that the total bit sequence length is equal to Q. For the cases of FDD when HARQ feedbac consists of 2 or more bits of information as a result of the aggregation of more than one DL cell, the bit sequence o o,..., o is the result of the concatenation of O HARQ- bits for different cells according to the following pseudo-code: Set c = cell index: lower indices correspond to lower RRC indices of corresponding cell Set j = HARQ- bit index Set DL N cells to the number of cells configured b higher laers for the UE while c < DL N cells if transmission mode configured in cell c {,2,5,6,7 } bit HARQ- feedbac for this cell else end if j o = HARQ- bit of this cell j = j + j o = HARQ- bit corresponding to the first codeword of this cell j = j + j o = HARQ- bit corresponding to the second codeword of this cell j = j + c = c + end while For the cases of TDD when HARQ feedbac is for the aggregation of more than one DL cell, the bit sequence o o,..., o is the result of the concatenation of HARQ- bits for different cells and different O subframes. DL DL Define N cells as the number of cells configured b higher laers for the UE and B c as the number of downlin subframes for which the UE needs to feedbac HARQ- bits as defined in Section 7.3 of [3].

27 26 TS V.. (2-4) The number of HARQ- bits for the UE to conve is computed as follows: Set = counter of HARQ- bits Set c= cell index: lower indices correspond to lower RRC indices of corresponding cell while c < set l = ; while l < DL N cells DL B c if transmission mode configured in cell c {,2,5,6,7 } -- bit HARQ- feedbac for this cell else end if l = l+ end while c = c + end while = + = + 2 If 2, the multiplexing of HARQ- bits is performed according to the following pseudo-code: Set c = cell index: lower indices correspond to lower RRC indices of corresponding cell Set j = HARQ- bit index while c < set l = ; while l < DL N cells DL B c if transmission mode configured in cell c {,2,5,6,7 } -- bit HARQ- feedbac for this cell else end if ~ = HARQ- bit of this cell as defined in Section 7.3 of [3] o j oc, l j = j + ~, ~ [ o j o j ] [ oc,2l, oc,2l+ ] l = l+ end while c = c + end while j = j = HARQ- bits of this cell as defined in Section 7.3 of [3]

28 if 3GPP TS version.. Release 27 TS V.. (2-4) If > 2, spatial bundling is applied to all subframes in all cells and the multiplexing of HARQ- bits is performed according to the following pseudo-code Set c = cell index: lower indices correspond to lower RRC indices of corresponding cell Set j = HARQ- bit index while c < set l = ; while l < DL N cells DL B c if transmission mode configured in cell c {,2,5,6,7 } bit HARQ- feedbac for this cell else ~ = HARQ- bit of this cell as defined in Section 7.3 of [3] o j oc, l j = j + ~ = binar AND operation of the HARQ- bits corresponding to the first and second o j oc, l codewords of this cell as defined in Section 7.3 of [3] j = j + end if l = l+ end while c = c + end while For O, the bit sequence o o,..., o O is obtained b setting o i = o%. i For < O 2, the bit sequence o O /2 + ( i )/2 = % o i i is odd. o o,..., o O is obtained b setting o /2 i = o% if i is even and i q, q, q,..., q For the case with TDD HARQ- bundling, a bit sequence 2 Q is obtained b concatenation of multiple encoded HARQ- blocs where Q is the total number of coded bits for all the encoded HARQ- blocs. The last concatenation of the encoded HARQ- bloc ma be partial so that the total bit sequence length is equal to Q. A scrambling sequence [ w w w2 w3 ] is then selected from Table A with index i = ( N bundled ) mod 4, where N bundled is determined as described in section 7.3 of [3]. The bit sequence q, q, q2,..., qq is then generated b setting m = if HARQ- consists of -bit and m = 3 if HARQ- consists of 2-bits and then scrambling Set i, to while i < Q ~ ~ ~ ~ ~ ~ ~ ~ q, q, q2,..., qq as follows if q ~ i = // place-holder repetition bit i = i ( ~ q w ) mod 2 q + / m

29 28 TS V.. (2-4) = ( +)mod4m else else if q ~ i = x // a place-holder bit q = q~ i i i // coded bit ( ~ q w ) mod 2 q = + i / m = ( +)mod4m end if i = i + end while Table A: Scrambling sequence selection for TDD HARQ- bundling. i [ w w w ] w 2 3 [ ] [ ] 2 [ ] 3 [ ] When HARQ- information is to be multiplexed with UL-SCH at a given UL cell, the HARQ- information is multiplexed in all laers of all transport blocs of that UL cell, For a given transport bloc, the vector sequence output of the channel coding for HARQ- information is denoted b q, q,..., q, where q, Q i i =,..., Q are column vectors of length ( Q m N L ) and where Q = Q / Qm is obtained as follows: Set i, to while i < Q ˆ q i i + Q m = [ q... q ] -- temporar row vector NL T q = [ qˆ Lqˆ ] -- replicating the row vector i = i + Q m = + end while where qˆ N L is the number of laers onto which the UL-SCH transport bloc is mapped. N L times and transposing into a column vector For ran indication () ( onl, joint report of and i, and joint report of and PTI) The corresponding bit widths for feedbac for PDSCH transmissions are given b Tables , , , , A, , and A, which are determined assuming the maximum number of laers according to the corresponding enodeb antenna configuration and UE categor.