3GPP TSG-RAN WG1 #51
`Jeju, Korea, November 5 – 9, 2007
`
`R1-075111
`
`CR-Form-v9.3
`
`
`
`36.212 CR 001
`
`CHANGE REQUEST
`-  Current version: 8.0.0 
`
` rev
`
`For HELP on using this form look at the pop-up text over the  symbols. Comprehensive instructions on
`how to use this form can be found at http://www.3gpp.org/specs/CR.htm.
`
`Proposed change affects: UICC apps
`
`ME X Radio Access Network X Core Network
`
`Title:
`
` Update of 36.212
`
`Source to WG:  Editor (Qualcomm Europe)
`Source to TSG:  RAN WG1
`
`Work item code:  LTE-Phys
`
`Date:  21/11/2007
`
`Category:
`
` F
`Use one of the following categories:
`F (correction)
`A (corresponds to a correction in an earlier release)
`B (addition of feature),
`C (functional modification of feature)
`D (editorial modification)
`Detailed explanations of the above categories can
`be found in 3GPP TR 21.900.
`
`Release:  Rel-8
`Use one of the following releases:
`R97
`(Release 1997)
`R98
`(Release 1998)
`R99
`(Release 1999)
`Rel-4
`(Release 4)
`Rel-5
`(Release 5)
`Rel-6
`(Release 6)
`Rel-7
`(Release 7)
`(Release 8)
`Rel-8
`
`Reason for change:  Decisions taken at RAN1#50bis and RAN1#51 need to be reflected in 36.212
`
`Summary of change: 
`
`Inclusion of decisions from RAN1#50bis and RAN1#51 which entails more
`details on control and data multiplexing in PUSCH. CRC attachment per code
`block. No channel interleaver for BCH, no channel interleaver in 36.212 for
`PDCCH. Renaming of some variables to keep uniqueness of variable names.
`Contents of DCI. Some details on UCI.
`
`Consequences if 
`not approved:
`
`Incomplete LTE physical layer specifications
`
`Clauses affected:  2, 3, 4, 5
`
`Other specs
`affected:
`
`
`
`Y N
`X Other core specifications
`X Test specifications
`X O&M Specifications
`
`
`
`Other comments: 
`
`Commented [H1]: Document numbers are allocated by the
`Working Group Secretary. Use the format of document number
`specified by the 3GPP Working Procedures.
`
`Commented [H2]: Enter the specification number in this box.
`For example, 04.08 or 31.102. Do not prefix the number with
`anything . i.e. do not use "TS", "GSM" or "3GPP" etc.
`
`Commented [H3]: Enter the CR number here. This number is
`allocated by the 3GPP support team. It consists of at least four
`digits, padded with leading zeros if necessary.
`
`Commented [H4]: Enter the revision number of the CR here. If
`it is the first version, use a "-".
`
`Commented [H5]: Enter the version of the specification here.
`This number is the version of the specification to which the CR was
`written and (normally) to which it will be applied if it is approved.
`Make sure that the latest version of the specification (of the relevant
`release) is used when creating the CR. If unsure what the latest
`version is, go to http://www.3gpp.org/specs/specs.htm.
`
`Commented [H6]: For help on how to fill out a field, place the
`mouse pointer over the special symbol closest to the field in
`question.
`
`Commented [H7]: Mark one or more of the boxes with an X.
`
`Commented [H8]: SIM / USIM / ISIM applications.
`
`Commented [H9]: Enter a concise description of the subject
`matter of the CR. It should be no longer than one line, but if this is
`not possible, do not enter hard new-line characters. Do not use
`redundant information such as "Change Request number xxx to
`3GPP TS xx.xxx".
`
`Commented [H10]: One or more organizations (3GPP
`Individual Members) which drafted the CR and are presenting it to
`the Working Group.
`
`Commented [H11]: For CRs agreed at Working Group level,
`the identity of the WG. Use the format "xn" where
`x = "C" for TSG CT, "R" for TSG RAN, "S" for TSG SA, "G" for
`for TSG GERAN;
`n = digit identifying the Working Group; for CRs drafted during
`the TSG meeting itself, use "P".
`Examples: "C4", "R5", "G3new", "SP".
`
`Commented [H12]: Enter the acronym for the work item which
`is applicable to the change. This field is mandatory for category F,
`A, B & C CRs for Release 4 and later. A list of work item acronyms
`can be found in the 3GPP work plan. See
`http://www.3gpp.org/ftp/Specs/html-info/WI-List.htm .
`
`Commented [H13]: Enter the date on which the CR was last
`revised. Format to be interpretable by English version of MS
`Windows ® applications, e.g. 19/02/2006.
`
`Commented [H14]: Enter a single letter corresponding to the
`most appropriate category listed. For more detailed help on
`
`Commented [H15]: Enter a single release code from the list
`below.
`
`Commented [H16]: Enter text which explains why the change
`is necessary.
`
`Commented [H17]: Enter text which describes the most
`important components of the change. i.e. How the change is made.
`
`Commented [H18]: Enter here the consequences if this CR
`were to be rejected. It is mandatory to complete this section only if...
`Commented [H19]: Enter the number of each clause which
`contains changes. Be as specific as possible (ie list each subclause, ...
`
`Commented [H20]: Tick "yes" box if any other specifications
`are affected by this change. Else tick "no". You MUST fill in one ...
`
`Commented [H21]: List here the specifications which are
`affected or the CRs which are linked.
`
`Commented [H22]: Enter any other information which may be
`needed by the group being requested to approve the CR. This could...
`
`Optis Cellular Ex 2027-p. 1
`Apple v Optis Cellular
`IPR2020-00465
`
`

`

`
`Error! No text of specified style in document.
`
`2
`
`Error! No text of specified style in document.
`
`Foreword
`
`This Technical Specification has been produced by the 3rd Generation Partnership Project (3GPP).
`
`The contents of the present document are subject to continuing work within the TSG and may change following formal
`TSG approval. Should the TSG modify the contents of the present document, it will be re-released by the TSG with an
`identifying change of release date and an increase in version number as follows:
`
`Version x.y.z
`
`where:
`
`x
`
`the first digit:
`
`1 presented to TSG for information;
`
`2 presented to TSG for approval;
`
`3 or greater indicates TSG approved document under change control.
`
`y
`
`the second digit is incremented for all changes of substance, i.e. technical enhancements, corrections,
`updates, etc.
`
`z
`
`the third digit is incremented when editorial only changes have been incorporated in the document.
`
`3GPP
`
`Optis Cellular Ex 2027-p. 2
`Apple v Optis Cellular
`IPR2020-00465
`
`

`

`
`Error! No text of specified style in document.
`
`3
`
`Error! No text of specified style in document.
`
`1
`
`Scope
`
`The present document specifies the coding, multiplexing and mapping to physical 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 by date of publication, edition number, version number, etc.) or
`non-specific.
`
` For a specific reference, subsequent revisions do not apply.
`
` For a non-specific reference, the latest version applies. In the case of a reference to a 3GPP document (including
`a GSM document), a non-specific reference implicitly refers to the latest version of that document in the same
`Release as the present document.
`
`[1]
`
`[2]
`
`[3]
`
`3GPP TR 21.905: "Vocabulary for 3GPP Specifications".
`
`3GPP TS 36.211: "Evolved Universal Terrestrial Radio Access (E-UTRA); Physical channels and
`modulation".
`
`3GPP TS 36.213: "Evolved Universal Terrestrial Radio Access (E-UTRA); Physical layer
`procedures".
`
`3
`
`Definitions, symbols and abbreviations
`
`3.1
`
`Definitions
`
`For the purposes of the present document, the terms and definitions given in [1] and the following apply. A term
`defined in the present document takes precedence over the definition of the same term, if any, in [1].
`
`(no further definitions)
`
`3.2
`
`Symbols
`
`For the purposes of the present document, the following symbols apply:
`
`(no symbols defined)
`
`
`
`
`
`
`
`
`
`Downlink bandwidth configuration, expressed in number of resource blocks [2]
`
`Uplink bandwidth configuration, expressed in number of resource blocks [2]
`
`
`
`Number of SC-FDMA symbols carrying PUSCH in a subframe
`
`Formatted: Lowered by 5 pt
`
`Formatted: EW
`
`Formatted: Lowered by 5 pt
`
`Formatted: Lowered by 7 pt
`
`
`
`Number of SC-FDMA symbols carrying control information in a subframe. [Note from the editor:
`
`Formatted: Guidance Char
`
`This number does not include additional control information that may be punctured into the data
`resources.]
`
`Number of SC-FDMA symbols in an uplink slot
`
`Number of SC-FDMA symbols used for SRS transmission in a subframe (0 or 1).
`
`3GPP
`
`DL
`RBN
`
`UL
`RBN
`
`PUSCH
`symbN
`
` UL
`control
`symbN
`
`UL
`symbN
`
`SRSN
`
`Optis Cellular Ex 2027-p. 3
`Apple v Optis Cellular
`IPR2020-00465
`
`

`

`
`Error! No text of specified style in document.
`
`4
`
`Error! No text of specified style in document.
`
`3.3
`
`Abbreviations
`
`For the purposes of the present document, the abbreviations given in TR 21.905 [1] and the following apply. An
`abbreviation defined in the present document takes precedence over the definition of the same abbreviation, if any, in
`TR 21.905 [1].
`
`
`BCH
`CFI
`CP
`DL-CCH
`DCI
`DL-SCH
`HI
`MCH
`PBCH
`PCFICH
`PCH
`PDCCH
`PDSCH
`PHICH
`PMCH
`PRACH
`PUCCH
`PUSCH
`RACH
`SRS
`UL-CCH
`UCI
`UL-SCH
`
`
`Broadcast channel
`Control format indicator
`Cyclic prefix
`Downlink Control channel
`Downlink Control Information
`Downlink Shared channel
`HARQ indicator
`Multicast channel
`Physical Broadcast channel
`Physical Control Format Indicator channel
`Paging channel
`Physical Downlink Control channel
`Physical Downlink Shared channel
`Physical HARQ indicator channel
`Physical Multicast channel
`Physical Random Access channel
`Physical Uplink Control channel
`Physical Uplink Shared channel
`Random Access channel
`Sounding Reference Signal
`Uplink Control channel
`Uplink Control Information
`Uplink Shared channel
`
`4
`
`Mapping to physical channels
`
`4.1
`
`Uplink
`
`Table 4.1-1 specifies the mapping of the uplink transport channels to their corresponding physical channels. Table 4.1-2
`specifies the mapping of the uplink control channel information to its corresponding physical channel.
`
`TrCH
`UL-SCH
`RACH
`
`Table 4.1-1
`
`Physical Channel
`PUSCH
`PRACH
`
`
`
`Table 4.1-2
`
`Control information
`UCIUL-CCH
`
`Physical Channel
`PUCCH
`
`
`
`4.2
`
`Downlink
`
`Table 4.2-1 specifies the mapping of the downlink transport channels to their corresponding physical channels. Table
`4.2-2 specifies the mapping of the downlink control channel information to its corresponding physical channel.
`
`3GPP
`
`Optis Cellular Ex 2027-p. 4
`Apple v Optis Cellular
`IPR2020-00465
`
`

`

`Formatted: Font: Italic, English (United States)
`
`Formatted: Font: Italic, English (United States)
`
`Formatted: Font: Italic, English (United States)
`
`Formatted: Font: Italic, English (United States)
`
`Formatted: Font: Italic, English (United States)
`
`Formatted: Font: Italic, English (United States)
`
`Formatted: Font: Italic, English (United States)
`
`Formatted: Font: Italic, English (United States)
`
`Formatted: Font: Italic, English (United States)
`
`Formatted: Font: Italic, English (United States)
`
`Formatted: Font: Italic, English (United States)
`
`Formatted: Font: Italic, English (United States)
`
`Formatted: Font: Italic, English (United States)
`
`Formatted: Italian (Italy), Lowered by 5 pt
`
`
`Error! No text of specified style in document.
`
`5
`
`Error! No text of specified style in document.
`
`TrCH
`DL-SCH
`BCH
`PCH
`MCH
`
`Table 4.2-1
`
`Physical Channel
`PDSCH
`PBCH
`PDSCH
`PMCH
`
`
`
`Table 4.2-2
`
`Control information
`CFI
`HI
`DCIDL-CCH
`
`Physical Channel
`PCFICH
`PHICH
`PDCCH
`
`Channel coding, multiplexing and interleaving
`
` 5
`
`
`
`Data and control streams from/to MAC layer are encoded/decoded to offer transport and control services over the radio
`transmission link. Channel coding scheme is a combination of error detection, error correcting, rate matching,
`interleaving and transport channel or control information mapping onto/splitting from physical channels.
`
`5.1
`
`Generic procedures
`
`This section contains coding procedures which are used for more than one transport channel or control information
`type.
`
`5.1.1
`
`CRC calculation
`
`Denote the input bits to the CRC computation by
`
`, and the parity bits by
`
`.
`
`A is the size of the input sequence and L is the number of parity bits. The parity bits are generated by one of the
`following cyclic generator polynomials:
`
`- gCRC24A(D) = [D24 + D23 + D18 + D17 + D14 + D11 + D10 + D7 + D6 + D5 + D4 + D3 + D + 1] and
`
`- gCRC24B(D) = [D24 + D23 + D6 + D5 + D + 1] for a CRC length L = 24, and;
`
`- gCRC16(D) = [D16 + D12 + D5 + 1] for a CRC length L = 16.
`
`The encoding is performed in a systematic form, which means that in GF(2), the polynomial:
`
`
`
`yields a remainder equal to 0 when divided by the corresponding length-24 CRC generator polynomial, gCRC24A(D) or
`gCRC24B(D), and the polynomial:
`
`yields a remainder equal to 0 when divided by gCRC16(D).
`
`
`
`The bits after CRC attachment are denoted by
`
`, where B = A+ L. The relation between ak and bk is:
`
`
`
`
`
`for k = 0, 1, 2, …, A-1
`
` for k = A, A+1, A+2,..., A+L-1
`
`
`
`
`
` for k = A, A+1, A+2,..., A+L-1.
`
`3GPP
`
`aaaa
`,
`,
`,
`0
`1
`2
`
`3
`
`,...,
`
`Aa
`1
`
`p
`
`0
`
`,
`
`pp
`,
`1
`
`2
`
`,
`
`p
`
`3
`
`,...,
`
`Lp
`1
`
`Da
`0
`
`A
`
`
`
`23
`
`
`
`Da
`1
`
`A
`
`
`
`22
`
`
`...
`
`Da
`A
`
`1
`
`24
`
`
`
`Dp
`0
`
`23
`
`
`
`Dp
`1
`
`22
`
`
`...
`
`Dp
`22
`
`1
`
`
`
`p
`
`23
`
`Da
`0
`
`A
`
`
`15
`
`
`
`Da
`1
`
`A
`
`
`14
`
`
`...
`
`Da
`A
`
`1
`
`16
`
`
`
`15
`Dp
`0
`
`
`
`Dp
`1
`
`14
`
`
`...
`
`Dp
`14
`
`1
`
`
`
`p
`15
`
`bbbb
`,
`,
`,
`0
`1
`2
`
`3
`
`,...,
`
`Bb
`1
`
`b 
`k
`
`a
`
`k
`
`b
`k
`
`
`
`p
`
`
`
`L
`
`
` Ak 
`
`
` 1
`
`
`
`b
`
`k
`
`
`
`p
`
`Ak
`
`
`Optis Cellular Ex 2027-p. 5
`Apple v Optis Cellular
`IPR2020-00465
`
`

`

`
`Error! No text of specified style in document.
`
`6
`
`Error! No text of specified style in document.
`
`5.1.2
`
`Code block segmentation and code block CRC attachment
`
`The input bit sequence to the code block segmentation is denoted by
`
`, where B > 0. If B is larger
`
`than the maximum code block size Z, segmentation of the input bit sequence is performed and an additional CRC
`sequence of L = 24 bits is attached to each code block. The maximum code block size is:
`
`- Z = 6144.
`
`If the number of filler bits F calculated below is not 0, filler bits are added to the beginning of the first block.
`
`Note that if B < 40, filler bits are added to the beginning of the code block.
`
`The filler bits shall be set to <NULL> at the input to the encoder.
`
`Total number of code blocks C is determined by:
`
`if
`
`
`
`
`
`L = 0
`
` Number of code blocks:
`
`
`
`
`
`
`
`else
`
`
`
`L = 24
`
` Number of code blocks:
`
`.
`
`
`
`end if
`
`
`
`The bits output from code block segmentation, for C  0, are denoted by
`
` , where r is the
`
`code block number, and Kr is the number of bits for the code block number r.
`
`
`
`Number of bits in each code block (applicable for C  0 only):
`
`First segmentation size:
`
`= minimum K in table 5.1.3-3 such that
`
`
`
`if
`
`
`
`
`
`the number of code blocks with length
`
` is
`
`=1,
`
`,
`
`
`
`else if
`
`
`
`
`
`
`
`
`
`
`
`Second segmentation size:
`
`= maximum K in table 5.1.3-3 such that
`
`
`
`
`
`Number of segments of size
`
`:
`
`.
`
`Number of segments of size
`
`:
`
`.
`
`
`
`end if
`
`Number of filler bits:
`
`
`
`for k = 0 to F-1
`
`
`
`
`
`
`
`
`
`
`
`-- Insertion of filler bits
`
`3GPP
`
`bbbb
`,
`,
`,
`0
`1
`2
`
`3
`
`,...,
`
`Bb
`1
`
`ZB 
`
`1C
`
`B 
`
`B
`
`C
`
`
`
`
`
` LZB
`
`/
`
`
`
`B
`
`
`LCB
`
`c
`
`r
`
`0
`
`,
`
`c
`
`r
`1
`
`,
`
`c
`
`r
`
`2
`
`,
`
`c
`
`r
`
`3
`
`c
`,...,
`
`
`1
`rKr
`
`K
`
`
`
` BKC 
`
`1C
`
`K
`
`C
`
`0K
`
`0C
`
`1C
`
`K
`
` KK
`
`KK
`
`
` 
`
`K
`
`
`
`K
`
`
`
`
`B
`
`KC
`
`
`
`
`
`K
`
`
`
`C
`
`
`
`
`
`K
`
`C
`
`
`
`
`
`
`
`  CC
`
`
`
`KCF
`
`
`
`
`
`
`
`
`KC
`
`
`
`
`
`
`B
`
`Optis Cellular Ex 2027-p. 6
`Apple v Optis Cellular
`IPR2020-00465
`
`

`

`
`Error! No text of specified style in document.
`
`7
`
`Error! No text of specified style in document.
`
`
`
`
`
`end for
`
`k = F
`
`s = 0
`
`for r = 0 to C-1
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`if
`
`
`
` else
`
`
`
`end if
`
` while
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
` end while
`
` if C >1
`
`Formatted: Lowered by 7 pt
`
`The sequence
`
` is used to calculate the CRC parity bits
`
`
`
`according to subclause 5.1.1 with the generator polynomial gCRC24B(D). For CRC calculation it is
`assumed that filler bits, if present, have the value 0.
`
`while
`
`
`
`
`
`
`
`
`
`end while
`
`end if
`
`
`
`
`end for
`
`5.1.3
`
`Channel coding
`
`The bit sequence input for a given code block to channel coding is denoted by
`
`, where K is the
`
`number of bits to encode. After encoding the bits are denoted by
`
`, where D is the number of
`
`encoded bits per output stream and i indexes the encoder output stream. The relation between
`
` and
`
` 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 types of TrCH is shown in table 5.1.3-1. Usage of coding
`scheme and coding rate for the different control information types is shown in table 5.1.3-2.
`
`3GPP
`
`c k0
`
` NULL
`
`
`
` Cr
`
`K r
`
` K
`
`K r
`
` K
`
`Kk
`
`
`r 
`
`L
`
`c 
`rk
`
`b
`
`s
`
`k
`
`1 k
`
`s
`
`1 s
`
`c
`
`r
`
`0
`
`,
`
`c
`
`r
`1
`
`,
`
`c
`
`r
`
`2
`
`,
`
`c
`
`r
`
`3
`
`c
`,...,
`
`
`1
`LKr
`r
`
`p
`
`r
`
`0
`
`,
`
`p
`
`r
`1
`
`,
`
`p
`
`r
`
`2
`
`,...,
`
`p
`
`
`1
`Lr
`
`rKk 
`
`c
`rk
`
`
`
`p
`kKr
`(
`
`)1
`r
`
`c
`rk
`
`
`
`p
`rKLkr
`(
`
`
`)
`
`k
`
`1 k
`
`0k
`
`c
`
`0
`
`,
`
`cc
`,
`1
`
`2
`
`,
`
`c
`
`3
`
`,...,
`
`Kc
`1
`
`i D
`
`)(
`1
`
`
`
`d
`
`
`)(i
`0
`
`,
`
`d
`
`)(i
`
`
`1
`
`,
`
`d
`
`
`)(i
`2
`
`,
`
`d
`
`
`)(i
`3
`
`
`
`,...,d
`
`kc
`
`)(i
`kd
`
`Optis Cellular Ex 2027-p. 7
`Apple v Optis Cellular
`IPR2020-00465
`
`

`

`
`Error! No text of specified style in document.
`
`8
`
`Error! No text of specified style in document.
`
`The values of D in connection with each coding scheme:
`
`-
`
`-
`
`tail biting convolutional coding with rate 1/3: D = K;
`
`turbo coding with rate 1/3: D = K + 4.
`
`The range for the output stream index, i, is 0, 1 and 2 for both coding schemes.
`
`Table 5.1.3-1: Usage of channel coding scheme and coding rate for TrCHs
`
`TrCH
`UL-SCH
`DL-SCH
`PCH
`MCH
`
`BCH
`
`Coding scheme Coding rate
`
`Turbo coding
`
`1/3
`
`Tail biting
`convolutional
`coding
`
`1/3
`
`Table 5.1.3-2: Usage of channel coding scheme and coding rate for control information
`
`Control Information
`DCIDL-CCH
`
`CFI
`HI
`UCIUL-CCH
`
`Coding scheme Coding rate
`Tail biting
`convolutional
`coding
`Block code
`Repetition code
`[FFS]
`
`1/16
`1/3
`[FFS]
`
`1/3
`
`
`
`
`
`5.1.3.1
`
`Tail biting convolutional coding
`
`A tail biting convolutional code with constraint length 7 and coding rate 1/3 is defined.
`
`The configuration of the convolutional encoder is presented in figure 5.1.3-1.
`
`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 by
`, then the initial value of the shift register shall be set to
`
`
`
`Figure 5.1.3-1: Rate 1/3 tail biting convolutional encoder
`
`
`
`The encoder output streams,
`
`,
`
` and
`
` correspond to the first, second and third parity streams, respectively
`
`as shown in Figure 5.1.3-1.
`
`3GPP
`
`s
`
`0
`
`,
`
`s
`1
`
`,
`
`s
`
`2
`
`,...,
`
`s
`
`5
`
`s
`
`i
`
`
`
`c
`
`
`
`K
`
`i
`
`1
`
`D
`
`D
`
`D
`
`D
`
`D
`
`D
`
`G0 = 133 (octal)
`
`G1 = 171 (octal)
`
`G2 = 165 (octal)
`
`kc
`
`)0(
`kd
`
`)1(
`kd
`
`)2(
`kd
`
`)0(
`kd
`
`)1(
`kd
`
`)2(
`kd
`
`Optis Cellular Ex 2027-p. 8
`Apple v Optis Cellular
`IPR2020-00465
`
`

`

`
`Error! No text of specified style in document.
`
`9
`
`Error! No text of specified style in document.
`
`5.1.3.2
`
`Turbo coding
`
`5.1.3.2.1
`
`Turbo encoder
`
`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 1/3. The structure of turbo
`encoder is illustrated in figure 5.1.3-2.
`
`The transfer function of the 8-state constituent code for the PCCC is:
`
`
`
`where
`
`
`
`
`
`G(D) =
`
`,
`
`g0(D) = 1 + D2 + D3,
`
`g1(D) = 1 + D + D3.
`
`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
`
`
`
`
`
`
`
`for
`
`.
`
`If the code block to be encoded is the 0-th code block and the number of filler bits is greater than zero, i.e., F > 0, then
`
`the encoder shall set ck, = 0, k = 0,…,(F-1) at its input and shall set
`
`, k = 0,…,(F-1) and
`
`, k = 0,…,(F-1) at its output.
`
`The bits input to the turbo encoder are denoted by
`
`, and the bits output from the first and second 8-
`
`state constituent encoders are denoted by
`
`and
`
`, respectively. The bits output
`
`from the turbo code internal interleaver are denoted by
`
`, and these bits are to be the input to the second 8-
`
`state constituent encoder.
`
`3GPP
`
`
`
`Dg
`(
`
`)
`
`01
`
`Dg
`(
`
`)
`
`
`
`,1
`
`d
`
`)0(
`k
`
`x
`
`k
`
`d
`
`)1(
`k
`
`z
`
`k
`
`d
`
`)2(
`z
`k
`k
`
`k
`
`
`
`K
`2,1,0
`,...,
`
`
`
`1
`
`)0(
`d k
`
` NULL
`
`
`
`)1(
`d k
`
` NULL
`
`
`
`c
`
`0
`
`,
`
`cc
`,
`1
`
`2
`
`,
`
`c
`
`3
`
`,...,
`
`Kc
`1
`
`z
`
`0
`
`,
`
`z
`
`1
`
`,
`
`z
`
`2
`
`,
`
`z
`
`3
`
`,...,
`
`Kz
`1
`
`z
`
`
`0
`
`,
`
`z
`
`
`1
`
`,
`
`z
`
`
`2
`
`,
`
`z
`
`
`3
`
`,...,
`
`
`Kz
`1
`
`
`
`cc
`,
`0
`1
`
`,...,
`
`
`Kc
`1
`
`Optis Cellular Ex 2027-p. 9
`Apple v Optis Cellular
`IPR2020-00465
`
`

`

`
`Error! No text of specified style in document.
`
`10
`
`
`
`Error! No text of specified style in document.
`
`Figure 5.1.3-2: Structure of rate 1/3 turbo encoder (dotted lines apply for trellis termination only)
`
`
`
`5.1.3.2.2
`
`Trellis termination for turbo encoder
`
`Trellis termination is performed by taking the tail bits from the shift register feedback after all information bits are
`encoded. Tail bits are padded after the encoding of information bits.
`
`The first three tail bits shall be used to terminate the first constituent encoder (upper switch of figure 5.1.3-2 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.1.3-2 in lower position) while the first constituent encoder is disabled.
`
`The transmitted bits for trellis termination shall then be:
`
`,
`
`,
`
`,
`
`,
`
`,
`
`,
`
`
`
`
`
`,
`
`,
`
`,
`
`
`
`5.1.3.2.3
`
`Turbo code internal interleaver
`
`The bits input to the turbo code internal interleaver are denoted by
`
`, where K is the number of input bits.
`
`The bits output from the turbo code internal interleaver are denoted by
`
`.
`
`The relationship between the input and output bits is as follows:
`
`, i=0,1,…,(K-1)
`
`3GPP
`
`1st constituent encoder
`
`D
`
`D
`
`D
`
`Input
`Turbo code internal
`interleaver
`Output
`
`2nd constituent encoder
`
`Output
`
`D
`
`D
`
`D
`
`kc
`
`kc
`
`kx
`
`kx
`
`kz
`
`kz
`
`d
`
`)0(
`K
`
`x
`
`K
`
`d
`
`)0(
`z
`  K
`K
`1
`
`
`1
`
`d
`
`)0(
`
`x
`K
`K
`2
`
`d
`
`)0(
`K
`
`
`3
`
` K
`z
`
`
`1
`
`d
`
`)1(
`K
`
`z
`
`K
`
`d
`
`)1(
`x
`  K1
`K
`
`
`
`
`
`2
`
`d
`
`)1(
`
`z
`K
`K
`2
`
`d
`
`)1(
`K
`
`
`3
`
` K
`x
`
`
`
`2
`
`d
`
`)2(
`K
`
`x
` K
`
`
`
`1
`
`d
`
`)2(
`z
`  K1
`K
`
`
`
`
`2
`
`d
`
`)2(
`K
`
`
`2
`
` K
`x
`
`
`
`1
`
`d
`
`)2(
`K
`
`
`3
`
` K
`z
`
`
`
`2
`
`c
`
`0
`
`,
`
`c
`1
`
`,...,
`
`Kc 1
`
`
`
`
`
`cc
`,
`0
`1
`
`,...,
`
`
`Kc
`1
`
`c
`
`i
`c
`
`
`
` i
`
`Optis Cellular Ex 2027-p. 10
`Apple v Optis Cellular
`IPR2020-00465
`
`

`

`
`Error! No text of specified style in document.
`
`11
`
`Error! No text of specified style in document.
`
`where the relationship between the output index i and the input index
`
` satisfies the following quadratic form:
`
`
`
`The parameters
`
` and
`
` depend on the block size K and are summarized in Table 5.1.3-3.
`
`Table 5.1.3-3. Turbo code internal interleaver parameters
`
`i
`
`Ki
`
`
`
`
`
`i
`
`Ki
`
`
`
`
`
`i
`
`Ki
`
`
`
`
`
`i
`
`Ki
`
`
`
`
`
`140 142 3200 111 240
`67
`1120
`95
`52
`25
`416
`48
`10
`3
`40
`1
`72
`143 3264 443 204
`35
`1152
`96
`106
`51
`424
`49
`12
`7
`48
`2
`74
`144 3328
`51
`104
`19
`1184
`97
`72
`47
`432
`50
`42
`19
`56
`3
`76
`145 3392
`51
`212
`39
`1216
`98
`110
`91
`440
`51
`16
`7
`64
`4
`78
`146 3456 451 192
`19
`1248
`99
`168
`29
`448
`52
`18
`7
`72
`5
`114 100 1280 199 240 147 3520 257 220
`29
`456
`53
`20
`11
`80
`6
`58
`101 1312
`21
`82
`148 3584
`57
`336
`247
`464
`54
`22
`5
`88
`7
`118 102 1344 211 252 149 3648 313 228
`29
`472
`55
`24
`11
`96
`8
`180 103 1376
`21
`86
`150 3712 271 232
`89
`480
`56
`26
`7
`104
`9
`122 104 1408
`43
`88
`151 3776 179 236
`91
`488
`57
`84
`41
`10 112
`62
`105 1440 149
`60
`152 3840 331 120
`157
`496
`58
`90
`11 120 103
`84
`106 1472
`45
`92
`153 3904 363 244
`55
`504
`59
`32
`12 128
`15
`64
`107 1504
`49
`846 154 3968 375 248
`31
`512
`60
`34
`13 136
`9
`66
`108 1536
`71
`48
`155 4032 127 168
`17
`528
`108 61
`14 144
`17
`68
`109 1568
`13
`28
`156 4096
`31
`64
`35
`544
`38
`62
`15 152
`9
`227 420 110 1600
`17
`80
`157 4160
`33
`130
`560
`120 63
`16 160
`21
`65
`96
`111 1632
`25
`102 158 4224
`43
`264
`576
`84
`64
`17 168 101
`19
`74
`112 1664 183 104 159 4288
`33
`134
`592
`44
`65
`18 176
`21
`37
`76
`113 1696
`55
`954 160 4352 477 408
`608
`46
`66
`19 184
`57
`41
`234 114 1728 127
`96
`161 4416
`35
`138
`624
`48
`67
`20 192
`23
`39
`80
`115 1760
`27
`110 162 4480 233 280
`640
`50
`68
`21 200
`13
`185
`82
`116 1792
`29
`112 163 4544 357 142
`656
`52
`69
`22 208
`27
`43
`252 117 1824
`29
`114 164 4608 337 480
`672
`36
`70
`23 216
`11
`21
`86
`118 1856
`57
`116 165 4672
`37
`146
`688
`56
`71
`24 224
`27
`155
`44
`119 1888
`45
`354 166 4736
`71
`444
`704
`58
`72
`25 232
`85
`79
`120 120 1920
`31
`120 167 4800
`71
`120
`720
`60
`73
`26 240
`29
`139
`92
`121 1952
`59
`610 168 4864
`37
`152
`736
`62
`74
`27 248
`33
`23
`94
`122 1984 185 124 169 4928
`39
`462
`752
`32
`75
`28 256
`15
`217
`48
`123 2016 113 420 170 4992 127 234
`768
`198 76
`29 264
`17
`25
`98
`124 2048
`31
`64
`171 5056
`39
`158
`784
`68
`77
`30 272
`33
`17
`80
`125 2112
`17
`66
`172 5120
`39
`80
`800
`31 280 103 210 78
`127 102 126 2176 171 136 173 5184
`31
`96
`816
`32 288
`19
`36
`79
`25
`52
`127 2240 209 420 174 5248 113 902
`832
`33 296
`19
`74
`80
`239 106 128 2304 253 216 175 5312
`41
`166
`848
`34 304
`37
`76
`81
`17
`48
`129 2368 367 444 176 5376 251 336
`864
`35 312
`19
`78
`82
`137 110 130 2432 265 456 177 5440
`43
`170
`880
`36 320
`21
`120 83
`215 112 131 2496 181 468 178 5504
`21
`86
`896
`37 328
`21
`82
`84
`29
`114 132 2560
`39
`80
`179 5568
`43
`174
`912
`38 336 115
`84
`85
`15
`58
`133 2624
`27
`164 180 5632
`45
`176
`928
`39 344 193
`86
`86
`147 118 134 2688 127 504 181 5696
`45
`178
`944
`40 352
`21
`44
`87
`29
`60
`135 2752 143 172 182 5760 161 120
`960
`41 360 133
`90
`88
`59
`122 136 2816
`43
`88
`183 5824
`89
`182
`976
`42 368
`81
`46
`89
`65
`124 137 2880
`29
`300 184 5888 323 184
`992
`43 376
`45
`94
`90
`55
`84
`138 2944
`45
`92
`185 5952
`47
`186
`44 384
`23
`48
`91 1008
`31
`64
`139 3008 157 188 186 6016
`23
`94
`45 392 243
`98
`92 1024
`17
`66
`140 3072
`47
`96
`187 6080
`47
`190
`46 400 151
`40
`93 1056
`47 408 155 102 94 1088 171 204 141 3136
`13
`28
`188 6144 263 480
`
`
`
`3GPP
`
`)(i
`
`i
`)(
`
`
`
`
`f
`
`1
`
`i
`
`
`f
`
`2
`
`
`
`i
`
`2
`
`
`mod
`
`K
`
`1f
`
`2f
`
`1f
`
`2f
`
`1f
`
`2f
`
`1f
`
`2f
`
`1f
`
`2f
`
`Optis Cellular Ex 2027-p. 11
`Apple v Optis Cellular
`IPR2020-00465
`
`

`

`
`Error! No text of specified style in document.
`
`12
`
`Error! No text of specified style in document.
`
`5.1.4
`
`Rate matching
`
`5.1.4.1
`
`Rate matching for Tturbo Ccoded Ttransport CchannelsDL-SCH and UL-
`SCH
`
`The rate matching for turbo coded transport channelsDL-SCH and UL-SCH is defined per coded block and consists of
`
`interleaving the three information bit streams,
`
`,
`
` and
`
`, followed by the collection of bits and the generation
`
`of a circular buffer as depicted in Figure 5.1.4-1. The output bits for each code block are transmitted as described in
`subclause 5.1.4.1.2.
`
`
`
`
`
`Figure 5.1.4-1. Rate matching for turbo coded transport channelsDL-SCH and UL-SCH
`
`The bit stream
`
` is interleaved according to the sub-block interleaver defined in subclause 5.1.4.1.1 with an output
`
`sequence defined as
`
` and where
`
` is defined in subclause 5.1.4.1.1.
`
`The bit stream
`
` is interleaved according to the sub-block interleaver defined in subclause 5.1.4.1.1 with an output
`
`sequence defined as
`
`.
`
`The bit stream
`
` is interleaved according to the sub-block interleaver defined in subclause 5.1.4.1.1 with an output
`
`sequence defined as
`
`.
`
`The sequence of bits
`
` for transmission is generated according to subclause 5.1.4.1.2.
`
`5.1.4.1.1
`
`Sub-block interleaver
`
`The bits input to the block interleaver are denoted by
`
`, where D is the number of bits. The output
`
`bit sequence from the block interleaver is derived as follows:
`
`(1) Assign
`
`C = 32 to be the number of columns of the matrix. The columns of the matrix are
`
`Formatted: Lowered by 5 pt
`
`numbered 0, 1, 2,…,
`
`C - 1 from left to right.
`
`Formatted: Lowered by 5 pt
`
`(2) Determine the number of rows of the matrix,
`
`R, by finding minimum integer
`
`R such that:
`
`.
`
`Formatted: Lowered by 5 pt
`
`Formatted: Lowered by 5 pt
`
`Formatted: Font: Italic, Lowered by 5 pt
`
`The rows of rectangular matrix are numbered 0, 1, 2,…,
`
`R - 1 from top to bottom.
`
`Formatted: Lowered by 5 pt
`
`3GPP
`
`)0(
`kd
`
`)1(
`kd
`
`)2(
`kd
`
`Sub-block
`interleaver
`
`virtual circular
` buffer
`
`Sub-block
`interleaver
`
`Bit
`collection
`
`Bit selection
`and pruning
`
`Sub-block
`interleaver
`
`)0(
`kd
`
`)1(
`kd
`
`)2(
`kd
`
`ke
`
`)0(
`kv
`
`)1(
`kv
`
`)2(
`kv
`
`kw
`
`)0(
`kd
`
`v
`
`)0(
`0
`
`,
`
`)0(
`v
`1
`
`,
`
`v
`
`)0(
`2
`
`)0(
`
`Kv
`,...,
`
`1
`
`K
`
`)1(
`kd
`
`v
`
`)1(
`0
`
`,
`
`)1(
`v
`1
`
`,
`
`v
`
`)1(
`2
`
`)1(
`
`Kv
`,...,
`
`1
`
`)2(
`kd
`
`v
`
`)2(
`0
`
`,
`
`)2(
`v
`1
`
`,
`
`v
`
`)2(
`2
`
`)2(
`
`Kv
`,...,
`
`1
`
`ke
`
`i D
`
`)(
`
`1
`
`d
`,...,
`
`d
`
`i
`)(
`0
`
`,
`
`i
`)(
`d
`1
`
`,
`
`d
`
`i
`)(
`2
`
`C
`
`TC
`subblock
`
`32
`
`C
`
`TC
`subblock
`
`1
`
`R
`
`TC
`subblock
`
`R
`
`TC
`subblock
`
`
`TC
`  subblock CRD
`
`
`
`
`TC
`subblock
`
`
`
`D
`
`
`
` CR 
`
`TC
`R
`subblock
`
`1
`
`Optis Cellular Ex 2027-p. 12
`Apple v Optis Cellular
`IPR2020-00465
`
`

`

`
`Error! No text of specified style in document.
`
`13
`
`Error! No text of specified style in document.
`
`(3) If
`
`R  C > D, then
`
`ND = (R  C – D) dummy bits are
`
`Formatted: Font: Italic, Lowered by 5 pt
`
`padded such that yk = <NULL> for k = 0, 1,…,ND - 1. Then, write the input bit sequence, i.e.,
`
`, k =
`
`Formatted: Font: Italic, Lowered by 5 pt
`
`0, 1,…, D-1, into the
`
`R  C matrix row by row starting with bit y0 in column 0 of row 0:
`
`Formatted: Font: Italic, Lowered by 5 pt
`
`Formatted: Lowered by 32 pt
`
`
`
`
`
`For
`
` and
`
`:
`
`(4) Perform the inter-column permutation for the matrix based on the pattern
` that is shown in table 5.1.4-1, where P(j) is the original column position
`
`Formatted: Lowered by 9 pt
`
`of the j-th permuted column. After permutation of the columns, the inter-column permuted
`
`R  C matrix is equal to
`
`Formatted: Font: Italic, Lowered by 5 pt
`
`
`
`(5) The output of the block interleaver is the bit sequence read out column by column from the inter-column
`
`permuted
`
`R  C matrix. The bits after sub-block interleaving are denoted by
`
`, where
`
` corresponds to
`
`yP(0),
`
` to
`
`yP(0)+C,… and
`
`Formatted: Font: (Asian) MS PMincho, Lowered by 7 pt
`
`For
`
`:
`
`.
`
`(4) The output of the sub-block interleaver is denoted by
`
`, where
`
` and where
`
`Formatted: Lowered by 17 pt
`
`
`
`The permutation function P is defined in Table 5.1.4-1.
`
`3GPP
`
`
`
`TC
`R
`subblock
`
`
`
`C
`
`TC
`subblock
`
` D
`
`
`N
`
`D
`
`
`
`
`
`TC
`R
`subblock
`
`
`
`C
`
`TC
`subblock
`
`
`
`D
`
`y
`
`N
`
`D
`
`k
`
`
`
`d
`
`)(i
`k
`
`
`
`TC
`R
`subblock C
`
`
`TC
`subblock
`
`
`
`
`
`
`
`
`
`y
`
`C
`
`TC
`subblock
`
`
`1
`
`y
`
`2
`
`C
`
`
`1
`
`TC
`subblock
`
`
`y
`
`(
`
`TC
`R
`subblock
`
`C
`
`
`TC
`subblock
`
`
`)1
`
`
`
`
`
`
`y
`
`0
`
`y
`
`C
`
`TC
`subblock
`
`
`y
`1
`
`y
`
`C
`
`
`1
`
`TC
`subblock
`
`
`y
`
`2
`
`y
`
`C
`
`
`
`2
`
`TC
`subblock
`
`
`(
`
`TC
`R
`subblock
`
`C
`
`)1
`
`TC
`subblock
`
`y
`
`(
`
`TC
`R
`subblock
`
`C
`
`)1
`
`TC
`subblock
`
`
`1
`
`y
`
`(
`
`TC
`R
`subblock
`
`C
`
`)1
`
`TC
`subblock
`
`
`
`2
`
`
`
`
`
`
`
`y
`
`
`
`
`
`
`
`y
`
`C
`
`
`1
`
`y
`
`2
`
`
`1
`
`C
`
`
`y
`
`(
`
`CR
`
`)1
`
`
`
`
`
`
`y
`
`0
`
`y
`C
`
`
`y
`1
`
`y
`
`
`1
`
`C
`
`
`y
`
`2
`
`y
`
`2
`
`C
`
`
`
`y
`
`(
`
`R
`
`C
`
`)1
`
`y
`
`(
`
`R
`
`C
`
`)1
`1
`
`y
`
`(
`
`R
`
`C
`
`)1
`
`2
`
`
`
`
`
`
`
`)0(
`kd
`
`)1(
`kd
`
` 
`jP
`
`
`
`j
`
`
`,...,1,0
`
`C
`
`TC
`subblock
`
`1
`
`
`
` 
`jP
`
`
`j
`C
`
`1,0
`,...,
`
`1
`
`
`
`
`TC
`R
`subblock C
`
`
`TC
`subblock
`
`
`
`
`
`
`
`
`
`y
`
`TC
`CP
`(
`subblock
`
`
`)1
`
`y
`
`TC
`CP
`(
`
`)1
`subblock
`
`
`TC
`C
`subblock
`
`y
`
`CP
`(
`
`TC
`subblock
`
`
`()1
`
`TC
`R
`subblock
`
`TC
`C
`
`)1
`subblock
`
`
`
`
`
`
`y
`
`P
`
`)0(
`
`y
`
`P
`
`)0(
`
`
`
`TC
`C
`subblock
`
`
`y
`
`P
`
`)1(
`
`y
`
`P
`
`)1(
`
`
`
`TC
`C
`subblock
`
`
`y
`
`P
`
`)2(
`
`y
`
`P
`
`)2(
`
`
`
`TC
`C
`subblock
`
`
`P
`
`()0(
`
`
`TC
`R
`subblock
`
`TC
`C
`
`)1
`subblock
`
`y
`
`P
`
`()1(
`
`
`TC
`R
`subblock
`
`TC
`C
`
`)1
`subblock
`
`y
`
`P
`
`()2(
`
`
`TC
`R
`subblock
`
`TC
`C
`
`)1
`subblock
`
`
`
`
`
`
`
`y
`
`
`
`
`
`
`
`y
`
`CP
`(
`
`
`)1
`
`y
`
`C
`
`CP
`(
`
`)1
`
`
`y
`
`CP
`(
`
`
`()1
`
`R
`
`C
`
`)1
`
`
`
`
`
`
`y
`
`P
`
`)0(
`
`y
`
`P
`
`
`
`C
`
`)0(
`
`
`y
`
`P
`
`)1(
`
`y
`
`P
`
`
`
`C
`
`)1(
`
`
`y
`
`P
`
`)2(
`
`y
`
`P
`
`
`
`C
`
`)2(
`
`
`y
`
`P
`
`()0(
`
`
`R
`
`C
`
`)1
`
`y
`
`P
`
`()1(
`
`
`R
`
`C
`
`)1
`
`y
`
`P
`
`()2(
`
`
`R
`
`C
`
`)1
`
`
`
`
`
`
`
`
`
`TC
`R
`subblock C
`
`
`TC
`subblock
`
`
`
`i K
`
`)(
`
`1
`
`v
`
`i
`)(
`0
`
`,
`
`i
`)(
`v
`1
`
`,
`
`v
`
`i
`)(
`2
`
`v
`,...,
`
`iv
`)(
`0
`
`)0(Py
`
`iv
`)(
`1
`
`y
`
`P
`
`TC
`C
`)0(
`subblock
`
`K
`
`
`
`
`
`TC
`subblock CR
`
`
`
`TC
`subblock
`
`
`
`K
`
`
`CR 
`
`)2(
`kd
`
`v
`
`)2(
`0
`
`,
`
`)2(
`v
`1
`
`,
`
`v
`
`)2(
`2
`
`)2(
`
`Kv
`,...,
`
`1