IP Library Granted Patent US 8,750,235
Granted Patent B2
US 8,750,235 · App. 13/614,417 · Granted Jun 10, 2014

Sequence allocating method and sequence allocating apparatus

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,750,235
App. No.
13/614,417
Granted
Jun 10, 2014
Kind
B2
Abstract

A sequence allocating method and apparatus wherein in a system where a plurality of different Zadoff-Chu sequences or GCL sequences are allocated to a single cell, the arithmetic amount and circuit scale of a correlating circuit at a receiving end can be reduced. In ST 201 , a counter (a) and a number (p) of current sequence allocations are initialized, and in ST 202 , it is determined whether the number (p) of current sequence allocations is coincident with a number (K) of allocations to one cell. In ST 203 , it is determined whether the number (K) of allocations to the one cell is odd or even. If K is even, in ST 204 -ST 206 , sequence numbers (r=a and r=N−a), which are not currently allocated, are combined and then allocated. If K is odd, in ST 207 -ST 212 , for sequences that cannot be paired, one of sequence numbers (r=a and r=N−a), which are not currently allocated, is allocated.

Claims (94)

1. A mobile station comprising:

a receiver that receives information related to a set of sequences configured to be available in a cell for use by the mobile station, the information being broadcasted from a base station;

a selector that selects a sequence from the set of sequences available in the cell; and

a transmitter that random-access-preamble-transmits the selected sequence;

wherein the set of sequences available in the cell include a sequence of r=a and a sequence of r=N−a, where r is a sequence number; a is an integer, and N is a sequence length, and the allocated sequences are defined by the following equation or an equation cyclic shifted from the following equation:

c

r

(

k

)

=

exp

{

-

j

2

π

r

N

(

k

(

k

+

1

)

2

+

qk

)

}

where k=0, 1, 2, . . . N−1, and q is an integer, and

the sequence of r=a and the sequence of r=N−a are conjugate to each other.

2. The mobile station according to claim 1 , wherein the set of sequences available in the cell further include a sequence of r=a′ (a′≠a) and a sequence of r=N−a′.

3. The mobile station according to claim 1 , wherein the N is a prime number.

4. A mobile station according to claim 1 , wherein the selector randomly selects the sequence from the set of sequences available in the cell.

5. A random access preamble transmitting method comprising:

receiving information related to a set of sequences configured to be available in a cell, the information being broadcasted from a base station;

selecting a sequence from the set of sequences available in the cell; and

random-access-preamble-transmitting the selected sequence;

wherein the set of sequences available in the cell include a sequence of r=a and a sequence of r=N−a, where r is a sequence number, a is an integer, and N is a sequence length, and the allocated sequences are defined by the following equation or an equation cyclic shifted from the following equation:

c

r

(

k

)

=

exp

{

-

j

2

π

r

N

(

k

(

k

+

1

)

2

+

qk

)

}

where k=0, 1, 2, . . . N−1, and q is an integer, and

the sequence of r=a and the sequence of r=N−a are conjugate to each other.

6. The random access preamble transmitting method according to claim 5 , wherein the set of sequences available in the cell further include a sequence of r=a′ (a′≠a) and a sequence of r=N−a′.

7. The random access preamble transmitting method according to claim 5 , wherein the N is a prime number.

8. The random access preamble transmitting method according to claim 5 , wherein the selecting unit randomly selects the sequence from the set of sequences available in the cell.

9. The random access preamble transmitting method according to claim 5 , wherein the set of sequences available in the cell are configured by a network that controls the base station.

10. The random access preamble transmitting method according to claim 5 , wherein a number of the sequences configured to be included in the set of sequences available in the cell is less than the N.

11. The random access preamble transmitting method according to claim 5 , wherein the information broadcasted from the base station includes an index indicative of the set of sequences available in the cell.

12. The mobile station according to claim 1 , wherein the set of sequences available in the cell are configured by a network that controls the base station.

13. The mobile station according to claim 1 , wherein a number of the sequences configured to be included in the set of sequences available in the cell is less than the N.

14. The mobile station according to claim 1 , wherein the information broadcasted from the base station includes an index indicative of the set of sequences available in the cell.

Assignments (3)
CHANGE OF NAME Recorded May 9, 2022
From: PANASONIC CORPORATION
To: PANASONIC HOLDINGS CORPORATION
Reel/Frame 060119/0989 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Aug 3, 2016
From: PANASONIC INTELLECTUAL PROPERTY CORPORATION OF AMERICA
To: PANASONIC CORPORATION
Reel/Frame 039551/0064 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded May 27, 2014
From: PANASONIC CORPORATION
To: PANASONIC INTELLECTUAL PROPERTY CORPORATION OF AMERICA
Reel/Frame 033033/0163 →