IP Library Granted Patent US 8,559,480
Granted Patent B2
US 8,559,480 · App. 13/143,688 · Granted Oct 15, 2013

Apparatus and method for generating scrambling codes in a radio communication system

View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 8,559,480
App. No.
13/143,688
Granted
Oct 15, 2013
Kind
B2
Abstract

An apparatus and method for generating a scrambling code in a radio communication system is disclosed. In particular, an apparatus and method for generating a scrambling code using a Gold-like sequence even when m is a multiple of 4 for a length 2 m −1 of a pseudo-random sequence is disclosed. Two LFSRs (LFSR a and LFSR a′) for generating the Gold-like sequence by two different polynomials of degree m are included. The LFSR a′ is constructed by a reciprocal primitive polynomial of the primitive polynomial of degree m over GF(2) used to construct the LFSR a. In order to generate 2 m different scrambling codes, one fixed initial value is input to the LFSR a and different initial values of m bits are input to the LFSR a′ according to system-specific information.

Claims (28)

1. An apparatus to generate a scrambling code in a radio communication system, the apparatus comprising:

a first linear feedback shift register (LFSR) comprising m blocks and constructed by a primitive polynomial of degree m over Galois Field of two (GF(2));

a second LFSR comprising m blocks and constructed by a reciprocal primitive polynomial of the primitive polynomial of degree m;

a first initial value mapper configured to input a fixed initial value to the first LFSR at every initialization period;

a second initial value mapper configured to selectively input one of different initial values of m bits to the second LFSR at every initialization period;

a controller configured to control the second initial value mapper based on a total sum of information bits, the total sum being between 1 and m bits, of system-specific information and to control one of the different initial values of m bits to be input to the second LFSR; and

a modulo 2 operator configured to add an output sequence from the first LFSR and an output sequence from the second LFSR bit by bit by a modulo 2 operation,

wherein m is an integer number greater than 0.

2. The apparatus according to claim 1 , wherein the initialization period is at least one of a subframe period, a radio frame period, an orthogonal frequency division multiplexing (OFDM) symbol period and a code block period in each physical signal or physical channel of uplink or downlink.

3. The apparatus according to claim 1 , wherein the system-specific information includes information regarding at least one of a user equipment (UE) ID, a cell ID, a subframe number, a stream ID, a multimedia broadcast multicast service (MBMS) over single frequency network (MBSFN) area ID, an OFDM symbol number in each physical signal or physical channel of uplink or downlink.

4. The apparatus according to claim 1 , wherein the fixed initial value input to the first LFSR is at least one of a value <0, 0, 0, . . . , 0, 0, 1> or <1, 0, 0, . . . , 0, 0, 0> having a length of m.

5. The apparatus according to claim 1 , wherein one of the different initial values of m bits input to the second LFSR is one of elements of a subset of a set A in which the number of elements is M, for M of 0<M≦2 m which is set based on the set A having a total of 2 m different initial values <0, 0, 0, . . . , 0, 0, 0> to <1, 1, 1, . . . , 1, 1, 1> having a length of m as elements and the number of cases of system-specific information distributed to the second LFSR by the controller.

6. The apparatus according to claim 1 , wherein m is 32.

7. The apparatus according to claim 1 , wherein the first LFSR and the second LFSR are constructed by two different polynomials of degree m for generating a Gold-like sequence.

8. A method for generating a scrambling code in a radio communication system, the method comprising:

constructing a first linear feedback shift register (LFSR) comprising m blocks according to a primitive polynomial of degree m over Galois Field of two (GF(2));

constructing a second LFSR comprising m blocks according to a reciprocal primitive polynomial of the primitive polynomial of degree m;

inputting a fixed initial value to the first LFSR at every initialization period so as to generate a first output sequence;

selecting and inputting one of different initial values of m bits to the second LFSR at every initialization period so as to generate a second output sequence; and

adding the first output sequence and the second output sequence bit by bit by a modulo 2 operation,

wherein m is an integer number greater than 0.

9. The method according to claim 8 , wherein the initialization period is at least one of a subframe period, a radio frame period, an orthogonal frequency division multiplexing (OFDM) symbol period and a code block period in each physical signal or physical channel of uplink or downlink.

10. The method according to claim 8 , wherein the generating the second output sequence includes controlling and generating the different initial values of the m bits input to the second LFSR based on a total sum of information bits, the total sum being between 1 and m bits, of system-specific information.

11. The method according to claim 10 , wherein the system-specific information includes information regarding at least one of a user equipment (UE) ID, a cell ID, a subframe number, a stream ID, a multimedia broadcast multicast service (MBMS) over single frequency network (MBSFN) area ID, an OFDM symbol number in each physical signal or physical channel of uplink or downlink.

12. The method according to claim 8 , wherein the fixed initial value input to the first LFSR is at least one of a value <0, 0, 0, . . . , 0, 0, 1> or <1, 0, 0, . . . , 0, 0, 0> having a length of m.

13. The method according to claim 8 , wherein one of the different initial values of m bits input to the second LFSR is one of elements of a subset of a set A in which the number of elements is M, for M of 0<M≦2 m which is set based on the set A having a total of 2 m different initial values <0, 0, 0, . . . , 0, 0, 0> to <1, 1, 1, . . . , 1, 1, 1> having a length of m as elements and the number of cases of system-specific information distributed to the second LFSR by the controller.

14. The method according to claim 8 , wherein m is 32.

15. The method according to claim 8 , wherein the constructing the first LFSR and the second LFSR includes generating two different polynomials of degree m using a Gold-like sequence.

Assignments (6)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded May 13, 2020
From: GOLDPEAK INNOVATIONS INC
To: PANTECH CORPORATION
Reel/Frame 052657/0066 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Mar 27, 2017
From: PANTECH INC
To: GOLDPEAK INNOVATIONS INC
Reel/Frame 041751/0642 →
CORRECTIVE ASSIGNMENT TO CORRECT THE REMOVAL OF PATENTS 09897290, 10824929, 11249232, 11966263 PREVIOUSLY RECORDED AT REEL: 040654 FRAME: 0749. ASSIGNOR(S) HEREBY CONFIRMS THE MERGER. Recorded Jan 18, 2017
From: PANTECH CO., LTD.
To: PANTECH INC.
Reel/Frame 041413/0799 →
CORRECTIVE ASSIGNMENT TO CORRECT THE PATENT APPLICATION NUMBER 10221139 PREVIOUSLY RECORDED ON REEL 040005 FRAME 0257. ASSIGNOR(S) HEREBY CONFIRMS THE PATENT APPLICATION NUMBER 10221139 SHOULD NOT HAVE BEEN INCLUED IN THIS RECORDAL. Recorded Nov 7, 2016
From: PANTECH CO., LTD.
To: PANTECH INC.
Reel/Frame 040654/0749 →
DE-MERGER Recorded Sep 13, 2016
From: PANTECH CO., LTD.
To: PANTECH INC.
Reel/Frame 040005/0257 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jul 8, 2011
From: YOON, SUNG JUN; SUH, SUNG JIN; JUNG, MYUNG CHEUL
To: PANTECH CO., LTD.
Reel/Frame 026559/0939 →