throbber

`
`Exhibit 1006.08Exhibit 1006.08
`
`
`
`ZTE Corporation and ZTE (USA) Inc.ZTE Corporation and ZTE (USA) Inc.
`
`

`

`TS 25.213 v2.1.0 (1999-06)
`
`Technical Specification
`
`3"‘ Generation Partnership Project (3GPP);
`Technical Specification Group (TSG)
`Radio Access Network (RAN);
`Working Group 1 (WG1);
`Spreading and modulation (FDD)
`
`
`
`The
`
`P
`
`P
`resent document has been develo ed within the 3"‘ Generation Partnership Project (3GPP W‘) and may be further elaborated for the purposes of 3GPP.
`
`The present document has not been subject to any approval process by the 3GPP Organisational Partners and shall not be implemented.
`This Specification is provided for future development work within 3GPP only. The Organisational Partners accept no liability for any use of this Specification.
`Specifications and reports for implementation of the 3GPP TM system should be obtained via the 3GPP Organisational Partners’ Publications Offices.
`
`ZTE Corporation and ZTE (USA) Inc.
`
`Exhibit 1006.08—00001
`
`

`

`Spreading and modulation (FDD)
`
`TS 25.213 V2.1.0 (1999-06)
`
`Reference
`
`<Workitem> (25_213-xxx.PDF)
`
`Keywords
`<keyword[, keyword]>
`
`3GPP
`
`Postal address
`
`Office address
`
`Internet
`
`secretariat@3gpp.org
`Individual copies ofthis deliverable
`can be downloaded from
`http://www.3gpp.org
`
`

`

`Spreading and modulation (FDD)
`
`TS 25.213 V2.1.0 (1999-06)
`
`Contents
`
`Intellectual Property Rights .............................................................................................................................. ..4
`
`Foreword .......................................................................................................................................................... . . 4
`
`1
`
`2
`
`3
`3.1
`
`3.2
`3.3
`
`4
`4.1
`
`4.2
`4.2.1
`4.2.2
`
`4.3
`4.3.1
`
`4.3.2
`4321
`
`4.3.2.2
`4323
`4.3.3
`
`4.3.3.1
`4.3.3.2
`4.3.3.3
`4.3.3.4
`4.4
`
`4.4.1
`4.4.2
`4.4.3
`
`5
`5.1
`5.2
`5.2.1
`
`5.2.2
`5.2.3
`5.2.3.1
`5232
`5.3
`
`5.3.1
`5.3.2
`5.3.3
`
`Scope ...................................................................................................................................................... .. 5
`
`References .............................................................................................................................................. .. 5
`
`Definitions, symbols and abbreviations ................................................................................................. ..5
`Definitions ....................................................................................................................................................... .. 5
`
`Symbols ........................................................................................................................................................... .. 5
`Abbreviations ................................................................................................................................................... .. 5
`
`Uplink spreading and modulation .......................................................................................................... ..7
`Overview ......................................................................................................................................................... .. 7
`
`Spreading ......................................................................................................................................................... .. 7
`Uplink Dedicated Physical Channels (uplink DPDCH/DPCCH) .............................................................. .. 7
`PRACH ...................................................................................................................................................... .. 9
`
`Code generation and allocation ....................................................................................................................... .. 9
`Channelization codes ................................................................................................................................. .. 9
`
`Scrambling codes ..................................................................................................................................... .. 11
`General ............................................................................................................................................... .. ll
`
`Long scrambling code ........................................................................................................................ .. 12
`Short scrambling code ........................................................................................................................ .. 13
`Random access codes ............................................................................................................................... .. l5
`
`Preamble spreading code .................................................................................................................... .. 15
`Preamble signature ............................................................................................................................. .. 17
`Channelization codes for the message part ......................................................................................... .. l7
`Scrambling code for the message part ................................................................................................ .. 18
`Modulation ..................................................................................................................................................... .. 18
`
`Modulating chip rate ................................................................................................................................ .. 18
`Pulse shaping ........................................................................................................................................... .. l8
`Modulation ............................................................................................................................................... .. 18
`
`Downlink spreading and modulation ................................................................................................... .. 19
`Spreading ....................................................................................................................................................... .. l9
`Code generation and allocation ..................................................................................................................... .. 20
`Channelization codes ............................................................................................................................... .. 20
`
`Scrambling code ....................................................................................................................................... .. 20
`Synchronisation codes .............................................................................................................................. .. 22
`Code Generation ................................................................................................................................. .. 22
`Code Allocation .................................................................................................................................. .. 23
`Modulation ..................................................................................................................................................... .. 24
`
`Modulating chip rate ................................................................................................................................ .. 24
`Pulse shaping ........................................................................................................................................... .. 24
`Modulation ............................................................................................................................................... .. 24
`
`6
`
`History .................................................................................................................................................. ..26
`
`

`

`Spreading and modulation (FDD)
`
`TS 25.213 V2.1.0 (1999-06)
`
`Intellectual Property Rights
`
`Foreword
`
`This Technical Specification has been produced by the 3Gl’P.
`
`The contents ofthe present document are subject to continuing work within the TSG and may change following formal
`TSG approval. Should the TSG modify the contents ofthis TS, it will be re-released by the TSG with an identifying
`change of release date and an increase in version number as follows:
`
`Version 3.y.z
`
`where:
`
`x the first digit:
`
`1
`
`presented to TSG for information;
`
`2 presented to TSG for approval;
`
`3
`
`Indicates TSG approved document under change control.
`
`the second digit is incremented for all changes of substance, i.e. technical enhancements, corrections,
`updates, etc.
`
`the third digit is incremented when editorial only changes have been incorporated in the specification.
`
`ZTE Corporation and ZTE (USA) Inc.
`
`Exhibit 1006.08-00004
`
`

`

`Spreading and modulation (FDD)
`
`TS 25.213 V2.1.0 (1999-06)
`
`1
`
`Scope
`
`The present document describes spreading and modulation for UTRA Physical Layer FDD mode.
`
`2
`
`References
`
`The following documents contain provisions which, through reference in this text, constitute provisions of the present
`document.
`
`0 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.
`
`A non-specific reference to an ETS shall also be taken to refer to later versions published as an EN with the
`same number.
`
`[<seq>]
`
`<doctype> <#>[ ([up to and including]{yyyy[-mm]lV<a[.b[.c]]>} [onwards])]: “<fitle>“.
`
`[1]
`
`[2]
`
`EN 301 234 (V2.1 onwards): “Example 1, using sequence field".
`
`EG 201 568 (V1.35): "Example 2, using fixed tex “.
`
`<doctype> <#>[ ([up to and including] {yyyy[-mm]lV<a[.b[.c]]>} [onwards])]: "<Title>“.
`
`EN 301 234 (V2.1 onwards): “Example 1".
`
`EG 201 568 (V1.35): “Example 2".
`
`3
`
`Definitions, symbols and abbreviations
`
`3.1
`
`Definitions
`
`For the purposes of the present document, the following terms and definitions apply.
`
`3.2
`
`Symbols
`
`For the purposes of the present document, the following symbols apply:
`
`<symbol>
`
`<Explanation>
`
`3.3
`
`Abbreviations
`
`For the purposes of the present document, the following abbreviations apply:
`
`BCH
`BER
`BS
`
`CCPCH
`DCH
`DL
`
`DPCH
`DPCCH
`DPDCH
`
`Broadcast Control Channel
`Bit Error Rate
`Base Station
`
`Common Control Physical Channel
`Dedicated Channel
`Downlink
`
`Dedicated Physical Channel
`Dedicated Physical Control Channel
`Dedicated Physical Data Channel
`
`ZTE Corporation and ZTE (USA) Inc.
`
`Exhibit 1006.08-00005
`
`

`

`Spreading and modulation (FDD)
`
`TS 25.213 V2.1.0 (1999-06)
`
`DS-CDMA
`FACH
`
`Direct-Sequence Code Division Multiple Access
`Forward Access Channel
`
`FDD
`Mcps
`MS
`
`OVSF
`PCH
`PG
`PRACH
`RACH
`RX
`
`SCH
`SF
`SIR
`TDD
`TFCl
`TPC
`TX
`
`UE
`
`Frequency Division Duplex
`Mega Chip Per Second
`Mobile Station
`
`Orthogonal Variable Spreading Factor (codes)
`Paging Channel
`Processing Gain
`Physical Random Access Channel
`Random Access Channel
`Receive
`
`Synchronisation Channel
`Spreading Factor
`Signal-to-Interference Ratio
`Time Division Duplex
`Transport-Format Combination Indicator
`Transmit Power Control
`Transmit
`
`User Equipment
`Uplink
`
`ZTE Corporation and ZTE (USA) Inc.
`
`Exhibit 1006.08-00006
`
`

`

`Spreading and modulation (FDD)
`
`TS 25.213 V2.1.0 (1999-06)
`
`4
`
`Uplink spreading and modulation
`
`4.1
`
`Overview
`
`Spreading is applied after modulation and before pulse shaping. It consists of two operations. The first is the
`channelization operation, which transforms every data symbol into a number ofchips, thus increasing the bandwidth of
`the signal. The number of chips per data symbol is called the Spreading Factor (SF). The second operation is the
`scrambling operation, where a scrambling code is applied to the spread signal.
`
`With the channelization, data symbol on so-called 1- and Q-branches are independently multiplied with an OVSF code.
`With the scrambling operation, the resultant signals on the I- and Q-branches are further multiplied by complex-valued
`scrambling code, where I and Q denote real and imaginary parts, respectively. Note that before complex multiplication
`binary values 0 and l are mapped to +1 and -l , respectively.
`
`4.2
`
`Spreading
`
`4.2.1
`
`Uplink Dedicated Physical Channels (uplink DPDCH/DPCCH)
`
`Figure 1 illustrates the spreading and modulation for the case of multiple uplink DPDCHS when total data rate is less
`than or equal to lO24kbps in the 5MHz band. Note that this figure only shows the principle, and does not necessarily
`describe an actual implementation. Figure 2 illustrates the case for data rate at 2048kbps in the 5 MHz band.
`Modulation is dual-channel QPSK (i.e.; separate BPSK on 1- and Q-channel), where the uplink DPDCH and DPCCH
`are mapped to the I and Q branch respectively. The I and Q branches are then spread to the chip rate with two different
`channelization codes and subsequently complex scrambled by a UE specific complex scrambling code Csmmb.
`
`channelization codes (OVSF;
`
`DPDCH gains
`
`DPDCH‘
`(BPSK)
`
`DPDCH3
`(BPSK)
`
`cm
`
`/
`
`/'
`
`Emu:
`I.
`
`w
`
`D1
`
`I A \
`
`ll;
`/l\
`
`/'
`
`\
`
`°.i ilk l
`
`llv l
`
`D:;':::;« e:.>‘Li~:>i.<;i~
`
`cmin
`/L
`
`ll;
`
`DPDCH2
`(BPSK)
`
`i’
`\
`
`V‘
`
`‘V4
`iirxiix
`Ly
`i f \ ‘~
`
`DPDCH4
`(BPSK)
`
`DPDC HN
`(BPSK)
`
`DPCCH
`(BPSK)
`
`0
`x, /’
`mm
`
`C»:
`
`’
`
`’
`
`'
`
`ljh
`
`_,/ f T i
`u.
`
`.i
`
`1
`
`—sim_wi)
`
`{W ,
`«>24
`
`Figure 1 Spreading/modulation for uplink DPDCI-I/DPCCI-I for user services less than or equal to 1024kbps in
`the 5MHz band
`
`ZTE Corporation and ZTE (USA) Inc.
`
`Exhibit 1006.08-00007
`
`

`

`Spreading and modulation (FDD)
`
`TS 25.213 V2.1.0 (1999-06)
`
`Channelllalmn codes (OVSFy
`
`DPDCH gains
`
`DPDCH‘
`(BPSK)
`
`DPDCH3
`(BPS K)
`
`/’
`
`/
`‘
`
`\
`
`C
`
`min
`
`,1
`
`\
`
`/’
`
`I‘;
`
`i:H:><i:~
`
`DPDCHN
`(BPSK)
`
`DPCCH
`(BPSK)
`
`Figure 2. Spreading/modulation for uplink DPDCH/DPCCH for user services at 2048kbps in the 5l\/II-lz band
`
`<Editor’s note: pulse shaping will be moved to appropriate WG4 documentation.>
`
`For a single uplink DPDCH transmission, only DPDCH] and DPCCH are transmitted]
`
`For services less than or equal to lO24kbps in the SMHZ band, the DPCCH is spread by the channelization code Cam
`and each DPDCHi is spread by a predefined individual channelization codes, Cchgdi (di=l,2,... ). For 2048kbps rate in
`the SMHZ band, the DPCCH is spread by the channelization code Cum and each pair of DPDCHZAH and DPDCH2dj is
`spread by a predefined individual channelization codes, Cami. The data symbols of both the DPDCHs and the DPCCH
`are BPSK-modulated and the channelization codes are real-valued. The real-valued signals of the 1- and Q-branches are
`then summed and treated as a complex signal. This complex signal is then scrambled by the complex-Valued scrambling
`code, Csmmb. The powers of the DPDCHS may be adjusted by gain factors, BC, Ba,
`_
`
`The channel with maximum power has always fli E 1.0 and the others have [Bi g LO, where i is in the range 1, 2, .. N,
`c The [3-values are quantized into 4 bits, and the quantization steps are given in Table 1.
`
`ZTE Corporation and ZTE (USA) Inc.
`
`Exhibit 1006.08-00008
`
`

`

`Spreading and modulation (FDD)
`
`TS 25.213 V2.1.0 (1999-06)
`
`_\ U‘!
`
`_;_x_\M0)-h
`
`_|.
`_x
`_x O
`
`O—|l\J(A)-l>U‘IO)\lCO<.D
`
`Quantized amplitude ratio
`(flquant )
`1 0
`0.9375
`0.875
`0.8125
`0.75
`0.6875
`0.625
`0.5625
`0.5
`0.4375
`0.375
`0.3125
`0.25
`0.1875
`0.125
`Switch off
`
`Table 1: The quantization ofthe gain parameters.
`
`4.2.2
`
`PRACH
`
`The spreading and modulation of the message part of the Random-Access burst is basically the same as for the uplink
`dedicated physical channels, see Figure l, where the uplink DPDCH and uplink DPCCH are replaced by the data part
`and the control part respectively. The scrambling code for the message part is chosen based on the base-station-specific
`preamble code.
`
`4.3
`
`Code generation and allocation
`
`4.3.1
`
`Channelization codes
`
`The channelization codes of Figure l are Orthogonal Variable Spreading Factor (OVSF) codes that preserve the
`orthogonality between a user’s different physical channels. The OVSF codes can be defined using the code tree of
`Figure 3.
`
`04.3: (1,-1,1,-1)
`
`c4.4= (1,-1,-1,1)
`
`Figure 3. Code-tree for generation of Orthogonal Variable Spreading Factor (OVSF) codes.
`
`In Figure 3, the OVSF code is described as CgF_c0d¢ numbcr, where SFd_n represents the spreading factor of nth DPDCH.
`Then the DPCCH is spread by code number 1 with a spreading factor of SFC.
`
`Each level in the code tree defines channelization codes of length SF, corresponding to a spreading factor of SF in
`Figure 3. All codes within the code tree cannot be used simultaneously by one mobile station. A code can be used by a
`
`ZTE Corporation and ZTE (USA) Inc.
`
`Exhibit 1006.08-00009
`
`

`

`Spreading and modulation (FDD)
`
`10
`
`TS 25.213 V2.1.0 (1999-06)
`
`UE if and only if no other code on the path from the specific code to the root of the tree or in the sub-tree below the
`specific code is used by the same mobile station. This means that the number of available channelization codes is not
`fixed but depends on the rate and spreading factor of each physical channel.
`
`The generation method for the channelization code can also be explained in Figure 4.
`
`Figure 4. Spreading Code Generation Method
`
`Binary code words are equivalent to the real valued sequences by the transformation ‘0’ -> ‘+1 ’, ‘l ’ -> ‘-1 ’.
`
`The spreading code cycle is the symbol cycle. Thus, for a given chip rate, the spreading code cycle depends on the
`symbol rate. Furthermore, the number of codes that can be used also differs according to the symbol rate. The relations
`between symbol rate, spreading code types, spreading code cycle and number of spreading codes is listed in Table 2.
`
`The spreading code phase synchronises with the modulation/demodulation symbols. In other words, the head chip of
`the symbol is spreading code phase:0i
`
`spreading
`
`code
`cycle(chip)
`
`No. of
`
`Spreading
`codes
`
`S mbol rate ks s)
`
`[32]
`
`128
`
`[16384
`MC 0 S]
`
`4096]
`
`2048]
`[I024]
`[512]
`256
`
`ZTE Corporation and ZTE (USA) Inc.
`
`Exhibit 1006.08-00010
`
`

`

`Spreading and modulation (FDD)
`
`TS 25.213 V2.1.0 (1999-06)
`
`222
`
`2
`-22
`
`Table 2. Correspondence between Symbol Rate and Spreading Code Types
`
`The DPCCH is spread by code number 1 in any code tree as described in Section 4.3.1. The first DPDCH is spread by
`code number (SFd,1 / 4 + 1). Subsequently added DPDCHS for multi-code transmission are spread by codes in
`ascending order starting from code number 2 excepting the one used for the first DPDCH. However to guarantee the
`orthogonality between channels, any subtree below the specified node is not used for the channelization code ofa
`DPDCH.
`
`<Editor's Note: The case of OVSF code allocation with multiple DPDCHS with different spreading Factors is for further study
`
`4.3.2
`
`Scrambling codes
`
`4.3.2.1
`
`General
`
`There are 224 uplink scrambling codes. Either short or long scrambling codes should be used on the uplink. The short
`scrambling code is typically used in cells where the base station is equipped with an advanced receiver, such as a multi-
`user detector or interference canceller. With the short scrambling code the cross-correlation properties between
`different physical channels and users does not vary in time in the same way as when a long code is used. In cells where
`there is no gain in implementation complexity using the short scrambling code, the long code is used instead due to its
`better interference averaging properties. Both short and long scrambling codes are represented with complex-value.
`
`The uplink scrambling generator (either short or long) shall be initialised by a 25 bit value. One bit shall indicate
`selection of short or long codes (short : 1, long : O). Twenty four bits shall be loaded into the scrambling generators as
`shown in sections 4.3.2.2 and 4.3.2.3.
`
`MS“
`was:
`
`‘/22
`
`v2
`
`V2‘
`
`v«
`
`v
`
`\’
`
`7
`
`v
`
`\’
`
`v
`
`lmllahsahon Code
`Short/Long flag + value v
`\'(1$I
`»(12)
`v(1l)
`\.(lL‘) w
`
`Figure 5 - Initialisation Code for Uplink Scrambling generator
`
`[A|ternatively, ifthe system chooses, RSTS for uplink transmission, the scrambling code is the same as the downlink
`scrambling code described in 0. ln this case, the same scrambling code is allocated to all dedicated physical channels in
`the cell.]
`
`Both short and long scrambling codes are formed as follows:
`
`= cl(w0 + jc2’w1)
`
`where w and w are chip rate sequences defined as repetitions of:
`
`

`

`Spreading and modulation (FDD)
`
`12
`
`TS 25.213 V2.1.0 (1999-06)
`
`Also, cl is a real chip rate code, and c2’ is a decimated version of the real chip rate code C2. The preferred decimation
`factor is 2, however other decimation factors should be possible in future evolutions of3GPP if proved desirable.
`
`With a decimation factor 2, C2’ is given as:
`
`c2’(2k) : c2’(2kl 1) : c2(2k),
`
`k:0,1,2....
`
`The constituent codes c1 and C2 are formed differently for the short and long scrambling codes as described in Sections
`4.3.2.2 and 4.3.2.3.
`
`4.3.2.2
`
`Long scrambling code
`
`The long scrambling codes are formed as described in Section 4.3.2, where c1 and C2 are constructed as the position
`wise modulo 2 sum of 40960 chip segments oftwo binary m-sequences generated by means of two generator
`polynomials of degree 25. Let x, and y be the two m-sequences respectively. The x sequence is constructed using the
`primitive (over GF(2)) polynomial X25 X3 1. They sequence is constructed using the polynomial X25 1X3 1X2 1X1 1.
`The resulting sequences thus constitute segments of a set of Gold sequences.
`
`The code, C2, used in generating the quadrature component of the complex spreading code is a 16,777,232 chip shifted
`version of the code, cl, used in generating the in phase component.
`
`The uplink scrambling code word has a period of one radio frame of 10 ms.
`
`no be the 24 bit binary representation ofthe scrambling code number 11 (decimal) with 170 being the least
`Let 1123
`significant bit. The X sequence depends on the chosen scrambling code number n and is denoted X”, in the sequel.
`Furthermore, let X,/I) and yfl) denote the /.'th symbol ofthe sequence x,, and y, respectively
`
`The m-sequences x,, and y are constructed as:
`
`Initial conditions:
`
`x,/0):/10, x,,(1): /1,,
`
`:x,,(22): /122 ,x,/23): /123, x/1(2-1):]
`
`y(0)—y(1)— —y(23)—y(24)—1
`
`Recursive definition of subsequent symbols:
`
`x,,(i+25) —x,,(i+3) + x,,(1) modulo 2, I'—0,
`
`225-43,
`
`y(i+25) » y(i+3)+y(z‘—2) »y(1+1) +y(z) modulo 2, i—0,..., 225-27.
`
`The definition of the nzth scrambling code word for the in phase and quadrature components follows as (the left most
`index correspond to the chip scrambled first in each radio frame):
`
`cm: <Xn(0) ‘y./0), 39/1)
`
`)’(1): ~~»Xn(N-1) ‘y(N—1) >,
`
`cm: <x,.,
`
`)ly(IlJ), x,,(IlJl 1) ly_(]l/[1 1),
`
`..., xnflll N-I)
`
`y(]l/[lN-1) i>,
`
`again all sums being modulo 2 additions. (Both N and M are defined in Table 3.)
`
`These binary code words are converted to real valued sequences by the transformation ‘O’ -> ‘ 1’, ‘1’ -> ‘-1’.
`
`<1z'a’il0r’s note: 224 — I is FFS.
`
`

`

`Spreading and modulation (FDD)
`
`TS 25.213 V2.1.0 (1999-06)
`
`MSB
`
`shift register 1 (41bit)
`
`ml
`
`440‘
`
`l
`
`l
`
`shift register 2 (41 bit)
`
`l20l....
`
`EXOR
`
`Figure 6. Configuration of uplink scrambling code generator
`
`Chip rate
`(MCPS)
`
`'
`
`S)
`
`(
`
`‘p )
`
`40960
`
`Range of phase (chip)
`
`(C?)
`
`[l6.384
`
`163840
`
`14336
`
`M N+(M")
`
`Table 3. Correspondence between chip rate and uplink scrambling code phase range
`
`4.3.2.3
`
`Short scrambling code
`
`The short scrambling codes are formed as described in Section 4.3.2. l,where cl and c2 are the real and imaginary
`components ofthe complex spreading code from the family of periodically extended S(2) codes.
`
`255, of length 256 chips are obtained by one chip periodic extension of S(2)
`The uplink short codes S,.(n), n:0,l
`sequences of length 255. It means that the first chip (SV(0)) and the last chip (S,.(255)) of any uplink short scrambling
`code are the same.
`
`The quaternary S(2) sequence zV(/7), O S v S 16,777,216, oflength 255 is obtained by modulo 4 addition of three
`sequences, a quaternary sequence a,.(n) and two binary sequences b5(n) and c,(n), according to the following relation:
`
`z,,(n) : a,.(n) + 2'b_,(n) + 2'c,(n)
`
`(mod 4) ,
`
`n : O, l,
`
`, 254.
`
`The user index v determines the indexes r, S, and tof the constituent sequences in the following way:
`
`V:f'216+S'28+}",
`>
`
`r: 0, 1, 2,
`
`255
`
`s:0,1,2,...,255
`
`>
`
`r:0,1,2,...,255.
`
`

`

`Spreading and modulation (FDD)
`
`14
`
`TS 25.213 V2.1.0 (1999-06)
`
`The quaternary sequence a,.(n) is generated by the recursive generator G0 defined by the polynomial
`
`g0(x)= x8+x5+3x3—x2+2x—I as
`
`a,(n): 3.a,(n-3) +1 .a,(n-5) + 3.a¢(n-6) +2.a,(n-7) + 3.a,(n-8) (mod 4).
`
`n:O, L2, ...,255.
`
`The binary sequence bS(n) is generated by the recursive generator G1 defined by the polynomial
`
`g,(x): x8+x7+x5+x—l
`
`as
`
`b5(n): b5(n-/)+ b_,.(n-3)+ b_,.(n- 7)+ b5(n-8) (mod 2).
`
`The binary sequence c,(n) is generated by the recursive generator G; defined by the polynomial
`
`g2(x): x8 lx7 lxfi lxi l 1
`
`as
`
`c,(n): c,(n-1)+ c,(n-3)+ c,(n-4)+ c,(n-8) (mod 2).
`
`An implementation of the short scrambling code generator is shown in Figure 7. The initial states for the binary
`generators G1 and G; are the two 8-bit words representing the indexes 5 and I in the 24-bit binary representation of the
`user index v, as it is shown in Figure 8.
`
`The initial state for the quaternary generator G0 is according to Figure 8. obtained after the transformation of 8-bit word
`representing the index r. This transformation is given by
`
`a,.(O) = 2v(O)+l
`
`(mod 4),
`
`a,.(/7) = 2v(/1) (m0a’4),
`
`/1 = 1,... ,7.
`
`The complex quadriphase sequence S,,(/7) is obtained from quaternary sequence z,.(n) by the mapping function given in
`Table 4.
`
`The Re{Sv(n)} and Im{Sv(n)} of the S(2) code are the pair of two binary sequences corresponding to input binary
`sequences c1 and C2 respectively described in 4.32
`
`Table 4. Mapping between S,(n) and z,.(n)
`
`ZTE Corporation and ZTE (USA) Inc.
`
`Exhibit 1006.08-00014
`
`

`

`Spreading and modulation (FDD)
`
`TS 25.213 V2.1.0 (1999-06)
`
`smn suspend aller
`every 255m chip 4» 4 7
`cycle
`
`fi/+ ) mod n addition
`
`multiplication
`
`+3>(>:<l
`
`!
`+3»:)V¢
`V
`,+2>lX>
`\
`7+ qr.
`"’+-\:l«jlj"+-\\,le(’:+\ ;4—<j"+-W47
`
`Figure 7. Uplink short scrambling code generator
`MST}
`Ilsermdex v
`
`(“WU
`
`t(s)
`
`(“Z
`
`Gcnuralur G2
`
`v’; mm mm ms; mjmjl|mx\ mjlzjl ml; mjmjl
`//
`3
`
`V‘
`
`Lugs)
`
`um L-‘(3)
`
`52
`
`Y
`
`L
`
`gm)
`
`um | M» M;
`
`| ml
`
`H2; my
`
`wax
`
`an
`us)
`/ X
`
`tutu)
`
`Gcnuralur G1
`
`./
`47)
`
`4,
`
`4(5)
`
`4,14.
`
`4(3)
`
`4,2
`
`2'
`
`Gunoralor Go
`
`“ml
`./
`
`\:
`nu)
`
`Figure 8. Uplink short scrambling code generator state initialisation
`
`The short scrambling code may, in rare cases, be changed during a connection.
`
`4.3.3
`
`Random access codes
`
`4.3.3.1
`
`Preamble spreading code
`
`The spreading code for the preamble part is cell specific and is broadcast by the base station. More than one preamble
`code can be used in a base station ifthe traffic load is high. The preamble codes must be code planned, since two
`neighbouring cells should not use the same preamble code.
`
`The code used is a real-valued 256 chip Oithogonal Gold code. All 256 codes are used in the system.
`
`The code sequences are constructed with the help offitwo binary m-sequences of length 255, x, and y, respectively. The
`x sequence is constructed using the polynomial l—X‘+X3+X4+X8. They sequence is constructed using the polynomial
`1 X'”X5lX6lX".
`
`no be the binary representation of the code number n (decimal) with no being the least significant bit. The x
`Let I17
`sequence depends on the chosen code number /7 and is denoted X” in the sequel. Furthermore, let x,,(/) and y(/) denote
`the i:th symbol of the sequence x,, and y, respectively
`
`The m-sequences x,, and y are constructed as:
`
`Initial conditions:
`
`x,,(())*ng, x,1(l)* 11,,
`
`*x,1(6)* I15, x,,(7)* n7
`
`y(0)‘y(/.)— 7/6.)/y(7.)*I
`
`Recursive definition of subsequent symbols:
`
`x,,(i l 8) :x,.,(i l 4)
`
`l x,.,(I'
`
`l 3)
`
`l x,,(i l 2)
`
`l x,,(z) modulo 2, i:0,..., 246,
`
`ZTE Corporation and ZTE (USA) Inc.
`
`Exhibit 1006.08-00015
`
`

`

`Spreading and modulation (FDD)
`
`16
`
`TS 25.213 V2.1.0 (1999-06)
`
`y(i+8) ’y(i~6)+yfi+5)+y(i+3)—y(U modulo 2,
`
`i—0,
`
`246.
`
`The definition of the nzth code word follows (the left most index correspond to the chip transmitted first in each slot):
`
`CRACILH = < 0, x,/0) t)’(0)y xn(1)t)’(1).
`
`,x,/254) 11254) >,
`
`All sums of symbols are taken modulo 2.
`
`The preamble spreadingcode is described in Figure 9.
`
`shift register 1 (8 bit) to
`generate x sequence
`
`shift register 2 (8 bit) to
`generate y sequence
`
`4
`
`lélsl M l
`
`l0
`
`Egg EXOR
`
`Figure 9. Preamble spreadingcode generator
`
`Note that the code words always start with a constant ‘O’ symbol.
`
`Before modulation and transmission these binary code words are converted to real valued sequences by the
`transformation ‘O’ -> ‘+1’, ‘1’ -> ‘-1’.
`
`Note: WGI has accepted the 4096 chip long code spreading as a working assumption.
`
`ZTE Corporation and ZTE (USA) Inc.
`
`Exhibit 1006.08-00016
`
`

`

`Spreading and modulation (FDD)
`
`17
`
`TS 25.213 V2.1.0 (1999-06)
`
`4.3.3.2
`
`Preamble signature
`
`The preamble part carries one of 16 diffe
`signatures are based on a set of Orthogon
`
`t orthogonal complex signatures oflen
`old codes of length 16 and are specifi
`
`6, < ,
`"n Tabl
`
`.
`
`, ..., P15>. The
`
`Note: WGl has accepted differential preambles additionally as a working assumption.
`
`Preamble symbols
`
`HE
`
`'
`
`'
`
`>HHEHHHHEHEEEEEHHEHEHHHHEEEBEEEEHEEEEEEHEEEEHEEEEHEEEEEEEEEEHEEHEEEEEEHHHEHHEHEEHEHEEEEEEHEHHEEEHEEEEE
`
`ZZZ
`
`K
`
`Table 5. Preamble signatures. A = l+j.
`
`4.3.3.3
`
`Channelization codes for the message part
`
`The signature in the pr
`length 16, as sh
`'n
`'
`rol (Q-bran
`data part (1-branc
`branch of the sub-tree. Ho
`cell, through the use ofa B
`
`esponds to channelization cod
`6 nodes in the code-tree that
`e specifies one of
`preading ofthe message part.
`w the specified node is used
`' ure 10. The sub-tree
`ode of spreading factor 256 in the lowest branch of the sub-tree.
`d with the channelizati
`tion codes from spreading factor 32 to 256 '
`upper-most
`n use any of the chann ‘
`ver, the system may restrict the set of codes (spreading factors) actu
`lowed in the
`message.
`
`3GPP
`
`ZTE Corporation and ZTE (USA) Inc.
`
`Exhibit 1006.08—00017
`
`

`

`Spreading and modulation (FDD)
`
`TS 25.213 V2.1.0 (1999-06)
`
`Signature 1
`
`.=>
`
`Sigznatlun 16
`
`‘:9
`
`mlffm:.'.::o"
`
`Control
`
`Figure 10. Channelization codes for the random access message part.
`
`Since the control part is always spread with a known channelization code of length 256, it can be detected by the
`NodeB. The rate information field of the control part informs the base station about the spreading factor used on the
`data part. With knowledge of the sub-tree (obtained from the preamble signature) and the spreading factor (obtained
`from the rate information), the NodeB knows which channelization code is used for the data part.
`
`<Editor’s note: possibly the replacement term for BS should be cell.>
`
`4.3.3.4
`
`Scrambling code for the message part
`
`In addition to spreading, the message part is also subject to scrambling with a l0 ms complex code. The scrambling
`code is cell-specific and has a one-to-one correspondence to the spreading code used for the preamble part.
`
`The scrambling codes used are from the same set of codes as is used for the other dedicated uplink channels when the
`long scrambling codes are used for these channels. The first 256 of the long scrambling codes are used for the random
`access channel. The generation of these codes is explained in Section 43.2.2. The mapping ofthese codes to provide a
`complex scrambling code is also the same as for the other dedicated uplink channels and is described in Section 4.3.2.
`
`4.4
`
`Modulation
`
`4.4.1
`
`Modulating chip rate
`
`The modulating chip rate is 4.096 Mcps. This basic chip rate can be extended to [l.O24, ]8.l92 or 16.384 Mcps.
`
`4.4.2
`
`Pulse shaping
`
`The pulse-shaping filters are root-raised cosine (RRC) with roll-off Oc:0.22 in the frequency domain.
`
`<Editor’s note: pulse shaping will be moved to appropriate WG4 documentation.>
`
`4.4.3
`
`Modulation
`
`In the uplink, the modulation of both DPCCH and DPDCH is BPSK. The modulated DPCCH is mapped to the Q-
`branch, while the first DPDCH is mapped to the I-branch. Subsequently added DPDCHS are mapped alternatively to
`the I or Q-branches.
`
`ZTE Corporation and ZTE (USA) Inc.
`
`Exhibit 1006.08-00018
`
`

`

`Spreading and modulation (FDD)
`
`TS 25.213 V2.1.0 (1999-06)
`
`5
`
`Downlink spreading and modulation
`
`5.1
`
`Spreading
`
`Figure 11 illustrates the spreading and modulation for the downlink DPCH. Data modulation is QPSK where each pair
`of two bits are serial-to-parallel converted and mapped to the I and Q branch respectively. The I and Q branch are then
`spread to the chip rate with the same channelization code cch (real spreading) and subsequently scrambled by the
`scrambling code Csmmh (complex scrambling).
`
`DPDC/H,/DPC/CH
`
`DPDCH2
`
`Figure 11. Spreading/modulation for downlink DPCH.

This document is available on Docket Alarm but you must sign up to view it.


Or .

Accessing this document will incur an additional charge of $.

After purchase, you can access this document again without charge.

Accept $ Charge
throbber

Still Working On It

This document is taking longer than usual to download. This can happen if we need to contact the court directly to obtain the document and their servers are running slowly.

Give it another minute or two to complete, and then try the refresh button.

throbber

A few More Minutes ... Still Working

It can take up to 5 minutes for us to download a document if the court servers are running slowly.

Thank you for your continued patience.

This document could not be displayed.

We could not find this document within its docket. Please go back to the docket page and check the link. If that does not work, go back to the docket and refresh it to pull the newest information.

Your account does not support viewing this document.

You need a Paid Account to view this document. Click here to change your account type.

Your account does not support viewing this document.

Set your membership status to view this document.

With a Docket Alarm membership, you'll get a whole lot more, including:

  • Up-to-date information for this case.
  • Email alerts whenever there is an update.
  • Full text search for other cases.
  • Get email alerts whenever a new case matches your search.

Become a Member

One Moment Please

The filing “” is large (MB) and is being downloaded.

Please refresh this page in a few minutes to see if the filing has been downloaded. The filing will also be emailed to you when the download completes.

Your document is on its way!

If you do not receive the document in five minutes, contact support at support@docketalarm.com.

Sealed Document

We are unable to display this document, it may be under a court ordered seal.

If you have proper credentials to access the file, you may proceed directly to the court's system using your government issued username and password.


Access Government Site

We are redirecting you
to a mobile optimized page.





Document Unreadable or Corrupt

Refresh this Document
Go to the Docket

We are unable to display this document.

Refresh this Document
Go to the Docket