# US 6,295,301 B1 · PN code generating apparatus and mobile radio communication system

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

- Number: US 6,295,301 B1
- Document ID: US6295301B1
- Status: Granted
- Kind: B1
- Application number: 09/139,325
- Filed: 1998-08-25
- Granted: 2001-09-25
- Earliest claimed: 1997-09-02
- Assignees: Matsushita Electric Industrial Co., Ltd.
- Inventors: Nobuo Asano
- Web page: https://patentgrep.com/patent/US6295301B1

## CPC

- H04J 13/0022: {PN, e.g. Kronecker}
- G06F 7/584: {using finite field arithmetic, e.g. using a linear feedback shift register}
- H03K 3/84: Generating pulses having a predetermined statistical distribution of a parameter, e.g. random pulse generators
- H04J 13/10: Code generation
- Y02D 30/70: in wireless communication networks
- H04J: MULTIPLEX COMMUNICATION (transmission in general H04B; peculiar to transmission of digital information H04L5/00; systems for the simultaneous or sequential transmission of more than one television signal H04N7/08; in exchanges H04Q11/00; stereophonic systems H04S)
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)
- H03K: PULSE TECHNIQUE (measuring pulse characteristics G01R; modulating sinusoidal oscillations with pulses H03C; transmission of digital information H04L; discriminator circuits detecting phase difference between two signals by counting or integrating cycles of oscillation H03D3/04; automatic control, starting, synchronisation or stabilisation of generators of electronic oscillations or pulses where the type of generator is irrelevant or unspecified H03L; coding, decoding or code conversion, in general H03M)
- Y02D: CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE

## Abstract

In a PN code generating apparatus, a code of the predetermined number of stages is generated using primitive polynomial G(x), then the code content of each stage is shifted to the next stage. And a state setting section obtains a code state of the PN code generating section after shifted the specific times from a code state of the PN code generating apparatus at a certain time, based on ximodG(x) as the number of shift times is i.

## Claims

### Claim 1

A PN code generating apparatus comprising:
a shift register that generates a PN code, said shift register having a plurality of serial connected delay elements, wherein the number of said delay elements corresponds to the number of orders of a primitive polynomial G(x), a plurality of exclusive ORs each at an input stage of one of said delay elements, and a plurality of multipliers that multiply a feedback code outputted from a predetermined delay element by a coefficient of each order of said primitive polynomial G(x) so as to input each multiplied value to an exclusive OR corresponding to the order respectively:
a generator that generates a masking polynomial S(x) based on the following formulation;
S(x)=ximodG(x)
where i is the number of times said shift register should be shifted during a predetermined period from a first time to a second time; and
a state setting system that inputs a state stored in said shift register at said first time into the exclusive OR corresponding to the orders of said S(x) which have coefficients 1, from the highest order to the lowest order of the code, so as to set a state of said shift register at said second time after an input of the lowest order.

### Claim 2 (depends on 1)

The PN code generating apparatus according to claim 1, wherein said generator calculates the number of shift times “i” at which said shift register should be shifted during a period from termination of a PN code generation operation to restarting of the operation.

### Claim 3 (depends on 1)

The PN code generating apparatus according to claim 1, wherein said generator stores the number of shift times “i” at which said shift register should be shifted during a period from termination of a PN code generation operation to restarting of the operation.

### Claim 4 (depends on 1)

The PN code generating apparatus according to claim 1, said generator further comprising:
a storage that stores a plurality of masking polynomials S(x) pre-calculated corresponding to a plurality of the number of shift times “i” or information concerning each order of the masking polynomial S(x); and
a selector that selects one of a masking polynomial S(x) and information concerning each order of the masking polynomial from said storage.

### Claim 5 (depends on 1)

The PN code generating apparatus according to claim 1, said generator further comprising:
a storage that stores a plurality of masking polynomials S(x) pre-calculated corresponding to a plurality of the number of shift times “i” or information concerning each order of the masking polynomial S(x); and
a selector that selects one of a masking polynomial S(x) and information concerning each order of the masking polynomial from said storage based on a value of n as n×T (n is an integer and T is a unit time) is a period time from the first time to the second time.

### Claim 6 (depends on 5)

The PN code generating apparatus according to claim 5, wherein said selector selects S(x) corresponding to one of mi×T and information concerning an order of the S(x) by sequentially increasing a value of “i” as n=mi.

### Claim 7 (depends on 1)

The PN code generating apparatus according to claim 1, said state setting system comprising:
a parallel/serial converter that serial outputs a plurality of bit data saved in parallel, while saving in parallel, memory bit data of said each delay element indicative of a state of said shift register at said first time; and
a plurality of ANDs corresponding to each of said exclusive ORs for calculating a logic product of bit data outputted from said parallel/serial converter and each order of said S(x) to input the logic product to a corresponding exclusive OR.

### Claim 8 (depends on 1)

A mobile station apparatus in radio communication with a base station in a CDMA system, said mobile station apparatus comprises a PN code generating apparatus according to claim 1.

### Claim 9 (depends on 1)

A base station apparatus in radio communication with a mobile station apparatus, said base station apparatus comprises the PN code generating apparatus according to claim 1.

### Claim 10

A method for generating a PN code using a shift register, wherein said shift register has a plurality of serial connected delay elements, the number of said delay elements corresponding to the number of orders of a primitive polynomial G(x), a plurality of exclusive ORs each at an input stage of one of said delay elements, and a plurality of multipliers that multiply a feedback code output from a predetermined delay element by a coefficient of each order of said primitive polynomial G(x) so as to input each multiplied value to an exclusive OR corresponding to the order, said method comprising:
generating a masking polynomial S(x) based on the following formulation;
S(x)=ximodG(x)
where i is the number of times said shift register should be shifted during a predetermined period from a first time to a second time; and
changing a state of said shift register at said first time to a state of said register at said second time by inputting a state decided by both of said shift register at the first time and coefficients of said S(x) into the exclusive OR's.

### Claim 11

A computer program product for operating a computer, said computer program product comprising:
a computer readable medium;
a first program instruction system that instructs a computer processor to shift a plurality of bit data forming a code to a next storage according to a shift clock, and to multiply a coefficient of each of the specific orders of a primitive polynomial G(x) by bit data to which the order corresponds so as to generate a new code; and
a second program instruction system that instructs a computer processor to obtain a state of a code after being shifted a predetermined number of times from a state of said code at a certain time based on ximodG(x) where the number of shift times is i, and wherein each of said program instruction systems are recorded on said medium in an executable form and are loadable into a computer memory for execution by the associated processor.

### Claim 12

A PN code generating apparatus comprising:
a PN code generator that generates a PN code;
a calculator that calculates a polynomial corresponding to a number of shift times during a period from when said PN code generator is turned off to when said PN code generator is turned on; and
a system that obtains a state of said PN code generator immediately after said PN code generator is turned on using said polynomial corresponding to the number of shift times and another state of said PN code generator immediately before said PN code generator is turned off;
wherein said PN code generator can be turned off during a non-reception period.

### Claim 13

A PN code generating method comprising:
generating a PN code;
calculating a polynomial corresponding to a number of shift times to be obtained during a period corresponding to a time the PN code generation is turned off and then turned on;
obtaining, based upon the polynomial and a state of said PN code generation at the time said PN code generation is turned off, a state of the PN code generation when the PN code generation is turned on; and
turning off the PN code generation during a non-reception period.