(19) United States
`(12) Patent Application Publication (10) Pub. No.: US 2005/0152265 A1
`(43) Pub. Date:
`Jul. 14, 2005
`Denk
`
`US 2005O152265A1
`
`(54) APPARATUS FOR PRODUCTION OF
`SCRAMBLING CODES AND PREAMBLES
`
`(76) Inventor: Robert Denk, Grafing (DE)
`Correspondence Address:
`ESCHWEILER & ASSOCIATES, LLC
`NATIONAL CITY BANK BUILDING
`629 EUCLIDAVE., SUITE 1210
`CLEVELAND, OH 44114 (US)
`(21) Appl. No.:
`(22) Filed:
`(30)
`
`11/014,274
`Dec. 16, 2004
`Foreign Application Priority Data
`
`Dec. 17, 2003 (DE)............................. DE 103 59 268.7
`
`Publication Classification
`
`(51) Int. Cl." ...................................................... H04J 11/00
`(52) U.S. Cl. ............................................ 370/209; 375/145
`(57)
`ABSTRACT
`The present invention is directed to an apparatus for pro
`duction of Scrambling codes that are used for Scrambling
`binary signals transmitted via physical channels in a mobile
`radio System. The apparatus is also configured to produce
`preambles that are Sent on a physical channel in order to
`control the access to that particular physical channel. The
`apparatus includes a Scrambling code generator for produc
`tion of the Scrambling codes, and a preamble generator for
`production of non-Scrambled preambles, and at least one
`multiplier for Scrambling the non-Scrambled preambles
`using associated Scrambling codes.
`
`
`
`
`
`
`
`
`
`4. BITS UNSIGNED
`4. BITS UNSIGNED
`4. BITS UNSIGNED
`3
`
`DPDCH, 1 bit
`
`
`
`
`
`
`
`9
`
`
`
`X
`
`5
`
`19
`
`3.84 MCHIPS/S
`
`
`Ex.1031 / Page 1 of 18Ex.1031 / Page 1 of 18
`
`TESLA, INC.TESLA, INC.
`
`

`

`Patent Application Publication Jul. 14, 2005 Sheet 1 of 6
`
`US 2005/0152265 A1
`
`s
`
`C
`
`
`Ex.1031 / Page 2 of 18Ex.1031 / Page 2 of 18
`
`TESLA, INC.TESLA, INC.
`
`

`

`Patent Application Publication Jul. 14, 2005 Sheet 2 of 6
`
`
`
`Z 9H
`
`
`Ex.1031 / Page 3 of 18Ex.1031 / Page 3 of 18
`
`TESLA, INC.TESLA, INC.
`
`

`

`Patent Application Publication Jul. 14, 2005 Sheet 3 of 6
`
`US 2005/0152265 A1
`
`
`
`|
`
`|----------|-----_%_ }
`
`98
`
`
`Ex.1031 / Page 4 of 18Ex.1031 / Page 4 of 18
`
`TESLA, INC.TESLA, INC.
`
`

`

`Patent Application Publication Jul. 14, 2005 Sheet 4 of 6
`
`US 2005/0152265 A1
`
`
`
`)
`
`dX0 X
`
`(
`+
`)
`
`
`Ex.1031 / Page 5 of 18Ex.1031 / Page 5 of 18
`
`TESLA, INC.TESLA, INC.
`
`

`

`Patent Application Publication Jul. 14, 2005 Sheet 5 of 6
`
`US 2005/0152265 A1
`
`É
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`Ex.1031 / Page 6 of 18Ex.1031 / Page 6 of 18
`
`TESLA, INC.TESLA, INC.
`
`

`

`Patent Application Publication Jul. 14, 2005 Sheet 6 of 6
`
`US 2005/0152265 A1
`
`
`
`r
`O)
`O
`s
`
`
`Ex.1031 / Page 7 of 18Ex.1031 / Page 7 of 18
`
`TESLA, INC.TESLA, INC.
`
`

`

`US 2005/0152265 A1
`
`Jul. 14, 2005
`
`APPARATUS FOR PRODUCTION OF
`SCRAMBLING CODES AND PREAMBLES
`
`REFERENCE TO RELATED APPLICATIONS
`0001. This application claims the benefit of the priority
`date of German application DE 103 59 268.7, filed on Dec.
`17, 2003, the contents of which are herein incorporated by
`reference in their entirety.
`
`FIELD OF THE INVENTION
`0002 The present invention relates to an apparatus for
`production of Scrambling codes and preambles and, in
`particular, to the production of Scrambling codes for Scram
`bling binary Signals which are transmitted in physical chan
`nels in a mobile radio System, and to the production of
`preambles which are Sent on a physical channel in order to
`control the access to that particular physical channel.
`
`BACKGROUND OF THE INVENTION
`0003. One modern example of a mobile radio system is
`the Universal Mobile Telecommunications System (UMTS).
`The basic architecture of a UMTS mobile radio system has,
`inter alia, mobile stations (User Equipment (UE)) and a
`radio access network (UMTS Terrestrial Radio Access Net
`work (UTRAN)). The radio access network contains devices
`for transmission of data by radio, Such as base Stations
`which, in UMTS mobile radio systems, are referred to as
`node B. The base Stations each Supply a specific area or a
`cell in which mobile stations may be located. The interface
`between a mobile Station and a base Station, which commu
`nicate by radio without the use of wires, is referred to as a
`radio interface (Uu interface).
`0004. The following text includes parts of the technical
`specification 3GPP TS 25.213, V5.4.0 (2003-09), Spreading
`and modulation (FDD) and of the technical specification
`3GPP TS 25.211, V5.5.0 (2003-09), Physical channels and
`mapping of transport channels (FDD), for the 3rd Genera
`tion Partnership Project (3GPP), Technical Specification
`Group Radio Access Network.
`0005. In a UMTS mobile radio system, digital data to be
`transmitted is first of all Subjected to channel coding. The
`digital data is, in the process, provided with redundancy and
`is protected against errors during transmission via a mobile
`radio channel that is Subject to interference, and/or error
`correction is made possible in the respective data receiver.
`The digital data is then distributed between physical chan
`nels by means of a multiple acceSS method, within the
`available transmission bandwidth. Finally, the digital data is
`digitally modulated, in order to be transmitted via a mobile
`radio channel. The mobile radio channel is Subdivided for a
`transmission mode and for a reception mode, by means of a
`duplexing method.
`0006. The multiple access method used in the UMTS
`Standard and in the 3GPP Standard (Third Generation
`Partnership Project) is the code division multiple access
`method (CDMA), in which a bipolar data bit stream to be
`transmitted is multiplied by a Subscriber-specific bipolar
`code Sequence, and/or by a spreading code, and is spread.
`The elements of the spreading code are referred to as chips,
`in order to make it possible to draw a Semantic distinction
`between them and the bits in the data bit Stream. In principle,
`
`chips are nothing more than bits. The multiplication of the
`data bit Stream by the chip Stream results in a bipolar data
`Stream, once again. In general, the rate of the chip Stream is
`a multiple of the rate of the data bit stream, and is governed
`by the length of the Spreading code, which is indicated by a
`spreading factor (SF). The spreading factor corresponds to
`the number of chips per bit. If the chip rate on the radio
`transmission path between transmitters and receiverS is
`constant, the data bit rate that is represented in the chip
`Stream is dependent only on the Spreading factor of the
`respective subscriber-specific spreading code. In the UMTS
`mobile radio System, orthogonal spreading codes with a
`variable spreading factor (OVSF=Orthogonal Variable
`Spreading Factor) are used, in order to make it possible to
`use variable data rates. The data rate may in this case
`fluctuate in a range from 32 kbit/s to 2 Mbit/s.
`0007. The modulation method used in the UMTS mobile
`radio system is four-phase keying (QPSK=Quaternary Phase
`Shift Keying), in which two Successive chips in a chip
`Sequence to be transmitted are in each case combined to
`form a chip pair. A chip pair is in each case mapped on the
`complex plane onto a Symbol in a Symbol Space which is
`covered by a real in-phase branch (I) and an imaginary
`quadrature branch (Q) of the QPSK modulation method,
`with the symbol having four elements. Owing to the four
`value modulation method, two chips are in each case trans
`mitted in each modulation Step. The groSS chip rate is thus
`twice as high as the modulation rate.
`0008. In the case of UMTS mobile radio systems, the
`time-division duplexing method (TDD) or the frequency
`division duplexing method (FDD) may be used to separate
`transmission Signals and received signals in a base Station or
`in a mobile Station, and to Separate the uplink from the
`mobile station to the base station, and the downlink from the
`base station to the mobile station. In the FDD method, the
`Stations each transmit and receive in Separate frequency
`bands. In this case, the transmission band of one Station is
`the reception band of the other Station, and Vice versa.
`0009. The wideband code division multiple access
`method (WCDMA) has been chosen by the ETSI (European
`Telecommunications Standard Institute) as the basis for the
`FDD-UMTS radio interface (Uu interface), allowing opera
`tion at the same data rate in both transmission directions, and
`Symmetrical uplink/downlink operation. According to the
`UMTS Standard, data is transmitted between the base sta
`tions and the mobile Stations in time frames. Each time
`frame in each case has 15 time slots, which each contain
`2560 chips. A time frame lasts for 10 ms, so that a time slot
`has a duration of 666 us, and a chip has a duration of about
`0.2604 us. The chip rate is 38 400 chips per time frame, or
`3.84 Mchips/s.
`0010. The multiple access method is used by all the
`Subscribers in order to apply a fingerprint to their payload
`data by means of a Subscriber-specific spreading code, thus
`allowing the transmitted Signal to be reproduced from the
`sum of the received signals. The bits in the data bit stream
`can be recovered from the received chip Sequence in the
`receiver by repeating the multiplication process. For this
`purpose, the chip Stream is once again multiplied or corre
`lated, in the correct phase, by the same spreading code which
`has already been used in the transmitter, thus resulting in the
`transmitted data bit stream once again.
`
`
`Ex.1031 / Page 8 of 18Ex.1031 / Page 8 of 18
`
`TESLA, INC.TESLA, INC.
`
`

`

`US 2005/0152265 A1
`
`Jul. 14, 2005
`
`Different data bit streams, which originate from
`0.011
`one transmitter and are intended to be transmitted in parallel
`are multiplied by different, orthogonal spreading codes, and
`are then added, in the real in-phase branch and in the
`imaginary quadrature branch in the QPSK modulation
`method. The complex Sum signal is then also Scrambled,
`which is carried out by complex multiplication of the Sum
`Signal, chip-by-chip and based on time frames, by a specific
`complex scrambling code. In the FDD mode in the UMTS
`mobile radio System, the Scrambling code is Station-specific,
`that is to Say each base Station and each mobile Station use
`a different Scrambling code.
`0012. In contrast to the spreading code, the scrambling
`code is not used for band Spreading, but only for Orthogonal
`coding. The Scrambling code thus has a fixed length of
`exactly 38,400 chips, which corresponds precisely to the
`length of one time frame. Each of these time frames is
`multiplicatively coded chip-by-chip by an associated Scram
`bling code. Owing to the QPSK modulation method that is
`used by UMTS mobile radio systems, two bit streams are
`transmitted at the same time, with each bit Stream being
`coded Separately. Two Scrambling codes thus exist in each
`case, a “real” and an "imaginary Scrambling code for the
`in-phase branch and for the quadrature branch, respectively,
`in the QPSK modulation method. 2' long scrambling codes
`each comprising 38,400 chips and 2' short scrambling
`codes each comprising 256 chips also exist.
`0013 FIG. 5 shows a known generator for production of
`long Scrambling codes for the uplink. The chips in the
`Scrambling codes are produced by means of shift registers,
`with 25 Series-connected registers being used in each shift
`register on the uplink. Information is in each case shifted
`from an output of one register to an input of a next register
`by means of a clock signal at 3.84 MHz, which corresponds
`to the chip rate of 3.84 Mchips/s. The registers are fed back
`via modulo-2 adders (MOD2), for example exclusive-OR
`gates (XOR).
`0014) The long Scrambling codes coin and clean are
`formed by position-by-position modulo-2 addition of 38,400
`chip Segments of two binary code Sequences X and y, which
`are produced by means of two polynomials. The X code
`sequence is constructed using a polynomial X+X+1. The
`y code sequence is constructed using a polynomial X+
`X+X+X+1. The resultant code sequences thus form seg
`ments of a set of gold code Sequences. The long Scrambling
`code clan is a version of the long Scrambling code
`C
`which has been shifted through 16,777,232 chips. The
`biliary 24-bit representation of the Scrambling code number
`n is n, n, . . . , no, where no is the least Significant bit
`(LSB) and n is the most significant bit (MSB). The X code
`Sequence depends on the chosen Scrambling code number n,
`and is referred to as X, X(i) and y(i) denote the i-th Symbol
`in the code Sequences X, and y, respectively. The code
`Sequences X, and y are constructed as follows.
`0.015. At the start of the production of the scrambling
`code, the registers are initialized with predetermined bits.
`The initial conditions are:
`
`0016. The following recursive definitions apply to suc
`cessive Symbols:
`
`0017. The binary gold code sequence Z is defined by:
`2,(i)=x,(i)+y(i)modulo 2.i=0, 1, 2, . . . .2-2
`(5)
`0018. The real gold code sequence Z is:
`
`3, (i) =
`
`+1 if : (i) = 0
`()
`-1 if a., (i) = 1
`
`for i = 0, 1, K, 2-2.
`
`(6)
`
`0019) The real long Scrambling codes can and can
`are now defined as follows:
`(7)
`Clone.1.n-Zn(i),i=0, 1, 2, . . . 2’-2; and
`co-Z,(i+16777232)modulo (2-1)), i=0,1,2,.
`(8)
`logg,
`0020. The complex long scrambling code is, finally,
`defined by:
`(9)
`elong...(i)-elong 1.(i)(1+(-1)'elong2.(2Li2),
`0021) where i=0, 1, . . . , 2-2 and LJ represents the
`integer component of the number i?2.
`0022 FIG. 6 shows a known generator for production of
`Short Scrambling codes for the uplink. The short Scrambling
`codes choi,(i) and chart(i) are defined by a code
`Sequence from the family of periodically extended S(2)
`codes. The binary 24-bit representation of the Scrambling
`code number n is n, n-2, ..., no. The n-th quaternary S(2)
`code sequence Z(i), 0=n=16,777.215 is obtained by
`modulo-4 addition (MOD4) of three code sequences, a
`quaternary code sequence a(i) and two binary code
`Sequences b(i) and d(i), with the initialization of the three
`code Sequences being defined from the Scrambling code
`number n. The code sequence Z(i) whose length is 255 is
`produced using the following relationship:
`
`0023 with the quaternary code Sequence a(i) being pro
`duced recursively by means of the polynomial
`
`0024 the binary code sequence b(i) being produced
`recursively by the polynomial
`
`b(i)=ns modulo 2,i=0, 1, . . . , 7.
`
`(12)
`,254;
`0025 and the binary code sequence d(i) being produced
`recursively by the polynomial
`
`
`Ex.1031 / Page 9 of 18Ex.1031 / Page 9 of 18
`
`TESLA, INC.TESLA, INC.
`
`

`

`US 2005/0152265 A1
`
`Jul. 14, 2005
`
`0026. The code sequence Z(i) is extended to a length of
`256 chips, by Setting Z(255)=Z(O). The mapping of Z(i)
`onto the real binary short Scrambling codes cho(i) and
`c.(i), where i=0, 1,..., 255 is shown in the following
`Table 1.
`
`TABLE 1.
`
`Cshort,1,n(i)
`+1
`-1
`-1
`+1
`
`Cshort 2n(i)
`+1
`+1
`-1
`-1
`
`Zn(i)
`O
`1.
`2
`3
`
`0027) The complex short Scrambling code cit is
`defined by:
`Cshort(i)=cshortin (i mod 256)(1+(-1)'eshort.2(2L(i
`(14)
`mod 256)/2))
`0028 where i=0,1,2,... and is the integer component
`of the number (imod 256)/2.
`0029 Information is transmitted in the uplink from the
`mobile stations via a radio link to the base stations. The
`information from various mobile Stations is coded using the
`CDMA multiple access method and transmitted via a com
`mon frequency channel or radio channel to those base
`Stations that are in radio contact with the mobile Stations in
`physical channels that are combined to form a radio signal.
`In the FDD mode a physical channel is defined by the
`spreading code and by the frequency channel. On the FDD
`uplink, the physical channels are also distinguished by the
`phase angle of the carrier Signal. Physical channels thus use
`either a cosine or Sine oscillation as the carrier Signal. This
`is achieved by transmitting a different physical channel Via
`the realin-phase branch (I) of the QPSK modulation method
`than via the imaginary quadrature branch.
`0.030. A distinction is in general drawn between so-called
`dedicated physical channels and common physical channels.
`A dedicated physical channel is used exclusively by one
`link, and is reassigned when Setting up a connection and,
`possibly, during the connection. Common physical channels
`are used simultaneously or alternately by a number of linkS.
`0031) Physical channels in the FDD mode are, for
`example, the dedicated physical data channel (DPDCH), the
`dedicated physical control channel (DPCCH), the physical
`random access channel (PRACH) and the physical common
`packet channel (PCPCH). In addition to the physical chan
`nels, indicator channels also exist in the FDD mode. These
`are single-bit or two-bit messages, which are spread by
`means of a spreading code and are transmitted at a specific
`time. An indicator channel is characterized by the Spreading
`code, the frequency channel and the time. Indicator channels
`are used for notification and for indication of Specific events.
`One example of an indicator channel is the acquisition
`indication channel (AICH).
`0032) The dedicated physical data channel DPDCH
`exists only on the uplink, and is used for transmission of
`coded and interleaved payload and Signalling data from
`higher layers of the UTRA protocol stack. One DPDCH, or
`two or more in parallel, may be used for transmission. If two
`or more DPDCHs are used in parallel, all of the DPDCHs
`must have the same spreading factor, and a maximum of Six
`
`DPDCHs can be transmitted in parallel. In this case, the
`DPDCHs are distributed as uniformly as possible between
`the in-phase and quadrature branches of the QPSK modu
`lation method.
`0033. The dedicated physical control channel DPCCH is
`a physical channel for controlling the data transmission
`between partner instances of the physical layer of the UTRA
`protocol stack for the uplink. Only information for the
`physical layer, for example power control commands, trans
`port format indicators or pilot bits, is transmitted via this
`link. One and only one DPCCH is associated with each
`layer-1 connection.
`0034. The physical random access channel PRACH is
`used for random access, and exists only on the uplink. The
`PRACH is used to transmit messages for the random access
`transport channel (RACH) for the UTRA protocol stack. The
`RACH may in this case be used both for setting up a call and
`for transmission of Small data packets. One typical opera
`tional use for the PRACH is, for example, the request for
`radio resources in a mobile radio System when a mobile
`Station is Setting up a telephone call. Since all of the mobile
`stations in a cell use the PRACH jointly in order to signal to
`the mobile radio System that radio resources are required, a
`Specific method must be used to ensure that collisions do not
`occur between different mobile Stations when accessing the
`PRACH. The method which ensures this is the slotted
`ALOHA method. Random accesses to the PRACH may take
`place at defined times, in access time slots. An access time
`slot corresponds to the duration of 5120 chips, that is to say
`an access time Slot is twice as long as a normal time slot,
`Such as that for a DPDCH. Fifteen access time slots exist
`within 20 ms and each define one access channel. The
`random access is Subdivided into a competition phase and a
`transmission phase. In the competition phase, the mobile
`stations use the slotted ALOHA method to access the
`PRACH within an access time slot by transmission of a
`PRACH preamble. In the transmission phase, a PRACH
`message part is then transmitted.
`0035) The common physical packet channel PCPCH is,
`finally, used for transmission of data packets of the common
`packet transport channel (CPCH) in the UTRA protocol
`Stack in accordance with a carrier Sense multiple access
`method with collision detection (CSMA/CD). Analogously
`to the physical random access channel PRACH, the mobile
`station can start transmission in the PCPCH in specific
`access time slots. The access time slot in which the mobile
`Station may transmit depends on the current System frame
`number (SFN).
`0036) The scrambling code for scrambling the physical
`channels DPCCH/DPDCH on the uplink may be either a
`long or a short Scrambling code. When the Scrambling code
`is produced, different code Sequences that form a component
`of the Scrambling code are used for the long and the short
`Scrambling code, as defined in the following text. The n-th
`uplink scrambling code for the physical channels DPCCH/
`DPDCH, which is referred to as Sei, is defined as
`(15)
`Sapchn(i)=Ciongn(i),i=0,1, . . . .38,399;
`0037 when long scrambling codes are used, and is
`defined as
`(16)
`Sapchn(i)=Cshortn(i), i=0,1, . . . .38,399;
`0038 when short scrambling codes are used. The lowest
`index i in each case corresponds to the chip that is trans
`mitted first in time.
`
`
`Ex.1031 / Page 10 of 18Ex.1031 / Page 10 of 18
`
`TESLA, INC.TESLA, INC.
`
`

`

`US 2005/0152265 A1
`
`Jul. 14, 2005
`
`0039. In order to scramble the physical channel PRACH,
`Scrambling codes must be produced for Scrambling the
`PRACH message parts and the PRACH preambles in the
`PRACH. The scrambling code that is used for the message
`part of the physical channel PRACH is 10 ms long, and there
`are 8192 different defined PRACH message scrambling
`codes. The n-th PRACH message part Scrambling code,
`which is referred to as S., where n=0, 1,...,8191, is
`based on the long Scrambling code, and is defined as:
`(17)
`S. s.(i)=cos(i+4096).j=0,1, . . . .38,399;
`0040 where the lowest index i corresponds to the chip
`which is transmitted first in time. The PRACH message part
`Scrambling code corresponds to a Scrambling code that is
`used for the PRACH preamble, or to a PRACH preamble
`Scrambling code. The same Scrambling code number is used
`for both scrambling codes for a PRACH, that is to say if the
`PRACH preamble scrambling code is S.
`then the
`ren?
`PRACH message part Scrambling code is S., with the
`Scrambling code number n being the Same for both Scram
`bling codes.
`is a complex
`0041) The PRACH preamble C
`sequence formed from the PRACH preamble scrambling
`code S., and a PRACH preamble signature C
`sigs S
`follows:
`
`i = 0, 1,2,3,..., 4095;
`
`0.042 where i=0 corresponds to the chip which is trans
`mitted first in time.
`0043. The PRACH preamble scrambling code is formed
`from the long scrambling code. There are a total of 8.192
`PRACH preamble scrambling codes. The n-th PRACH
`preamble Scrambling code, n=0, 1, . . . .8.191, is defined as:
`Spren(i)=Consin(i), i=0,1, . . . .4095.
`(19)
`0044) The PRACH preamble signature comprises 256
`repetitions of a signature P(n), with a length of 16 chips,
`where n=0 . . . 15. This is defined as follows:
`(20)
`cis(i)=P(i modulo 16).i=0,1, . . . .4095.
`004.5 The signature P(n) with the signature number s
`originates from a Set of 16 Hadamard codes of length 16.
`There are therefore 16 different PRACH preambles, each
`having 4096 chips, for each access time slot, So that 16
`parallel access channels are available for each access time
`slot, by means of which mobile Stations can gain acceSS
`without any collisions.
`0046. A mobile station that wishes to access the PRACH
`chooses an available access time slot, and then one of the 16
`PRACH preambles. The PRACH preamble is then transmit
`ted with a low transmission power, and the Station waits for
`an acknowledgement, which is received via the indicator
`channel AICH. If no acknowledgement is received from the
`base Station, or the mobile Station receives a negative
`acknowledgement, then it chooses a new access time slot
`and a new PRACH preamble, and transmits this with a
`Somewhat higher transmission power. This process is
`repeated until a maximum number of attempts is reached
`without a positive acknowledgement having been received.
`
`When a Successful competition phase occurs, that is to Say
`there is a positive acknowledgement, the mobile Station
`transmits its PRACH message with a delay of three or four
`time slots. The PRACH message bits are transmitted via the
`real in-phase branch (I) of the QPSK modulation method.
`0047 A PCPCH access transmission has one or more
`PCPCH access preambles with 4096 chips, a PCPCH col
`lision detection preamble with 4096 chips, a PCPCH power
`control preamble with a length of either 0 or 8 time slots, and
`a PCPCH message part of variable length, of NX10 ms. The
`set of scrambling codes which is used for the PCPCH
`message part has a length of 10 ms, is cell-specific, and each
`PCPCH message part scrambling code corresponds to the
`Signature and to the access channel element which is used by
`the PCPCH access preamble. Both long and short scram
`bling codes may be used in order to scramble the PCPCH
`message part. There are 64 Scrambling codes on the uplink,
`which are defined per cell, and there are 32,768 different
`PCPCH scrambling codes, which are defined in the system.
`0048 When the long scrambling codes are used, the n-th
`PCPCH message part scrambling code which is referred to
`as S
`where n=8192,8193,...,40,959 is based on the
`long Scrambling code, and is defined as:
`(21)
`Sc-msgn(i)=Clonen(i), i=0,1, . . . .38,399.
`0049. When the short scrambling codes are used, the n-th
`PCPCH message part scrambling code, which is referred to
`as S
`where n=8192,8193, ... 40,959 is based on the
`Short Scrambling code, and is defined as:
`(22)
`Sensgn(i)=Cshorn(i),i=0,1, . . . .38,399.
`0050. The lowest index i corresponds to the chip which is
`transmitted first in time.
`0051) The scrambling code for the PCPCH power control
`preamble is the same as the PCPCH message part scram
`bling code. The phase of the Scrambling code is chosen Such
`that the end of the code is aligned with the time frame
`boundary at the end of the PCPCH power control preamble.
`0052) The PCPCH access preambles C.
`C CO
`plex Sequences, in a similar way to the PRACH preambles.
`The PCPCH access preambles are formed from PCPCH
`preamble Scrambling codes S
`and from a PCPCH
`preamble signature C,
`as follows:
`
`c-acc.n
`
`C-acc.(i) = S-acc.(i)x C.(i)xes",
`i = 0, 1,2,3,..., 4095.
`
`(23)
`
`0053) The PCPCH access preamble scrambling code is
`formed from the long Scrambling codes. There are a total
`40,960 PCPCH access preamble scrambling codes. The n-th
`PCPCH access preamble scrambling code, where n=0 ...,
`40,959, is defined as:
`(24)
`Scaccin(i)=Clongin(i),i=0,1, . . . .4095.
`0054) The PCPCH access preamble uses the same 16
`signatures as those for the PRACH, although a smaller
`number of defined code Sequences can be used for the
`PCPCH than for the PRACH. The PCPCH access preamble
`scrambling code may also be the same as the PRACH
`preamble Scrambling code.
`
`
`Ex.1031 / Page 11 of 18Ex.1031 / Page 11 of 18
`
`TESLA, INC.TESLA, INC.
`
`

`

`US 2005/0152265 A1
`
`Jul. 14, 2005
`
`0055. A mobile station that wishes to access the PCPCH
`first of all uses the access time slots to transmit the PCPCH
`access preambles before transmitting the actual messages.
`As already described for the PRACH, these PCPCH access
`preambles are transmitted with an increasing power level
`until an acknowledgement is received via the AICH from the
`base Station.
`0056. In UMTS mobile radio systems, the base stations
`(node B) each Supply one or more cells in which mobile
`Stations may be located. The base Stations proceSS received
`radio Signals from the mobile Stations located in their cells,
`and the mobile Stations process radio signals from the
`Surrounding base Stations. This processing comprises, inter
`alia, error correction via the channel coding, spreading and
`despreading in accordance with the CDMA multiple acceSS
`method, Scrambling as well as modulation and demodulation
`based on the QPSK modulation method. The base stations
`and the mobile stations in the UMTS mobile radio system
`for this purpose each have dedicated data processing devices
`and at least one central data processing device. The dedi
`cated data processing devices are connected to one another
`and are connected to the central data processing device Such
`that they can interchange data.
`0057 The central data processing device, the dedicated
`data processing devices etc. are normally provided on a
`baseband chip. In the case of the base Stations and the mobile
`stations in the UMTS mobile radio system, by way of
`example, the central data processing device is a digital signal
`processor (DSP) in order to carry out the complex calcula
`tion functions in a communication protocol. The DSP pro
`grams the dedicated data processing devices to carry out
`specific defined functions with the aid of internal locally
`available registers or memories, which are provided for
`Storage of parameters. The dedicated data processing
`devices, for example in the case of the UMTS mobile radio
`System, have a RAKE receiver, a Search apparatus or a
`Searcher, a channel decoder and a transmission part. A
`transmission (TX) modulator is a central block in a trans
`mission part of a UMTS mobile station. The transmission
`modulator is used to produce the OVSF spreading codes and
`Scrambling codes, for Spreading and Scrambling of Signals
`on different physical channels, and for processing of the
`Spread Signals. The transmission modulator processes not
`only the dedicated physical data channels DPDCH but also
`the dedicated physical control channels DPCCH, and pro
`duces the Scrambling codes for the physical channels
`PRACH and PCPCH.
`for the dedicated
`0058) The scrambling code Sale
`physical data channel DPDCH and for the dedicated physi
`cal control channel DPCCH are normally produced using
`equations 15 and 16, and the preambles C. and C
`for the physical random access channel PRACH and for the
`common physical packet channel PCPCH are produced
`using equations 18 and 23, in Separate devices in the
`baseband chip of a mobile station. The preambles are
`produced as a function of the respective signature C.
`using equation 20, in the digital signal processor DSP itself,
`and are then transmitted to the transmission modulator.
`0059) One disadvantage of the production of the scram
`bling codes and of the preambles in Separate devices is that,
`although this is associated with greater independence for the
`control of the devices, the complexity, for example with
`
`regard to the amount of chip area consumed on a baseband
`chip, is, however, also greater.
`0060 A further disadvantage of the production of the
`Scrambling codes and of the preambles in Separate devices
`is that the production of the Signature and of the preamble in
`the DSP and their transmission to the transmission modul
`lator by means of an additional data transmission are asso
`ciated with corresponding complexity in terms of power and
`control.
`
`SUMMARY OF THE INVENTION
`0061 The following presents a simplified summary in
`order to provide a basic understanding of one or more
`aspects of the invention. This Summary is not an extensive
`overview of the invention, and is neither intended to identify
`key or critical elements of the invention, nor to delineate the
`Scope thereof. Rather, the primary purpose of the Summary
`is to present Some concepts of the invention in a simplified
`form as a prelude to the more detailed description that is
`presented later.
`0062) The present invention is directed to an apparatus
`for production of Scrambling codes and preambles that is
`leSS complex than the prior art and reduces the amount of
`data to be transmitted between a digital Signal processor and
`a transmission modulator.
`0063. The idea on which the present invention is based
`includes an appreciation by the inventor that the equations
`15, 16, 17, 21 and 22 for the short and long scrambling codes
`are the same for the physical channels DPDCH, DPCCH,
`PRACH and PCPCH and that the PRACH message part
`Scrambling code from equation 17 can be derived from the
`Scrambling code from the other physical channels by Shift
`ing through 4096 chips, and that the PRACH preamble
`scrambling code based on equation 19 and the PCPCH
`preamble Scrambling code based on equation 24 can be
`derived directly from the real part of the long Scrambling
`code Conn based on equation 9.
`0064. Therefore according to the present invention the
`scrambling codes for the physical channels DPDCH,
`DPCCH, PRACH and PCPCH and the preambles for the
`physical channels PRACH and PCPCH are produced and
`processed in a single common apparatus, for example one
`hardware block, and thus the basic Scrambling code need
`only be shifted through 4096 chips for the physical channel
`PRACH.
`0065. The invention is directed to an apparatus for pro
`duction of Scrambling codes that are used for Scrambling
`binary signals which are transmitted