plink long scrambling sequence generator. 4.3.5.2 Short Scrambling Sequence The short scrambling sequences Cshort,1,n(i) and Cshort,2,n(i) originate from a family se- quence of periodically extended S(2) codes, where N23N22 = 24 bit binary represen- tation of the code number N. We obtain the nth quaternary S(2) sequence Zn(i), 1677721 by modulo 4 addition of three sequences, a quaternary sequence a(i) and two binary sequences b(i) and d(i), where the initial loading of the three sequences comes from the code number N. The sequence Zn(i) of length 255 results from the following relation: (i)=a(i)+2b(i)+2d(i)mod = 4, i=0,1,...,254, (4.13) where we obtain the quaternary sequence a(i) recursively through the polynomial go(x)= x8+x5+3xx2+2x+1as a(0)=2n,+1 mod 4, (4.14) a(i) = 2n mod 4, i=1,2,...,7, (4.15) a(i)=3a(i-3)+a(i-5)+3a(i-6)+2a(i-7)+3a(i-8) = mod 4, i=8,9,...,254, (4.16) and the binary sequence b(i) comes also recursively from the polynomial g1(x)= b(i)=ng,mod 2,i0,1,..,7, (4.17) b(i)=b(i-1)+b(i-3)+b(i-7)+b(i-8): mod 2, i=8,9,...,254, (4.18) and the binary sequence d(i) is again generated recursively by the polynomial g2(x)= x8+x7+x5+x4+1as The UMTS Network and Radio Access Technology d(i)=m6ti mod 2, i=0,1,...,7, (4.19) d(i)=d(i-1)+d(i-3)+d(i-4)+d(i-8) = - mod 2, i=8,9,...,254. (4.20) We extend the sequence Zn(i) to length 256 chips by setting Zn(255) = Zn(0). Table 4.13 defines the mapping from Zn(i) to the real-valued binary sequences Cshort,1,n(i) and Cstont2,(i),i=0,1,...255. Table 4.13 Mapping from Zn(i) to chort,1,n(i) and Cshort,2,n(i), =0,1,,,,,255 Zn(i) Cshort,1,n(i) Cshort,2,n(i) Finally, we define the complex-valued short scrambling sequence Cshort,n' as: Cshort,n (4.21) Figure 4.14 illustrates an implementation of the short scrambling sequence generator for the 255 chip sequence extension by one chip. mod 2 Cshort,1,n(i) z,(i) Mapper Cshort,2.n (i) mod 4 mod 2 mod n addition multiplication mod 4 Figure 4.14255 chip sequence uplink short scrambling sequence generator. 4.3.5.3 Scrambling Codes in Up