3GPP TS V8.1.0 ( )

Similar documents
3GPP TS V8.3.0 ( )

ETSI TS V8.3.0 ( ) Technical Specification

ETSI TS V ( )

ETSI TS V ( ) Technical Specification

ETSI TS V ( )

ETSI TS V ( )

3GPP TS V8.0.0 ( )

ETSI TS V ( )

ETSI TS V ( )

3GPP TS V ( )

ARIB STD-T V Evolved Universal Terrestrial Radio Access (E-UTRA); LTE Physical Layer - General Description (Release 8)

ETSI TS V ( )

3GPP TS V ( )

3GPP TS V8.9.0 ( )

3G TR 25.xxx V0.0.1 ( )

3GPP TS V8.0.0 ( )

ETSI TS V8.1.0 ( ) Technical Specification

ETSI TS V ( )

3GPP TR V ( )

3GPP TS V8.4.0 ( )

3GPP TS V ( )

ETSI TS V8.2.0 ( ) Technical Specification

3GPP TS V8.0.0 ( )

3GPP TS V6.6.0 ( )

3GPP TS V ( )

3GPP TS V ( )

ETSI TS V ( )

ETSI TS V ( )

ETSI TS V8.7.0 ( ) Technical Specification

3GPP TS V ( )

3GPP TS V ( )

ARIB STD-T V

3GPP TS V8.0.0 ( )

3GPP TS V8.0.0 ( )

3GPP TS V ( )

3GPP TS V ( )

3GPP TS V ( )

ETSI TS V ( ) Technical Specification

3GPP TR v ( )

3GPP TS V ( )

3GPP TS V5.6.0 ( )

3GPP TS V8.0.0 ( )

II. FRAME STRUCTURE In this section, we present the downlink frame structure of 3GPP LTE and WiMAX standards. Here, we consider

3GPP TS V8.0.1 ( )

3GPP TR V ( )

ETSI TS V ( )

ETSI TS V8.1.0 ( ) Technical Specification

ETSI TS V6.2.0 ( )

ETSI TS V (201

3G/4G Mobile Communications Systems. Dr. Stefan Brück Qualcomm Corporate R&D Center Germany

3GPP TS V8.0.0 ( )

ETSI TS V1.1.2 ( )

3G TS V3.0.0 ( )

3G TS V2.0.0 ( )

3G TS V3.2.0 ( )

ETSI TS V ( )

3GPP TSG RAN WG2 TR V0.1.0: on Opportunity Driven Multiple Access

ARIB STD-T V Mandatory speech codec; AMR speech codec; Interface to lu and Uu (Release 1999)

3GPP TS V9.0.0 ( )

DOWNLINK AIR-INTERFACE...

ARIB STD-T V Evolved Universal Terrestrial Radio Access (E-UTRA); Base Station (BS) radio transmission and reception (Release 8)

ETSI TS V8.1.0 ( ) Technical Specification

3GPP TS V ( )

3GPP TS V ( )

3GPP TS V ( )

ETSI TS V ( ) Technical Specification

3GPP TS V8.3.0 ( )

ETSI TS V8.1.0 ( ) Technical Specification

3GPP TS V8.0.0 ( )

ETSI TS V ( )

3GPP TS V6.4.0 ( )

ETSI TS V9.1.0 ( )

3GPP TS V8.9.0 ( )

ETSI TS V ( )

ARIB STD-T V10.5.0

GSM GSM TELECOMMUNICATION May 1996 STANDARD Version 5.0.0

3GPP TS V ( )

ETSI TS V8.0.0 ( ) Technical Specification

ETSI TS V5.1.0 ( )

3GPP TS V8.9.0 ( )

LTE systems: overview

ETSI TS V ( )

Architecture Overview NCHU CSE LTE - 1

MACHINE TO MACHINE (M2M) COMMUNICATIONS-PART II

3GPP TS V ( )

3GPP TS V5.0.0 ( )

ARIB STD-T V Evolved Universal Terrestrial Radio Access (E-UTRA); Services provided by the physical layer.

ETSI TS V3.1.0 ( )

3GPP TS V8.1.0 ( )

ETSI TS V ( )

EUROPEAN ETS TELECOMMUNICATION May 1997 STANDARD

ETSI TS V ( )

3GPP TS V ( )

3GPP TS V ( )

GSM GSM TECHNICAL August 1997 SPECIFICATION Version 5.2.0

ETSI TS V9.1.1 ( ) Technical Specification

3GPP TS V ( )

Wireless Test World 2009

3GPP TR V ( )

CH 4. Air Interface of the IS-95A CDMA System

Transcription:

TS 36. V8.. (7- Technical Specification 3 rd Generation Partnership Project; Technical Specification Group Radio Access Networ; Evolved Universal Terrestrial Radio Access (E-UTRA; ultiplexing and channel coding (Release 8 The present document has been developed within the 3 rd Generation Partnership Project ( T and ma be further elaborated for the purposes of. The present document has not been subject to an approval process b the Organizational Partners and shall not be implemented. This Specification is provided for future development wor within onl. The Organizational Partners accept no liabilit for an use of this Specification. Specifications and reports for implementation of the T sstem should be obtained via the Organizational Partners Publications Offices.

TS 36. V8.. (7- Kewords <eword[, eword]> Postal address support office address 65 Route des Lucioles Sophia Antipolis Valbonne France Tel. : +33 9 9 Fax : +33 93 65 7 6 Internet http:www.3gpp.org 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. 7, Organizational Partners (ARIB, ATIS, SA, ETSI, TTA, T. All rights reserved.

3 TS 36. V8.. (7- Contents Foreword...5 Scope...6 References...6 3 Definitions, smbols and abbreviations...6 3. Definitions... 6 3. Smbols... 6 3.3 Abbreviations... 7 apping to phsical channels...7. Uplin... 7. Downlin... 7 5 Channel coding, multiplexing and interleaving...8 5. Generic procedures... 8 5.. CRC calculation... 8 5.. Code bloc segmentation and code bloc CRC attachment... 9 5..3 Channel coding... 5..3. Tail biting convolutional coding... 5..3. Turbo coding... 5..3.. Turbo encoder... 5..3.. Trellis termination for turbo encoder... 3 5..3..3 Turbo code internal interleaver... 3 5.. Rate matching... 5 5... Rate matching for turbo coded transport channels... 5 5... Sub-bloc interleaver... 5 5... Bit collection, selection and transmission... 6 5... Rate matching for convolutionall coded transport channels and control information... 7 5... Sub-bloc interleaver... 8 5... Bit collection, selection and transmission... 9 5..5 Code bloc concatenation... 9 5. Uplin transport channels and control information... 5.. Random access channel... 5.. Uplin shared channel... 5... Transport bloc CRC attachment... 5... Code bloc segmentation and code bloc CRC attachment... 5...3 Channel coding of UL-SCH... 5... Rate matching... 5...5 Code bloc concatenation... 5...6 Channel coding of control information... 5...7 Data and control multiplexing... 5...8 Channel interleaver... 3 5..3 Uplin control information... 3 5..3. Channel coding for UCI HARQ-ACK... 3 5..3. Channel coding for UCI scheduling request... 3 5..3.3 Channel coding for UCI channel qualit information... 3 5..3. Channel coding for UCI channel qualit information and HARQ-ACK... 3 5.3 Downlin transport channels and control information... 3 5.3. Broadcast channel... 3 5.3.. Transport bloc CRC attachment... 3 5.3.. Channel coding... 3 5.3..3 Rate matching... 3 5.3. Downlin shared channel, Paging channel and ulticast channel... 3 5.3.. Transport bloc CRC attachment... 33 5.3.. Code bloc segmentation and code bloc CRC attachment... 33 5.3..3 Channel coding... 33 5.3.. Rate matching... 3

TS 36. V8.. (7-5.3..5 Code bloc concatenation... 3 5.3.3 Downlin control information... 3 5.3.3. DCI formats... 35 5.3.3.. Format... 35 5.3.3.. Format... 35 5.3.3..3 Format A... 36 5.3.3.. Format... 36 5.3.3..5 Format 3... 37 5.3.3..6 Format 3A... 37 5.3.3. CRC attachment... 37 5.3.3.3 Channel coding... 37 5.3.3. Rate matching... 37 5.3. Control format indicator... 37 5.3.. Channel coding... 38 5.3.5 HARQ indicator... 38 5.3.5. Channel coding... 38 Annex <X> (informative: Change histor...39

5 TS 36. V8.. (7- Foreword This Technical Specification has been produced b the 3 rd Generation Partnership Project (. 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; 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.

6 TS 36. V8.. (7- Scope The present document specifies the coding, multiplexing and mapping to phsical channels for E-UTRA. 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 document (including a GS document, a non-specific reference implicitl refers to the latest version of that document in the same Release as the present document. [] TR.95: "Vocabular for Specifications". [] TS 36.: "Evolved Universal Terrestrial Radio Access (E-UTRA; Phsical channels and modulation". [3] TS 36.3: "Evolved Universal Terrestrial Radio Access (E-UTRA; Phsical laer procedures". 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. Smbols For the purposes of the present document, the following smbols appl: DL N RB Downlin bandwidth configuration, expressed in number of resource blocs [] UL N RB Uplin bandwidth configuration, expressed in number of resource blocs [] PUSCH N smb Number of SC-FDA smbols carring PUSCH in a subframe N smb Number of SC-FDA smbols carring control information in a subframe. [Note from the editor: This number does not include additional control information that ma be punctured into the data resources.] UL N smb Number of SC-FDA smbols in an uplin slot N SRS Number of SC-FDA smbols used for SRS transmission in a subframe ( or.

7 TS 36. V8.. (7-3.3 Abbreviations For the purposes of the present document, the following abbreviations appl: BCH CFI CP DCI DL-SCH HI CH PBCH PCFICH PCH PDH PDSCH PHICH PCH PRACH PUH PUSCH RACH SRS UCI UL-SCH Broadcast channel Control Format Indicator Cclic Prefix Downlin Control Information Downlin Shared channel HARQ indicator ulticast channel Phsical Broadcast channel Phsical Control Format Indicator channel Paging channel Phsical Downlin Control channel Phsical Downlin Shared channel Phsical HARQ indicator channel Phsical ulticast channel Phsical Random Access channel Phsical Uplin Control channel Phsical Uplin Shared channel Random Access channel Sounding Reference Signal Uplin Control Information Uplin Shared channel apping to phsical channels. Uplin Table.- specifies the mapping of the uplin transport channels to their corresponding phsical channels. Table.- specifies the mapping of the uplin control channel information to its corresponding phsical channel. Table.- TrCH UL-SCH RACH Phsical Channel PUSCH PRACH Table.- Control information UCI Phsical Channel PUH. Downlin Table.- 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.

8 TS 36. V8.. (7- Table.- TrCH DL-SCH BCH PCH CH Phsical Channel PDSCH PBCH PDSCH PCH Table.- Control information CFI HI DCI Phsical Channel PCFICH PHICH PDH 5 Channel coding, multiplexing and interleaving Data and control streams fromto AC laer are encodeddecoded 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 ontosplitting 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, a, a3,..., a A, and the parit bits b p, p, p, 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 CRCA (D = [D + D 3 + D 8 + D 7 + D + D + D + D 7 + D 6 + D 5 + D + D 3 + D + ] and; - g CRCB (D = [D + D 3 + D 6 + D 5 + D + ] for a CRC length L = and; - g CRC6 (D = [D 6 + D + D 5 + ] for a CRC length L = 6. The encoding is performed in a sstematic form, which means that in GF(, the polnomial: a A+ 3 A+ 3 D + ad + + a AD + p D + pd +...... + p D + p ields a remainder equal to when divided b the corresponding length- CRC generator polnomial, g CRCA (D or g CRCB (D, and the polnomial: a A+ 5 A+ 6 5 D + ad + + a AD + p D + pd +...... + p D + p ields a remainder equal to when divided b g CRC6 (D. The bits after CRC attachment are denoted b b, b, b, b3,..., b B, where B = A+ L. The relation between a and b is: b = a for =,,,, A- b = for = A, A+, A+,..., A+L-. p A 5 3

9 TS 36. V8.. (7-5.. Code bloc segmentation and code bloc CRC attachment The input bit sequence to the code bloc segmentation is denoted b b, b, b, 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 = bits is attached to each code bloc. The maximum code bloc size is: - Z = 6. 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 <, 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 = 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, cr, 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 5..3-3 such that if C = C K B the number of code blocs with length K + is C + =, K =, C = else if C > Second segmentation size: K = maximum K in table 5..3-3 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- =< NULL > c F C K + C K B = + + -- Insertion of filler bits

TS 36. V8.. (7- end for = 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 = end for The sequence c r, cr, cr, cr3,..., cr( Kr L is used to calculate the CRC parit bits p r, pr, pr,..., pr( L according to subclause 5.. with the generator polnomial g CRCB (D. For CRC calculation it is assumed that filler bits, if present, have the value. while < K r cr = p r ( + LKr = + end while 5..3 Channel coding The bit sequence input for a given code bloc to channel coding is denoted b c, c, c, c3,..., c K, where K is the number of bits to encode. After encoding the bits are denoted b d, d, d, 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 5..3-. Usage of coding scheme and coding rate for the different control information tpes is shown in table 5..3-. The values of D in connection with each coding scheme: - tail biting convolutional coding with rate 3: D = K;

TS 36. V8.. (7- - turbo coding with rate 3: D = K +. The range for the output stream index i is, and 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 CH BCH Turbo coding 3 Tail biting convolutional coding 3 Table 5..3-: 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 UCI [FFS] [FFS] 5..3. 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 5..3-. 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, s,..., s5, then the initial value of the shift register shall be set to s i = c( K i c ( d ( d ( d The encoder output streams d, shown in Figure 5..3-. Figure 5..3-: Rate 3 tail biting convolutional encoder ( 5..3. Turbo coding ( d and 5..3.. Turbo encoder ( d correspond to the first, second and third parit streams, respectivel as The scheme of turbo encoder is a Parallel Concatenated Convolutional Code (PC 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 5..3-.

TS 36. V8.. (7- The transfer function of the 8-state constituent code for the PC is: G(D = g, g ( D, ( D where g (D = + D + 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 ( = z d for =,,,..., 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, c, c3,..., c K, and the bits output from the first and second 8- state constituent encoders are denoted b z, z, z, z3,..., z K and z, z, z, 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.

3 TS 36. V8.. (7- x z c z c x Figure 5..3-: Structure of rate 3 turbo encoder (dotted lines appl for trellis termination onl 5..3.. 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 5..3- in lower position while the second constituent encoder is disabled. The last three tail bits shall be used to terminate the second constituent encoder (lower switch of figure 5..3- 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 ( K = x K + (, K + = z K + d, d = x K (, K + = xk + d, d = z K ( K + = K + ( ( K +, d K + 3 = z K + ( ( K +, d K + 3 = x K + ( K + + ( K + 3 + d, d z, d = x K, d = z K 5..3..3 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: ci = cπ( i, i=,,, (K-

TS 36. V8.. (7- where the relationship between the output index i and the input index Π (i satisfies the following quadratic form: Π = ( f i + f i mod K The parameters f and f depend on the bloc size K and are summarized in Table 5..3-3. Table 5..3-3: Turbo code internal interleaver parameters i K i f f i K i f f i K i f f i K i f f 3 8 6 5 5 95 67 3 8 7 9 5 6 96 5 35 7 3 36 3 3 56 9 5 3 7 7 97 8 9 7 338 5 6 7 6 5 9 98 6 39 76 5 339 5 5 7 7 8 5 8 9 68 99 8 9 78 6 356 5 9 6 8 53 56 9 8 99 7 35 57 7 88 5 5 6 7 58 3 8 8 358 57 336 8 96 55 7 9 8 3 5 9 368 33 8 9 7 6 56 8 89 8 3 376 86 5 37 7 3 8 57 88 9 8 3 88 5 3776 79 36 3 9 58 96 57 6 5 9 6 5 38 33 8 5 3 59 5 55 8 6 7 5 9 53 39 363 3 36 9 3 6 5 3 6 7 5 9 86 5 3968 375 8 7 8 6 58 7 66 8 536 7 8 55 3 7 68 5 5 9 38 6 5 35 68 9 568 3 8 56 96 3 6 6 6 63 56 7 6 7 8 57 6 33 3 7 68 8 6 576 65 96 63 5 58 3 6 8 76 65 59 9 7 66 83 59 88 33 3 9 8 57 6 66 68 37 76 3 696 55 95 6 35 77 8 9 3 8 67 6 3 78 7 96 6 6 35 38 3 5 68 6 39 8 5 76 7 6 8 33 8 8 7 5 69 656 85 8 6 79 9 63 5 357 3 6 36 7 67 3 5 7 8 9 6 68 337 8 7 56 7 688 86 8 856 57 6 65 67 37 6 5 3 85 58 7 7 55 9 888 5 35 66 736 7 6 9 6 73 7 79 9 3 67 8 7 7 8 33 6 7 736 39 9 95 59 6 68 86 37 5 8 56 5 3 75 75 3 9 98 85 69 98 39 6 9 6 7 98 76 768 7 8 3 6 3 7 99 7 3 3 7 33 68 77 78 5 98 8 3 6 7 556 39 58 3 8 3 78 8 7 8 5 7 66 7 5 39 8 3 88 9 36 79 86 7 6 76 7 36 73 58 3 96 33 96 9 7 8 83 5 5 7 9 7 58 3 9 3 3 37 76 8 88 39 6 8 3 53 6 75 53 66 35 3 9 78 8 86 7 8 9 368 367 76 5376 5 336 36 3 83 88 37 3 3 65 56 77 5 3 7 37 38 8 8 896 5 3 96 8 68 78 55 86 38 336 5 8 85 9 9 3 56 39 8 79 5568 3 7 39 3 93 86 86 98 5 58 33 6 7 6 8 563 5 76 35 87 9 7 8 3 688 7 5 8 5696 5 78 36 33 9 88 96 9 6 35 75 3 7 8 576 6 368 8 6 89 976 59 36 86 3 88 83 58 89 8 3 376 5 9 9 99 65 37 88 9 3 8 5888 33 8 38 3 8 9 8 55 8 38 9 5 9 85 595 7 86 5 39 3 98 9 3 6 39 38 57 88 86 66 3 9 6 5 93 56 7 66 37 7 96 87 68 7 9 7 8 55 9 88 7 336 3 8 88 6 63 8

5 TS 36. V8.. (7-5.. Rate matching 5... 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 ( ( information bit streams d, d and d (, followed b the collection of bits and the generation of a circular buffer as depicted in Figure 5..-. The output bits for each code bloc are transmitted as described in subclause 5... ( d ( v ( d ( v w e ( d ( v The bit stream ( d Figure 5..-. Rate matching for turbo coded transport channels is interleaved according to the sub-bloc interleaver defined in subclause 5... with an output ( ( ( (, v KΠ sequence defined as v v, v,..., and where K Π is defined in subclause 5... The bit stream ( d is interleaved according to the sub-bloc interleaver defined in subclause 5... with an output ( ( ( (, v KΠ sequence defined as v v, v,...,. The bit stream ( d is interleaved according to the sub-bloc interleaver defined in subclause 5... with an output ( ( ( (, v KΠ sequence defined as v v, v,...,. The sequence of bits e for transmission is generated according to subclause 5... 5... Sub-bloc interleaver The bits input to the bloc interleaver are denoted b d, d, d,..., d bit sequence from the bloc interleaver is derived as follows: subbloc subbloc D, where D is the number of bits. The output ( Assign C = 3 to be the number of columns of the matrix. The columns of the matrix are numbered,,,, C from left to right. ( Determine the number of rows of the matrix R subbloc, b finding minimum integer ( R subbloc C D subbloc subbloc The rows of rectangular matrix are numbered,,,, R from top to bottom. R subbloc such that:

6 TS 36. V8.. (7- (3 If ( R C D, then N ( R C D subbloc subbloc > D = dumm bits are padded such that = <NULL> subbloc subbloc for =,,, N D -. Then, write the input bit sequence, i.e. N D + = d, =,,, D-, into the ( C R matrix row b row starting with bit in column of row : subbloc subbloc (i Csubbloc ( Rsubbloc Csubbloc Csubbloc + ( Rsubbloc Csubbloc + Csubbloc + ( Rsubbloc Csubbloc + L L O L Csubbloc Csubbloc ( Rsubbloc Csubbloc For ( d ( and d : ( Perform the inter-column permutation for the matrix based on the pattern ( j j {,,..., } P that is shown in C subbloc table 5..-, where P(j is the original column position of the j-th permuted column. After permutation of the R C matrix is equal to columns, the inter-column permuted ( subbloc subbloc P( P( + Csubbloc P( + ( Rsubbloc Csubbloc P( P( + Csubbloc P( + ( Rsubbloc Csubbloc P( P( + Csubbloc P( + ( Rsubbloc Csubbloc L L O L P( Csubbloc P( Csubbloc + Csubbloc P( Csubbloc + ( Rsubbloc Csubbloc (5 The output of the bloc interleaver is the bit sequence read out column b column from the inter-column permuted ( C R subbloc subbloc matrix. The bits after sub-bloc interleaving are denoted b v, v, v,..., v where v corresponds to P(, v to ( For d : P(+ C subbloc and K = ( R subbloc C K. Π subbloc Π = ( R C ( ( ( (, v KΠ ( The output of the sub-bloc interleaver is denoted b v v, v,...,, where v = π ( and where ( mod R + subbloc mod Π π ( = P + C K subbloc Rsubbloc The permutation function P is defined in Table 5..-. Table 5..- Inter-column permutation pattern for sub-bloc interleaver ( KΠ, Number of columns C subbloc 3 Inter-column permutation pattern < P (, P(,..., P( > C subbloc <, 6, 8,,,,, 8,, 8,, 6, 6,,, 3,, 7, 9, 5, 5,, 3, 9, 3, 9,, 7, 7, 3, 5, 3 > 5... 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 v Π + w = for =,, K Π

7 TS 36. V8.. (7- ( K v Π + + w = for =,, K Π 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, 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 for QPSK, for 6QA and 6 for 6QA, and where N L is equal to for blocs mapped onto one transmission laer and is equal to for blocs mapped onto two or four transmission laers. Set G = G ( Set γ = G mod C, where C is the number of code blocs computed in subclause 5... if r C γ else end if set E = N L G C set E = N L G C Set R subbloc ( rv = idx + Set = and j = while { < E } if w + j mod < NULL > ( e end if = K w w( + j mod K w = + j = j + end while 5... 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 ( ( ( three bit streams, d, d and d, followed b the collection of bits and the generation of a circular buffer as depicted in Figure 5..-. The output bits are transmitted as described in subclause 5... ( d ( v ( d ( v w e ( d ( v

8 TS 36. V8.. (7- Figure 5..-. Rate matching for convolutionall coded transport channels and control information The bit stream ( d is interleaved according to the sub-bloc interleaver defined in subclause 5... with an output ( ( ( (, v KΠ sequence defined as v v, v,..., and where K Π is defined in subclause 5... The bit stream ( d is interleaved according to the sub-bloc interleaver defined in subclause 5... with an output ( ( ( (, v KΠ sequence defined as v v, v,...,. The bit stream ( d is interleaved according to the sub-bloc interleaver defined in subclause 5... with an output ( ( ( (, v KΠ sequence defined as v v, v,...,. The sequence of bits e for transmission is generated according to subclause 5... 5... Sub-bloc interleaver The bits input to the bloc interleaver are denoted b d, d, d,..., d bit sequence from the bloc interleaver is derived as follows: subbloc subbloc D, where D is the number of bits. The output ( Assign C = 3 to be the number of columns of the matrix. The columns of the matrix are numbered,,,, C from left to right. ( Determine the number of rows of the matrix R subbloc, b finding minimum integer ( R subbloc C D subbloc The rows of rectangular matrix are numbered,,,, R from top to bottom. subbloc (3 If ( R C D, then N ( R C D subbloc subbloc > D subbloc subbloc for =,,, N D -. Then, write the input bit sequence, i.e. the ( C subbloc subbloc R subbloc such that: = dumm bits are padded such that = <NULL> N (i D + = d, =,,, D-, into R matrix row b row starting with bit in column of row : C subbloc ( R subbloc C subbloc C subbloc + ( R subbloc C subbloc + C subbloc + ( R subbloc C subbloc + L L O L C subbloc C subbloc ( R subbloc C subbloc ( Perform the inter-column permutation for the matrix based on the pattern ( j j {,,..., } P that is shown in C subbloc table 5..-, where P(j is the original column position of the j-th permuted column. After permutation of the R C matrix is equal to columns, the inter-column permuted ( subbloc subbloc P( P( + Csubbloc P( + ( Rsubbloc Csubbloc P( P( + Csubbloc P( + ( Rsubbloc Csubbloc P( P( + Csubbloc P( + ( Rsubbloc Csubbloc L L O L P( Csubbloc P( Csubbloc + Csubbloc P( Csubbloc + ( Rsubbloc Csubbloc (5 The output of the bloc interleaver is the bit sequence read out column b column from the inter-column permuted ( C R subbloc subbloc matrix. The bits after sub-bloc interleaving are denoted b v, v, v,..., v where v corresponds to P(, v to P(+ C subbloc and K = ( R subbloc C Π subbloc KΠ,

9 TS 36. V8.. (7- Table 5..- Inter-column permutation pattern for sub-bloc interleaver Number of columns C subbloc 3 Inter-column permutation pattern < P (, P(,..., P( > C subbloc <, 7, 9, 5, 5,, 3, 9, 3, 9,, 7, 7, 3, 5, 3,, 6, 8,,,,, 8,, 8,, 6, 6,,, 3 > 5... 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Π + ( ( K 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 } if w < NULL > j mod K w e end if = w j mod K w = + j = j + end while 5..5 Code bloc concatenation The input bit sequence for the code bloc concatenation and channel interleaving bloc are the sequences e r, for r =,..., C and,..., E. The output bit sequence from the code bloc concatenation and channel interleaving bloc is the sequence = r 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 +

TS 36. V8.. (7- end while r = r + end while 5. Uplin transport channels and control information 5.. Random access channel The sequence index for the random access channel is received from higher laers and is processed according to []. 5.. Uplin shared channel Figure 5..- shows the processing structure for the UL-SCH transport channel. Data arrives to the coding unit in form of a maximum of one transport bloc ever transmission time interval (TTI. The following coding steps can be identified: Add CRC to the transport bloc Code bloc segmentation and code bloc CRC attachment Channel coding of data and control information Rate matching Code bloc concatenation ultiplexing of data and control information Channel interleaver The coding steps for UL-SCH transport channel are shown in the figure below.

TS 36. V8.. (7- a,...,, a a A Transport bloc CRC attachment b,...,, b b B Code bloc segmentation Code bloc CRC attachment cr, cr,..., cr( K r Channel coding dr, dr,..., dr( D r Rate matching er, er,..., er( E r Code bloc concatenation Channel coding o,...,, o o O f,...,, f f G q,...,, q q Q Data and Control multiplexing g,...,, g g H Channel interleaver h,...,, h h H Figure 5..-: Transport channel processing for UL-SCH 5... Transport bloc CRC attachment Error detection is provided on UL-SCH transport blocs 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, a, a3,..., a A, and the parit bits b p, p, p, p3,..., p L. A is the size of the transport bloc and L is the number of parit bits. The parit bits are computed and attached to the UL-SCH transport bloc according to subclause 5.. setting L to bits and using the generator polnomial g CRCA (D. 5... Code bloc segmentation and code bloc CRC attachment The bits input to the code bloc segmentation are denoted b b, b, b, b3,..., b B where B is the number of bits in the transport bloc (including CRC.

TS 36. V8.. (7- Code bloc segmentation and code bloc CRC attachment are performed according to subclause 5... The bits after code bloc segmentation are denoted b c r, cr, cr, cr3,..., cr( K r, where r is the code bloc number and K r is the number of bits for code bloc number r. 5...3 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, cr, 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 subclause 5..3.. After encoding the bits are denoted b dr, dr, dr, dr3,..., d r( Dr, with i =,, and and where Dr is the number of bits on the i-th coded stream for code bloc number r, i.e. D K +. 5... Rate matching r = r Turbo coded blocs are delivered to the rate matching bloc. The are denoted b dr, dr, dr, dr3,..., d r( Dr, with i =,, and, 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 subclause 5... After rate matching, the bits are denoted b e r, er, er, er3,..., er( E r, where r is the coded bloc number, and where E r is the number of rate matched bits for code bloc number r. 5...5 Code bloc concatenation The bits input to the code bloc concatenation bloc are denoted b e r, er, er, 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 subclause 5..5. The bits after code bloc concatenation are denoted b f, f, f, f3,..., f G, where G is the total number of coded bits for transmission excluding the bits used for control transmission, when control information is multiplexed with the UL- SCH transmission. 5...6 Channel coding of control information The coding rate of the control information when multiplexed with the data transmission is given b the modulation scheme and the coding rate used for the UL-SCH transmission. Different coding rates for the control information are achieved b allocating different number of coded smbols for its transmission. The bits output from the control information coding are denoted b q, q, q, q3,..., q Q. [Note from the editor: the value Q needs to be a multiple of Q m so that modulation smbols do not mix control and data information.] 5...7 Data and control multiplexing The control and data multiplexing is performed such that control is present on both slots in the subframe and so that the control is mapped to resources around the demodulation reference signals. In addition, the multiplexing ensures that control and data information are mapped to different modulation smbols. The inputs to the data and control multiplexing are the coded bits of the control information denoted b q, q, q, q3,..., q Q and the coded bits of the UL-SCH denoted b f, f, f, f 3,..., f G. The output of the data and

3 TS 36. V8.. (7- control multiplexing operation is denoted b g, g, g, g,..., g, where H = ( G + Q and H = H, and where g, i =,..., H are column vectors of length Q m. i 3 PUSCH UL Denote the number of SC-FDA smbols per subframe for PUSCH transmission b N = ( ( N H smb smb N SRS. PUSCH Set = H N smb, which is the number of coded bits per SC-FDA smbol carring PUSCH and Q = Q, which is the number of modulation smbols for control information in the subframe. The number of SC-FDA smbols containing control information denoted b N smb is defined to be N smb if Q = if < Q = 8 if < Q 8 PUSCH N smb if Q > 8 Denote b n i the number of control information coded bits in the i-th SC-FDA smbol carring PUSCH in the subframe. The number of coded bits for control to be mapped to each SC-FDA smbol carring PUSCH for subframes with normal CP is as specified in Tables 5...7- through 5...7-9. [Note from the editor: Tables 5...7- through 5...7-8 and descriptions in this section ma be revised later according to further decisions on multiplexing multiple inds of control information with data.] smb = Table 5...7-: Values of n i for N, normal CP subframes with no SRS Q ' mod n n n n 3 n n 5 n 6 n 7 n 8 n 9 n n Q Q Q Q Q m Q' Q m Q' Q m Q' Q' Q' Q' Q m Q' 3 Q m Q m Q m smb = Table 5...7-: Values of n i for N, normal CP subframes with SRS in the last smbol Q ' mod n n n n 3 n n 5 n 6 n 7 n 8 n 9 n Q Q Q Q Q m Q' Q m Q' Q m Q' Q' Q' Q' Q m Q' 3 Q m Q m Q m smb = Table 5...7-3: Values of n i for N, normal CP subframes with SRS in the first smbol Q ' mod n n n n 3 n n 5 n 6 n 7 n 8 n 9 n Q Q Q Q Q m Q' Q m Q' Q m Q' Q' Q' Q' Q m Q' 3 Q m Q m Q m

TS 36. V8.. (7- smb = Table 5...7-: Values of n i for N 8, normal CP subframes with no SRS [( ] mod ( R Q n n n n 3 n n 5 Q mux m ( ( Q Q ( R mux m ( Q Q ( Q m ( ( Q Q 3 m ( ( Q Q ( m ( Q Q ( m ( Q Q [( ] mod ( R Q n 6 n 7 n 8 n 9 n n Q mux m ( ( Q Q ( R mux m ( Q Q ( Q m ( ( Q Q 3 m ( ( Q Q ( m ( Q Q ( m ( Q Q smb = Table 5...7-5: Values of n i for N 8, normal CP subframes with SRS in the last smbol [( ] mod ( R Q n n n n 3 n n 5 Q mux m ( ( Q Q ( R mux m ( Q Q ( Q m ( ( Q Q 3 m ( ( Q Q ( m ( Q Q ( m ( Q Q [( ] mod ( R Q n 6 n 7 n 8 n 9 n Q mux m ( ( Q Q ( Q R mux ( Q ( m ( ( Q Q 3 m ( ( Q Q ( ( Q ( ( Q

5 TS 36. V8.. (7- smb = Table 5...7-6: Values of n i for N 8, normal CP subframes with SRS in the first smbol [( ] mod ( R Q n n n n 3 n Q mux m ( ( Q Q ( R mux m ( Q Q ( Q m ( ( Q Q 3 m ( ( Q Q ( m ( Q Q ( m ( Q Q [( ] mod ( R Q n 5 n 6 n 7 n 8 n 9 n Q mux m ( ( Q Q ( R mux m ( Q Q ( Q m ( ( Q Q 3 m ( ( Q Q ( m ( Q Q ( m ( Q Q smb PUSCH smb Table 5...7-7: Values of n i for N = N, normal CP subframes with no SRS [( 8 ] mod ( R Q n n n n 3 n n 5 Q 8 mux m ( ( Q 8 Q ( Q 8R mux ( Q 8 ( m ( ( Q 8 Q ( ( Q 8 3 m ( ( Q 8 Q ( ( Q 8 [( 8 ] mod ( R Q n 6 n 7 n 8 n 9 n n Q 8 mux m ( ( Q 8 Q ( Q 8R mux ( Q 8 ( m ( ( Q 8 Q ( ( Q 8 3 m ( ( Q 8 Q ( ( Q 8

6 TS 36. V8.. (7- smb PUSCH smb Table 5...7-8: Values of n i for N = N, normal CP subframes with SRS in the last smbol [( 8 ] mod 3 ( R 3 Q n n n N 3 n n 5 Q 8 mux m ( ( Q 8 Q 3 ( Q 8R mux 3 ( Q 8 ( 3 m ( ( Q 8 Q 3 ( ( Q 8 3 [( 8 ] mod 3 ( R 3 Q n 6 n 7 n 8 N 9 n Q 8 mux m ( ( Q 8 Q 3 m ( ( Q 8 Q 3 smb PUSCH smb Table 5...7-9: Values of n i for N = N, normal CP subframes with SRS in the first smbol [( Q ] mod 3 Q n n n n 3 n 8 m ( Q 8R mux 3 ( Q 8 ( 3 ( ( Q 8 3 [( 8 ] mod 3 ( R 3 Q n 5 n 6 n 7 n 8 n 9 n Q 8 mux m ( ( Q 8 Q 3 ( Q 8R mux 3 ( Q 8 ( 3 m ( ( Q 8 Q 3 ( ( Q 8 3 The number of coded bits for control to be mapped to each SC-FDA smbol carring PUSCH for subframes with extended CP is as specified in Tables 5...7- through 5...7-8. smb = Table 5...7-: Values of n i for N, extended CP subframes with no SRS Q ' mod n n n n 3 n n 5 n 6 n 7 n 8 n 9 Q Q Q Q Q m Q' Q m Q' Q m Q' Q' Q' Q' Q m Q' 3 Q m Q m Q m

7 TS 36. V8.. (7- smb = Table 5...7-: Values of n i for N, extended CP subframes with SRS in the last smbol Q ' mod n n n n 3 n n 5 n 6 n 7 n 8 Q Q Q Q Q m Q' Q m Q' Q m Q' 3 Q m Q' Q m Q' Q m Q' smb = Table 5...7-: Values of n i for N, extended CP subframes with SRS in the first smbol Q ' mod n n n n 3 n n 5 n 6 n 7 n 8 Q Q Q Q Q m Q' Q' Q m Q' Q m Q' Q' 3 Q m Q' Q m Q' Q m Q' Q' Q m Q m Q m smb = Table 5...7-3: Values of n i for N 8, extended CP subframes with no SRS [( ] mod ( R Q n n n n 3 n Q mux m ( ( Q Q m ( ( Q Q ( Q R mux ( Q ( ( ( Q \ 3 m ( ( Q Q ( ( Q [( ] mod ( R Q n 5 n 6 n 7 n 8 n 9 Q mux m ( ( Q Q ( Q R mux ( Q ( m ( ( Q Q 3 m ( ( Q Q ( ( Q ( ( Q

8 TS 36. V8.. (7- smb = Table 5...7-: Values of n i for N 8, extended CP subframes with SRS in the last smbol [( ] mod ( R Q n n n n 3 n Q mux m ( ( Q Q ( Q R mux ( Q ( m ( ( Q Q 3 m ( ( Q Q ( ( Q ( ( Q [( ] mod ( Q R ( R Q n 5 n 6 n 7 n 8 mux Q mux ( ( Q m ( ( Q Q ( ( Q m ( ( Q Q 3 ( ( Q m ( ( Q Q smb = Table 5...7-5: Values of n i for N 8, extended CP subframes [( ] mod ( R with SRS in the first smbol Q n n n n 3 Q mux m ( ( Q m ( ( Q 3 m ( ( Q Q Q Q [( ] mod ( R ( Q R mux ( Q ( ( ( Q ( ( Q Q n n 5 n 6 n 7 n 8 Q mux m ( ( Q m ( ( Q 3 m ( ( Q Q Q Q ( Q R mux ( Q ( ( ( Q ( ( Q

9 TS 36. V8.. (7- smb PUSCH smb Table 5...7-6: Values of n i for N = N, extended CP subframes with no SRS [( 8 ] mod ( R Q n n n n 3 n Q 8 mux m ( ( Q 8 Q [( 8 ] mod ( R Q n 5 n 6 n 7 n 8 n 9 Q 8 mux m ( ( Q 8 Q smb PUSCH smb Table 5...7-7: Values of n i for N = N, extended CP subframes with SRS in the last smbol n n n n 3 n n 5 n 6 n 7 n 8 Q 8 mux R ( smb PUSCH smb Table 5...7-8: Values of n i for N = N, extended CP subframes with SRS in the first smbol n n n n 3 n n 5 n 6 n 7 n 8 mux R ( Q 8 mux R The control information and the data shall be multiplexed as follows: Set i, j,, l to while l < H if n > -- control coded bits left in this SC-FDA smbol (multiplex control PUSCH l mod N smb g = ] j = j + [ q j... q j+ Q m = + T n PUSCH l mod N smb = n PUSCH l mod N smb Q m else no more control coded bits in this SC-FDA smbol (multiplex data g = f f ] i = i + [ i... i+ Q m = + end if l = l + end while T

3 TS 36. V8.. (7-5...8 Channel interleaver The channel interleaver described in this subclause in conjunction with the resource element mapping for PUSCH in [] implements a time-first mapping of modulation smbols onto the transmit waveform while ensuring that the control information is present on both slots in the subframe and is mapped to resources around the uplin demodulation reference signals. The bits input to the channel interleaver are denoted b g, g, g,..., g, where H is the number of modulation H smbols in the subframe. The output bit sequence from the channel interleaver is derived as follows: PUSCH ( Assign C mux = N smb to be the number of columns of the matrix. The columns of the matrix are numbered,,,, C from left to right. mux ( The number of rows of the matrix is = H Cmux and we define =. The rows of the rectangular matrix are numbered,,,, R from top to bottom. (3 Write the input vector sequence, i.e., starting with the vector = g for =,,, H, into the ( mux C mux in column and rows to ( Q : m mux R matrix b Q m rows Cmux ( Cmux Cmux + ( Cmux + Cmux + ( Cmux + L L O L Cmux Cmux ( Cmux [Note from the editor: if part of the control information punctures the data transmission, this is a good place to perform the operation] (The output of the bloc interleaver is the bit sequence read out column b column from the ( C mux matrix. The bits after channel interleaving are denoted b h h, h,..., h H. 5..3 Uplin control information, Data arrives to the coding unit in form of indicators for measurement indication, scheduling request and HARQ acnowledgement. Three forms of channel coding are used, one for the channel qualit information (CQI, another for HARQ-ACK (acnowledgement and scheduling request and another for combination of channel qualit information (CQI and HARQ-ACK. a,...,, a a A b,...,, b b B Figure 5..3-: Processing for UCI 5..3. Channel coding for UCI HARQ-ACK Details for the coding of the HARQ acnowledgement message. Need to include the possibilit of repetition. Also need to include the coding when the control is multiplexed with the data.

3 TS 36. V8.. (7- The HARQ acnowledgement bits are received from higher laers and are processed according to []. 5..3. Channel coding for UCI scheduling request The scheduling request indication is received from higher laers and is processed according to []. 5..3.3 Channel coding for UCI channel qualit information Details for the coding of the channel qualit information. Need SIO and IO formats. Need to include the coding when the control is multiplexed with the data. 5..3. Channel coding for UCI channel qualit information and HARQ-ACK This subclause applies when the HARQ acnowledgement message and the channel qualit information are transmitted in the same subframe. Need to include the coding when the control is multiplexed with the data. When normal CP is used for uplin transmission, the channel qualit information is coded according to subclause 5..3.3, and the HARQ acnowledgement bits are processed according to []. When extended CP is used for uplin transmission, the channel qualit information and the HARQ-ACK acnowledgement bits are jointl coded. 5.3 Downlin transport channels and control information 5.3. Broadcast channel Figure 5.3.- shows the processing structure for the BCH transport channel. Data arrives to the coding unit in form of a maximum of one transport bloc ever transmission time interval (TTI of ms. The following coding steps can be identified: Add CRC to the transport bloc Channel coding Rate matching The coding steps for BCH transport channel are shown in the figure below. a,...,, a a A c,...,, c c K d, d,..., d Dr e,...,, e e E

3 TS 36. V8.. (7- Figure 5.3.-: Transport channel processing for BCH 5.3.. Transport bloc CRC attachment Error detection is provided on BCH transport blocs 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, a, a3,..., a A, and the parit bits b p, p, p, p3,..., p L. A is the size of the transport bloc and L is the number of parit bits. The parit bits are computed and attached to the BCH transport bloc according to subclause 5.. setting L to 6 bits. 5.3.. Channel coding Information bits are delivered to the channel coding bloc. The are denoted b c, c, c, c3,..., c K, where K is the number of bits, and the are tail biting convolutionall encoded according to subclause 5..3.. After encoding the bits are denoted b d, d, d, d3,..., d D, and where D is the number of bits on the i-th coded stream, i.e., D = K. 5.3..3 Rate matching A tail biting convolutionall coded bloc is delivered to the rate matching bloc. This bloc of coded bits is denoted b d, d, d, d3,..., d D, with i =,, and, and where i is the coded stream index and D is the number of bits in each coded stream. This coded bloc is rate matched according to subclause 5... After rate matching, the bits are denoted b e e, e, e3,..., e E, where E is the number of rate matched bits., 5.3. Downlin shared channel, Paging channel and ulticast channel Figure 5.3.- shows the processing structure for the DL-SCH, PCH and CH transport channels. Data arrives to the coding unit in form of a maximum of one transport bloc ever transmission time interval (TTI. The following coding steps can be identified: Add CRC to the transport bloc Code bloc segmentation and code bloc CRC attachment Channel coding Rate matching Code bloc concatenation The coding steps for DL-SCH, PCH and CH transport channels are shown in the figure below.

33 TS 36. V8.. (7- a,...,, a a A Transport bloc CRC attachment b,...,, b b B Code bloc segmentation Code bloc CRC attachment cr, cr,..., cr( K r Channel coding dr, dr,..., dr( D r Rate matching er, er,..., er( E r Code bloc concatenation f,...,, f f G Figure 5.3.-: Transport channel processing for DL-SCH, PCH and CH 5.3.. Transport bloc CRC attachment Error detection is provided on transport blocs 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, a, a3,..., a A, and the parit bits b p, p, p, p3,..., p L. A is the size of the transport bloc and L is the number of parit bits. The parit bits are computed and attached to the transport bloc according to subclause 5.. setting L to bits and using the generator polnomial g CRCA (D. 5.3.. Code bloc segmentation and code bloc CRC attachment The bits input to the code bloc segmentation are denoted b b, b, b, 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 subclause 5... The bits after code bloc segmentation are denoted b c r, cr, cr, cr3,..., cr( K r, where r is the code bloc number and K r is the number of bits for code bloc number r. 5.3..3 Channel coding Code blocs are delivered to the channel coding bloc. The are denoted b c r, cr, cr, 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 subclause 5..3..

3 TS 36. V8.. (7- After encoding the bits are denoted b dr, dr, dr, dr3,..., d r( D, with i =,, and, and where D r is the number of bits on the i-th coded stream for code bloc number r, i.e. D K +. 5.3.. Rate matching r r = r Turbo coded blocs are delivered to the rate matching bloc. The are denoted b dr, dr, dr, dr3,..., d r( D, with i =,, and, 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 subclause 5... After rate matching, the bits are denoted b e r, er, er, er3,..., er( E r, where r is the coded bloc number, and where E r is the number of rate matched bits for code bloc number r. 5.3..5 Code bloc concatenation The bits input to the code bloc concatenation bloc are denoted b e r, er, er, 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 subclause 5..5.. The bits after code bloc concatenation are denoted b f, f, f, f3,..., f G, where G is the total number of coded bits for transmission. r 5.3.3 Downlin control information A DCI transports downlin or uplin scheduling information, or uplin power control commands for one AC ID. The AC ID is implicitl encoded in the CRC. Figure 5.3.3- shows the processing structure for the DCI. The following coding steps can be identified: Information element multiplexing CRC attachment Channel coding Rate matching The coding steps for DCI are shown in the figure below.

35 TS 36. V8.. (7- a,...,, a a A CRC attachment c,...,, c c K Channel coding d, d,..., d D Rate matching e,...,, e e E Figure 5.3.3-: Processing for DCI 5.3.3. DCI formats 5.3.3.. Format DCI format is used for the transmission of UL-SCH assignments. The following information is transmitted b means of the DCI format : - [Flag for formatformata differentiation bit] - Hopping flag bit UL UL - Resource bloc assignment and hopping resource allocation log ( RB ( N RB + N bits - Transport format - Retransmission sequence number - TPC command for scheduled PUSCH bits - [Cclic shift for D RS] - [Transmit antenna selection] - UL index (this field just applies to TDD operation 5.3.3.. Format DCI format is used for the transmission of DL-SCH assignments for SIO operation. The following information is transmitted b means of the DCI format : - Distributed transmission flag bit - Resource allocation header - Resource bloc assignment N DL P RB bits, where the value of P depends on the number of DL resource blocs as indicated in subclause [7..] of [3]

36 TS 36. V8.. (7- - Transport format - HARQ process number - Retransmission sequence number - TPC command for PUH and persistent PUSCH bits 5.3.3..3 Format A DCI format A is used for a compact transmission of DL-SCH assignments for SIO operation. The following information is transmitted b means of the DCI format A: - [Flag for formatformata differentiation bit] - Distributed transmission flag bit DL DL - Resource bloc assignment up to log ( N RB ( N RB + bits - Transport format - HARQ process number - Retransmission sequence number - TPC command for PUH and persistent PUSCH bits 5.3.3.. Format DCI format is used for the transmission of DL-SCH assignments for IO operation. The following information is transmitted b means of the DCI format : In general: - Distributed transmission flag bit - Resource allocation header - Resource bloc assignment N RB DL P as indicated in subclause [7..] of [3] bits, where the value of P depends on the number of DL resource blocs - TPC command for PUH and persistent PUSCH bits - [Number of laers] For the first codeword: - Transport format - HARQ process number - Retransmission sequence number For the second codeword: - Transport format - [HARQ process number] - [Retransmission sequence number]

37 TS 36. V8.. (7-5.3.3..5 Format 3 DCI format 3 is used for the transmission of TPC commands for PUH and PUSCH with -bit power adjustments. The following information is transmitted b means of the DCI format 3: - TPC command for user, user,, user N 5.3.3..6 Format 3A DCI format 3A is used for the transmission of TPC commands for PUH and PUSCH with single bit power adjustments. The following information is transmitted b means of the DCI format 3A: - TPC command for user, user,, user N 5.3.3. CRC attachment Error detection is provided on DCI transmissions through a Cclic Redundanc Chec (CRC. The entire PDH paload is used to calculate the CRC parit bits. Denote the bits of the PDH paload b a, a, a, a3,..., a A, and the parit bits b p, p, p, p3,..., p L. A is the PDH paload size and L is the number of parit bits. The parit bits are computed and attached according to subclause 5.. setting L to [6] bits, resulting in the sequence b, b, b, b3,..., b B, where B = A+ L. After the attachment, the CRC bits are scrambled with the UE identit x ue,, xue,,..., xue,5 to form the sequence of bits c, c, c, c3,..., c B. The relation between c and b is: c = b for =,,,, A- c ( b + x mod = for = A, A+, A+,..., A+5. ue, A 5.3.3.3 Channel coding Information bits are delivered to the channel coding bloc. The are denoted b c, c, c, c3,..., c K, where K is the number of bits, and the are tail biting convolutionall encoded according to subclause 5..3.. After encoding the bits are denoted b d, d, d, d 3,..., d D, and where D is the number of bits on the i-th coded stream, i.e., D = K. 5.3.3. Rate matching A tail biting convolutionall coded bloc is delivered to the rate matching bloc. This bloc of coded bits is denoted b d, d, d, d 3,..., d D, with i =,, and, and where i is the coded stream index and D is the number of bits in each coded stream. This coded bloc is rate matched according to subclause 5... After rate matching, the bits are denoted b e e, e, e3,..., e E, where E is the number of rate matched bits. 5.3. Control format indicator, Data arrives each subframe to the coding unit in the form of an indicator for the time span, in units of OFD smbols, of the DCI in that subframe, i.e., CFI =, or 3. The coding flow is shown in Figure 5.3.-.