# US 2010/0135493 A1 · Method and apparatus for generating pseudo random sequence in broadband wireless communication system

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2010/0135493 A1
- Document ID: US20100135493A1
- Status: Published application
- Kind: A1
- Application number: 12/629,570
- Filed: 2009-12-02
- Published: 2010-06-03
- Earliest claimed: 2008-12-02
- Assignees: Pantech Co., Ltd.; Pantech&Curitel Communication, Inc.
- Inventors: Sung Jun Yoon; Sung Jin Suh; Myung Cheul Jung
- Web page: https://patentgrep.com/patent/US20100135493A1

## CPC

- H04L 9/0662: {with particular pseudorandom sequence generator}
- G06F 7/584: {using finite field arithmetic, e.g. using a linear feedback shift register}
- H04L 2209/34: Encoding or coding, e.g. Huffman coding or error correction
- H04L 2209/80: Wireless
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)

## Abstract

Provided are a method and an apparatus for generating pseudo random sequence to generate pseudo random sequences which have larger sizes and are different from each other in a wireless communication system; a method for generating pseudo random sequence in a wireless communication system, comprising generating a first output sequence, generating a second output sequence, and generating a third output sequence; and an apparatus to generate pseudo random sequence in a wireless communication system, comprising a first linear feedback shift register (LFSR), a second LSFR, and a third LFSR, a first initial value mapper, a second initial value mapper, a third initial value mapper, and an N delay operator.

## Claims

### Claim 1

A method for generating pseudo random sequence in a wireless communication system, comprising:
generating a first output sequence by inputting a fixed initial value to a first linear feedback shift register (LFSR) having m blocks at every initialization period;
generating a second output sequence by inputting one of m-bit initial values to a second LFSR having m blocks at every initialization period;
after inputting a predetermined initial value to a third LFSR having m blocks, generating a third output sequence by delaying a sequence output from the third LFSR by a given delay value N, at every initialization period; and
generating the pseudo random sequence by summing the first output sequence, the second output sequence and the third output sequence bit by bit through a modulo 2 operation.

### Claim 2 (depends on 1)

The method of claim 1, further comprising constructing the first LFSR, the second LFSR, and the third LFSR, each of which has m blocks, by three different polynomials of degree m; and
wherein the constructing of the first LFSR, the second LFSR, and the third LFSR comprises:
selecting a first polynomial of degree m, and constructing the first LFSR by the first polynomial;
determining a second polynomial of degree m by sampling a binary sequence generated by the first polynomial with a sampler f=1+2└(m+2)/2┘, and constructing the second LFSR by the second polynomial; and
determining a third polynomial of degree m by sampling a binary sequence generated by the first polynomial with a sampler f=1+2m/2, and constructing the third LFSR by the third polynomial.

### Claim 3 (depends on 2)

The method of claim 2, wherein the three different polynomials of degree m are generated by Large sets of Kasami sequence of degree m.

### Claim 4 (depends on 2)

The method of claim 2, wherein the first polynomial of degree m is one having the smallest number of terms among plural primitive polynomials of degree m over GF(2), and the binary sequence generated by the first polynomial is an m-sequence.

### Claim 5 (depends on 1)

The method of claim 1, wherein the m-bit initial values input to the second LFSR are distributed on the basis of some information of which the sum of total information bits is between 1 and m bits among specific system information, and
the delay values given for the sequence output from the third LFSR are distributed on the basis of remaining information of which the sum of total information bits is between 0 and m/2 bits among the specific system information.

### Claim 6 (depends on 5)

The method of claim 5, wherein the specific system information comprises information on any one of a user equipment identification (UE ID), a cell ID, a cell group ID, a component carrier (CC) ID, a component carrier (CC) offset, a relay node ID, a Home node B (HeNB) ID, a system frame number, a subframe number, a slot number, an Orthogonal Frequency Division Multiplexing (OFDM) symbol number, a stream ID, and a Multimedia Broadcast and Multicast Service (MBMS) over Single-Frequency Network (MBSFN) area ID, per each physical channel or each physical signal of an uplink or an downlink.

### Claim 7 (depends on 1)

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

### Claim 8 (depends on 1)

The method of claim 1, the one of m-bit initial values input to the second LFSR is one of elements of subset of the set A, which have M elements, and
wherein the set A has total 2m different m-bit initial values, and M (0<M≦2m) is determined on the basis of the number of cases of specific system information distributed to the second LFSR.

### Claim 9 (depends on 1)

The method of claim 1, wherein the predetermined initial value input to the third LFSR is constructed with first m bits of a sequence obtained by sampling a binary sequence output from the first LFSR with a sampler f=1+2m/2.

### Claim 10 (depends on 1)

The method of claim 1, the delay value N is one of total M′ different delay values from 0 to M′−1, and
wherein M′ (0≦M′≦2m/2) is determined on the basis of the number of cases of the specific system information distributed to the third LFSR.

### Claim 11 (depends on 1)

The method of claim 1, wherein the every initialization period comprises one of a subframe period, a radio frame period, an Orthogonal Frequency Division Multiplexing (OFDM) symbol period, a slot period, and a code block period, per each physical channel or each physical signal of an uplink or an downlink.

### Claim 12

A method for generating pseudo random sequence in a wireless communication system, comprising:
generating a first output sequence by inputting a fixed initial value to a first linear feedback shift register (LFSR) having m blocks at every initialization period;
generating a second output sequence by inputting one of m-bit initial values to a second LFSR having m blocks at every initialization period;
generating a third output sequence by inputting one of m-bit initial values to a third LFSR having m blocks at every period; and
generating the pseudo random sequence by summing the first output sequence, the second output sequence and the third output sequence bit by bit through a modulo 2 operation.

### Claim 13 (depends on 12)

The method of claim 12, further comprising constructing the first LSFR, the second LSFR, and the third LFSR, each of which has m blocks, by three different polynomials of degree m, and
wherein the three different polynomials of degree m are generated by using a binary sequence of any one of 3-error-correcting BCH code, Modified or Extended Gold sequence, and Modified or Extended Kasami sequence.

### Claim 14 (depends on 12)

The method of claim 12, wherein the m-bit initial values input to the second LFSR are distributed on the basis of some information of which the sum of total information bits is between 1 and m bits among specific system information, and
the m-bit initial values input to the third LFSR are distributed on the basis of remaining information of which the sum of total information bits is between 0 and m bits among the specific system information.

### Claim 15 (depends on 12)

The method of claim 12, the one of m-bit initial values input to the second LFSR is one of elements of subset of set A, which have M elements, wherein the set A having total 2m different m-bit initial values, and M (0<M≦2m) is determined on the basis of the number of cases of specific system information distributed to the second LFSR, and
the one of m-bit initial values input to the third LFSR is one of elements of subset of set B, which have M′ elements, wherein the set B having total 2m different m-bit initial values, and M′ (0≦M′≦2m) is determined on the basis of the number of cases of specific system information distributed to the third LFSR.

### Claim 16

An apparatus for generating pseudo random sequence in a wireless communication system, comprising:
a first linear feedback shift register (LFSR), a second LSFR, and a third LFSR, each of which has m blocks;
a first initial value mapper to input a fixed initial value to the first LFSR at every initialization period;
a second initial value mapper to input one of m-bit initial values to the second LFSR at every initialization period;
a third initial value mapper to input a predetermined initial value to the third LFSR at every initialization period;
an N delay operator to delay a sequence output from the third LFSR receiving the initial value from the third initial value mapper by N clocks for a given delay value N; and
a modulo 2 operator to sum the first output sequence, the second output sequence and the third output sequence bit by bit through a modulo 2 operation.

### Claim 17 (depends on 16)

The apparatus of claim 16, wherein the first LFSR is constructed from a first polynomial of degree m selected from plural primitive polynomials of degree m over GF(2);
the second LFSR is constructed from a second polynomial determined by sampling a binary sequence generated by the first polynomial with a sampler f=1+2└(m+2)/2┘; and
the third LFSR is constructed from a third polynomial determined by sampling a binary sequence generated by the first polynomial with a sampler f=1+2m/2.

### Claim 18 (depends on 16)

The apparatus of claim 16, wherein the first LFSR, the second LFSR, and the third LFSR are constructed from three different polynomials of degree m generated by using Large sets of Kasami sequence of degree m.

### Claim 19

An apparatus for generating pseudo random sequence in a wireless communication system, comprising:
a first linear feedback shift register (LFSR), a second LFSR, and a third LFSR, each of which has m blocks;
a first initial value mapper to input a fixed initial value to the first LFSR at every initialization period;
a second initial value mapper to input one of m-bit initial values to the second LFSR at every initialization period;
a third initial value mapper to input one of m-bit initial values to the third LFSR at every initialization period; and
a modulo 2 operator to sum the first output sequence, the second output sequence and the third output sequence bit by bit through a modulo 2 operation.

### Claim 20 (depends on 19)

The apparatus of claim 19, wherein the first LFSR, the second LFSR, and the third LFSR are constructed from three different polynomials of degree m generated by using a binary sequence comprising any one of 3-error-correcting BCH code, Modified or Extended Gold sequence, and Modified or Extended Kasami sequence.
