Cryptography – Communication system using cryptography – Pseudo-random sequence scrambling
Reexamination Certificate
2003-03-07
2008-10-14
Vu, Kimyen (Department: 2135)
Cryptography
Communication system using cryptography
Pseudo-random sequence scrambling
C380S270000
Reexamination Certificate
active
07436963
ABSTRACT:
To generate the main scrambling code of order N and the secondary scrambling code of order K within the set identified by the primary scrambling code of order N, a first m-sequence and a second m-sequence are generated using Fibonacci linear feedback shift registers. The first m-sequence and the second m-sequence are modulo-2 added to form the I branch of the primary scrambling code. A first T-bit masking word and a second T-bit masking word of rank0are generated that correspond to the polynomial time shifts, and the intermediate taps of the X and y registers respectively chosen by the masking words are modulo-2 added so as to generate a third sequence and a fourth sequence, which are modulo-2 added together to form the Q branch of the primary scrambling code. Starting from the least significant Kmax bits of the register X, of the K-th intermediate tap corresponding to the secondary scrambling code of order K within the set identified by the primary scrambling code of order N, a fifth sequence is generated, which, modulo-2 added to the second sequence, forms the I branch of the secondary scrambling code. By modulo-2 summing the intermediate taps of the register X masked by the first masking word of rank N, a sixth sequence is generated, which, modulo-2 added to the fourth sequence, forms the Q branch of the secondary scrambling code.
REFERENCES:
patent: 5926070 (1999-07-01), Barron et al.
patent: 5943361 (1999-08-01), Gilhousen et al.
patent: 6141374 (2000-10-01), Burns
patent: 6445714 (2002-09-01), d'Anjou et al.
patent: 6459883 (2002-10-01), Subramanian et al.
patent: 6567017 (2003-05-01), Medlock et al.
patent: 2002/0011940 (2002-01-01), Cappel
patent: 0963070 (1999-12-01), None
patent: 01/05079 (2001-01-01), None
Universal Mobile Telecommunications Systems (UMTS) Spreading and Modulation (FDD) (3G TS 25.213 Version 3.2.0 Release 1999), ETSI TS 125 213 V3.2.0, Mar. 2000, pp. 1-27, XP002203809.
Linear Feedback Shift Registers, May 19, 2001, XP002211559, Retrieved from the Internet: http://www.amug.org/ahmrphd/LFSR.htm1, retrieved on Aug. 28, 2002.
Universal Mobile Telecommunications Systems (UMTS) Spreading and Modulation (FDD) (3G TS 25.213 Version 3.2.0 Release 1999), ETSI TS 125 213 V3.2.0, Mar. 2000, pp. 1-27, XP002203809.
Linear Feedback Shift Registers, May 19, 2001, XP002211559, Retrieved from the Internet: http://www.amug.org/ahmrphd/LFSR.htm1, retrieved on Aug. 28, 2002.
Avellone Giuseppe
Galluzzo Agostino
Iacono Daniele Lo
Messina Ettore
Allen Dyer Doppelt Milbrath & Gilchrist
Jorgenson Lisa K.
Pan Joseph
STMicroelectronics S.r.L.
Vu Kimyen
LandOfFree
Process for generating codes for CDMA communications, system... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Process for generating codes for CDMA communications, system..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Process for generating codes for CDMA communications, system... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-4004395