WCDMA3G UpLkScrambler

WCDMA3G_UpLkScrambler

Description: Uplink scrambling code generator
Library: 3GPPFDD 10-99, Spreading & Modulation
Class: SDFWCDMA3G_UpLkScrambler

Parameters

Pin Outputs

Notes/Equations

1. This model is used to generate uplink transmission scrambling codes. The index of this sequence is also conveyed. Each firing, a cycle of tokens is produced in out and one is produced in INDEX.
2. The scrambling codes are divided into short and long codes. Uplink channels use long or short code. Both scrambling code sequences are constructed by combining two real sequences into a complex sequence. The long code cycle is 38400, the short code cycle is 256.
3. Scrambling codes are formed as follows.

   

   where

   w 0 and w 1 are chip rate sequences defined as repetitions of
   w 0={1 1}, w 1={1−1}.
   c 1 is a real chip rate code
   c 2' is a decimated version with a decimation factor2 of real chip rate code c₂

   In a long scrambling code, the c 1 and c 2 sequences are constructed as the modulo 2 sum of 38400 chip segments of two binary m-sequences generated by two 25-degree generator polynomials.
   The primitive polynomial for x sequence is .
   The primitive polynomial for y sequence is .
   The long code sequence generator configuration is shown in the following figure.
   The initial value of shift register 1 is the index binary, while the initial values of shift register 2 are all −1. Because the uplink scrambling code is defined as a cycle of 38400 [1]; the shortened Gold sequence generator exports chips in a 38400 radio frame duration and phase 0 to 38400 radio frames are repeated. The sequence phase is shifted by an amount 16777232 between c 1 and c 2.
   
   

   Uplink Long Scrambling Code Generator

   In a short scrambling code, codes lengths of 256 chips are obtained by one chip periodic extension of 255 sequences; the first and last chips of any uplink short scrambling code are the same. The 255-length sequence is obtained by modulo 4 addition of three sequences:

   n = 0, 1, 2, ..., 254

   Sequences a(n), b(n) and c(n) are constructed by the recursive generator defined by the polynomial g 0 (x), g 1 (x) and g 2 (x).

   
   
   

   The short code sequence generator configuration is shown in the following figure.
   Sequence z v (n) is mapped to a complex sequence S v (n) by the mapping function given in the following table. Re{S_v (n)} and Im{S_v (n)} are binary sequences c 1 and c 2.

   z_v(n) and S_v(n) Mapping

   z v (n)	S v (n)
   0	+1+1j
   1	-1+1j
   2	-1-1j
   3	+1-1j

   The initial states for the G 1 and G 2 are the two 8-bit words representing index s and t in the 24-bit binary representation of scrambling code index v. The initial state of G 0 is obtained after the transformation of 8-bit word representing index r . The transformation is:

   ,
   , n=1, ..., 7.

   
   

   Uplink Short Scrambling Code Generator

   The initial states of three generators are shown in the following figure.
   
   

   Uplink Short Scrambling Code Generator

   State Initialization

References

1. 3GPP Technical Specification, TS 25.213, V3.0.0, "Spreading and modulation (FDD)," October 1999.