Sequence allocating method and sequence allocating apparatus.

(54) Title: METHOD TO ASSIGN A SEQUENCE AND APPARATUS TO ASSIGN A SEQUENCE. (54) Title: SEQUENCE ALLOCATING METHOD AND SEQUENCE ALLOCATING APPARATUS.

(57) Summary

A method for assigning sequences and an apparatus., For assigning a sequence in a system where a plurality of different Zadoff-Chu sequences or GCL sequences are assigned to a single cell, the arithmetic quantity and the circuit circuit scale of the correlation circuit in a receiving end can be reduced. According to this method and apparatus, in ST2O1, a counter (a) and a number (p) of current sequence assignments are started, and in ST202, it is determined whether the number (p) of the current sequence assignments matches a number (K) of assignments to a cell '. ST203 determines if the number (K) of the assignments to a cell is non or even. If K is even, in ST204-ST206, the sequence numbers (r = a and rNa), which are not currently assigned, are combined and then assigned. If K is non, in ST207-ST212, for sequences that cannot be connected, one of the sequence numbers (r = a and r = Na), which are not currently assigned, are assigned.

(57) Abstract

A sequence allocating method and a sequence allocating apparatus where 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. According to these method and apparatus, in ST201, a counter (a) and a number (p) of current sequence allocations are initialized, and in ST202, it is determined whether the number (p) of current sequence allocations is coincident with a number (K) of allocations to one cell. In ST203, it is determined whether the number (K) of allocations to the one cell is odd or even. If K is even, in ST204-ST206, sequence numbers (r = a and r = Na), which are not currently allocated, are combined and then allocated. If K is odd, in ST207-ST212, for sequences that cannot be paired, one of sequence numbers (r = a and r = Na), which are not currently allocated, is allocated.

Institute

Mexican Property

Industrial

SECMI'AItlA Ϊ3Ι ECONOMY

PATENT TITLE NO. 338548

Owner (s): PANASONIC INTELLECTUAL PROPERTY CORPORATION OF AMERICA

Address: 20000 Marlner Avenue, Suite 200, Torrárice, California, 90503, USA

Name: METHOD TO ASSIGN A SEQUENCE AND APPARATUS TO ASSIGN A SEQUENCE.

Classification:

lnt.CI.8: H04J13 / 00; lnt.CI.8: H04J13 / 10; lnt.CI.8: H04J13 / 16; lnt.CI.8: H04J13 / 22; lnt.CI.8: H04L27 / 26; lnt.CI.8: H04W4 / 00; lnt.CI.8: H04W72 / 04

Inventor (s): DAICHI IMAMURA; TAKASHI IWAI; KAZUNORI INOGAI; SADAKI FUTAGI;

ATSUSHI MATSUMOTO

Wildebeest

MX / a / 2013AXM291

Pressure date

Divisional intei filing September 28, 2007 Patent Number: 308847

PRIORITY

<img file="MX338548B_D0001.tif" />

Country:

JP?

JP

B | Λ

Validity: Twenty years

Date:

September 2006- December 27, 2006 '

<img file="MX338548B_D0002.tif" />

Number:

2006-269327

2006-352897

Expiration Date »28 of the reference entity is granted based on the ·

In accordance with article 23 of the e and e of the Propii edited from the date of presetjjación de la sol »rights d 2027

<img file="MX338548B_D0003.tif" />

and based on the provisions of section 6, section III, and 59 of the Industrial Property Law rite patei i * - will have a twenty-year term, subject to the payment of U tadfe to keep them creditable, lenses subscribe to the present title Industriality (Diarii - 4 16 * 06 / 2006-25 / 0- / 2006,

Clause a), 4th and 12th sections I and III of the Regulation of the Mexican Institute of Industrial Property (DOF 14/12/1999, amended on 07/01/2002, 07/15/2004, 07/28/2004 and 09/07/2007); Articles 1, 3, 4, 5, section V, Section a), 16 sections I and III and 30 of the Organic Statute of the Mexican Institute of Industrial Property (DOF) 12/27/1999, amended on 10/10/2002, 07/29/2004, 08/04/2004 and 09/13/2007); 1, 3 'and 5 subsection a) of the Agreement that delegates powers to the Deputy Directors General, Coordinator, Divisional Directors, Directors of divisions, Divisional Deputy Directors, Departmental Coordinators and other subordinates of the Mexican Property Institute - ¿12 / 1999, amended on 02/04/2000, 07/29/2004, 08/04/2004 and 09/13/2007).

.ey of ictions III and 7 ° bis 2 of I fíclal dete Federación (DOF) 06/27/1991, amended on 08/02/1994, 10/25/1996, 12/26/1997, # / 05/1999 , 1/2006, ofWWCTWHHW -------------------------------------------- ------- ~ --------------------------- 'ration V

<img file="MX338548B_D0004.tif" />

Issue Date: April 20, 2016

DIVISIONAL DIRECTOR OF PATENTS

<img file="MX338548B_D0005.tif" />

NAHANNY CANAL REYES

<img file="MX338548B_D0006.tif" />

<img file="MX338548B_D0007.tif" />

Sand! No. 550, Floor 1.

Co!. Pueoto Santa María Tepepan

Xochimilco, CP 16020

Mexico City

Tel (55) 53 34 07 00 www.impi.LOb mx

MX / 2016/30910

339SH8

METHOD FOR ASSIGNING A SEQUENCE AND APPARATUS

TO ASSIGN A

MEXICAN INSTITUTE OF PROPERTY

INDUSTRIAL

<img file="MX338548B_D0008.tif" />

SEQUENCE

Field of the Invention

The present invention relates to a method for assigning a sequence and an apparatus for assigning a sequence to assign a Zadoff-Chu sequence or GCL sequence to a cell.

Background to the Irrigation

Mobile communication systems represented by wireless radio cellular communication systems or LAN (ie local area network) systems are provided with a random access region in their transmission regions. This random access region is provided in an uplink transmission region when a terminal station (hereafter UE) sends a connection request to a base station (hereafter BS) for the first time, or when a UE makes a new request for band allocation in a centralized control system where a BS or the like assigns transmission times and transmission bands to the UEs. The base station can be referred to as an access point or Node B.

Also, in a system using TDMA (i.e., time division multiple access) such as 3GPP PAN L¹who is currently undergoing standardization, when or

Ref: 240775

<img file="MX338548B_D0009.tif" />

makes a connection request for the first time (which is carried out not only when a UE is triggered but also when uplink transmission timing synchronization is not established such as when a transfer is in progress, when communication is not carried out for a certain period of time, and when synchronization is lost due to channel conditions, etc.). Random access is used for a first process of acquiring uplink transmission timing synchronization, BS connection request (i.e. association request) or band allocation request (i.e. resource request) .

A random access burst (hereinafter RA burst) transmitted in a random access region (hereinafter an RA location), unlike other scheduled channels, results in error reception and retransmission due to the coalition between identification sequences (situation where a plurality of UEs transmit the same identification sequence using the same RA location) or interference between the identification sequences. Collision of RA bursts or occurrence of receive error increases delays in processing uplink transmission timing synchronization acquisition including RA bursts and processing of association request to the

IMPI

MEXICAN INSTITUTE OF INDUSTRIAL PROPERTY

<img file="MX338548B_D0010.tif" />

from BS. For this reason, a reduction in the degree of collision of the identification sequences and an improvement in the detection characteristics of the identification sequences are required.

Since the method to improve the detection characteristics of the identification sequences, the generation of an identification sequence of a GCL sequence (i.e. generalized pulsed modulated frequency (chirp) type) having a low self-correlation characteristic and also a feature of low inter-sequence cross-correlation or Zadoff-Chu sequence is under study. A signal sequence, which constitutes a random access channel and is known between the transmitter and the receiver, is referred to as a preamble and a preamble is generally comprised of a signal sequence that has better auto-correlation and cross-correlation characteristics. Furthermore, an identification is a preamble pattern, and assumes that the identification sequence and the preamble pattern are synonyms herein.

Non-Patent Documents 1 to 3 use a Zadoff-Chu sequence or GCL sequence, the length of which sequence N is a prime, as a burst preamble RA. Here, adapting a prime number for the length N of the sequence makes it possible to use Nl sequences with auto-correlation characteristics' and characteristics of

MEXICAN INSTITUTE OF PROPERTY

INDUSTRIAL

<img file="MX338548B_D0011.tif" />

optimal cross-correlation, and optimizes (haee —— value — correlation amplitude constant Vn) the cross-correlation characteristics between any of the two sequences of the available sequences. Therefore, the system can assign any sequence of the Zadoff-Chu sequences to each cell as a preamble.

Document 1 Non-Patent: Rl-62174, Panasonic, NTT

DoCoMo Random access sequence comparison for E-ULTRA.

Document 2 Patent Number: Rl-061816: Rl-061816,

Huawei, Expanded sets of ZCZ-GCL random access preamble.

Non-Patent Document 3: Rl-062066, Motorola, Preamble Sequence Design for Non-Synchronized Random Access

Brief Description of the Invention

However, since the Zadoff-Chu sequence or the GCL sequence is a complex code sequence where each element that makes up the sequence is a complex number, a correlation circuit (compared filter) necessary for each code detection on the side Receiver requires complex multiplication for each element of the sequence, which involves a large number of calculations and also increases the scale of the circuit. Furthermore, when the number of different Zadoff-Chu sequences or GCL sequences used in a cell is increased, it is necessary to carry out the corresponding correlation calculations on the number of sequences for the detection of the preamble, and this gives as ⁵ IMPI

MEXICAN INSTITUTE

OWNED

INDUSTRIAL resulted in a number of computations and circuit loop proportional to the number of sequences assigned.

It is an object of the present invention to provide a sequence allocation method and sequence allocation apparatus that reduces the number of calculations and the scale of the circuit of the correlation circuit on the reception side in a system where a plurality of different Zadoff-Chu sequences or GCL sequences are assigned to a cell.

I

The sequence allocation method of the present invention includes an allocation step for assigning a combination of sequence sequence numbers.

Zadoff-Chu or GCL sequences assigned to a cell, which has a relation where the absolute values ​​of the amplitudes of the coefficients of the real part and the imaginary part of each element of the sequences are equal.

The sequence allocation apparatus of the present invention adapts a configuration including a sequence allocation section that assigns combinations of sequence numbers of the general Zadoff-Chu sequences or pulsed modulated frequency type sequences to be assigned to a cell, combinations of sequence numbers maintain a relationship where the absolute values ​​of the amplitudes of the coefficients of the real parts and the imaginary parts of the elements in the

I

INSTITUTO MEXICANO PE LA PROPIEDAD INDUSTRIAL sequences are the same and a section of reports-epa-e-ti-ene · matches between the combinations of sequence numbers and the indexes of the combinations, and reports an index corresponding to a combination of the numbers of assigned sequence.

The present invention provides an advantage in reducing the number of computations and circuit scaling of the correlation circuit on the receive side in a system where a plurality of different Zadoff-Chu sequences or GCL sequences are assigned to a cell.

Brief Description of the Figures

Figure 1 is a block diagram showing a configuration of a radio communication system according to embodiment 1 of the present invention;

Figure 2 is a block diagram showing a configuration of the BS shown in Figure 1;

Figure 3 is a block diagram showing a configuration of an OE in accordance with embodiment 1 of the present invention;

Figure 4 is a flowchart showing the operations of the sequence allocation section shown in Figure 1;

Figures 5A-5B show how a sequence number is assigned to each cell;

Figure 6 shows a correspondence between the

MEXICAN INSTITUTE

OF THE PROPERTY

INDUSTRIAL

<img file="MX338548B_D0012.tif" />

sequence numbers and indexes; ~

Figure 7 shows an internal configuration of the preamble sequence detection section shown in Figure 2;

Figure 8 shows another correspondence between the

<td colspan="2">sequence numbers and those</td><td colspan="2">indices;</td><td rowspan="2">shows</td>

<td>The figure</td><td>9 is</td><td>a diagram</td><td>of blocks</td>

<td>a configuration</td><td>of</td><td>system of</td><td colspan="2">administration type</td>

<td>distributed;</td><td></td><td></td><td></td><td></td>

<td>The figure</td><td>10 is</td><td>a diagram</td><td>of blocks</td><td>shows</td>

a configuration of a RA burst generation section according to Mode 2 of the present invention;

Figure 11 illustrates an example of the generation of a ZC sequence in a frequency domain through the generation section of the ZC sequence shown in Figure 10 and the assignment to subcarriers through the section

IDFT;

FIG. 12 is a block diagram showing an internal configuration of the preamble sequence detection section according to Mode 2 of the present invention;

Figure 13 is a block diagram showing an internal configuration of the complex multiplication section shown in Figure 12;

Figure 14 is a block diagram showing

<img file="MX338548B_D0013.tif" />

MEXICAN INSTITUTE OF PROPERTY

INDUSTRIAL

<img file="MX338548B_D0014.tif" />

a configuration of the RA burst generation according to Mode 3 of the present invention;

Figure 15 shows a correspondence between myq according to Mode 3 of the present invention; and

Figure 16 shows a correspondence between sequence numbers and indices.

Detailed description of the invention

Next, the embodiments of the present invention will be explained in detail with reference to the attached figures.

Mode 1

First, a Zadoff-Chu sequence will be shown using the equations. A Zadoff-Chu sequence that has a sequence length N that is expressed by equation 1 when N is an even number and is expressed by equation 2 when N is a non number.

c_r(£) = exp * j2πτ í 1.2 + qk (Equation 1) c_r(ky = exp * .2πτ (k (k + í) • 'ΊΫΛ 2

V

Lqk ► z

(Equation 2) positive less than N.

where k = 0, 1, 2, ..., Nl, q is an arbitrary integer and r is a sequence number (sequence index). r is a number co-prime to N and is an integer

Then, a GCL sequence will be displayed using the equations. A GCL sequence that has a sequence length N is expressed by equation 3 when N is an even number and is expressed by equation 4 when N is a non number.

INSTITUTO MEXICANO DE LA PROPlEílAli INDUSTRIAL &lt;z „(*) = exp, 2nr f ι„ ί + qk. . Equation 3 '

2nr k (k + í) (Equation 4) where k = 0, 1, 2, N-1, q is an arbitrary integer, r is a number co-prime to N, and is a positive integer less than N, bi ( k mode m) is an arbitrary complex number and i = 0, 1, ..., Ml. Furthermore, when the cross-relationship between the GCL sequences is minimized, an arbitrary complex number of amplitude 1 is used for b¿ (k mode m).

The GCL sequence is a sequence that results from the multiplication of a Zadoff-Chu sequence by bi (k mode m), and since the calculation of the correlation on the receptor side is similar to that of the Zadoff-Chu sequence, the Zadoff sequence -Chu will be explained as a following example. Furthermore, a case will be explained later where the Zadoff-Chu sequence whose sequence length N is a non number and a prime number will be used as the preamble sequence of the RA burst.

Figure 1 is a block diagram showing

<img file="MX338548B_D0015.tif" />

MEXICAN INSTITUTE OF PROPERTY

INDUSTRIAL

<img file="MX338548B_D0016.tif" />

a configuration of a _______ radio communication system according to Mode 1 of the present invention. In this figure, the radio resource management section 51 handles the radio resources to be assigned to a plurality of BSs (# 1 to #M) 100-1 to 100-M and is provided with a sequence allocation section 52 and a report section 53.

Sequence assignment section 52 assigns a sequence number r of a Zadoff-Chu sequence to a cell managed through a BS under its control, and outputs the sequence number assigned to report section 53. Reporting section 53 reports an index indicating the sequence number r that has been produced from sequence assignment section 52 to BS 100-1 to 100-M. The details of sequence assignment section 52 and report section 53 will be explained later.

BS 100-1 to 100-M broadcasts the reported indices from sequence assignment section 52 to the ÜE in its own cells, and detects preamble sequences transmitted from the UEs. Since all BS 100-1 to 100-M have the same function, assume that the BS will be collectively referred to as a BS 100.

Figure 2 is a block diagram illustrating a configuration of the BS 100 shown in Figure 1. In this figure, the broadcast channel processing section 101 is provided with a channel generation section of

......⁴

MEXICAN INSTITUTE of broadcasting 102 industrial property, coding section 103, and modulation section 104. Broadcast channel generation section 102 generates a broadcast channel, which is a downlink control channel, through the inclusion of the index reported from report section 53 shown in Figure 1. The generated broadcast channel is sent to coding section 103.

The encoding section 103 encodes the broadcast channel produced from the broadcast channel generation section 102, and the modulation section 104 modulates the encoded broadcast channel under a modulation scheme such as BPSK and QPSK. The modulated broadcast channel is output to multiplex section 108.

The DL data transmission processing section 105 is provided with the encoding section 106 and the modulation section 107 and performs transmission processing on the DL transmission data. The encoding section 106 encodes the DL transmit data and the modifying section 107 modulates the encoded DL transmit data under a modulation scheme such as BPSK and QPSK and outputs the modulated DL transmit data to the multiplex section 108 .

<td>The</td><td>section from</td><td>multiplexing 108</td><td>performed</td><td>the</td>

<td>multiplexing</td><td>weather,</td><td>multiplexing</td><td>of frequency,</td><td>the</td>

<td>multiplexing</td><td>from space</td><td>and multiplexing</td><td>of the code in</td><td>the</td>

<img file="MX338548B_D0017.tif" />

MEXICAN INSTITUTE OF PROPERTY

INDUSTRIAL

<img file="MX338548B_D0018.tif" />

broadcast channel produced from modulation section 104 and DL transmission data produced in modulation section 107 and outputs the multiplexed signal to RF transmission section 109.

RF transmission section 109 applies predetermined radio transmission processing such as D / A conversion, filtering, and upconversion to the multiplexed signal produced from multiplex section 108 and transmits the signal undergoing radio transmission processing from the antenna 110.

RF reception section 111 applies predetermined radio reception processing such as downconverting and A / D conversion to the signal received through antenna 110 and outputs the signal undergoing radio reception processing for demultiplexing section 112.

The demultiplexing section 112 separates the produced signal from the RF receiving section 111 at a RA location and a UL data location and outputs the separate RA location to the preamble sequence detection section 114 and the UL data location for demodulation section 116 of UL data reception processing section 115 respectively.

The storage section of the preamble sequence table 113 stores a preamble sequence table that associates the preamble sequences that can

MEXICAN INSTITUTE

OF PROPERTY C «w_tÍ £ / W

INDUSTRIAL be assigned through the allocation section sccuenuiu 5 · Ζ——. shown in Figure 1, these sequence numbers and indices indicate these combinations, read a preamble sequence corresponding to the index reported from report section 53 shown in Figure 1 of the table, and output the preamble sequence corresponding to section Preamble Sequence Detection 114.

The preamble sequence detection section 114 performs the preamble waveform detection processing such as correlation processing at the RA site produced from the demultiplexing section 112 using an identification stored in the preamble sequence table storage 113 and detects whether or not the preamble sequence has been transmitted from a UE. The detection result (RA burst detection information) is output to a higher layer (not shown).

The UL data reception processing section 115 is provided with the demodulation section 116 and the decoding section 117 and performs reception processing on the UL data. The demodulation section 116 corrects the distortion of the channel response of the UL data produced in the demultiplexing section 112, makes a decision of the signal point through a hard decision or soft decision depending on the modulation scheme and the

IMPI

MEXICAN INSTITUTE OF INDUSTRIAL PROPERTY

<img file="MX338548B_D0019.tif" />

decoding section 117 performs error correction processing about the signal point decision result through demodulation section 116 and outputs the received UL data.

Figure 3 is a block diagram showing a configuration of the UE 150 according to Mode 1 of the present invention. In this figure, the RF reception section 152 receives a signal transmitted from BS shown in Figure 1 through antenna 151 and applies predetermined radio reception processing such as upconverting and A / D conversion to the signal received and outputs the signal undergoing radio reception processing to demultiplex section 153.

The demultiplexing section 153 separates the broadcast channel and the DL data included in the signal produced from the RF receiving section 152 and outputs the separated DL data to the demodulating section 155 of the receiving data processing section. DL 154 and the broadcast channel to demodulation section 158 of broadcast channel receive processing section 157.

DL data reception processing section 154 is provided with demodulation section 155 and decoding section 156, and performs reception processing on DL data. Demodulation section 155 corrects distortion of the response of

IMPI

MEXICAN INSTITUTE OF INDUSTRIAL PROPERTY

<img file="MX338548B_D0020.tif" />

channel in the DL data produced in the demultiplexing section ....... 153, makes a signal point decision through a hard decision or a soft decision, depending on the modulation system, and the decoding section 156 it performs error correction processing on the signal point decision resulting from demodulation section 155 and outputs the received data DL.

Broadcast channel reception processing section 157 is provided with demodulation section 158, decoding section 159 and broadcast channel processing section 160, and performs reception processing on the broadcast channel . The demodulation section 158 corrects the distortion of the channel response of the broadcast channel produced from the demultiplexing section 153, makes a signal point decision through a hard decision or a soft decision depending on the modulation scheme, and the decoding section 159 performs error correction processing on the signal point decision resulting from the broadcast channel through demodulation section 158. The broadcast channel subjected to error correction processing is output to broadcast channel processing section 160. The broadcast channel processing section

160 outputs the calculated index on the broadcast channel produced from the decoding section 159 to the

MEXICAN INSTITUTE OF PROPERTY

INDUSTRIAL storing the TTT preamble sequence table — and other broadcast channels to a higher layer (not shown).

The preamble sequence storage section 161 stores the sequence preamble sequence table of the storage section of the DS 100 preamble sequence table 130 shown in Figure 2.

That is, the preamble sequence storage section 161 stores a preamble sequence table that associates the preamble sequences that can be assigned through the sequence allocation section 52 shown in Figure 1 with these sequence numbers and indices indicated by these combinations. The preamble sequence storage section 161 then outputs a preamble sequence associated with the index produced from the broadcast channel processing section 160 to the burst generation section RA 162.

After acquiring a RA burst transmission instruction from a higher layer (not shown), a burst generation section RA 162 selects one of the available preamble sequences from the preamble sequence table storage section 161, generates a RA burst that includes the selected preamble sequence and outputs the generated RA burst to multiplex section 166.

The data transmission procedure section

UL 163 is provided with coding section 164 and the

IMPI

MEXICAN INSTITUTE OF THE PROPERTY: INDUSTRIAL

<img file="MX338548B_D0021.tif" />

ZlT modulation section 165, and performs the transmission pTTOeyaiuitíiiLu in the UL transmission data. Coding section 164 encodes the UL transmission data and modulation section 165 modulates the UL transmission data encoded under the modulation scheme such as BPSK and QPSK and outputs the modulated and UL transmission data to the multiplex section 166.

The multiplex section 166 multiplexes the RA burst produced from the RA burst generation section 162 and the UL transmit data produced from the modulation section 165 and outputs the multiplexed signal to the RF transmit section 167.

RF transmission section 167 applies predetermined radio transmission processing such as D / A conversion, filtering and upconversion to the multiplexed signal produced from multiplex section 166 and transmits the signal undergoing radio transmission processing from antenna 151.

Thereafter, the operations of the sequence allocation section 52 shown in Figure 1 will be explained using Figure 4. In Figure 4, the step (hereinafter abbreviated as ST) 201, the counter a, and the current number of assigned sequences p starts (a = l, p = 0). Also, suppose that the number of sequences assigned to a cell is K.

In ST202, it is decided whether the number of sequences

IMPI

MEXICAN INSTITUTE OF INDUSTRIAL PROPERTY

<img file="MX338548B_D0022.tif" />

assigned as p match or not match ñüflísro — of sequences assigned to a cell K. When the number matches, since the current number of sequences assigned p reaches the number of sequences assigned to a cell K, the sequence assignment processing it ends, and when the numbers don't match, the sequence allocation still needs to be done, and therefore the process moves to ST203.

In ST203, it is decided whether the value resulting from the subtraction of the current number of assigned sequences p from the number of sequences assigned to a cell K matches or does not match 1. The process moves to ST207 when the value matches 1 or moves to ST204 when the value does not match

1.

In ST204, it is decided whether the numbers r = a and r = N have already been assigned or not, and the process moves to ST205 when at least one of the numbers in the sequence r = a and r = N has already been assigned or is assigned. moves to ST206 when it has not yet been assigned.

In ST205, since it is decided in ST204 that one or both r = a and r = N have already been assigned, the counter a is incremented (aa = a + l is updated) and the process returns to ST204.

In ST206, the sequence numbers r = a and r = N have been decided that they have not been assigned to any cell in ST204, they are assigned, the current number of the assigned sequences p is updated to p = + 2 and the counter a is increased ( updated to

JL

<img file="MX338548B_D0023.tif" />

MEXICAN INSTITUTE

OF THE INDUSTRIAL FROEIEPAO

<img file="MX338548B_D0024.tif" />

a = a + l) and the process returns to ST202.

In ST208, the counter a in ST203 starts for a = l, and in ST208 it is decided whether the number r = a has already been assigned or not. The process moves to ST210 when the sequence number r = a has already been assigned or moves to ST209 when it has not yet been assigned.

In ST209, the sequence number r = a that was decided not to assign, was assigned in ST208, and the sequence assignment processing ends.

In ST210, since the sequence number r = a had decided to be assigned in ST208, it was decided whether or not the sequence number r = Na had already been assigned. The procedure moves to ST211, when it was already assigned, or it moves to ST212, when it was not assigned yet.

In ST211, since it had been decided in ST210 that the sequence number r = N had already been assigned, the counter a is incremented (updated to aa = a + l) and the process returns to

ST208.

In ST212, the sequence number r = Na that you decided

<td>not assigned in ST210</td><td>is assigned</td><td>and</td><td>the</td><td>processing</td><td>of</td>

<td colspan="2">sequence assignment ends. Of the sequences that do not</td><td colspan="2">they can</td><td>connect with</td><td>the</td>

<td>number of sequences</td><td>assigned</td><td>is</td><td>a</td><td>number non,</td><td>a</td>

procedure to search for sequences to be assigned in ascending order of sequence number is shown in ST208 a

IMPI

MEXICAN INSTITUTE OF PROPERTY

INDUSTRIAL

<img file="MX338548B_D0025.tif" />

ST211, but sequences that have not yet been found Sldu — asiynadaj can also be selected and assigned randomly.

Performing sequence allocation processing allows sequence allocation as shown in Figures 5A-5B to be carried out. Figure 5A shows a case where four sequences (even number) are assigned to each cell (here, BS # 1 and BS # 2). That is, the sequence numbers r = 1,2, Nl and N-2 are assigned to BS # 1 and the sequence numbers r = 3, 4, N-3 and N-4 are assigned to BS # 2. When the number of assigned sequences is two or more, ai, a₂, ... of each pair (ai, N-aJ, (a₂, Na₂) ... to be assigned can be arbitrarily selected from the available sequences.

On the other hand, Figure 5B shows a case where three sequences (non number) are assigned to each cell. That is, the sequence numbers r = 1,2 and Nl are assigned to BS # 1 and the sequence numbers r = 3, N-3 and N-2 are assigned to BS # 2. When the number of allocated sequences is a non number, r = a and r = N are assigned in pairs, and the sequences are selected based on the default selection rule and assigned to sequences that cannot connect.

Then, the method for reporting the indexes through reporting section 53 will be explained. The indices are determined according to the table shown in Figure 6 for sequence numbers assigned to each cell through sequence allocation section 52. In Figure 6, the

IMPI

MEXICAN INSTITUTE OF INDUSTRIAL PROPERTY pair of sequence numbers r = l and Nl know SSOCiaii cotí-erl · index 1 and pair of sequence numbers r = 2 and N-2 are associated with index 2. Pairs of sequence numbers they are also associated with index 3 indexes progressively, floor (N / 2) in the figure denotes an integer not greater than N / 2.

The indices determined in this way are broadcast from a BS to a UE through broadcast channels. The EU side is also provided with the same table shown in Figure 6 and can identify pairs of available sequence numbers using the reported indices.

In this way, by assigning an index to a pair of sequence numbers r = a and r = Na, it is possible to reduce the number of signaling bits required for the report.

Incidentally, another reporting method can also be adopted such as one-by-one assignment to sequence number indices and index repote.

Furthermore, the number of signaling bits required to report can further be reduced by increasing a sequence number assigned to an index such as 4, 8, ....

Next, the preamble sequence detection section 114 illustrated in Figure 2 will be explained. Figure 7 shows an internal configuration of the preamble sequence detection section 114 shown in Figure 2. Here, a case where the length of sequence N = ll

<img file="MX338548B_D0026.tif" />

IMPI

MEXICAN INSTITUTE OE THE INDUSTRIAL PROPERTY will illustrate. ””

In Figure 7, assuming an input signal from retarder D is r (k) = a_k+ jb_k and each coefficient of the Zadoff-Chu sequence with the sequence number r = a is a_{r = a}* (k) = c_k+ jd_k, the complex multiplication section x assumes the result of the calculation with respect to the correlation of the sequence side r = a as a_kc_k-b_kd_k+ j (b_kc_k+ a_kd_k). On the other hand, each coefficient of the Zadoff-Chu sequence with a sequence number r = Na is a_{r = N}-a * (k) = (a_{r = a}* (k)) * = c_k-jd_k and the resulting calculation with respect to the correlation on the sequence side r = Na is a_kc_k+ b_kd_k+ j (b_kc_k-to_kd_k) .

Therefore, to_kc_k, b_kd_k, b_kc_k, already_kd_k The result of the multiplication operation carried out to obtain the correlation value on the r = a side of the sequence can be used to calculate a correlation value on the sequence side r = N, and therefore it is possible to reduce the number of multiplication operations and reduce the scale of the circuit (number of multipliers).

As is obvious from Figure 7, since a Zadoff-Chu sequence is a relation of uniform symmetric sequences (each element of the sequence is a_r (k) = a_r (Nlk)), the correlator performs multiplication processing by ascendingly adding the elements of k and Nlk before performing the operation of

<img file="MX338548B_D0027.tif" />

Mexican Institute of Industrial Property

<img file="MX338548B_D0028.tif" />

multiplication, and therefore also can. Roll — e_L number of multiplications (number of multipliers ^) in half.

In this way, when a plurality of different Zadoff-Chu sequences are assigned to a cell, the modality of the present assigns sequences in the combinations in such a way that the relation maintains the elements of the sequence that are complex conjugates, yes, and therefore it can reduce the amount of computation and scale of the correlation circuit circuit on the receive side without deteriorating the detection characteristics of the sequences.

A case has been explained in the present embodiment where the length N of the sequence is a prime number (non number) but the length N of the sequence can also be a non-prime number (either a non number or an even number) . When the length N of the sequence is not a prime number, the number of the sequence r has optimal autocorrelation characteristics that can be used in the complete system, it need not be a number co-prime to the length N of the sequence.

When the sequence length N is an even number, assume that the preamble sequence assignment rule is r = a -> r = Na -> r = N / 2-a -> r = N / 2 + a ( where 1 <a <N / 2-l, in addition, the order of allocation can be arbitrary) and therefore it is possible to carry out the calculation of the

IMPI

MEXICAN INSTITUTE OF INDUSTRIAL PROPERTY

<img file="MX338548B_D0029.tif" />

correlation of four different sequences with the amount of multiplication operation (number of multipliers) corresponding to a sequence). Since the relationship controls that the sequences r = a and r = Na are complex conjugates with each other, and the relationship is maintained between r = a and r = N / 2-a that the values ​​of the real part and the imaginary part are interchanged and their signs are different, the result of the multiplication operation can be used as such. Accordingly, the amount of multiplication operation and the number of multipliers in a sequence can be reduced to about 1/4.

Furthermore, when the length N of the sequences is an even number, assigning an index to a combination of four sequences of r = (a, Na, Ν / 2-a, Ν / 2 + a) as shown in Figure 8 As a method of reporting sequence allocation, the number of bits required to report sequence allocation can also be reduced.

Furthermore, a preamble sequence used in a random access may be explained in the present embodiment as an example, but the present invention is not limited thereto and can also be applied to a case where a plurality of Zadoff-Chu sequences, or sequences GCLs are used in a BS as known signals. Known signals include the channel estimate reference signal and the pilot signal for link synchronization has

1P J

MEXICAN INSTITUTE Τ '· OF THE PROPERTY -

INDUSTRIAL downstream (synchronization channel).

Furthermore, present invention concentrated administration type system configuration wherein a sequence allocation section 52 exists in a plurality of BSs as shown in Figure 1, but the system can also adopt a distributed administration type system configuration as shown in Figure 9 where each BS is provided with a sequence allocation section and the information is exchanged in such a way that the mutually different sequence numbers r of the sequences

Zadoff-Chu are assigned in a plurality of BS.

Furthermore, the present embodiment has described the complex conjugate, the present invention is not limited to this as long as the relationship is maintained where the absolute values ​​of the amplitudes of the coefficients of the real part and the imaginary part are the same.

Mode 2

A case in Mode 1 where the preamble sequences are generated and detected in the time domain has been explained, and a case in Mode 2 of the present invention where the preamble sequences are generated and detected in will be explained. frequency domain. The UE configuration according to Mode 2 of the present invention is similar to that of Mode 1 shown in Figure 3, and will therefore be explained using Figure 3.

exiled a

<img file="MX338548B_D0030.tif" />

Figure 10 is a block diagram showing IWUtísLrít · a configuration of the RA 162 burst generation section according to Mode 2 of the present invention. In this figure, the burst generation section RA 162 is provided with the sequence generation section AC 171, the IDFT section 172, and the addition section CP 173.

The sequence generation section ZC 171 generates a Zadoff-Chu sequence in the frequency domain and outputs the respective coefficients (symbols) of the Zadoff-Chu sequence generated to predetermined subcarriers of section IDFT 172.

Section IDFT 172 applies the transformation of

Inverse Discrete Fourier (IDFT) to an input signal sequence that includes the Zadoff-Chu sequences that occur from the ZC 171 sequence generation section to default subcarriers and NULL (value: 0) carried out on the remaining subcarriers, and outputs the time domain signal to the CP 173 add section.

The CP addition section 173 binds a cyclic prefix (CP) to the time domain signal that is produced from the IDFT section 172, and outputs the time domain signal to the multiplex section 166. Herein, CP refers to the portion of a sequence that duplicates a predetermined length of a signal sequence from the end of the produced time domain signal of the IDFT section

IMPI

MEXICAN INSTITUTE OF INDUSTRIAL PROPERTY

<img file="MX338548B_D0031.tif" />

172, added to the main part of the signal — d & i — d ^ mi ni r> ....._ of time. Incidentally, the addition section CP 173 can be omitted.

Then, the generation of the Zadoff-Chu sequence in the frequency domain through the ZC 171 sequence generating section shown in Figure 10 and an example of assignment to the subcarriers through the IDFT section 172 will be explained using the Figure 11.

First, the Zadoff-Chu sequence generated in the frequency domain through the ZC sequence generator section will be displayed using equations. Sequence

Zadoff-Chu that has a sequence length N is expressed by equation 5 when N is an even number and is expressed by equation 6 when N is a non number.

Here, although the equations are the same as for the Zadoff-Chu sequence in Mode 1, since the Zadoff-Chu sequence will be defined in the frequency domain, the equations will be redefined using symbols to make a distinction from the definition in the time domain of the

Mode 1.

C „(«) = exp &lt;

-J.2toí

ΛΊ (Equation 5)

C_to(n) = exp &lt;-y. 2w «(« +!) + Qn (Equation 6)

JL

MEXICAN INSTITUTE

OF THE PROPERTY

INDUSTRIAL

<img file="MX338548B_D0032.tif" />

where n = 0, 1, 2, ..., Nl, q is — a num?¹ arbitrary integer, is a sequence number (sequence index), and N is a number co-prime to N and a minor integer of N. The Zadoff-Chu sequence generated in the frequency domain expressed by equation 5 and the equation 6 can be transformed into a Zadoff-Chu sequence generated in the time domain by the application of the Fourier transformation. That is, a Zadoff-Chu sequence generated in the frequency domain becomes a Zadoff-Chu sequence in the time domain, too.

As shown in Figure 11, the respective coefficients C_or(n) of the Zadoff-Chu sequence generated in equation 5 or in equation 6 in the generator section of sequence ZC 171 are adapted to the subcarriers of section IFFT 172 in the order of C_or(0), C_or(l), C_or(2 C_OR(N-1). NULL (no input signal or value 0) are normally set in the remaining subcarriers of section IFFT 172.

The operations of sequence allocation section 52 of the present embodiment (see Figure 1) are the same as for Mode 1 in Figure 4 except that the symbol indicates a sequence number that changes from ra u. Furthermore, the method for reporting indices in report section 53 is also the same as for Mode 1, and when an even number of sequences is always assigned to a cell, it is possible to reduce the required number of bits when the

<img file="MX338548B_D0033.tif" />

sequence allocation reports giving an index 5ΤΓΠ for sequences u = ayu = Na.

It is also possible to further reduce the number of bits required when sequence allocation is reported by setting 4, 8, ... as pairs of sequence numbers assigned to an index.

<td>Already</td><td>than</td><td>setting up a</td><td>BS agree</td><td>with</td><td>the</td>

<td>Mode 2</td><td>of</td><td>the present invention</td><td>It's similar</td><td>to</td><td>the</td>

<td>setting</td><td>of</td><td>Mode 1 shown</td><td>in the figure</td><td> 2,</td><td>the</td>

Figure 2 will be used for explanations of it.

FIG. 12 is a block diagram showing an internal configuration of the preamble sequence detection section 114 in accordance with Mode 2 of the present invention. In this figure, the preamble sequence detection section 114 is provided with the DFT section 181, the complex multiplication sections 182-1 through 182-Nl, and the IDFT sections 183-1 and 183-2. Here, a sequence length N = ll will be illustrated as an example.

Section DFT 181 applies the discrete Fourier transform (DFT) to the received signal produced in demultiplexing section 112 and outputs a frequency domain signal to complex multiplication sections 182-1 through 182-Nl and sections IDFT 183-1 and 183-2.

Incidentally, DFT processing and IDFT processing can be replaced by FFT processing

AJ

MEXICAN INSTITUTE

OF THE PROPERTY

INDUSTRIAL

<img file="MX338548B_D0034.tif" />

(fast Fourier transformation) and IFFT (- ^ - r anus formation — fifi inverse fast Fourier) respectively.

Here, assuming that the frequency domain signal produced from the section

DFT

181 is

X (n) = Re {X (n)} + j Im {X (n)}, if each coefficient of the sequence u = a is

Zadoff-Chu with a sequence number C_{u = a}* (n) = Re {C_{u = a}* (n)} + j Im {C_{u = a}* (n)}, the calculation is Y_{u = a}(n) with respect to the correlation on the u = a side of the sequence of complex multiplication sections 182-1 to 182-Nl as shown in Equation 7 below.

and, „(») = Re {Jf («)} Re {CL („)) - ta {^ (n)) Im {Cl «)} _ _. _{(Equation 7)} +7 (Im {T (»)) Re {CL (n)} + Re {T (»)) Im {C;_-(«)})

On the other hand, each coefficient of the sequence

Zadoff-Chu with sequence number u = Na is C_{U = K}_ _to* (n) = Re (C_or=_to* (n)) * = Re {C_{u = a}* (n)} -jIm. {C_{u = a}* (n)} and the calculation is Y_or= Na (n) with respect to the correlation on the side of the sequence u = Na as shown in the following equation 8.

^_{= W}-J «) = Re {^ («)} Re {C „'_{= to}(/ 7)} + Im {X (n)} Im {C;_{= íJ}(»)}„, '' Equation 8) +7 (Im {X (n)} Re {C ^ (_W)} - Re {xV (_W)} Im {C;_{= fl}(»)})

Figure 3 is a block diagram showing an internal configuration of the complex multiplication section 182-n (l &lt;n &lt;Nl) shown in Figure 12. In this figure, the multiplication section 191-1 multiplies Re {X (n)}

I / ·· *

Jl jL MEXICAN INSTITUTE

DF. INDUSTRIAL PROPERTY

<img file="MX338548B_D0035.tif" />

by Re {C_or=_to* (n)} and outputs the result of 15 nurí-t iplioaión - addition sections 192-1 and 192-3.

Multiplication section 191-2 multiplies Im {X (n)} by Im {C_or=_to* (n)} and outputs the multiplication result to addition sections 192-1 and 192-3.

Also, multiplication section 191-3 multiplies Im {X (n)} by Re {C_or=_to* (n)} and outputs the multiplication result to addition sections 192-2 and 192-4.

Also, multiplication section 191-4 multiplies Re {X (n)} by Im {C_{u = a}* (n)} and outputs the multiplication result to addition sections 192-2 and 192-4.

Addition section 192-1 adds up the multiplication results produced from multiplication sections 191-1 and 191-2 and outputs the addition results Re {Y_{u = a}(n)}. On the other hand, addition section 192-3 adds up the multiplication results produced from multiplication sections 191-1 and 192-2 and outputs the result of addition Re {Y_or=_N-_to (n)}

Furthermore, addition section 192-2 adds up the multiplication results produced from multiplication sections 191-3 and 191-4 and outputs the addition result Re {Y_{u = a}(n)}. In addition, the addition section 192-4 adds up the multiplication results produced from the

MEXICAN INSTITUTE

OF THE PROPERTY

INDUSTRIAL

<img file="MX338548B_D0036.tif" />

multiplication 191-3 and 192-4 and outputs the result of the addition Im {C_{u = N}__to (n)}.

The internal configuration of the complex multiplication section 182-n shown in Figure 13 is equal to the configuration of the complex multiplication section of Mode 1 shown in Figure 7.

Accordingly, the results of operations

<td colspan="2">of multiplication led to</td><td>cape</td><td>to get the</td><td>value</td><td>of</td>

<td>correlation</td><td>on the side of</td><td>the</td><td>sequence r = a,</td><td>Re {X (n)</td><td> )}·</td>

<td>Re {C_{u = a}* (n)},</td><td>Im {X (n)} Im {C_{u = a}*</td><td>(n)},</td><td>Im {X (n)} · Re {C_{u = a}</td><td>* (n)}</td><td>and</td>

Re {X (n)} Im {C_{u = a}* (n)} can be used to calculate a correlation value on the sequence side r = N, and therefore it is possible to reduce the amount of multiplication operation and reduce the scale of the circuit (the number of multipliers).

<td></td><td>When N is</td><td>a</td><td>number non and</td><td>q = 0,</td><td>already</td><td>what a</td>

<td>sequence</td><td>Zadoff-Chu</td><td>this</td><td>in relation</td><td>with</td><td>the</td><td>sequence</td>

<td>symmetric</td><td>uniform (</td><td>every</td><td>element of</td><td>the</td><td colspan="2">sequence is</td>

C_or (n) = C_OR (Nlk)), the correlator carries out the processing of the addition on the elements of k and Nlk before the multiplication operation, and therefore it is also possible to reduce the number of multiplications (the number of multipliers) in half.

In this way, when a plurality of different Zadoff-Chu sequences are assigned to a cell, Mode 2

MEXICAN INSTITUTE OF INDUSTRIAL PROPERTY.

<img file="MX338548B_D0037.tif" />

combines and assigns sequence numbers that have a reLarrÓTr 'where the absolute values ​​of the amplitude of the coefficients of the real part and the imaginary part of the sequence whose each element is C_or(n) is equal (or complex conjugate to each other), and therefore the number of calculations and circuit scales of the correlation circuit in the frequency domain on the reception side can be reduced without deteriorating the detection characteristics of sequence.

A case has been explained in the present embodiment where the sequence length N is a prime number (non number) but the sequence length N can also be a non-prime number (e ither a non number or an even number). However, when the sequence length N is an even number, assume that the preamble sequence assignment rule is u = a - »u = Na -» u = N / 2-a - »u = N / 2 + a (where, 1 &lt;a &lt;N / 2-l, in addition, the order of allocation can be arbitrary) therefore it is possible to carry out the calculation of the correlation of four different sequences with an amount of multiplication operation (the number of multiplies) for a sequence. Therefore, the amount of multiplication operation and the number of multipliers in a sequence can be reduced to approximately 1/4. Furthermore, when the length N of the sequence is an even number, it is also possible to reduce the number of bits required for reporting the

<img file="MX338548B_D0038.tif" />

MEXICAN INSTITUTE OF PROPERTY

INDUSTRIAL

<img file="MX338548B_D0039.tif" />

sequence assignment by assigning 'de - un lndlóé' Ώ four sequence combinations of u = (a, Na, Ν / 2-a, Ν / 2 + a) as the sequence allocation reporting method as in the case from Figure 8.

Mode 3

A case will be explained in Mode 3 of the present invention where the preamble sequences are generated in the time domain and the preamble sequences are detected in the frequency domain.

Since the configuration of a UE according to Mode 3 of the present invention is similar to the configuration of Mode 1 shown in Figure 3, Figure 3 will be used for the explanation thereof.

FIG. 14 is a block diagram showing a configuration of the burst generator section RA 162 in accordance with Mode 3 of the present invention. Figure 14 is different from Figure 10 in that the DFT section of point N 202 is added and the sequence generation section ZC 171 is changed to the sequence generation section ZC 201.

The sequence generating section ZC 201 generates a Zadoff-Chu sequence in the time domain and outputs each coefficient (symbol) of the Zadoff-Chu sequence generated to the DFT section of point N 202.

The DFT section of point N 202 has the same number of points as the length N of sequence with the sequence

IMPI

MEXICAN INSTITUTE OF INDUSTRIAL PROPERTY

<img file="MX338548B_D0040.tif" />

Zadoff-Chu, transforms the Zadoff-Chu sequences 'tíh the points' N produced from the modulating section of sequence ZC 201 to the frequency components and outputs the frequency components to be the default subcarriers of section IDFT 172.

Incidentally, Figure 14 shows an example of the configuration of the DFT-S-OFDM signal (multiplexing of the expanded orthogonal frequency division in the discrete Fourier transformation) and the time domain signal of the Zadoff-Chu sequence to be produced from the sequence generation section ZC 201 to the addition section CP 173 can be directly generated without using the point DFT section N 202 and the IDFT section 172.

The operation of the sequence assignment section 52 (see Figure 1) according to the present modality is equal to those of Mode 1 in the sequence number r = a and r = Na assigned in pairs, and different from the equation of the Zadoff-Chu sequence generated in the ZC 201 sequence generator section.

To be more specific, the Zadoff-Chu sequence generated in the time domain through the sequence generating section ZC 201 is assigned such that the sequence of r = a and the sequence resulting from the cyclic change r = Na by mo the sequence resulting from the cyclic change of r = a by m and the sequence of r = Na are connected.

MEXICAN INSTITUTE OF EROPIEDAD

INDUSTRIAL

<img file="MX338548B_D0041.tif" />

Here, m varies depending on the value of q in equations 1 to 4. Figure 15 shows a relationship between m and q when the length N of the sequences is a number non. For example, m = Nl (= - l) when q = 0 and m = N-3 (= 3) when q = l.

When the length N of the sequence is a prime number and q = 0, the Zadoff-Chu sequence generated in the time domain by the generating section of by the following equation the sequence of r = a is resulting from the change sequences z, c zur is added from equation 2 when paired with the cyclic sequence of r = Na per m.

-J2 / zr k (k + l) '/ 7 \ _ í i (A + · (£ +! + / ») Mode JV *> = # - 0 («) - expi - JI ””' '' ”^ 2.............................................

(Equation 9)

Here, since modeN can be omitted, equation 9 can be expressed by the following 19.

^cr = &lt;#) = ^formerP

W'l 2, j

... f .2nr ((k + m) (k + 1 + /? ζ) ή = ^formerP | - '(Equation 10)

Similarly, the case where the sequence resulting from the cyclic exchange r = a by m is connected with the sequence of r = Na can be expressed by the following equation

IMPIOUS"*

MEXICAN INSTITUTE

OF PROPERTY C%

INDUSTRIAL

11.

c „.« = exp {-y ^ (&lt;í ± 2! ffi ± i ± ^ ^Cr = JV - &lt;#) = ^formerP .270 (kík + X '} ^ where, k = 0, 1, 2, ..., sequence (sequence index).

(Equation 11) ^J . . .

N-1 and r is a number of In addition, r is a number

<td>coprime to N and is an integer less than N.</td><td></td><td></td>

<td>Then the index reporting method</td><td>of</td><td>the</td>

<td>report section 53 according to Mode 3</td><td>of</td><td>the</td>

<td colspan="2">The present invention will be explained. The indices are determined</td><td>by</td>

the sequence numbers assigned to each cell through sequence allocation section 52 according to a table as shown in Figure 16. In Figure 16, the sequence number r = l, N-1 and the amount of the initial change m are associated with index 1 and the sequence number r = 2, N-2 and the amount of the initial change associated with index 2. Similar associations are also made with the indexes of progressive index 3. In Figure floor (N / 2), denotes an integer not greater than N / 2.

The indices determined in this way are broadcast to the UEs from the BS through the broadcast channels. The EU side will also be provided with the same table as shown in Figure 16 and identifies the pair of available sequence numbers using the reported indices.

<img file="MX338548B_D0042.tif" />

In this way, when a plurality of different Zadoff-Chu sequences is assigned to a cell, Mode 3 assigns the sequence numbers in the combinations that the relationship controls the absolute values ​​of the amplitudes of the coefficients of the real part and the part Imaginary of the Zadoff-Chu sequence that are defined in the time domain and where each element is C_r(k), is equal to or a complex conjugate to each other, and furthermore gives a predetermined amount of initial cyclic change of one or both pair-assigned sequences, and may therefore reduce the amount of computation and circuit scale of the correlation circuit by frequency domain on the reception side without deteriorating the detection characteristics of the sequence.

A case has been explained as an example with the present modality where the Zadoff-Chu sequence is defined in the time domain and the preamble detection is carried out in the frequency domain (calculation of the correlation in the frequency domain ), but in the case where the Zadoff-Chu sequence is defined in the frequency domain and the detection of the preamble is carried out in the time domain (calculation of correlation in the time domain) as in the case of Mode 3 , it is possible to maintain the relationship where the absolute values ​​of the amplitudes of the coefficients of the real part and the imaginary part are equal with respect to the coefficient of two sequences

<img file="MX338548B_D0043.tif" />

ΙΝχΤΙΙΌΤΟ MEXICAN PROPERTY

INDUSTRIAL

Zadoff-Chu in the time domain through tte — ΪΉ — 3 ^ Τφ1ΑΤ'Γ0Τϊ of the Zadoff-Chu sequences such that the sequence of u = a and the sequence that results from the cyclic change u = Na to + a or the sequence resulting from the cyclic change u = a by -a and the sequence of u = Na connect. This can reduce the amount of computation and circuit scale of the correlation circuit in the time domain on the receiving side.

Furthermore, a case has been explained in the above-described embodiments where the Zadoff-Chu sequences are used, but the present invention is not limited thereto and the GCL sequences can also be used.

The configurations have been explained with the previously described modalities where the sequence allocation section 52 and the report section 53 are included in the radio resource management section 51 or BS as an example, but the present invention is not limited to this, and the present invention also applies to any other apparatus such as a regulatory station and a UE that includes sequence allocation section 52 and reporting section 53 and can report indices indicating a sequence number r.

Furthermore, the modalities described above have been explained using a base station (BS) and a terminal station (UE) as an example, and the base station may also be referred to as an access point (AP), station

IMP I

MEXICAN INSTITUTE OF INDUSTRIAL PROPERTY

<img file="MX338548B_D0044.tif" />

regulatory, regulatory terminal, Node B, eNodu B ¹ or S'lltlíTaTT In addition, the terminal station may also be referred to as a mobile station (MS), station, UE (user equipment), terminal end (TE), regulatory station, regulatory terminal or the like.

A case has been explained in the previously described modalities where the present invention is configured through hardware as an example, but the present invention can also be implemented by software.

Furthermore, each functional block used for explanations of the modalities described above is typically implemented as an LSI which is an integrated circuit. These can be integrated on a single chip individually or can be integrated on a single chip to include some or all of the functional blocks. Herein, the term LSI is used, but the term may also be IC, System LSI, Super LSI, or Ultra LSI depending on the difference in degree of integration.

Furthermore, the technique for implementing an integrated circuit is not limited to an LSI but can also be implemented as a dedicated circuit or a general-purpose processor. It is also possible to use a programmable FPGA (Field Programmable Gate Array) or a reconfigurable processor whose connections or circuit cell configurations within the LSI are

<img file="MX338548B_D0045.tif" />

IMPI

MEXICAN INSTITUTE

OF THE PROPERTY

INDUSTRIAL reconfigure after LSI manufacturing. ......

Furthermore, if a technology of making an integrated circuit that can be replaced by an LSI appears with the advancement of semiconductor technologies or other derived technologies, it is of course possible to integrate functional blocks using the technology. The application of similar biotechnology can be considered as a possibility.

The description of the Japanese Patent Application No. 2006-269327, filed on September 29, 2006, and the Japanese Patent Application No. 2006-352897, filed on December 27, 2006, includes the specification, figures and summary, they are incorporated herein by reference in their entirety.

Industrial Applicability

The sequence allocation method and sequence allocation apparatus according to the present invention can reduce the amount of computation and circuit scale of a receiver-side correlation circuit in a system where a plurality of different sequences Zadoff-Chu or GLC sequences are assigned to a cell, and is applicable to, for example, a mobile communication system.

<td>It is noted that in relation to</td><td>at this date,</td><td>the</td>

<td>best method known to the applicant</td><td>to carry</td><td>the</td>

<td colspan="2">practice the aforementioned invention, is what is clear from</td><td>the</td>

present description of the invention.

<img file="MX338548B_D0046.tif" />

MEXICAN INSTITUTE OF INDUSTRIAL PROPERTY

<img file="MX338548B_D0047.tif" />