ES2380698T3

Sequence generating method for detection and method for transmitting and receiving signals using the same

Abstract

A method of transmitting signals to a receiver in a transmitter of a mobile communication system based on an orthogonal frequency division multiplexing scheme, the procedure comprising: mapping a sequence with frequency domain resource elements, in which the sequence is generated in the frequency domain from a specific CAZAC sequence according to one of the root indices selected in a set of root indices comprising a first and a second index, where the sum of the first and second index corresponds to the odd length of the specific CAZAC sequence; convert the sequence mapped with the frequency domain into a time domain transmission signal; and transmit the time domain transmission signal to the receiver.

ES2380698T3, drawing sheet 1 — Sheet 1 of 45

Term

1.2 yearsto projected expiry

Projected expiry 19 December 2027, counted from filing; an application has no term until it is granted.

28 claims: 4 independent, 24 dependent

1
ES 2 380 698 T3 REIVINDICACIONES 1. - Un procedimiento de transmisión de señales a un receptor en un transmisor de un sistema de comunicaciones móviles basado en un esquema de multiplexación por división de frecuencia ortogonal, comprendiendo el procedimiento:mapear una secuencia con elementos de recurso de dominio de frecuencia, en el que la secuencia se genera en el dominio de frecuencia a partir de una secuencia CAZAC específica según uno de los índices de raíz seleccionados en un conjunto de índices de raíz que comprende un primer y un segundo índice, donde la suma del primer y del segundo índice corresponde a la longitud impar de la secuencia CAZAC específica;convertir la secuencia mapeada con el dominio de frecuencia en una señal de transmisión de dominio de tiempo;y transmitir la señal de transmisión de dominio de tiempo al receptor.
2
- El procedimiento según la reivindicación 1, en el que la secuencia se genera a partir de una secuencia de ZadoffChu que tiene una longitud de número impar, y en el que una ecuación para generar la secuencia a partir de la secuencia de Zadoff-Chu se basa en la siguiente ecuación:en la que la longitud de la secuencia de Zadoff-Chu es “N”, “M” es un índice de raíz de la secuencia de Zadoff-Chu, y n es el índice de cada uno de los componentes constituyentes de la secuencia generada, y en el que la suma del primer índice y del segundo índice es “N.
3
- El procedimiento según la reivindicación 2, en el que “N” es 63, y el primer índice y el segundo índice son 34 y 29, respectivamente.
4
- El procedimiento según la reivindicación 1, en el que el conjunto de índices de raíz comprende 3 índices.
5
- El procedimiento según la reivindicación 4, en el que el conjunto de índices de raíz comprende 34, 29 y 25 como el primer índice, el segundo índice y un tercer índice, respectivamente.
6
- El procedimiento según la reivindicación 1, en el que el transmisor utiliza la secuencia generada como una secuencia de transmisión de P-SCH (SCH primario).
7
- El procedimiento según la reivindicación 1, en el que el transmisor utiliza la secuencia generada como una secuencia de transmisión de preámbulo de enlace ascendente.
8
- Un transmisor para transmitir señales a un receptor de un sistema de comunicaciones móviles basado en un esquema de multiplexación por división de frecuencia ortogonal (OFDM), comprendiendo el transmisor:una unidad de mapeo (504) adaptada para mapear una secuencia con elementos de recurso de dominio de frecuencia, donde la secuencia se genera en el dominio de frecuencia a partir de una secuencia CAZAC (autocorrelación constante de amplitud cero) específica según uno de los índices de raíz seleccionados en un conjunto de índices de raíz que comprende un primer y un segundo índice, donde la suma del primer y del segundo índice corresponde a la longitud impar de la secuencia CAZAC específica;un módulo IFFT (505) adaptado para convertir la secuencia mapeada con el dominio de frecuencia en una señal de transmisión de dominio de tiempo;y una unidad de radiofrecuencia (RF) adaptada para transmitir la señal de transmisión de dominio de tiempo al receptor.
9
- El transmisor según la reivindicación 8, en el que la secuencia se genera a partir de una secuencia de Zadoff-Chu que tiene una longitud de número impar, y en el que una ecuación para generar la secuencia a partir de la secuencia de Zadoff-Chu se basa en la siguiente ecuación:ES 2 380 698 T3 en la que la longitud de la secuencia de Zadoff-Chu es “N”, “M” es un índice de raíz de la secuencia de Zadoff-Chu, y n es el índice de cada uno de los componentes constituyentes de la secuencia generada, y en el que la suma del primer índice y del segundo índice es “N.
10
- El transmisor según la reivindicación 9, en el que “N” es 63, y el primer índice y el segundo índice son 34 y 29, respectivamente.
11
- El transmisor según la reivindicación 8, en el que el conjunto de índices de raíz comprende 3 índices.
12
- El transmisor según la reivindicación 11, en el que el conjunto de índices de raíz comprende 34, 29 y 25 como el primer índice, el segundo índice y un tercer índice, respectivamente.
13
- El transmisor según la reivindicación 8, en el que el transmisor utiliza la secuencia generada como una secuencia de transmisión de P-SCH (SCH primario).
14
- El transmisor según la reivindicación 8, en el que el transmisor utiliza la secuencia generada como una secuencia de transmisión de preámbulo de enlace ascendente.
15
- Un procedimiento de detección de una secuencia utilizada en una señal Rx recibida por un receptor de un sistema de comunicaciones móviles basado en un esquema de multiplexación por división de frecuencia ortogonal, comprendiendo el procedimiento:recibir la señal Rx desde un transmisor;y detectar la secuencia utilizada en la señal Rx, en el que la secuencia utilizada en la señal Rx se genera en el dominio de frecuencia a partir de una secuencia CAZAC específica según uno de los índices de raíz seleccionados en un conjunto de índices de raíz que comprende un primer y un segundo índice, en el que la suma del primer y del segundo índice corresponde a la longitud impar de la secuencia CAZAC específica.
16
- El procedimiento según la reivindicación 15, en el que la secuencia utilizada en la señal Rx se genera a partir de una secuencia de Zadoff-Chu que tiene una longitud de número impar, y en el que una ecuación para generar la secuencia a partir de la secuencia de Zadoff-Chu se basa en la siguiente ecuación:en la que la longitud de la secuencia de Zadoff-Chu es “N”, “M” es un índice de raíz de la secuencia de Zadoff-Chu, y n es el índice de cada uno de los componentes constituyentes de la secuencia generada, y en el que la suma del primer índice y del segundo índice es “N.
17
- El procedimiento según la reivindicación 16, en el que “N” es 63, y el primer índice y el segundo índice son 34 y 29, respectivamente.
18
- El procedimiento según la reivindicación 15, en el que el conjunto de índices de raíz comprende 3 índices.
19
- El procedimiento según la reivindicación 18, en el que el conjunto de índices de raíz comprende 34, 29 y 25 como el primer índice, el segundo índice y un tercer índice, respectivamente.
20
- El procedimiento según la reivindicación 15, en el que la señal Rx es una señal de P-SCH (SCH primario). ES 2 380 698 T3
21
- El procedimiento según la reivindicación 20, que comprende además:llevar a cabo una sincronización con el transmisor en función de la detección de la secuencia utilizada en la señal Rx.
22
- Un receptor para detectar una secuencia utilizada en una señal Rx recibida en un sistema de comunicaciones móviles basado en un esquema de multiplexación por división de frecuencia ortogonal, comprendiendo el receptor:una unidad de radiofrecuencia adaptada para recibir la señal Rx desde un transmisor;y un desmapeador de índices adaptado para detectar la secuencia utilizada en la señal Rx, en el que la secuencia utilizada en la señal Rx se genera en el dominio de frecuencia a partir de una secuencia CAZAC específica según uno de los índices de raíz seleccionados en un conjunto de índices de raíz que comprende un primer y un segundo índice, en el que la suma del primer y del segundo índice corresponde a la longitud impar de la secuencia CAZAC específica.
23
- El receptor según la reivindicación 22, en el que la secuencia utilizada en la señal Rx se genera a partir de una secuencia de Zadoff-Chu que tiene una longitud de número impar, y en el que una ecuación para generar la secuencia a partir de la secuencia de Zadoff-Chu se basa en la siguiente ecuación:donde la longitud de la secuencia de Zadoff-Chu es “N”, “M” es un índice de raíz de la secuencia de Zadoff-Chu, y n es el índice de cada uno de los componentes constituyentes de la secuencia generada, y en el que la suma del primer índice y del segundo índice es “N.
24
- El receptor según la reivindicación 23, en el que “N” es 63, y el primer índice y el segundo índice son 34 y 29, respectivamente.
25
- El receptor según la reivindicación 22, en el que el conjunto de índices de raíz comprende 3 índices.
26
- El receptor según la reivindicación 25, en el que el conjunto de índices de raíz comprende 34, 29 y 25 como el primer índice, el segundo índice y un tercer índice, respectivamente.
27
- El receptor según la reivindicación 22, en el que la señal Rx es una señal de P-SCH (SCH primario).
28
- El receptor según la reivindicación 22, en el que el receptor lleva a cabo una sincronización con el transmisor en función de la detección de la secuencia utilizada en la señal Rx.

Independent claims28

1,292 paragraphs in 52 sections, as filed

IS 2 380 698 T3

DESCRIPTION

Sequence generation procedure for the detection and procedure for the transmission and reception of signals using the same

Cross reference to related requests

Background of the invention

Field of the invention

The present invention relates to a signal transmission / reception method for use in a communication system based on an orthogonal frequency division multiplexing (OFDM) scheme and, more particularly, to a sequence generation procedure. which enables a receiving end to efficiently detect a sequence used for a specific channel of the mobile communication system, and to a signal transmission / reception procedure using this sequence generation procedure.

Related Art Analysis

The OFDM, OFDMA and SC-FDMA schemes for use in the present invention will now be described in detail.

In recent times, as the demand for high-speed data transmissions increases rapidly, the OFDM scheme is more advantageous for these high-speed transmissions, so that the OFDM scheme is used as a transmission scheme for use in various high-speed communication systems.

Next, the OFDM (orthogonal frequency division multiplexing) scheme will be described.

OFDM scheme

According to the basic principles of the OFDM scheme, the OFDM scheme divides a high-speed data stream into many low-speed data streams, and simultaneously transmits the low-speed data streams through multiple carriers. Each of the carriers is referred to as a subcarrier.

In the OFDM scheme there is orthogonality between multiple carriers. Accordingly, although the frequency components of the carrier overlap each other, the overlapping frequency components can be detected by a receiving end.

More specifically, a high-speed data stream is converted to a low-speed parallel data stream by a serial-to-parallel (SP) converter. The individual subcarriers are multiplied by the previous parallel data streams, the individual data streams are added to the multiplied result, and the summed result is transmitted to the receiving end.

On the other hand, the OFDMA scheme is a multiple access procedure that allows the OFDM system to assign the subcarriers of a total band to each of a plurality of users according to the transmission speed required by each user.

Next, the conventional SC-FDMA (single carrier FDMA) scheme will be described. This SCFDMA scheme is also referred to as a DFS-S-OFDM scheme.

SC-FDMA scheme

Next, the SC-FDMA scheme will be described in detail. The SC-FDMA scheme applied mainly to an uplink carries out the propagation as a function of the DFT matrix in the frequency domain before generating the OFDM signal, modulates the propagation result according to the conventional OFDM scheme and transmits the modulated result.

Some variables are defined to explain the SC-FDMA scheme. "N" indicates the number of subcarriers that transmit the OFDM signal. "Nb" indicates the number of subcarriers for a predetermined user. "F" indicates the discrete Fourier transform (DFT) matrix, "s" indicates a vector of data symbols, "x" indicates a frequency-domain data spread vector, and "y" indicates a vector. of OFDM symbols transmitted in the time domain.

Before the SC-FDMA schema transmits the data symbol (s), the data symbol (s) are scattered, as represented by the following equation 1:

IS 2 380 698 T3

[Equation 1] X = x AVS

In equation 1, FNb x Nb indicates a DFT matrix of size Nb for the scattering of the data symbol (s).

The subcarrier mapping process is carried out on the scatter vector (x) according to a predetermined subcarrier assignment technique. The resulting mapping signal is converted into a time domain signal by the IDFT module, so that a desired signal is obtained to be transmitted to the receiving end. In this case, the transmit signal converted to a time domain signal by the transmit end can be represented by the following equation 2:

[Equation 2]

F7-1 , In equation 2, λχα indicates the N-size IDFT matrix for the conversion of a frequency domain signal into a time domain signal.

Then, a cyclic prefix is inserted into the signal (y) created by the above-mentioned procedure, so that the resulting signal is transmitted. This procedure that can generate the transmission signal and transmits it to the receiving end is called the SC-FDMA procedure. The size of the DFT matrix can be controlled in various ways to implement a specific purpose.

The concepts mentioned above have been disclosed based on the DFT or IDFT operation. For descriptive purposes, the following description will be disclosed without discriminating between the DFT (discrete Fourier transform) scheme and the FFT (fast Fourier transform) scheme.

If the number of input values of the DFT operation is represented by modular exponentiation of 2, it is well known to those skilled in the art that the FFT operation can be substituted for the DFT operation. In the following description, the FFT operation can also be considered as the DFT operation or other equivalent operation without any modification.

Normally, the OFDM system forms a single frame using a plurality of OFDM symbols, so that it transmits the single frame composed of several OFDM symbols in frame units. The OFDM system first transmits the preamble in multi-frame intervals or in each frame. In this case, the number of OFDM symbols in the preamble is different depending on the system types.

For example, the IEEE 802.16 system based on the OFDMA scheme first transmits the preamble made up of a single OFDM symbol at intervals of each downlink frame. The preamble is applied to a communication terminal, so that the communication terminal can synchronize with the communication system, can search for a needed cell, and can perform channel estimation.

FIG. 1 shows a downlink subframe structure of the IEEE 802.16 system. As shown in FIG. 1, the preamble consisting of the single OFDM symbol is positioned in front of each frame, so that it is transmitted before each frame. The preamble is also used to search for the cell, perform channel estimation, and is time and frequency synchronized.

FIG. 2 shows the set of subcarriers that transmit the preamble from the 0-th sector in the IEEE 802.16 system. Some parts of both sides of a given bandwidth are used as the protection band. If the number of sectors is 3, each sector inserts the sequence in intervals of 3 subcarriers, and 0 is inserted into the remaining subcarriers, so that the resulting subcarriers are transmitted to a destination.

The conventional sequence used in the preamble will be described below. The sequence used in the preamble is shown in Table 1 below.

IS 2 380 698 T3

Table 1

<td>Index</td><td>Cell ID</td><td>Sector</td><td>Sequence (hexadecimal)</td>

<td> 0</td><td> 0</td><td> 0</td><td>A6F294537B285E1844677D133E4D53CCBLF18 2DE00489E53E6B6E77065C7EE7D0ADBEAF</td>

The sequence is defined by the sector number and the value of the "Cell ID" parameter. Each defined sequence is converted to a binary signal in ascending numerical order, and the binary signal is mapped to the subcarrier by BPSK modulation.

In other words, the hexadecimal sequence becomes a binary sequence (Wk), the binary sequence (Wk) is mapped into the interval between the MSB (most significant bit) and the LSB (least significant bit). Specifically, the value 0 is mapped to another value +1, and the value 1 is mapped to another value -1. For example, the Wk value of the C12 hexadecimal value in the 0-th segment with index 0 is “110000010010 ...”. The converted binary code value is -1, -1, +1, +1, +1, +1, +1, -1, +1, +1, -1, +1 ....

The sequence according to the conventional technique maintains the correlation characteristics between various types of sequence that can be composed of binary codes. The sequence according to the conventional technique can maintain a low level PAPR (Peak to Average Power Ratio) when the data is converted to other time domain data, and can be obtained by computer simulation. If the structure of the system is changed to another or the sequence is applied to another system, the conventional technique must look for a new sequence.

A new sequence has recently been proposed for use in 3GPP LTE (Long-Term Evolution of Third Generation Collaboration Project, hereinafter LTE) technology, which will be described in detail later.

Various sequences have been proposed for the LTE system. The sequences used in the LTE system will be described below.

To allow the terminal to communicate with the Node-B (ie, the base station), the terminal must synchronize with the Node-B through a synchronous channel (SCH) and must search for the cell.

The above-mentioned operation, in which the terminal is synchronized with the Node-B and the ID of a cell including the terminal is obtained, is referred to as a cell search process. Generally, the cell search is classified into an initial cell search and a neighbor cell search. The initial cell search process runs when the terminal is initially powered up. The neighbor cell search is executed when a terminal in connection mode or idle mode searches for a neighboring Node-B.

The SCH (synchronous channel) can have a hierarchical structure. For example, the SCH can use a primary SCH (P-SCH) and a secondary SCH (S-SCH).

The P-SCH and S-SCH can be included in a radio frame by various procedures.

FIGS. 3 and 4 show various procedures that can include the P-SCH and S-SCH in the radio frame. In various situations, the LTE system can configure the SCH according to the structure of FIGS. 3 or 4.

In FIG. 3, the P-SCH is included in the last OFDM symbol of a first subframe, and the S-SCH is included in the last OFDM symbol of a second subframe (in FIG. 3, the duration of a subframe is assumed to be 0.5 ms, but the subframe length can be set differently depending on the system).

In FIG. 4, the P-SCH is included in the last OFDM symbol of a first subframe, and the S-SCH is included in a second OFDM symbol with respect to the last OFDM symbol of the first subframe (in FIG. 4 it is also assumed that the duration of a subframe is 0.5 ms).

IS 2 380 698 T3

The LTE system can achieve time / frequency synchronization through the P-SCH. In addition, the S-SCH may include a cell group ID, frame synchronous information, antenna configuration information, and so on.

Next, the P-SCH configuration procedure proposed by the conventional 3GPP LTE system will be described.

The P-SCH is transmitted through the 1.08 MHz band as a function of a carrier frequency, and corresponds to 72 subcarriers. In this case, the interval between the individual subcarriers is 15 kHz since the LTE system defines 12 subcarriers as a single resource block (RB). In this case, the 72 subcarriers equal 6 RB.

P-SCH is widely used in a communication system (eg, an OFDM or SC-FDMA system) that can use multiple orthogonal subcarriers, so it must satisfy the following five conditions.

According to the first condition, in order to allow a receiving end to detect superior performance, the above-mentioned PSCH must have superior autocorrelation and cross-correlation characteristics in a time domain associated with constituent sequences of the P-SCH.

According to the second condition, the P-SCH mentioned above must allow low complexity associated with synchronization detection.

According to the third condition, it is "preferable" that the above-mentioned P-SCH can have an Nx repeat structure to implement higher frequency offset estimation performance.

According to the fourth condition, a P-SCH having a low PAPR (peak-to-average power ratio) or a low CM is preferred.

According to the fifth condition, as long as the P-SCH is used as a channel estimation channel, the frequency response of the P-SCH can have a constant value. In other words, from the point of view of channel estimation, it is well known in the art that a flat response in the frequency domain has the best channel estimation performance.

Although the conventional technique has proposed various sequences, the conventional technique cannot sufficiently satisfy the conditions mentioned above.

US 2005/111522 AI describes an apparatus for generating a preamble signal for cell identification in an OFDM mobile communication system. The procedure includes the steps of generating a Walsh code symbol for cell identification by combining Walsh code words that have a predetermined length and generating the preamble signal by multiplying the Walsh code symbol by a pseudo-noise code (PN). which is identical in length to the length of the Walsh code symbol.

Document WO 2006/129166 A describes a method for generating pilot signal sequences with a low peak-to-average ratio comprising the steps of: providing a first signal sequence consisting of a first number, m, of elements of signal and known to have a frequency spectrum with identical or nearly identical nonzero amplitude values in a first frequency range; carrying out a first invertible transformation of the first sequence of signals to a first frequency spectrum in the first frequency range, the first frequency spectrum consisting of m first frequency samples; carry out a second transformation of the first frequency spectrum to a second frequency spectrum consisting of n frequency samples in the first frequency interval, the n frequency samples being formed by the first m frequency samples and a third number, n minus m, of additional second frequency samples, having an amplitude of zero, so that the second frequency spectrum has m frequency peaks distributed in the second frequency range; and performing a third transformation, which forms an inverse of the first transformation, to the second frequency spectrum to obtain a second signal sequence that forms the pilot signal sequence.

The document A comparison of unfütered and filtered complex spreading sequences based on aperiodic correlation properties, by AMIL M ET AL., SPREAD SPECTRUM TECHN / QUES AND APPLICATIONS, 1998.

PROCEEDINGS, 1998 IEEE FIFTH INTERNATIONAL SYMPOSIUM IN CIUDAD DEL SOL, SOUTH AFRICA, September 2 to September 1998, NEW YORK, NY, USA, IEEE, US, volume 3, September 2, 1998 (09/02/1998), pages 686 to 691, XP010307631 ISBN: 978-0-7803-4281-1, describes a polyphase sequence for DS / SSMA communication systems. In addition, polyphasic sequence filtering is explained.

IS 2 380 698 T3

Summary of the invention

Accordingly, the present invention is directed to a sequence generation method for efficient detection, and to a signal transmission / reception method that uses it and that substantially eliminates one or more problems caused by the limitations and disadvantages of the related art. .

An object of the present invention is to provide a method for providing a sequence having superior correlation characteristics.

Another object of the present invention is to provide a method for generating a sequence at a transmitting end and transmitting the sequence, so that a receiving end can easily detect the sequence.

Yet another object of the present invention is to provide a method for effectively detecting the above-mentioned generated / transmitted signal.

Additional advantages, objects and features of the invention will be set forth in part in the following description and in part will be apparent to those skilled in the art upon examination of the following or may be learned from practice of the invention. The objects and other advantages of the invention can be realized and obtained by the structure specifically disclosed in the written description and claims thereto, as well as in the accompanying drawings.

The object is solved by the features of the independent claims.

Preferably, the multiple sequences indicate Zadoff-Chu sequences, and the set of root indices that satisfy the conjugate symmetry property allows the sum of the root indices of the first and second sequences to correspond to the length of the sequences. by Zadoff-Chu.

Preferably, the Zadoff-Chu sequences are odd-numbered in length, and an equation for generating the Zadoff-Chu sequences is denoted by the following equation:

where the length of the Zadoff-Chu sequences is "N", "M" is a root index of the ZadoffChu sequence, and "n" is the index of each constituent component of a specific Zadoff-Chu sequence .

Preferably, the set of root indices, in which the sum of individual root indices of the first and second sequences corresponds to the length of the Zadoff-Chu sequences, is set to make the sum of the indices of individual roots of the first and second sequences is set to the value "N".

Preferably, the length of the Zadoff-Chu sequence is 63, and the root index of the first sequence is set to 34, and the root index of the second sequence is set to 29.

Preferably, the number of the multiple sequences is three, and the root index of a third sequence from among the multiple sequences of the set of root indices is selected considering the influence of a frequency shift.

Preferably, in the set of root indices, the root index of the first sequence is set to 34, the root index of the second sequence is set to 29, and the root index of the third sequence is set to 25.

Preferably, the multiple sequences are used as transmission sequences of P-SCH (primary SCH).

Preferably, the multiple streams are used as uplink preamble transmission streams.

Preferably, a signal transmission method is provided, comprising: selecting one of the root indices included in the set of root indices that allows the sum of individual root indices of a first sequence and a second sequence from among multiple sequences exhibiting each of the root indices of the set of root indices to correspond to the length of the multiple sequences; generating the sequence in the frequency domain or in the time domain according to the selected root index; mapping the generated sequence to a frequency domain resource element; and converting the frequency domain mapped sequence into a time domain transmission signal and transmitting the time domain transmission signal.

IS 2 380 698 T3

Preferably, the multiple sequences indicate Zadoff-Chu sequences that are odd-numbered in length, and an equation for the generation of the Zadoff-Chu sequences is denoted by the following equation:

in which the length of the Zadoff-Chu sequences is "N", the set of root indices, in which the sum of individual root indices of the first and second sequences corresponds to the length of multiple sequences, is set to cause the sum of the individual root indices of the first and second sequences to be set to the value "N", where "M" is a root index of the Zadoff-Chu sequence, and "n" is the index of each constituent component of a specific Zadoff-Chu sequence.

Preferably, a method is provided for calculating a cross-correlation value between a received signal (Rx) and each of the multiple sequences comprising a first sequence and a second sequence, the method comprising: obtaining a plurality of intermediate values generated when calculates a cross-correlation value between the Rx signal and a first sequence of the multiple sequences; and calculating each of the cross-correlation values between the Rx signal and the first sequence of the multiple sequences and between the Rx signal and a second sequence of the multiple sequences by adding or subtracting the intermediate values, where a A root index for the first sequence and a root index for the second sequence are set so that the first sequence and the second sequence fulfill the property of conjugate symmetry.

Preferably, the first sequence and the second sequence, which fulfill the property of conjugate symmetry, satisfy a conjugate-complex relationship with each other.

Preferably, the intermediate values include: a first result value indicating a cross-correlation value between the real part of the Rx signal and the real part of the first sequence; a second result value indicating a cross-correlation value between the imaginary part of the Rx signal and the imaginary part of the first sequence; a third result value indicating a cross-correlation value between the imaginary part of the Rx signal and the real part of the first sequence; and a fourth result value indicating a cross-correlation value between the real part of the Rx signal and the imaginary part of the first sequence.

Preferably, the cross-correlation value between the Rx signal and the first sequence is calculated so that the sum of the first result value and the second result value is the real part, and the difference between the third result value and the fourth value result is the imaginary part.

Preferably, the cross-correlation value between the Rx signal and the second sequence is calculated so that the difference between the first result value and the second result value is the real part, and the sum of the third result value and the fourth value result is the imaginary part.

Preferably, a signal transmission method is provided using a zero amplitude constant autocorrelation sequence (CAZAC), comprising: selecting a predetermined root index and generating the CAZAC sequence in the frequency domain or in the time domain according to the selected root index; continuously mapping the generated CAZAC sequence with a frequency resource element; and converting the frequency domain mapped sequence into a time domain transmission signal, and transmitting the time domain transmission signal, where the time domain transmission signal is transmitted in a state where it is omitted a specific component corresponding to a part of a frequency 0 of the CAZAC sequence, so that the resulting time domain transmission signal does not have any component corresponding to the frequency "0".

Preferably, the time domain transmission signal is transmitted after selectively removing the component corresponding to the frequency 0 portion of the CAZAC sequence.

Preferably, the CAZAC sequence is a Zadoff-Chu sequence with an odd number length, and an equation for the generation of the Zadoff-Chu sequence is denoted by the following equation:

ES 2 380 698 T3 where the length of the Zadoff-Chu sequence is "N", "M" is a root index of the Zadoff-Chu sequence and "n" is the index of each constituent component of a sequence of Zadoff-Chu specific.

Preferably, the length of the Zadoff-Chu sequence is 63 and, in the Zadoff-Chu sequence, the constituent components corresponding to the 0 ~ 30 "value of n (that is, n = 0 ~ 30) are continuously mapped to elements frequency resource from a frequency resource element with a frequency resource element index of "-31" to a frequency resource element with a frequency resource element index of "-1", and the constituent components corresponding to the value 32 ~ 62 "of" n "(ie, n = 32 ~ 62) are continuously mapped with frequency resource elements from a frequency resource element to a frequency resource element index from 1 to a frequency resource element with a frequency resource element index of "31".

Preferably, the Zadoff-Chu sequence is used as a P-SCH transmission sequence (primary SCH).

It should be understood that both the above general description and the following detailed description of the present invention are provided by way of example and explanation and are intended to provide a detailed explanation of the claimed invention.

Brief description of the drawings

The accompanying drawings, which are included to provide a better understanding of the invention, illustrate embodiments of the invention and together with the description serve to explain the principle of the invention.

In the drawings:

FIG. 1 is a structural diagram illustrating a downlink subframe of the IEEE 802.16 system.

FIG. 2 shows the set of subcarriers transmitted from the 0-th sector of the IEEE 802.16 system.

FIGS. 3 and 4 are concept diagrams illustrating various procedures that include P-SCH and S-SCH in a radio frame.

FIG. 5 is a block diagram illustrating transmit / receive endpoints for implementing an embodiment of the present invention.

FIG. 6 is a flow chart illustrating a procedure for maintaining rational correlation characteristics and a procedure for designing a low PAPR sequence in accordance with the present invention.

FIG. 7 shows autocorrelation characteristics of a CAZAC sequence according to the present invention.

FIG. 8 is a conceptual diagram illustrating a procedure for the generation of the P-SCH according to the present invention.

FIG. 9 is a flow chart illustrating a procedure for generating the P-SCH according to the present invention.

FIG. 10 is a conceptual diagram illustrating exemplary subcarriers, each of which is mapped to the P-SCH based on the LTE standard, in accordance with the present invention.

FIG. 11 is a block diagram illustrating a Frank sequence of length 36 in the time domain according to the present invention.

FIG. 12 is a block diagram illustrating the 2x repeating structure in the time domain such that a resulting sequence of length 72 is formed in accordance with the present invention.

FIG. 13 shows the result of step S1703 of FIG. 9 according to the present invention.

FIG. 14 shows the result of step S1704-1 of FIG. 9 according to the present invention.

FIG. 15 shows the result of the circular shift to the right of the result of FIG. 13 according to the present invention.

FIG. 16 is a conceptual diagram illustrating a sequence generation procedure in accordance with the present invention.

FIG. 17 shows the comparison on a constellation map between a sequence that has no CC component and another sequence that has a CC component according to the present invention.

FIG. 18 is a conceptual diagram illustrating a procedure to design a sequence in the domain of

ES 2 380 698 T3 frequency, so that a 2x repeating structure is formed in the time domain according to the present invention.

FIGS. 19 and 20 are graphs illustrating cross-correlation characteristics of the set of indices (1, 2, 34) according to the present invention.

FIG. 21 is a graph illustrating frequency shift sensitivity and a CM under various conditions in accordance with the present invention.

FIGS. 22 to 25 are graphs illustrating autocorrelation profiles of individual sets when a root index is selected in accordance with the present invention.

FIG. 26 is a conceptual diagram illustrating a method for mapping a sequence of length 63 to a frequency domain resource element in accordance with the present invention.

FIGS. 27 and 28 are block diagrams illustrating receiving ends in accordance with the present invention.

Detailed description of the invention

Reference will now be made in detail to the preferred embodiments of the present invention, the examples of which are illustrated in the accompanying drawings. Wherever possible the same reference numerals will be used throughout the drawings to refer to the same or similar parts.

For descriptive purposes and for a better understanding of the present invention, the following detailed description will disclose various embodiments and modifications of the present invention. In some cases, in order to prevent ambiguous concepts of the present invention from occurring, conventional devices or apparatus widely known to those skilled in the art will be omitted and denoted in the form of a block diagram according to the main functions of the invention. present invention.

It should be noted that the present invention generates and transmits a sequence so that a receiving end can efficiently receive or detect a corresponding sequence. To this end, the present invention provides various methods for generating / transmitting a sequence to be used on a specific channel, for example, a method for generating a sequence in the time or frequency domain, a method for mapping of a sequence generated in the time or frequency domain with a frequency domain sequence, a procedure for converting a frequency domain sequence to a time domain sequence, a data processing procedure for removing or avoiding a CC component, and a procedure for generating a sequence exhibiting iterative or repetitive characteristics in the time domain, etc.

Basic realization

The sequence generated by the present invention can be applied to various channels.

For example, the sequence can be applied to an uplink preamble transmission signal (eg, a random access channel (RACH)) or a downlink sync channel, etc. Furthermore, the sequence can be applied to a data channel or to a channel for a control signal and can also be applied to the synchronization channel that enables a time or frequency synchronization process.

For descriptive purposes, although the present invention will describe a method for generating a sequence for synchronization channels (eg, the P-SCH channel), it should be noted that the scope of the present invention is not limited only to the following examples, It can also be applied to other examples.

For example, in case of transmitting specific information through a corresponding channel without establishing a time synchronization, the instantaneous correlation output data of the above-mentioned time synchronization concept is used to obtain corresponding information. Whenever a zero-delay correlation output function is executed, the specific information mentioned above follows the same procedure.

FIG. 5 is a block diagram illustrating transmit / receive endpoints for implementing an embodiment of the present invention.

The transmission end will now be described with reference to FIG. 5. After receiving input data 501, the transmitting end performs channel coding 502 to add redundant bits (also called redundancy bits) to input data 501 so that input data 501 can be prevented from being distorted. in a channel.

The channel coding unit 502 can be implemented by a turbo code or LDPC code, etc. Channel encoding unit 502 may be omitted from a process for transmitting a sync channel or a

ES 2 380 698 T3 uplink preamble. Therefore, the channel coding unit 502 is not a necessary component for the embodiment of this invention that provides a sequence generation method to be used in a synchronization channel or a method for the transmission of uplink preambles.

The resulting data is then input into a symbol mapping unit 504 which can be implemented with QPSK or 16QAM, etc. The symbol-mapped signals are then loaded onto time domain carriers via IFFT 505, and the output signals from IFFT 505 are transmitted to a radio frequency (RF) channel through filter 506 and a DAC (digital to analog converter) 507. The operations of the receiving end are carried out in the reverse order of that of the transmitting end.

FIG. 5 is not an exemplary transmission end structure to implement the sequence generation / transmission procedure to be described later.

FIG. 6 is a flow chart illustrating the basic concept of sequence generation / transmission according to an embodiment of the present invention.

Referring to FIG. 6, the sequence generation method generates a sequence of length N in the time or frequency domain in step S101. In step S101, an embodiment of this invention proposes to select a root index from the set of root indices that allows at least two sequences having indices from that set of indices to fulfill the conjugate symmetry property. Using the sequence having the index that satisfies the conjugate symmetry property, the receiving end can easily detect the received signal by a correlation operation. The conjugate symmetry property and other characteristics of this embodiment will be described later.

On the other hand, if the sequence is generated in the time domain, the sequence generation procedure performs the N-point FFT operation, so that the sequence is mapped to a frequency domain resource element. However, it should be noted that the present invention is not limited to time domain sequence generation, but can be implemented to generate frequency domain sequences. Therefore, for the embodiment that generates sequences in the frequency domain, the FFT or DFT step can be omitted.

On the other hand, according to the requirements of a communication system, the sequence generation method may process a DC (direct current) components and introduce protection subcarriers in step S105. In step S105, the DC component processing is to prevent the generated sequence from having DC components in the frequency domain. This can be accomplished by directly selectively removing the CC component from the sequence, or by some other equivalent operation.

If necessary, the PAPR attenuation technique can be applied to the resulting sequence in step S107, and a corresponding sequence is converted into a time domain sequence by the IDFT or IFT (inverse Fourier transform) operation in step S109. . As described above, it is apparent to those skilled in the art that DFT or FFT can be selectively executed based on the N value.

The sequence generated and / or transmitted by the above scheme can be an uplink preamble, a downlink sync channel signal, or any other equivalent signal.

Next, the sequence generation method and the signal transmission method according to the present invention will be described in more detail.

If the sequence of length N is generated in step S101, the sequence may select a specific index from sets of indices having multiple indices to discriminate sequences, so that it can be generated by the selected index.

In this case, as indicated above, an embodiment of the present invention provides a method of generating sequences selected by indices from the set of indices, wherein at least two of the indices satisfy the property of conjugated symmetry. In this case, the conjugate symmetry property indicates that a sequence corresponding to a specific index is equal to a conjugated complex of another sequence corresponding to another sequence, which will now be described in detail with reference to the following detailed sequence.

In case of using at least one sequence out of multiple sequences, each of which includes an index that satisfies the conjugate symmetry property, the receiving end can greatly reduce the number of cross-correlation calculations, so it can easily detect a desired signal.

The present invention provides a method of omitting a component corresponding to DC subcarriers, as shown at S105, and transmitting the resulting signal.

The individual steps of FIG. 6.

IS 2 380 698 T3

First, the step S101 of forming / generating a sequence of length N will be described.

According to an embodiment of the present invention, the present invention provides not only a method of making the sequence express superior correlation characteristics, but also a method of generating a sequence that can maintain a predetermined amplitude. For this purpose, this embodiment generates a sequence of specific length in the time or frequency domain.

Preferred conditions required for the sequence used in this embodiment will now be described.

As described above, in order to increase the efficiency of a transmitting end amplifier, it is preferable that the transmitting end transmits the sequence to reduce the PAPR. The sequence according to this embodiment may have a predetermined amplitude value in the time domain. It is preferable that the signal amplitude of the sequence can be slightly modified not only in the time domain, but also in the frequency domain.

Although most communication procedures have assigned a predetermined frequency band to a specific transmit / receive end, communication procedures have limited the maximum value of power that can be used in the assigned frequency band. In other words, a generic communications procedure includes a specific spectrum mask. Therefore, if the signal amplitude is irregular in the frequency domain even though a sequence of constant amplitude is transmitted in the time domain, the signal may unexpectedly exceed the spectrum mask after the sequence has been amplified in the frequency domain.

If the channel value is previously recognized in the frequency domain, it is preferable that the system can carry out the power allocation in different ways depending on the good or bad condition of the channel. However, since the system has difficulties in pre-recognizing the channel due to the characteristics of the use of preambles, the power of the subcarrier used is generally constant.

Regarding the above-mentioned flat frequency characteristics, in case of using a corresponding sequence as a specific channel to perform the channel estimation (for example, if the P-SCH is used in the LTE system), the optimal case is decided wherein a reference signal for channel estimation may have the flat frequency characteristics.

In addition to the above-mentioned PAPR characteristics, the sequence according to this embodiment may have superior correlation characteristics to easily detect or discriminate signals. Superior cross-correlation characteristics indicate the presence of superior autocorrelation characteristics and the presence of superior cross-correlation characteristics.

It is preferable that the sequence can be generated by the transmitting end so that the receiving end can easily obtain synchronization. The aforementioned synchronization may indicate frequency synchronization and time synchronization. Generally, if a specific pattern is repeated in a single OFDM symbol in the time domain, the receiving end can easily obtain frequency synchronization and time synchronization.

Therefore, the sequence according to this embodiment can be set so that a specific pattern repeats in a single OFDM symbol in the time domain, but this is not essential. A non-limiting example for generating a sequence having a repeating structure will be described below. For example, during the sequence generation stage, the system may insert a preamble sequence equipped with two identical patterns into a single OFDM symbol generated by the N-point FFT module. There is no limitation on a procedure for generating a sequence of specific length by repeating the same pattern in the time domain. The following examples are provided.

If the N-point DFT or FFT encounters a serious problem, a sequence of length N / 2 is created and repeated twice; then a preamble sequence of full length N can be configured. If a sequence of length N / 4 is generated and repeated twice, and the repeated sequence is inserted, a preamble sequence with a total length of N / 2 can be configured. The preamble sequence of length N / 2 may be of length N / 2 in the frequency domain. In this case, the sequence interval is adjusted in the frequency domain, so that a sequence of length N can be generated.

On the other hand, as indicated above, the present invention can also use a non-repetitive sequence in the time domain. In this case, the repetitive operation mentioned above can be omitted as necessary. In other words, the present invention can also generate a sequence of length N in the time domain or directly in the frequency domain without repeating the sequence of length N. The sequence used in this stage can be a CAZAC sequence, a Golay sequence, a binary sequence, etc.

According to this embodiment, there are several sequences that can be selected considering the conditions mentioned.

ES 2 380 698 T3 above. As an exemplary embodiment, the present invention proposes to use a CAZAC sequence. Although a procedure for forming a sequence of length 1024 in the time domain of the CAZAC sequence and for inserting the same sequence will be described later in more detail, it should be noted that the length of the CAZAC sequence need not be limited to this procedure to as an example.

According to the CAZAC sequence generated by this embodiment, the set of root indices is previously generated to discriminate available CAZAC sequences and a specific root index is selected from the generated sets of root indexes, and a sequence is generated according to the selected index. In this case, it is preferable that the root index selected for the sequence generation can be selected from the set of root indices that satisfy the conjugate symmetry property.

To fulfill the previously mentioned property of conjugate symmetry in the CAZAC sequence, the sum of two root indices of the index set can have different conditions based on specific information that indicates whether the sequence length is denoted by an odd or even number length. If the corresponding sequence length is denoted by an odd length and the sum of two root indices corresponds to a period of an equation that generates the corresponding sequence (in some cases, the length of the sequence), the property of symmetry can be satisfied conjugate mentioned above.

However, the above-mentioned equation for generating the corresponding sequence can change from a basic format equation to another equation to implement a specific purpose. In this case, the condition to fulfill the conjugate symmetry property mentioned above can change to another condition. In fact, the sum of both root indices must correspond to the period of an equation capable of generically generating a corresponding sequence. In relation to this requirement, a detailed description of the sequence generation method according to the present invention will be provided below together with other embodiments applied to a specific sequence.

The sequence according to the present invention can be generated in the time and / or frequency domains according to the same principle. For descriptive purposes, the following embodiment will be described based on a specific example that generates a sequence in the time domain and converts the generated sequence into a frequency domain sequence, since the example that generates the sequence directly in the domain of Frequency can be easily understood because only some steps of the implementation are skipped for time domain sequence generation. However, it should be noted that the scope of the present invention is not limited to this example, but can also be applied to other examples as necessary.

The following description will disclose a specific example shown in the following equation 3.

In this example shown in Equation 3, "M" is set to 1 (where M is a natural number that is relatively prime to N), and a CAZAC (zero amplitude constant autocorrelation) sequence of length 1024. This CAZAC sequence has been described in the document "Po / yphase Codes with Good Periodic Correlation Properties' by David C. Chu, Information Theory IEEE Transaction, vol. 18, number 4, pages 531 and 532, July 1972.

In Equation 3, "n" is equal to 0, 1, 2, ..., N-1. Therefore, "N" corresponds to the sequence length or "equivalent sequence length". The reason that N can be denoted as an equivalent sequence length is that, as indicated above, the generated sequence may have a different length than N in specific cases. For example, the sequence can be generated by any alternative equation to prevent the sequence from having a CC component. Preventing the sequence from having a DC component can be implemented by directly selectively removing the DC component in the frequency domain but, alternatively, the sequence can be generated by omitting a value of n that corresponds to the DC component. In this case, the resulting sequence length can be N-1, not N. But this is a special case and normally N corresponds to the length of the sequence. Furthermore, even in that special case, N corresponds to the substantial sequence length or sequence generation period.

On the other hand, if the sequence length is predetermined, the present invention may use any one of

ES 2 380 698 T3 the two equations shown in Equation 3 according to specific information indicating whether the corresponding sequence has an even number length or an odd number length.

As described above, a specific pattern available for this embodiment can be repeated, so that the CAZAC sequence can repeat the specific pattern by adjusting the value of N. In other words, in Equation 3, provided that the value of M is set to 1 and the value of N is set to 512, the CAZAC sequence is generated and repeated twice, so that a sequence of length 1024 can be generated.

FIG. 7 shows autocorrelation characteristics of a CAZAC sequence according to the present invention.

As described above, the sequence according to this embodiment can have superior correlation characteristics. It can be recognized that time domain autocorrelation characteristics in association with the CAZAC sequence may have ideal autocorrelation characteristics, as shown in FIG. 7. In conclusion, it can be recognized that the CAZAC sequence mentioned above is an example of a sequence that meets various conditions required by this embodiment.

As an optional step according to this embodiment, the step of mapping a generated sequence in the time domain to the frequency domain will be described in detail below.

According to a procedure for converting the time domain sequence into a frequency domain sequence according to a predetermined standard of the OFDM system, the N-point FFT process can be executed on a sequence of length N generated in the time domain as shown. represented by Equation 4 below, so that the sequence of length N can be converted to a frequency domain sequence.

[Equation 4]

JV-1 4 = Σ “/ · '! Λ, λ //=0

In Equation 4, k is equal to 0, 1,2, ..., N-1.

As described above, the time domain sequence generated in the time domain can be converted to a frequency domain sequence Ak, as represented by Equation 4. In addition, for the embodiment that generates sequences in the domain frequency, the sequence generated in the frequency domain needs to be mapped to the frequency resource element by an equivalent operation.

In case of using a CAZAC sequence in this embodiment, it is preferable that the present invention can continuously map the generated sequence with a frequency domain resource element, so that the system can maintain the CAZAC sequence property that maintains amplitude characteristics. Default in time domain (or frequency domain) when the sequence is mapped to the frequency domain resource.

In some embodiments of the present invention, a 2x repeat sequence is used in the time domain, so that the resulting sequence is mapped to the frequency domain. In this case, each sequence component of the frequency domain is mapped to every two subcarriers. The term "continuous mapping" in the present invention is assumed to indicate that the sequence is mapped to one nth specific subcarrier included continuously in the frequency domain, and includes continuous mapping of the sequence with every two subcarriers.

It will now be described, with reference to FIG. 6, step S105 processing the DC subcarrier and inserting the protection subcarrier according to an embodiment of the present invention.

Generally, a specific OFDM communication procedure may request the handling of the DC subcarrier and the insertion of a constant protection subcarrier. If the DC subcarrier and the protection subcarrier must be inserted to meet the predetermined standard of the specific OFDM communication procedure, the above step S105 can be executed.

The above-mentioned DC frequency subcarrier treatment indicates that data 0 is inserted into the subcarrier having frequency 0 in the frequency domain to solve the DC offset problem found in the RF unit of the transmitting unit. /reception. This operation is equivalent to selectively removing the DC component.

Not only can the aforementioned procedure be used that inserts the data "0" in the subcarrier that has the

ES 2 380 698 T3 frequency "0", but other methods capable of obtaining the same effect can also be used as necessary.

For example, the component to be mapped to the DC subcarrier can be omitted in the sequence generation step S101, so that a resulting sequence can be generated that does not have any mapping component. Then, during step S109 to convert the resulting sequence to a time domain sequence, the sequence component corresponding to the DC subcarrier can be omitted.

Therefore, as long as the component corresponding to the DC component having the frequency "0" in the frequency domain is removed from the transmitted signal to the time domain, and a sequence that has no DC component is transmitted to a destination, several procedures may be available.

Furthermore, the insertion of protection subcarriers indicates that protection subcarriers can be inserted to reduce adjacent channel interference (ACI).

According to the present invention, when a corresponding signal is mapped to the subcarrier of the frequency domain, the locations of the subcarriers of the corresponding signal can be arranged in reverse order as necessary. For example, the signal is circularly shifted by as much as the distance of at least one subcarrier and then its mapping process is carried out.

The present invention may also include a random mapping process, although it is preferable that the location in the frequency domain cannot be changed to another location. The embodiment of the present invention will describe a specific case where the location in the frequency domain of the generated signal does not change to another location.

Next, as an optional step, step S107 applying the PAPR attenuation technique to the resulting sequence generated by the above-mentioned steps according to the present invention will be described in detail.

As described above, the time domain signal is converted to another signal by processing the DC subcarrier and inserting the protection subcarriers so that the PAPR can be increased.

This embodiment can again perform the PAPR attenuation technique to reduce the increased PAPR, although this process is not always necessary for the present invention. Thus, during the PAPR attenuation technique, it is preferable that the embodiment can minimize the variation in the amplitude level of the frequency domain sequence codes and that at the same time it can apply the PAPR attenuation technique to the frequency domain sequence codes.

The resulting frequency domain sequences are specific values previously recognized by the transmitting / receiving end, so that they can be used as reference signals for other uses (eg, channel estimation).

According to the embodiment shown in FIG. 6, Next, step S109 converting the above-mentioned sequence into a time domain sequence by IFFT operation will be described.

The above step S109 is used to generate the final time domain preamble sequence and is carried out in the manner represented by the following Equation 5. In this case, the generated sequence can be used to carry out synchronization, detect signals or discriminate the signals.

[Equation 5] i Ύ-1 «„ = -Ea ^2'you'; V

It is preferable that a DC component is omitted from the frequency domain of the resulting signal converted to the time domain signal in step S109. By doing this the time / frequency duality of a CAZAC sequence can be maintained.

The above-mentioned embodiment has described the above-mentioned procedure of time domain sequence generation and conversion of time domain sequence into frequency domain sequence, but it should be noted that the scope of the inventive sequence is not limited only to the aforementioned sequence of the time domain, but it can also be applied to other examples. In other words, it is well known to those of skill in the art that the CAZAC sequence generated in the frequency domain (e.g., a Zadoff-Chu sequence) can be mapped directly to a domain resource element of

ES 2 380 698 T3 frequency.

Realization based on Frank's sequence

Next, a method for applying any one of the CAZAC sequences mentioned above to the P-SCH of the 3GPP LTE system (hereinafter referred to as LTE) according to the present invention will be described.

In greater detail, after repeating the Frank sequence from among the CAZAC sequences in the time domain, this embodiment of the present invention can generate the P-SCH by processing data in the frequency domain, which will be described below in a detailed.

The Frank sequence is a representative example of the CAZAC sequences mentioned above and includes a constant amplitude (ie, a constant envelope) in the time and frequency domains. The Frank sequence has ideal autocorrelation characteristics, and a representative Frank sequence has been described in Phase Shift Pulse Codes with Good Periodic Correlation Properties, by RL Frank and SA Zadoff, IRE Trans. Inform. Theory, volume IT-8, pages 381 and 382, of 1962.

On the other hand, if P-SCH and S-SCH are multiplexed according to the FDM scheme of the LTE system, a P-SCH generation procedure using Frank's sequence has been previously discussed by partner developers.

However, the inventive method proposed by the present invention multiplexes P-SCH and S-SCH according to the TDM scheme and thus implements an improved P-SCH superior to conventional P-SCH.

The comparison between the conventional P-SCH generation method and the inventive P-SCH generation method will now be described in detail.

Frank's sequence can be represented by the following Equation 6:

[Equation 6] a¡g = e, (Λ = 0,1, ..., ΛΓ-1)

In equation 6, Ik is shown in the following Equation 7:

[Equation 7] k

lk~ [-] · (A- mod 772 + I) m 2

In equations 6 and 7, "N" indicates the length of Frank's sequence and must meet the condition N = m; "R" is a natural number, which is a relative prime with respect to m and is less than the value of m.

For example, if N = 4, the sequences shown in Equation 6 have a constellation map such as the QPSK. If N = 16, the aforementioned sequences shown in Equation 6 have a constellation map such as QPSK. If N = 16 and r = 1, the generation of the Frank sequence in the time domain is shown in the following Table 2, and the sequences converted into the frequency domain data are shown in the following Table 3:

IS 2 380 698 T3

Table 2

<td></td><td>In phase</td><td>Quadrature</td>

Table 3

<td></td><td>In phase</td><td>Quadrature</td>

<td> 2</td><td>-square root (1/2)</td><td>square root (1/2)</td>

<td> 3</td><td>-square root (1/2)</td><td>square root (1/2)</td>

<td> 6</td><td>square root (1/2)</td><td>square root (1/2)</td>

<td> 7</td><td>square root (1/2)</td><td>-square root (1/2)</td>

<td> 10</td><td>square root (1/2)</td><td>-square root (1/2)</td>

<td> 11</td><td>-square root (1/2)</td><td>square root (1/2)</td>

<td> 14</td><td>-square root (1/2)</td><td>-square root (1/2)</td>

<td> 15</td><td>square root (1/2)</td><td>-square root (1/2)</td>

IS 2 380 698 T3

The result shown in Table 2 is equal to the result of QPSK modulation , and the result in Table 3 has a constant amplitude.

For example, in case of using the result of Table 3 under the condition that the number of subcarriers actually used is 16, the system can use all 16 subcarriers, regardless of the use or disuse of a scalable bandwidth.

When the timing acquisition is carried out according to the time-domain cross-correlation procedure, if the target data is modulated into other data by the BPSK or M-PSK scheme, the complexity of calculating a correlation value decreases. In this case, the BPSK or M-PSK scheme implements phase rotation in the constellation map to include desired information. In other words, the present invention calculates the correlation value as a function of a simple complex sum using a simple sign converter, instead of a complex operation, so that the complexity of the calculation decreases.

Furthermore, the Frank sequence is indicative of a CAZAC sequence, so it has superior correlation characteristics in all time and frequency domains.

Frank's sequence has a constant value in all time and frequency domains, so it has a low PAPR. If the Frank sequence is used to carry out a channel estimation, the optimal condition is provided.

For example, if the vector of signals “r” received from the time domain with N = 16 and r = 1 is represented by r = [r (0) r (1) ... r (15)], the equation for calculate the correlation value between the signal vector “r” (r = [r (0) r (1) ... r (15)]), the well-known signal “a” (a = [a (0) a (1) ... a (15)]H) and the signal vector can be represented by the following Equation 8:

[Equation 8]

R (d) = r a

In Equation 8, “a” is shown in Table 2 above.

If the R (d) value is calculated directly using Equation 8, a total of 15 complex multiplications and a total of 15 complex sums are needed to calculate a single R (d) value.

However, due to unique properties of the Frank "a" sequence, the present invention can change the code of the real or imaginary part of an Rx signal to be multiplied by another code, and can carry out the addition using the Modified code to calculate correlation value. Therefore, the present invention can finish the aforementioned calculation using only the 15 complex sums instead of the complex multiplication.

Typically, the complexity of a single complex multiplication operation is about 8 times greater than that of a single complex addition.

The procedure proposed above configures the P-SCH using the advantages of the Frank sequence. In other words, it is proposed that the FDM-based P-SCH be mapped to 64 subcarriers using a Frank sequence of length 16.

FIG. 8 is a conceptual diagram illustrating a procedure for generating the P-SCH according to the present invention.

Referring to FIG. 8, a Frank sequence of length 16 is inserted into the frequency domain at intervals of 2 frequency indices. In other words, the sequence in Table 3 is inserted into the frequency domain at intervals of two frequency indices. In this case, the interval of two frequency indices indicates that the mth sequence is inserted into the k-th subcarrier, that no sequence is inserted into the (k + 1) -th subcarrier, and that the (m + 1) - th is inserted into the (k + 2) -th subcarrier.

If the aforementioned sequence inserted into the frequency domain at intervals of two frequency indices is copied into the frequency domain and then expanded, the other sequence of FIG. 8 mapped with a total of 64 subcarriers. The sequence of FIG. 8 is inserted into the time domain at two-sample intervals and then repeated twice.

The present invention can improve the above-mentioned P-SCH generation process in the following respects.

First, the sequence based on the P-SCH generation procedure proposed above includes a specific value that has the value 0 in the time domain, so that the PAPR characteristics deteriorate.

ES 2 380 698 T3 to a large extent. The present invention can mitigate the deterioration of PAPR characteristics.

The above proposed procedure inserts the sequence into an odd subcarrier, instead of an even carrier, to solve the problem caused by the DC carrier (ie, the 0th carrier). In particular, the above proposed method inserts data into the subcarrier having an odd frequency index.

In case of looking at the resulting sequence generated by the above-mentioned scheme in the time domain, the QPSK format in the time domain (i.e. Frank's sequence advantage) inevitably changes to another format, resulting in being causes a serious problem. In particular, the complexity of the complex operation increases, resulting in impractical use. The present invention aims to solve the problem mentioned above.

FIG. 9 is a flow chart illustrating a procedure for generating the P-SCH according to the present invention.

Steps S1701 to S1705 of FIG. 9 with reference to other accompanying drawings.

FIG. 10 is a conceptual diagram illustrating exemplary subcarriers, each of which is mapped to the P-SCH according to the LTE standard.

The P-SCH based on the LTE standard is mapped to 73 subcarriers (including the DC carrier) based on the DC carrier.

This embodiment provides a 2x repeating sequence structure in the time domain (i.e. the sequence repeats twice in the time domain), such that it can generate 73 subcarriers (including the DC carrier) requested by the standard. LTE. In particular, the present invention provides a sequence exhibiting the 2x repeat structure in the time domain.

After the DC subcarriers have been processed, the system uses a Frank frequency of length 71 (not shown in FIG. 10) from a Frank sequence of length 72.

In this case, it is preferable that the 2x repeat sequence in the time domain can be attached to the Frank sequence. Preferably, the length of the Frank sequence is set to 36, and the variable r in Equation 6 is set to 1. If the length of the Frank sequence is set to 36, this Frank sequence can have a constellation map such as 6-PSK.

The reason the Frank sequence length is set to 36 is to generate a target sequence that maps to all 73 subcarriers. In other words, if the sequence is generated by two repetitions of the sequence of length 36, the resulting sequence conforms to the LTE standard.

Needless to say, if the repeat format is not desired, the present invention may select another sequence of length 64 in association with the LTE system. If the P-SCH is generated by four repeats of the sequence, a length 16 Frank sequence can also be used.

Next, step S1701 of FIG. 9.

Referring to FIG. 9, a Frank sequence with a length of N is generatedpre= 36. In this case, “Npre"Indicates the length of an initial sequence that the P-SCH generates. In this case, it is preferable that the variable "r" of Equation 6 is set to "1".

FIG. 11 is a block diagram illustrating a Frank sequence of length 36 in the time domain according to the present invention.

The sequence of FIG. 11 can be represented by a (i), i = 0, 1, ..., 35. The following Table 4 shows values of the real part and values of the imaginary part of the previous value “a (i)”.

IS 2 380 698 T3

[Table 4]

<td></td><td>Real part</td><td>Imaginary part</td>

Next, step S1702 will be described in detail.

In case of using a Frank sequence of length 36, this sequence is repeated twice in the time domain, so that the resulting sequence is generated.

FIG. 12 is a block diagram illustrating the 2x repeat sequence in the time domain such that a resulting sequence of length 72 is formed in accordance with the present invention.

Some parts of the 2x repeat signals of FIG. 12 are shown in the following Table 5:

[Table 5]

<td></td><td>Real part</td><td>Imaginary part</td>

The sequence values shown in Table 5 indicate values in the time domain.

Next, step S1703 will be described in detail.

The length 72 Frank sequence (ie, the 2x time domain repeat sequence) generated in step S1702 is converted to a frequency domain signal by a 72 point DFT or FFT conversion. In this case, from the point of view of the frequency domain, the 2x repetition is carried out in the time domain, so that an alternative insertion has been carried out from even frequency indices in the frequency domain. Specifically, the sequence is inserted into even frequency indices, as shown in FIG. 13. FIG. 13 shows the result of the previous step S1703 of FIG. 9.

Some parts of the sequence inserted in the even frequency indices can be represented by the following

IS 2 380 698 T3

Table 6:

[Table 6]

<td></td><td>Real part</td><td>Imaginary part</td>

<td> 0</td><td>Square root (2) * 1</td><td> 0</td>

<td> 2</td><td>Square root (2) * cos (pi / 9)</td><td>Square root (2) * sin (pi / 9)</td>

<td> 4</td><td>Square root (2) * cos (3 * pi / 9)</td><td>Square root (2) * sin (3 * pi / 9)</td>

<td> 6</td><td>-Square root (2) * cos (3 * pi / 9)</td><td>Square root (2) * sin (3 * pi / 9)</td>

<td> 8</td><td>-Square root (2) * cos (pi / 9)</td><td>-Square root (2) * sin (pi / 9)</td>

Next, step S1704 will be described in detail.

This step S1704 is adapted to solve the problem caused by the DC subcarriers. If the DC subcarrier part of the communication standard to be used is not used (for example, if the value 0 is to be transmitted via the DC subcarrier), it is preferable that step S1704 is carried out.

The present invention provides two methods for solving the problem of DC subcarriers mentioned above. For descriptive purposes and for a better understanding of the present invention, first step S1704-1 will be described in detail and then step S1704-2 will be described in detail.

Step S1704-1 is adapted to carry out selective removal of a corresponding sequence located on the DC subcarrier. In other words, the term selective deletion indicates that the corresponding sequence undergoes a nullification process with the value 0.

FIG. 14 shows the result of step S1704-1.

If step S1704-1 is carried out on the result of FIG. 13, the result of FIG. 14.

Some parts of the result of FIG. 14 can be represented by the following Table 7:

[Table 7]

<td></td><td>Real part</td><td>Imaginary part</td>

<td> 2</td><td>Square root (2) * cos (pi / 9)</td><td>Square root (2) * sin (pi / 9)</td>

<td> 4</td><td>Square root (2) * cos (3 * pi / 9)</td><td>Square root (2) * sin (3 * pi / 9)</td>

<td> 6</td><td>-Square root (2) * cos (3 * pi / 9)</td><td>Square root (2) * sin (3 * pi / 9)</td>

<td> 8</td><td>-Square root (2) * cos (pi / 9)</td><td>-Square root (2) * sin (pi / 9)</td>

Next, step S1704-2 will be described.

IS 2 380 698 T3

Step S1704-2 is adapted to perform a corresponding sequence correlation except for the DC subcarrier.

The 2x repeat sequence is performed in step S1702 above. Therefore, the result of step S1703 is configured in the form of a specific sequence, which is inserted into the frequency domain at intervals of two frequency indices. In other words, it should be noted that the sequence is inserted at even frequency indices.

In this case, the present invention carries out step S1704-2, so that the generated sequence undergoes a CS (circular shift) process to the right or to the left.

FIG. 15 shows the CS result to the right of the result of FIG. 13 according to the present invention. Some parts of the result of FIG. 15 can be represented by the following Table 8:

[Table 8]

<td></td><td>Real part</td><td>Imaginary part</td>

<td> 1</td><td>Square root (2) * 1</td><td> 0</td>

<td> 3</td><td>Square root (2) * cos (pi / 9)</td><td>Square root (2) * sin (pi / 9)</td>

<td> 5</td><td>Square root (2) * cos (3 * pi / 9)</td><td>Square root (2) * sin (3 * pi / 9)</td>

<td> 7</td><td>-Square root (2) * cos (3 * pi / 9)</td><td>Square root (2) * sin (3 * pi / 9)</td>

If the above step S1704-1 is compared with the other step S1704-2, it can be recognized that step S1704-1 is more preferable than step S1704-2.

Step S1704-1 can easily calculate the correlation value using the known signals from Table 5. A detailed procedure for calculating the correlation value will be described below.

Since the sequence is inserted into odd indices in step S1704-2, the sequence value in the time domain is changed to another, so that the present invention has difficulties in calculating the correlation value using a calculation. simple due to modified sequence value.

Needless to say, the receiving end shifts the carrier frequency from one current location to another location along the subcarrier spacing, and can receive the resulting signal. However, the first subcarrier is used as the DC component, so you may inevitably experience a DC phase shift. As a result, step S1704-1 is superior to step S1704-2 in view of the DC offset problem. Needless to say, the multiplication of a specific complex number is carried out in the time domain after the above-mentioned receiving action, the frequency offset can then be carried out. However, if the multiplication of the specific complex number is adapted to calculate the simple correlation value, the efficiency can be greatly deteriorated.

Next, step S1705 will be described. Step S1705 is used as an additional step for a specific case where the receiving end does not downsample and is applied to the 128 point FFT process.

The above step S1705 can be used effectively when the receiving end does not support the downsampling function.

For example, the subcarrier spacing of the LTE system is 15 kHz. If the 128-point FFT (or 128-point DFT) is applied to the LTE system, 128 sample values are generated in the time domain and the 128 sample values can have a sample rate of 1.92 MHz. The receiving end filters the Rx signal (that is, the received signal) at the 1.08 MHz frequency and can select any one of the following operations (that is, the first and second operations).

According to the first operation, the receiving end uses the 1.92 MHz sampling rate without any

ES 2 380 698 T3 modification. According to the second operation, the receiving end performs downsampling using a sampling frequency of 1.08 MHz and uses the downsampling result.

Step S1705 is used as an additional step for a specific case where the receiving end does not perform the downsampling process and uses the 1.92 MHz sampling rate without any modification.

If the upsampling process is required, step S1705 performs upsampling of the generated sequence at the 1.08 MHz frequency (corresponding to 72 samples), so that the sequence with the 1.08 MHz frequency it undergoes an upsampling process to another frequency of 1.92 MHz. The digital sampling procedure basically inserts the value of "0" into 56 subcarriers (56 = 128-72), and performs the 128 point IFFT processing on the above zero padding result.

Sampling techniques are widely and in detail known to those skilled in the art, so a detailed description thereof will be omitted. For reference, the sequence in Table 7 or 8 should be used in a corresponding band (ie the 1.08 MHz band) during the transmission process.

Next, operations of the receiving end after receiving the P-SCH sequence will be described in detail. Next, the cross-correlation procedure to be used at the receiving end will be described.

The example mentioned above shows the 2x repeat structure in the time domain. Therefore, a predetermined range of the Rx signal is determined according to the autocorrelation scheme, and then the cross-correlation scheme is applied to the determined interval, so that a rigorous synchronization acquisition process can be carried out.

The procedure for determining a predetermined interval of the Rx signal repeated by the autocorrelation scheme is identical to the conventional procedure used in the conventional technique, Therefore, a procedure to reduce the number of calculations according to the scheme will be described below. cross-correlation.

The timing acquisition procedure based on the cross-correlation scheme can be represented by the following Equation 9:

In Equation 9, p (n) indicates the known P-SCH sequence value in the time domain, r (n) indicates the Rx signal, M indicates the value of “M” for the partial correlation procedure, Nm is the magnitude of FFT, and Syndicates the detected timing acquisition location.

If the P-SCH does not have a repetition format, and a maximum value of the frequency offset in the 2GHz frequency band is 5 ppm, the system can have sufficient performance with M = 1 according to Equation 9. Therefore , it is not necessary for the present invention to apply the partial correlation procedure to the repeated interval.

Based on Equation 9, the LTE system performs a downsample (i.e. 72 samples) of the Rx signal using the 1.08 MHz sample rate and the P-SCH has two symbols in the 10 term ms.

Therefore, if time synchronization is obtained by averaging the 5 ms term, the computational complexity for timing acquisition can be represented by the following Equation 10:

[Equation 10] (72 complex multiplications + 72 complex sums + 2 complex power calculations) * 9600

In order to explain the procedure for calculating the correlation value according to the present invention, the sequence of

IS 2 380 698 T3

Frank shown in Table 4 will be described as an example.

If the Rx signal is denoted by r = [r (0) r (1) r (2), ..., r (35)], the procedure for calculating the Rx signal and correlation value from Table 4 can be carried out through the following parallel process.

First, the real value can be obtained as represented by the following equation 11, and the imaginary value 5 can be obtained as represented by the following equation 12:

<td colspan="2" rowspan="2">[ Equation Real value : Real [r (0)]</td><td colspan="5"> 11]</td>

<td>Real [r (ll)]</td><td> +</td><td>Real [r (13)]</td><td>- Real [r (14)]</td><td> +</td><td>Realfr (15)]</td><td> -</td>

<td>Real [r (23)]</td><td> -</td><td>Royal [r (26)]</td><td>+ Real [r {29)]</td><td> +</td><td>Real [r (31)]</td><td> +</td>

<td>Real [r (32)]</td><td> +</td><td>Royal [r (33)]</td><td>+ Real [r (34)]</td><td> +</td><td>Royal [r (35)]</td><td> +</td>

<td>Real [r (7)]</td><td colspan="3">- Real [r (9) J - Real [r (10)] -Realí</td><td>r (12)</td><td colspan="2">] - Real [r (19)]</td>

- Real [r (21)] - Real [r (22)] - Real [r (24)] - Real [r (25)] Real [r (27)] + Real [r (28)] + Real [ r (30)]} + sin (pi / 3) * {-Imag [r (l)] + Imag [r (3)] + Imag [r (4)] - Imag [r (6)] + Imag [ r (7)] - Imag [r (9)] + Imag [r (10)] - Imag [r (12)] - Imag [r (19)] + Imag [r (21)] Imag [r (22 )] + lmag [r (24)] + Imag [r (25)] - Imag [r (27)] Imag [r (28)] + Imag [r (30)]}

[Equation 12]

Imaginary value

<td>Imag [r (32)]</td><td> +</td><td>Imag [r (33)] +</td><td>Imagfr (34)]</td><td> +</td><td>Imag [r (35)] +</td>

Imag [r (27)] + Imag [r (28)] + lmag [r (30)]} - sin (pi / 3) * {Real [r (l)] + Real [r (3)] + Real [r (4)] - Real [r (6)] + Real [r (7)] Real [r (9)] + Real [r (10)] - Real [r (12)] - Real [r ( 19)] +

Real [r (21)] - Real [r (22)] + Real [r (24)] + Real [r (25)] Real [r (27)] - Real [r (28)] + Real [r (30)]}

IS 2 380 698 T3

In case of expressing the complexity of Equations 11 and 12, the following Equation 13 can be obtained:

[Equation 13] ((52 * 2) real sums + (2 * 2) real multiplications) * 9600 = (104 real sums + 4 real multiplications) * 9600

In case of comparing Equation 13 with Equation 10 there is a great difference in complexity between Equation 13 and Equation 10.

Furthermore, since the value “cos (pi / 3) is 1/2 (that is, cos (pi / 3) = 1/2), this value“ cos (pi / 3) = 1/2 ”corresponds to the displacement 1 bit of the hardware implementation, so this value can be neglected in view of the number of calculations. In this case, the number of calculations can be represented by the following equation 14:

[Equation 14] ((51 * 2) real sums + (1 * 2) real multiplications) * 9600 = (102 real sums + 2 real multiplications) * 9600

Also, the value of “sin (pi / 3)” is equal to (square root of (3)) / 2 or 0.8660 (that is, sin (pi / 3) = (square root of (3)) / 2 = 0.8660), so the number of calculations approaches 0.75 (= 1/2 + 1/4). In this case, the approximate result can be implemented with bit shifting. Therefore, if the number of calculations is ignored, the complexity decreases as represented by the following Equation 15:

[Equation 15] ((51 * 2) real sums + (1 * 2) real sums) * 9600 = (102 real sums) * 9600

On the other hand, the positive mark (+) or the negative mark (-) can be easily implemented by the code inverter, so that these marks are not included in the number of calculations.

The example mentioned above is repeated twice in the time domain, so the P-SCH is configured. However, the detailed numbers have been described for illustrative purposes of the present invention only, so that the scope of the present invention is not limited to the detailed numbers mentioned above, but can also be applied to other examples.

For example, the initial sequence can be set to a Frank sequence of length 16. In other words, the Frank sequence of length 16 is generated in step S1701. The length 16 Frank sequence is repeated four times in the time domain in step S1702. The Frank sequence is converted to a frequency domain sequence by FFT 64 in step S1703. In this case, the sequence is inserted into the frequency domain at intervals of four frequency indices.

At step 1704, the present invention may perform the selective removal process at the DC carrier location or it may perform sequence insertion simultaneously while avoiding the DC carrier. The sequence is then converted to a time domain signal and step S1705 can be executed as necessary.

In case of using the basic embodiments of the present invention mentioned above and applying the embodiments to Frank's sequence, it is preferable that all generated sequences can be generated using the selected index under the condition that the conjugated symmetry property mentioned above is fulfilled. .

In case of selecting the sequence by selecting an index from the set of indices that satisfies the conjugate symmetry property, the number of calculations can be greatly reduced at the receiving end, which detects the signal using cross-correlation.

The following description refers to a specific case in which a communication system based on the aforementioned correlation technique generates / uses the sequence described above.

Appearance used in a communication system based on the correlation technique

For descriptive purposes, the following description will be based on the frequency synchronization sequence or the time synchronization sequence (for example, the primary synchronization code (PSC) for the P-SCH), the sequences proposed by individual embodiments of the present invention can be applied to an uplink preamble transmission channel (e.g. RACH), to any other downlink synchronous channel, to signaling, to a control channel, and to ACK / NACK communication fields.

Typically, a correlation metric component of the computational procedure for obtaining time synchronization includes a delay component, as represented by (R (d)).

IS 2 380 698 T3

However, if time synchronization is not obtained, the correlation metric generated by the delay component is not required.

If the concept of the present invention is applied to a time synchronous channel, the delay component (d) must be taken into account. Otherwise, if the concept of the present invention is applied to another channel irrelevant for time synchronization, it is not necessary to take into account the delay component (d).

Subsequently, considering the delay component (d) mentioned above, various equations will be proposed. However, it is clear to those skilled in the art that the proposed equations can equally be applied to another case that does not have any delay component (ie, d = 0). Therefore, the case that does not have a delay component will be omitted for ease of description.

Next, a method of generating / using at least one sequence out of multiple sequences will be described, where the generated sequence is used as the time and frequency synchronization sequence. In particular, the sequence generation method mentioned above does not use a common sequence with a single cell, but rather selects a specific sequence from multiple predetermined sequences and uses the selected sequence.

The sequence for time and frequency synchronization in the cell can be referred to as the primary sequence code (PSC).

For example, if the P-SCH is designed using a single common sequence in a single cell, it is determined that the cell common PSC applies to this P-SCH. Otherwise, if the P-SCH is designed using one of multiple sequences in a single cell, it is determined that a specific PSC is selected from multiple PSCs.

The present invention provides a method of generating a sequence from multiple available sequences, so that the receiving end can calculate correlation values between the received signal and each of the multiple sequences using only one correlation operation.

If the P-SCH is designed using the Frank sequence of Equation 6, a sequence of length 16 and another sequence of length 36 can be used. In this case, if the length N is 16, the variable m of Equation 6 is equal to 4, so that two types of Frank sequences are used. Also, if the length N is 36, the variable m in Equation 6 is equal to 6, so two types of sequences are used. In this case, the present invention cannot support three or more PSCs, resulting in a serious problem occurring.

The present invention provides a method of generating the available sync channel sequence for a plurality of communication systems, but this method can support several sync channels in a single cell.

There are no limits when it comes to the types of the various communication systems mentioned above. For descriptive purposes, the present invention will be described in terms of the LTE system.

This embodiment will explain the Zadoff-Chu sequence by referring to the following Equation 16, so that a method for generating a plurality of PSCs is proposed. The Zadoff-Chu sequence has already been described in Equation 3.

[Equation 16]. (Jm-k2'] exp | --— 2— hhowdo L is even jm ~ k (k + l)

In Equation 16, "m" is a less natural number than "L" and is relatively prime to L. For example, if L = 8, m is set to 1, 3, 5, and 7.

This embodiment provides a method of generating a sequence from a plurality of available sequences using the Zadoff-Chu sequence. Preferably, the synchronous channel generated by the sequence according to the present invention can follow the structure of FIG. 10.

The sequence according to this embodiment can be generated by the method of FIG. 16. FIG. 16 is a

when L is odd

ES 2 380 698 T3 conceptual diagram illustrating an exemplary sequence generation method in accordance with the present invention.

Referring to FIG. 16, the sequence generation method efficiently selects a sequence index from a plurality of sequence indices (or the set of indices) to generate a sequence in step S10. If the sequence index is selected, the sequence generation procedure generates the sequence in the time or frequency domain according to the index selected in step S20. In this case, the sequence can be repeated N times in the time domain in step S30, but this step can be omitted.

The generated sequence can be mapped to the frequency resource element in step S40. A data process to remove the DC component from the frequency domain can be executed in step S51 or S52.

If the data processing to remove the CC component is executed, the data processing to convert the sequence to a time domain sequence is carried out in step S60.

According to this embodiment of the present invention, various procedures other than the procedures mentioned above can also be used to remove the CC component. According to the present invention, provided that a specific component corresponding to the part having frequency 0 can be omitted from the frequency domain of a corresponding sequence during time domain transmission, the present invention can use an arbitrary method to meet the condition mentioned above.

Individual steps will be described in detail below.

Step S10 which efficiently selects a sequence index from the plurality of sequence indices (or the set of indices) will be described in detail. In step S10, the set of sequence indices may comprise the parent sequence index or the root index, and the remaining sequence indices. In more detail, if the receiving end aims at timing acquisition, it is preferable that the root index and the remaining indexed sequence meet the condition that the cross-correlation value can be calculated with fewer calculations by the receiving end. Therefore, this embodiment proposes that the set of root indexes have the root sequence index and the remaining sequence indexes that satisfy the above condition.

On the other hand, the number of PSCs available in the cell can be determined in various ways. For example, a specific case where the P-SCH is configured using one of 4 PSCs will be described below. If only 3 PSCs are needed and 4 PSCs are available, then 3 PSCs out of the 4 PSCs can be used as required.

This embodiment can prepare 3 root indices to use the 3 PSCs, so that the index to be generated can be selected from the prepared root indices.

Next, the procedure for generating the sequence using a Zadoff-Chu sequence of length "36" or "32" will be described. In this case, a procedure for generating the P-SCH by repeating the sequence twice will be described below.

A Zadoff-Chu sequence of length 36 or 32 can be generated by Equation 16.

If the length (L) is 36, as denoted by Equation 16, the value "m" that indicates the sequence index is 1, 5, 7, 11, 13, 17, 19, 23, 25, 29, 31 , 33 and 35. If the length (L) is 32, the value "m" that indicates the sequence index is 1, 3, 5, 7, 9, 11, 13, 15, 17, 19, 21, 23, 25, 27, 29 and 31.

If the length (L) is 36, one of the values 1, 5, 7, 11, 13, 17, 19, 23, 25, 29, 31, 33, and 35 is determined to be a parent sequence index. If the length (L) is 32, one of the values 1, 3, 5, 7, 9, 11, 13, 15, 17, 19, 21, 23, 25, 27, 29, and 31 is set to the sequence index mother. For descriptive purposes, the parent sequence index is denoted as m0, and the remaining sequence indices are denoted as my.

In order to fulfill the property of conjugate symmetry between the parent sequence index m0 and the remaining sequence index mi, it is preferable that the relationship in Equation 17 can be established.

IS 2 380 698 T3

[Equation 17] m0+ m, = ~ 'AP¡Xn

OR w,-neither= + | xpix «» = 1,2,3, ...

In equation 17, “PL"Indicates a value corresponding to a single period equal to 2 * pi in a polyphase sequence. Typically, the value of a denominator of the phase component in the sequence generation equation corresponds to the value equal to a single period.

In other words, in the case of the polyphasic sequence, the aforementioned conjugate symmetry property is relevant for an integer multiple of the middle of the sequence generation period in the sequence generation equation.

If the value of k corresponding to the part having frequency 0 is omitted from several values of k shown in Equation 16 and then the sequence is generated, the period of the generated sequence is shorter than a normal period by a value of "1", and the sequence length (L ') is shorter than the sequence length (L) by a value of "1". As a result, during the sequence generation, the part having the frequency "0" is skipped in the frequency domain and then the sequence is generated.

In order to select the root index that maintains the conjugate symmetry property while carrying out the aforementioned process, the sum of the indices or the difference between the indices may correspond to an integer multiple of L / 2 in association with the L value instead of L 'value. Therefore, as long as the sum of the root indices corresponds to an integer value associated with half the period or sequence length, this means that a sequence generation period or sequence length (L) is provided when uses a normal sequence generation equation.

On the other hand, the following Equations 18 and 19 show the application examples of Equation 17.

[Equation 18]

772 ^ + 772, = ^ - / XL ^ n

Ó ηι0-ηι, = ± and X \ [lX <n

72=1,2,3,...

As Equation 16 shows, the value corresponding to a single period in the Zadoff-Chu sequence is equal to the sequence length L. Therefore, the generation period of Equation 18 is equal to "L". If the same procedure is applied to the Frank sequence, Equation 20 can be obtained. On the other hand, the value corresponding to a single period is set to Jl.

As shown in Equation 18, if the parent sequence index (m0) and the remaining sequence index (mi) are determined, the receiving end can easily calculate the cross-correlation value.

For example, if a single m0 value and three values (m1, m2, and m3) are selected and then the sequence is generated, the receiving endpoint must calculate the cross-correlation value using four sequences. Specifically, after receiving an unknown signal, the receiving end calculates each of the cross-correlation values from the sequences m0, m1, m2 and m3 stored at the receiving end, and you must determine whether the unknown signal is the m0 sequence, the m1 sequence, the m2 sequence, or the m3 sequence using the calculated cross-correlation values.

However, if at least one of the sequences that satisfy the conjugate symmetry property is received, the present invention calculates the cross-correlation amplitude of the selected sequence from the sequences m0 to m3, from

ES 2 380 698 T3 so that the cross-correlation amplitudes of the remaining sequences are determined. Detailed operations of the receiving end will be described later with reference to other embodiments.

For example, if the sequence length L is 32, the parent sequence index can be set to "1". In this case, if “1” is set as the value of m0 of a first expression of Equation 18, and set 32 as the value of L, the value of m1 equals "15". If "1" is set as the value of m0 of a second expression of Equation 18, and "32" is set as the value of "L", the value of m2 equals "17". If the values of m1 and L are fixed in the first expression of Equation 18, the value of m3 equals "31". In this case, the value of m0, m1, m2 and m3 it can be determined as a single group of indices.

Simply put, if a single parent sequence index is determined, its associated index group can also be determined.

If the length is set to 32, the values m0= 3, m1= 13, m2= 19 ym3= 29 can be determined as a single group of indices. Needless to say, other sets may also be available. If 8 sequences are used, the present invention only needs to select two groups using the same procedure.

If the sequence length L is 36, the values m0= 1, m1= 17, m2= 19 ym3= 35 can be determined as a single group of indices. Furthermore, the values m0= 5, m1= 13, m2= 23 ym3= 31 can be determined as a single group of indices.

If the value of L is denoted by a prime number (that is, L = 37), the values m0= 1 and m1= 36 are determined as a single group or the other values m0= 3 and m1= 16 can be determined as a single group.

If the value of L is an odd number, Equation 18 can be simplified as represented by the following Equation 19:

[Equation 19] m0 + m¡ = L

If the sequences corresponding to the sequence indices selected by Equation 19 are used, all correlation operations can be completed by a single correlation operation in the same way as in Equation 19.

Equation 19 corresponds to the subset of Equations 17 and 18.

The sequences selected according to the present invention can be Zadoff-Chu sequences, all CAZAC sequences or polyphasic sequences composed of an exponential function. For example, the selected sequences can be Frank sequences. However, if the selected sequences are determined to be Frank's sequences, equations 18 and 19 are modified to form the following Equation 21.

The following Equations 20 and 21 can also correspond to the subset of Equation 17.

[Equation 20] ηια+ ηΐί = - ^ - X \ lL / n or

± A- X¿ X n ^ = 1,2,3, ...

[Equation 21] mor+ m¡ = \ / L

The sequences selected by this embodiment can be truncated Zadoff-Chu sequences, as necessary.

In case of generating a Zadoff-Chu sequence, the sequence length is set to a prime number and many more sequences can be obtained. In this case, some bits are truncated, so that a truncated Zadoff-Chu sequence can be configured. For example, if the length L is discarded after a sequence of length 36 is generated, the

ES 2 380 698 T3 sequence of length 36 can be generated.

As can be seen from Equation 19, two sets of sequence indices processed once can be generated. For example, if a Zadoff-Chu sequence of length 37 is provided, the group of indices or the set of indices can be set to any of (1-36), (2-35), (3-34), (4 -33), (5-32), (6-31), (7-30), (8-29), (9-28), (10-27), (11-26), (1225), (13-24), (14-23), (15-22), (16-21), (17-20), and (18-19).

Since Equation 19 is a specialized format of Equation 18, the sequence indices that satisfy Equation 19 correspond to the other sequence indices that satisfy Equation 18.

As described above, all sequence indices can be selected according to Equation 17, or they can also be selected by other methods. For example, some sequence indices are selected by Equation 17, and any one of the selected sequence indices undergoes a CS (circular shift) process at a predetermined amplitude, so that a new sequence can be selected based on the result of the CS process. .

For example, the sequence indices "1" and "31" are selected, each of which has a length of 32. In this case, the sequence corresponding to the sequence index "1" or "31" may undergo a process. CS in the middle of the sequence length, so that a new sequence can be selected based on the result of the CS process. In other words, the sequence of length 32 corresponding to the sequence index 1 or "31" undergoes a CS process at "16", so that a third new sequence can be selected according to the result of the CS process at 16.

It should be noted that the numerical values mentioned above have only been described for illustrative purposes, therefore the concept of the present invention is not limited only to the numerical values mentioned above, but can also be applied to other examples as necessary.

For descriptive purposes, an exemplary case in which the sequence length L is set to 32 or 36 will be described below.

If the length is set to 32, an example case will be described where the values m0= 1, m1= 15, m2= 17 and m3 = 31 are fixed to a single group of indices. If the length is set to 36, an exemplary case will be described where the values m0= 1, m1= 17, m2= 19 ym3= 35 are set to a single group of indices.

Next, step S20 of FIG. 16 for generating a sequence in the time domain or in the frequency domain according to the selected sequence.

Using Equation 16, a sequence of a single group of indices can be generated that has a length of 36 and the values m0= 1, m1= 17, m2= 19 ym3= 35. The following Table 9 shows examples of the generated sequences.

IS 2 380 698 T3

[Table 9]

ES 2 380 698 T3 (Continued)

<td>Imaginary part</td><td> 0,90631 |</td><td> 0,64279</td><td> -0,70711</td><td> -0,64279</td><td> 0,90631</td><td>OR</td><td> -0,81915</td><td> 0,98481</td><td> -0,70711</td><td> 0,34202</td><td> -0,087156</td>

<td>Imaginary part</td><td> 0,42262</td><td> -0,64279</td><td> -0,7071</td><td> 0,64279</td><td> 0,42262</td><td>OR</td><td> 0,57358</td><td> -0,98481</td><td> -0,70711</td><td> -0,34202</td><td> -0,99619</td>

<td>Imaginary part</td><td> 0,42282</td><td> 0,64279</td><td> -0,70711</td><td> -0,64279</td><td> 0,42262</td><td>OR</td><td> 0,57358</td><td> 0,98481</td><td> -0,70711</td><td> 0,34202</td><td> -0,99819</td>

<td>Imaginary part</td><td> 0,90631</td><td> -0,64279</td><td> -0,70711</td><td> 0,64279</td><td> 0,90631</td><td>OR</td><td> -0,81915</td><td> -0,98481</td><td> -0,70711</td><td> -0,34202</td><td> -0,087158</td>

IS 2 380 698 T3

The result in Table 9 is related to four sequences. Any of the four sequences can be configured in the form of FIG. 11. However, FIG. 11 refers to the Frank sequence, and the result in Table 9 is related to the Zadoff-Chu sequence.

In case of using Equation 16, the sequence result associated with a single group of 5 indices having a length of 32 and the values m can be generated0= 1, mi = 15, m2= 17 ym3= 31. The following Table 10 shows examples of the generated sequences.

IS 2 380 698 T3

[Table 10]

<td>Imaginary part</td><td>or</td><td>-0.09H017</td><td> 0,38268</td><td> -0,77301</td><td> -</td><td> -0,83439</td><td> -0,38268</td><td> 0,99518</td><td>or</td><td> -0,99518</td><td> -0,38268</td><td> 0,83439</td>

<td>Imaginary part</td><td>or</td><td> -0,99518</td><td> -0,38258</td><td> -0,63439</td><td>V</td><td> 0,77301</td><td> 0,38288</td><td> -0,098017 7</td><td>or</td><td> 0,098017</td><td> 0,38288</td><td> -0,77301</td>

<td>Imaginary part</td><td>or</td><td> -0,99518</td><td> 0,38268</td><td> -0,63439</td><td> -</td><td> 0,77301</td><td> -0,38268</td><td> -0,098017</td><td>or</td><td> 0,098017</td><td> -0,38288</td><td> -0,77301</td>

<td>Imaginary part</td><td>or</td><td> -0,098017</td><td> -0,38268</td><td> -0,77301</td><td>V</td><td> -0,63439</td><td> 0,38288</td><td> 0,99518 8</td><td>or</td><td> -0,99518</td><td> 0,38288</td><td> 0,83439</td>

ES 2 380 698 T3 (continued)

<td>Imaginary part</td><td> 0,99518</td><td> -0,38268</td><td> -0,83439</td><td> -</td><td> -0,77301</td><td> 0,38268</td><td> -0,098017 |</td>

<td>Imaginary part</td><td> -0,098017</td><td> 0,38268</td><td> 0,77301</td><td>T</td><td> -0,63439</td><td> -0,38288</td><td>-0.995t8 |</td>

<td>Imaginary part</td><td> -0,098017</td><td> -0,38268</td><td> 0,77301</td><td> -</td><td> -0,63439</td><td> 0,38268</td><td> -0,99518 |</td>

<td>Imaginary part</td><td> 0,99518</td><td> 0,38268</td><td> -0,83439</td><td>v</td><td> ,0,77301</td><td> -0,38268</td><td> -0,098017 |</td>

IS 2 380 698 T3

Next, the step S30 repeating the sequence N times in the time domain in FIG. 16.

Step S30 can be omitted for ease of description and the value of "N" can be freely determined.

Next, the result of FIG. 9, that is, the 2x repeat structure in the time domain, with reference to Tables 11 and 12. The following Tables 11 and 12 show the repeat result of Table 9.

IS 2 380 698 T3

[Table 11]

<td>Imaginary part</td><td>or</td><td> -0,087156</td><td> 0,34202</td><td> -0,70711</td><td> 0,98481</td><td> -0,81915</td><td>OR</td><td> 0,90631</td><td>-O, S4279</td><td> -0,70711</td><td> 0,84279</td><td> 0,90631</td>

<td>Imaginary part</td><td>or</td><td> -0,99619</td><td> -0,34202</td><td> -0,70711</td><td> -0,98481</td><td> 0,57358</td><td>or</td><td> 0,42282</td><td> 0,84279</td><td> -0,70711</td><td> -0,84279</td><td> 0,42262</td>

<td>Imaginary part</td><td>or</td><td> -0,99619</td><td> 0,34202</td><td> -0,70711</td><td> 0,98481</td><td> 0,57358</td><td>or</td><td> 0,42282</td><td> -0,84279</td><td> -0,70711</td><td> 0,64279</td><td> 0,42282</td>

<td>Imaginary part</td><td>or</td><td> -0,087158</td><td> -0,34202</td><td> -0,70711</td><td> -0,98481</td><td> -0,81915</td><td>or</td><td> 0,90831</td><td> 0,84279</td><td> -0,70711</td><td> -0,84279</td><td> 0,90631</td>

ES 2 380 698 T3 (continued)

<td>Imaginary part</td><td> 0,90831 |</td><td> 0,64279</td><td> -0,70711</td><td> -0,64279</td><td> 0,90631</td><td>OR</td><td> -0,81915</td><td> 0,98481</td><td> -0,70711</td><td> 0,34202</td><td> -0,087158 |</td>

<td>Imaginary part</td><td> 0,42282</td><td> -0,84279</td><td> -0,70711</td><td> 0,64279</td><td> 0,42262</td><td>OR</td><td> 0,57358</td><td> -0,98481</td><td> -0,70711</td><td> -0,34202</td><td> -0,99619</td>

<td>Imaginary part</td><td> 0,42262</td><td> 0,84279</td><td> -0,70711</td><td> -0,84279</td><td> 0,42282</td><td>OR</td><td> 0,57358</td><td> 0,98481</td><td> -0,70711</td><td> 0,34202</td><td> -0,99619 |</td>

<td>Imaginary part</td><td> 0,90631</td><td> -0,84279</td><td> -0,70711</td><td> 0,64279</td><td> 0,90631</td><td>OR</td><td> -0,81915</td><td> -0,98481</td><td> -0,70711</td><td> -0,34202</td><td> -0,087156 |</td>

IS 2 380 698 T3

[Table 12]

<td>Imaginary part</td><td>or</td><td> -0,087156</td><td> 0,34202</td><td> -0,70711</td><td> 0,98481</td><td> -0,81915</td><td>or</td><td> 0,90631</td><td> -0,84279</td><td> -0,70711</td><td> 0,84279</td><td> 0,90631</td>

<td>Imaginary part</td><td>OR</td><td> -0,99819</td><td> -0,34202</td><td> -0,70711</td><td> -0,98481</td><td> 0,57358</td><td>OR</td><td> 0,42262</td><td> 0,84279</td><td> -0,70711</td><td> -0,64279</td><td> 0,42282</td>

<td>Imaginary part</td><td>OR</td><td> -0,99819</td><td> 0,34202</td><td> -0,70711</td><td> 0,98481</td><td> 0,57358</td><td>OR</td><td> 0,42262</td><td> -0,64279</td><td> -0,70711</td><td> 0,54279</td><td> 0,42282</td>

<td>Imaginary part</td><td>OR</td><td> -0,087166</td><td> -0,34202</td><td> -0,70711</td><td> -0,98481</td><td> -0,81915</td><td>OR</td><td> 0,90631</td><td> 0,84279</td><td> -0,70711</td><td> -0,84279</td><td> 0,90631</td>

ES 2 380 698 T3 (Continued)

<td>Imaginary part</td><td> 0,90831</td><td> 0,84279</td><td> -0,70711</td><td> -0,84279</td><td> 0,90631</td><td>OR</td><td> -0,81915</td><td> 0,98481</td><td> -0,70711</td><td> 0,34202</td><td> -087156 |</td>

<td>Imaginary part</td><td> 0,42282</td><td> -0,84279</td><td> -0,70711</td><td> 0,84279</td><td> 0,42282</td><td>or</td><td> 0,57358</td><td> -0,98481</td><td> -0,70711</td><td> -0,34202</td><td> -0,99619</td>

<td>Imaginary part</td><td> 0,42282</td><td> 0,84279</td><td> -0,70711</td><td> -0,64279</td><td> 0,42262</td><td>OR</td><td> 0,57358</td><td> 0,98481</td><td> -0,70711</td><td> -0,34202</td><td> -0,99619 |</td>

<td>Imaginary part</td><td> 0,90831</td><td> -0,84279</td><td> -0,70711</td><td> 0,64279</td><td> 0,90831</td><td>OR</td><td> -0,81915</td><td> -0,98481</td><td> -0,70711</td><td> -0,34202</td><td> -0,087156 |</td>

IS 2 380 698 T3

Next, an example obtained when the result of Table 10 is repeated twice in the time domain will be described with reference to Tables 13 and 14. As can be seen in Tables 13 and 14, the result of Table 10 is repeated once more.

IS 2 380 698 T3

[Table 13]

<td>Imaginary part</td><td>or</td><td> -0,098017</td><td> 0,38268</td><td> -0,77301</td><td> -</td><td> -0,83439</td><td> -0,38268</td><td> 0,99518</td><td>or</td><td> -0,99518</td><td> -0,38268</td><td> 0,63439</td>

<td>Imaginary part</td><td>or</td><td> -0,99518</td><td> -0,38288</td><td> -0,33439</td><td>V</td><td> 0,77301</td><td> 0,38268</td><td> -0,098017</td><td>or</td><td> 0,098017</td><td> 0,38268</td><td> -0,77301</td>

<td>Imaginary part</td><td>or</td><td> -0,098017</td><td> -0,38268</td><td> -0,77301</td><td>V</td><td> -0,83439</td><td> 0,38268</td><td> 0,99518</td><td>or</td><td> -0,99518</td><td> 0,38268</td><td> 0,83439</td>

ES 2 380 698 T3 (Continued)

<td>Imaginary part</td><td> 0,99518</td><td> -0,38268</td><td> -0,63439</td><td> -</td><td> -0,77301</td><td> 0,38268</td><td> -0,098017</td><td>or</td>

<td>Imaginary part</td><td> -0,098017</td><td> 0,38268</td><td> 0,77301</td><td>V</td><td> -0,83439</td><td> -0,38288</td><td> -0,99518</td><td>or</td>

<td>Imaginary part</td><td> -0,098017</td><td> -0,38268</td><td> 0,77301</td><td> -</td><td> -0,63439</td><td> 0,38268</td><td> -0,99518</td><td>or</td>

<td>Imaginary part</td><td> 0,99518</td><td> 0,38268</td><td> -0,63439</td><td>V</td><td> -0,77301</td><td> -0,38268</td><td> -0,098017</td><td>or</td>

IS 2 380 698 T3

[Table 14]

<td>Imaginary part</td><td> -0,098017</td><td> 0,38268</td><td> -0,77301</td><td> -</td><td> -0,63439</td><td> -0,38268</td><td> 0,99518</td><td>OR</td><td> -0,99516</td><td> -0,38268</td><td></td><td> 0,63439 1</td>

<td>Imaginary part</td><td> -0,99518</td><td> -0,38268</td><td> -0,63439</td><td>T</td><td> 0,77301</td><td> 0,38268</td><td> -0,098017</td><td>OR</td><td> 0,098017</td><td> 0,38268</td><td> -0,77301</td><td>T</td>

<td>Imaginary part</td><td> -0,99518</td><td> 0,38266</td><td> -0,63439</td><td> -</td><td> 0,77301</td><td> -0,38268</td><td> -0,098017</td><td>OR</td><td> 0,098017</td><td> -0,38268</td><td> -0,77301</td><td> -</td>

<td>Imaginary part</td><td> -0,098017</td><td> -0,38268</td><td> -0,77301</td><td>T</td><td> -0,83439</td><td> 0,38288</td><td> 0,99518</td><td>OR</td><td> -0,99518</td><td> 0,38268</td><td> 0,63439</td><td>T</td>

ES 2 380 698 T3 (Continued)

<td>Imaginary part</td><td> -0,38268 |</td><td> -0,63439</td><td></td><td> -0,77301</td><td> 0,38268</td><td>h- or 00 oo or</td>

<td>Imaginary part</td><td> 0,38268</td><td> 0,77301</td><td>T</td><td> -0,83439</td><td> -0,38268</td><td> -0,99518</td>

<td>Imaginary part</td><td> -0,38268</td><td> 0,77301</td><td> -</td><td> -0,63439</td><td> 0,38268</td><td> -0,99518 |</td>

<td>Imaginary part</td><td> 0,38268</td><td> -0,83439</td><td>v</td><td> -0,77301</td><td> -0,38288</td><td> -0,098017 |</td>

IS 2 380 698 T3

Next, step S40 will be described, which maps the time domain sequence to the frequency domain in FIG. 16. However, it should be noted that the sequence according to the present invention can be generated in the frequency domain, so that it can be directly mapped to the frequency resource element as required.

If the sequence with the 2x repeat structure is mapped to the frequency domain, a specific sequence is generated in the frequency domain. In this case, this specific sequence has a frequency component only at even frequency indices of the frequency domain due to the characteristics of the DFT operation.

In more detail, if the sequences in Tables 11 and 12 are mapped to the frequency domain, the following sequences shown in Tables 15 and 16 can be obtained.

If the sequences in Tables 13 and 14 are mapped to the frequency domain, the following sequences shown in Tables 17 and 18 can be obtained.

IS 2 380 698 T3

[Table 15]

<td>Imaginary part</td><td></td><td>or</td><td> 0,90904</td><td>OR</td><td> -0,59767</td><td>or</td><td>or</td><td>or</td><td> 0,81116</td><td>or</td><td> -1,3927</td><td>or</td><td> -</td><td>OR</td><td> 0,48369</td><td>or</td><td>00 00 or 3-</td><td>or</td><td>or</td><td>or</td><td>00 00 or 3-</td><td>or</td><td> 0,46369</td><td>OR</td><td>V</td>

<td>Imaginary part</td><td></td><td>or</td><td> -0,90904</td><td>OR</td><td> -1,2817</td><td>or</td><td>or</td><td>or</td><td> -1,1585</td><td>or</td><td> 1,3927</td><td>or</td><td> -</td><td>OR</td><td> -0,48369</td><td>or</td><td> -0,12326</td><td>or</td><td>or</td><td>or</td><td> 0,12326</td><td>or</td><td> -0,48369</td><td>OR</td><td>V</td>

<td>Imaginary part</td><td></td><td>or</td><td> 0,90904</td><td>OR</td><td> -1,2817</td><td>or</td><td>or</td><td>or</td><td> -1,1585</td><td>or</td><td> -1,3927</td><td>or</td><td> -</td><td>OR</td><td> 0,48369</td><td>or</td><td> -0,12326</td><td>or</td><td>or</td><td>or</td><td> 0,12328</td><td>or</td><td> 0,48369</td><td>OR</td><td></td>

<td>Imaginary part</td><td></td><td>or</td><td> -0,90904</td><td>OR</td><td> -0,59787</td><td>or</td><td>or</td><td>or</td><td> 0,81116</td><td>or</td><td> 1,3927</td><td>or</td><td> -</td><td>or</td><td> -0,48369</td><td>or</td><td>00 00 or 3-</td><td>or</td><td>or</td><td>or</td><td> 1,4068</td><td>OR</td><td> -0,48369</td><td>OR</td><td></td>

ES 2 380 698 T3 (Continued)

<td>Imaginary part</td><td>or</td><td> -1,3927</td><td>OR</td><td> -0,61116</td><td>OR</td><td>OR</td><td>OR</td><td> 0,59787</td><td>OR</td><td> 0,90904</td><td>OR</td>

<td>Imaginary part</td><td>OR</td><td> 1,3927</td><td>OR</td><td> 1,1585</td><td>OR</td><td>OR</td><td>or</td><td> 1,2917</td><td>OR</td><td> -0,90904</td><td>OR</td>

<td>Imaginary part</td><td>OR</td><td> -1,3927</td><td>OR</td><td> 1,1585</td><td>OR</td><td>OR</td><td>or</td><td> 1,2817</td><td>OR</td><td> 0,90904</td><td>OR</td>

<td>Imaginary part</td><td>OR</td><td> 1,3927</td><td>OR</td><td> -0,81116</td><td>OR</td><td>OR</td><td>or</td><td> 0,59767</td><td>OR</td><td> -0,90904</td><td>OR</td>

IS 2 380 698 T3

[Table 16]

<td>Imaginary part</td><td></td><td>OR</td><td> 0,90904</td><td>or</td><td> 0,59767</td><td>OR</td><td>or</td><td>OR</td><td>00 00 or</td><td>OR</td><td> -1,3927</td><td>OR</td><td>T</td><td>OR</td><td> 0,48369</td><td>or</td><td>00 00 or 3-</td><td>OR</td><td>OR</td><td>OR</td><td>00 00 or 3-</td><td>or</td><td> 0,48369</td><td>or</td><td> -</td>

<td>Imaginary part</td><td></td><td>or</td><td> -0,90904</td><td>OR</td><td> 1,2817</td><td>or</td><td>OR</td><td>OR</td><td> 1,1585</td><td>OR</td><td> 1,3927</td><td>OR</td><td>T</td><td>or</td><td> -0,48369</td><td>or</td><td> 0,12326</td><td>OR</td><td>OR</td><td>or</td><td> -0,12328</td><td>or</td><td> -0,48369</td><td>OR</td><td> -</td>

<td>Imaginary part</td><td></td><td>or</td><td> 0,90904</td><td>OR</td><td> 1,2817</td><td>or</td><td>OR</td><td>OR</td><td> 1,1585</td><td>OR</td><td> -1,3927</td><td>OR</td><td>T</td><td>or</td><td> 0,48369</td><td>or</td><td> 0,12326</td><td>OR</td><td>OR</td><td>or</td><td> -0,12326</td><td>or</td><td> 0,48389</td><td>OR</td><td> -</td>

<td>Imaginary part</td><td></td><td>or</td><td> -0,90904</td><td>OR</td><td> 0,59767</td><td>or</td><td>OR</td><td>OR</td><td> -0,81116</td><td>OR</td><td> 1,3927</td><td>OR</td><td>T</td><td>or</td><td> -0,48369</td><td>or</td><td>00 00 or 3-</td><td>OR</td><td>OR</td><td>or</td><td>00 00 or 3-</td><td>or</td><td> -0,48389</td><td>OR</td><td> -</td>

ES 2 380 698 T3 (Continued)

<td>Imaginary part</td><td>or</td><td> -1,3927</td><td>OR</td><td> 0,81116</td><td>OR</td><td>OR</td><td>OR</td><td> -0,59767</td><td>OR</td><td> 0,90904</td><td>OR</td>

<td>Imaginary part</td><td>or</td><td> 1,3927</td><td>OR</td><td> -1,1585</td><td>OR</td><td>OR</td><td>OR</td><td> -1,2817</td><td>OR</td><td> -0,90904</td><td>or</td>

<td>Imaginary part</td><td>or</td><td> -1,3927</td><td>OR</td><td> 1,1585</td><td>OR</td><td>OR</td><td>OR</td><td> -1,2817</td><td>OR</td><td> 0,90904</td><td>or</td>

<td>Imaginary part</td><td>or</td><td> 1,3927</td><td>OR</td><td> 0,81116</td><td>OR</td><td>OR</td><td>OR</td><td> -0,59767</td><td>OR</td><td> -0,90904</td><td>or</td>

IS 2 380 698 T3

[Table 17]

<td>Imaginary part</td><td></td><td>or</td><td> -0,89717</td><td>OR</td><td> 0,5412</td><td>or</td><td> 0,13862</td><td>or</td><td></td><td>or</td><td> 1,4074</td><td>or</td><td> -0,5412</td><td>OR</td><td> -1,0932</td><td>or</td><td> -</td><td>or</td><td> 1,0932</td><td>or</td><td> -0,5412</td><td>or</td><td> -1,4074</td><td>OR</td><td></td>

<td>Imaginary part</td><td></td><td>or</td><td> -1,0932</td><td>OR</td><td> -0,5412</td><td>or</td><td> -1,4074</td><td>or</td><td> -</td><td>or</td><td> 0,13862</td><td>or</td><td> 0,5412</td><td>OR</td><td> 0,89717</td><td>or</td><td>V</td><td>or</td><td> -0,89717</td><td>or</td><td> 0,5412</td><td>or</td><td> -0,13862</td><td>OR</td><td> -</td>

<td>Imaginary part</td><td></td><td>or</td><td> -1,0932</td><td>OR</td><td> 0,5412</td><td>or</td><td> -1,4074</td><td>or</td><td>V</td><td>or</td><td> 0,13862</td><td>or</td><td> -0,5412</td><td>OR</td><td> 0,89717</td><td>or</td><td> -</td><td>or</td><td> -0,89717</td><td>or</td><td> -0,5412</td><td>or</td><td> -0,13862</td><td>OR</td><td></td>

<td>Imaginary part</td><td></td><td>or</td><td> -0,89717</td><td>OR</td><td> -0,5412</td><td>or</td><td> 0,13862</td><td>or</td><td> -</td><td>or</td><td> 1,4074</td><td>or</td><td> 0,5412</td><td>or</td><td> -1,0932</td><td>or</td><td>V</td><td>or</td><td> 1,0932</td><td>or</td><td> 0,5412</td><td>OR</td><td> -1,4074</td><td>OR</td><td> -</td>

ES 2 380 698 T3 (Continued)

<td>Imaginary part</td><td>or</td><td> -0,13862</td><td>OR</td><td> 0,5412</td><td>OR</td><td> 0,89717</td><td>OR</td>

<td>Imaginary part</td><td>OR</td><td> 1,4074</td><td>OR</td><td> -0,5412</td><td></td><td> 1,0932</td><td>or</td>

<td>Imaginary part</td><td>OR</td><td> 1,4074</td><td>OR</td><td> 0,5412</td><td></td><td> 1,0932</td><td>or</td>

<td>Imaginary part</td><td>OR</td><td> -0,13862</td><td>OR</td><td> -0,5412</td><td></td><td> 0,89717</td><td>or</td>

IS 2 380 698 T3

[Table 18]

<td>Imaginary part</td><td></td><td>OR</td><td> 0,89717</td><td>or</td><td> 0,5412</td><td>OR</td><td> -0,13862</td><td>OR</td><td></td><td>OR</td><td> -1,4074</td><td>OR</td><td> -0,5412</td><td>OR</td><td> 1,0932</td><td>or</td><td> -</td><td>OR</td><td> -1,0932</td><td>OR</td><td> -0,5412</td><td>or</td><td> 1,4074</td><td>OR</td><td></td>

<td>Imaginary part</td><td></td><td>or</td><td> 1,0932</td><td>OR</td><td> -0,5412</td><td>OR</td><td> 1,4074</td><td>OR</td><td> -</td><td>or</td><td> -0,13862</td><td></td><td> 0,5412</td><td>or</td><td> -0,89717</td><td>OR</td><td></td><td>OR</td><td> 0,89717</td><td>or</td><td> 0,5412</td><td>or</td><td> 0,13662</td><td>OR</td><td> -</td>

<td>Imaginary part</td><td></td><td>or</td><td> 1,0932</td><td>OR</td><td> 0,5412</td><td>OR</td><td> 1,4074</td><td>OR</td><td></td><td>or</td><td> -0,13862</td><td></td><td> -0,5412</td><td>or</td><td> -0,89717</td><td>OR</td><td> -</td><td>OR</td><td> 0,89717</td><td>or</td><td> -0,5412</td><td>or</td><td> 0,13862</td><td>OR</td><td></td>

<td>Imaginary part</td><td></td><td>or</td><td> 0,89717</td><td>OR</td><td> -0,5412</td><td>OR</td><td> -0,13862</td><td>OR</td><td> -</td><td>or</td><td> -1,4074</td><td></td><td> 0,5412</td><td>or</td><td> 1,0932</td><td>OR</td><td></td><td>OR</td><td> -1,0932</td><td>or</td><td> 0,5412</td><td>or</td><td> 1,4074</td><td>OR</td><td> -</td>

ES 2 380 698 T3 (Continued)

<td>Imaginary part</td><td>or</td><td> 0,13862</td><td>OR</td><td> 0,5412</td><td>OR</td><td> -0,89717</td><td>OR</td>

<td>Imaginary part</td><td>OR</td><td> -1,4074</td><td>OR</td><td> -0,5412</td><td>or</td><td> -1,0932</td><td>or</td>

<td>Imaginary part</td><td>OR</td><td> -1,4074</td><td>OR</td><td> 0,5412</td><td>or</td><td> -1,0932</td><td>or</td>

<td>Imaginary part</td><td>OR</td><td> 0,13862</td><td>OR</td><td> -0,5412</td><td>or</td><td> -0,89717</td><td>or</td>

IS 2 380 698 T3

Next, step S51 or S52 will be described, which removes the DC component from the frequency domain in FIG.

16.

Step S51 is used to selectively remove the DC component. Only the DC component of Table 15 becomes 0. In other words, the result of Tables 15 and 16 is shown in the following Table 19, and the result of Tables 17 and 18 is shown in the following Table 20.

For descriptive purposes, the following Tables 19 and 20 list the DC components only, and the remaining components other than the DC components are omitted from Tables 19 and 20.

[Table 19]

<td>m0 = 1</td><td>Real part</td><td>Imaginary part</td><td>m1 = 17</td><td>Real part</td><td>Imaginary part</td><td>m2=19</td><td>Real part</td><td>Imaginary part</td><td>m3=35</td><td>Real part</td><td>Imaginary part</td>

[Table 20]

<td>m0 = 1</td><td>Real part</td><td>Imaginary part</td><td>m1 = 15</td><td>Real part</td><td>Imaginary part</td><td>m2 = 17</td><td>Real part</td><td>Imaginary part</td><td>m3=31</td><td>Real part</td><td>Imaginary part</td>

Step S51 can be explained as a function of the frequency domain as described above, or it can also be explained as a function of the time domain.

For example, according to this embodiment of the present invention, the sequence of length 35 can be denoted as c (n). This "c (n)" sequence corresponds to the time domain sequence. The result of the selective removal of CC from the sequence c (n) "can be denoted as" d (n) ".

In this case, the sequence "c (n)" can be represented by

- O · / 33) J can be represented by • and the sequence “d (n)”

If the sequence exhibits the repeating structure in the time domain in step S52, a frequency component is alternatively generated at the frequency indices of the frequency domain. In step S52, in order to prevent the frequency component from being present in the DC component during subcarrier mapping, a corresponding sequence is shifted or undergoes a CS process to remove the DC component.

The resulting indices from Tables 15 to 18 are adjusted by step S52 above, and the detailed result will be omitted here for ease of description.

After the data processing for removing the CC component is finished, another S60 data processing is carried out to convert the resulting sequence to a time domain sequence. If the result of Table 19 is processed by step S60 above, the results of Tables 21 and 22 are obtained. If the result of Table 20 is processed, the results of Tables 23 and 24 can be obtained.

IS 2 380 698 T3

[Table 21]

<td>Imaginary part</td><td> 0,11785</td><td> 0,030695</td><td> 0,45987</td><td> -0,58926</td><td> 1,1027</td><td> -0,7013</td><td> 0,11785</td><td> 1,0242</td><td> -0,52494</td><td> -0,58926</td><td> 0,76064</td><td> 1,0242</td>

<td>Imaginary part</td><td> 0,11785</td><td> -0,87834</td><td> -0,22417</td><td> -0,58926</td><td> -0,86696</td><td> 0,69143</td><td> 0,11785</td><td> 0,54047</td><td> 0,76064</td><td> -0,56926</td><td> -0,52494</td><td> 0,54047</td>

<td>Imaginary part</td><td> 0,11785</td><td> -0,87834</td><td> 0,45987</td><td> -0,58926</td><td> 1,1027</td><td> 0,89143</td><td> 0,11785</td><td> 0,54047</td><td> -0,52494</td><td> -0,58926</td><td> 0,76064</td><td> 0,54047</td>

<td>Imaginary part</td><td> 0,11785</td><td> 0,030695</td><td> -0,22417</td><td> -0,58926</td><td> -0,86696</td><td> -0,7013</td><td> 0,11785</td><td> 1,0242</td><td> 0,76064</td><td> -0,58926</td><td> -0,52494</td><td> 1,0242</td>

ES 2 380 698 T3 (continued)

<td>Imaginary part</td><td> 1,0242 |</td><td> 0,76064</td><td> -0,58926</td><td> -0,52494</td><td> 1,0242</td><td> 0,11785</td><td> -0,7013</td><td> 1,1027</td><td> -0,56926</td><td> 0,45987</td><td> 0,030895 |</td>

<td rowspan="2">Imaginary part</td><td rowspan="2"> 0,54047</td><td rowspan="2"> -0,52494</td><td rowspan="2"> -0,58926</td><td rowspan="2"> 0,76064</td><td rowspan="2"> 0,54047</td><td rowspan="2"> 0,11785</td><td rowspan="2"> 0,89143</td><td rowspan="2"> -0,86696</td><td rowspan="2"> -0,58926</td><td rowspan="2"> -0,22417</td><td> ,87834 |</td>

<td rowspan="2">Imaginary part</td><td rowspan="2"> 0,54047</td><td rowspan="2"> 0,76064</td><td rowspan="2"> -0,58926</td><td rowspan="2"> -0,52494</td><td rowspan="2"> 0,54047</td><td rowspan="2"> 0,11785</td><td rowspan="2"> 0,69143</td><td> ,1027</td><td rowspan="2"> -0,58926</td><td rowspan="2"> 0,45987</td><td> ,87834 |</td>

<td>Imaginary part</td><td> 1,0242</td><td> -0,52494</td><td> -0,58926</td><td> 0,76064</td><td> 1,0242</td><td> 0,11785</td><td> -0,7013</td><td> -0,86696</td><td> -0,58926</td><td> -0,22417</td><td> 0,030695</td>

IS 2 380 698 T3

[Table 22]

<td>Imaginary part</td><td> 0,11785</td><td> -0,67834</td><td> -0,22417</td><td> -0,58926</td><td> -0,68696</td><td> 0,69143</td><td> 0,11785</td><td> 0,54047</td><td> 0,76064</td><td> -0,58926</td><td> -0,52494</td><td> 0,54047</td>

<td>Imaginary part</td><td> 0,11785</td><td> -0,87834</td><td> 0,45987</td><td> -0,58926</td><td> 1,1027</td><td> 0,69143</td><td> 0,11785</td><td> 0,54047</td><td> -0,52494</td><td> -0,58926</td><td> 0,76064</td><td> 0,54047</td>

<td> 1179</td><td rowspan="2"> 0,69143</td><td rowspan="2"> -0,0558</td><td rowspan="2"> -0,58926</td><td rowspan="2">00 I HEARD 00 or</td><td rowspan="2"> -0,87834</td><td rowspan="2"> -0,88215</td><td rowspan="2"> -0,87834</td><td rowspan="2">3- 00 I HEARD 00 or</td><td rowspan="2"> -0,58926</td><td rowspan="2"> -0,0558</td><td rowspan="2"> 0,69143</td><td> 1179</td>

ES 2 380 698 T3 (Continued)

<td>Imaginary part</td><td> 0,54047</td><td> -0,52494</td><td> -0,58926</td><td> 0,76064</td><td> 0,54047</td><td> 0,11785</td><td> 0,69143</td><td> -0,86696</td><td> -0,56926</td><td> -0,22417</td><td> -0,87834 |</td>

<td>Imaginary part</td><td> 0,54047</td><td> 0,76064</td><td> -0,58926</td><td> -0,52494</td><td> 0,54047</td><td> 0,11785</td><td> 0,69143</td><td> 1,1027</td><td> -0,58926</td><td> 0,45987</td><td> -0,87834</td>

IS 2 380 698 T3

[Table 23]

<td>Imaginary part</td><td> -0,125</td><td> -0,22302</td><td> 0,25768</td><td> -0,89801</td><td> 0,875</td><td> -0,75939</td><td> -0,50768</td><td> 0,87018</td><td> -0,125</td><td> -1,1202</td><td> -0,50768</td><td> 0,50939</td>

<td>Imaginary part</td><td> 0,125</td><td> -0,87018</td><td> -0,25768</td><td> -0,50939</td><td> -0,875</td><td> 0,89801</td><td> 0,50768</td><td> 0,026983</td><td> 0,125</td><td> 0,22302</td><td> 0,50788</td><td> -0,64801</td>

<td>Imaginary part</td><td> -0,125</td><td> -1,1202</td><td> 0,25768</td><td> -0,75939</td><td> 0,875</td><td> 0,64801</td><td> -0,50768</td><td> -0,22302</td><td> -0,125</td><td> -0,02698</td><td> -0,50788</td><td> -0,89801</td>

<td>Imaginary part</td><td> 0,125</td><td> 0,026983</td><td> -0,25768</td><td> -0,54801</td><td> -0,875</td><td> -0,50939</td><td> 0,50768</td><td> 1,1202</td><td> 0,125</td><td> -0,87018</td><td> 0,50768</td><td> 0,75939</td>

ES 2 380 698 T3 (Continued)

<td>Imaginary part</td><td> 0,87018 |</td><td> -0,50788</td><td> -0,75939</td><td> 0,875</td><td> -0,89801</td><td> 0,25768</td><td> -0,22302 |</td>

<td>Imaginary part</td><td> 0,026983</td><td> 0,50788</td><td> 0,89801</td><td> -0,875</td><td> -0,50939</td><td> -0,25768</td><td> -0,87018 |</td>

<td>Imaginary part</td><td> -0,22302</td><td> -0,50788</td><td> 0,64801</td><td> 0,875</td><td> -0,75939</td><td> 0,25788</td><td> -1,1202 |</td>

<td>Imaginary part</td><td> 1,1202</td><td> 0,50788</td><td> -0,50939</td><td> -0,875</td><td> -0,64801</td><td> -0,25768</td><td> 0,026983 |</td>

IS 2 380 698 T3

[Table 24]

<td>Imaginary part</td><td> 0,125</td><td> -0,87018</td><td> -0,25788</td><td> -0,50939</td><td> -0,875</td><td> 0,89801</td><td> 0,50788</td><td> 0,026983</td><td> 0,125</td><td> 0,22302</td><td> 0,50788</td><td> -0,64801</td>

<td>Imaginary part</td><td> -0,125</td><td> -1,1202</td><td> 0,25788</td><td> -0,75939</td><td> 0,875</td><td> 0,64801</td><td> -0,50788</td><td> -0,22302</td><td> -0,125</td><td> -0,02698</td><td> -0,50768</td><td> -0,89801</td>

<td>Imaginary part</td><td> 0,125</td><td> 0,026983</td><td> -0,25788</td><td>OR 00 3- 00 or</td><td> -0,875</td><td> -0,50939</td><td> 0,50768</td><td> 1,1202</td><td> 0,125</td><td> -0,87018</td><td> 0,50788</td><td> 0,75939</td>

ES 2 380 698 T3 (continued)

<td>Imaginary part</td><td>00 or 00 or</td><td> -0,50788</td><td> -0,75939</td><td> 0,875</td><td> -0,89801</td><td> 0,25788</td><td> -0,22302 |</td>

<td>Imaginary part</td><td> 0,026983</td><td> 0,50768</td><td> 0,89801</td><td> -0,875</td><td> -0,50939</td><td> -0,25788</td><td> -0,87018 |</td>

<td>Imaginary part</td><td> -0,22302</td><td> -0,50788</td><td> 0,64801</td><td> 0,875</td><td> -0,75939</td><td> 0,25788</td><td> -1,1202 |</td>

<td>Imaginary part</td><td> 1,1202</td><td> 0,50788</td><td> -0,50939</td><td> -0,875</td><td>or 00 M- 00 or</td><td> -0,25768</td><td> 0,026983 |</td>

IS 2 380 698 T3

FIG. 17 shows the comparison on the constellation map between a sequence that has no CC component and another sequence that has a CC component, according to the present invention.

In greater detail, if the parent sequence index (m0) is "1", the result of the 2x repetition of a sequence of length 36 is shown in FIG. 17 (a), and the result of the 2x repetition of a sequence of length 32 is shown in FIG. 17 (b).

In this case, each of the two aforementioned cases of FIG. 17 (a) and FIG. 17 (b) includes only 12 constellations. Although a CC selective removal is performed, the location of the constellations is shifted by the value of selectively removed, so that 12 fixed constellations remain.

The above-mentioned features with the least number of constellations can greatly reduce the number of calculations associated with the receiving end correlation function.

FIG. 18 is a conceptual diagram illustrating a procedure for designing a sequence in the frequency domain such that a 2x repeating structure is formed in the time domain according to the present invention.

The Zadoff-Chu sequence maintains ideal correlation characteristics in the time domain and in the frequency domain. Therefore, the sequence can be generated in the time domain, or it can also be generated in the frequency domain.

In other words, if the Zadoff-Chu sequence is inserted into the frequency domain, and the sequence is inserted into the even frequency indices at intervals of two partitions (that is, two spaces), the same result is obtained as in the above case where the sequence generated in the time domain is mapped to the time domain.

A further description of step S10 of FIG. 16. The procedure for selecting multiple sequence indices is the same as a procedure that easily computes the cross-correlation using the receiving end.

However, the Zadoff-Chu sequence basically serves as a polyphasic sequence, so it is vulnerable to frequency shift.

Therefore, it is preferable that the sequence can be selected taking into account the frequency offset in the sequence selection step.

In other words, if three sequences are selected without taking into account the frequency offset according to Equation 18, the present invention may have difficulties in finding a correct correlation value according to the frequency offset. In this case, two sequence indices can be determined from three sequence indices by Equation 18, and the remaining sequence index can be determined by considering the frequency offset characteristics.

In conclusion, in case of selecting a plurality of sequence indices, only Equation 18 can be considered, and the frequency offset characteristics can also be considered together with Equation 18.

The above-mentioned concept refers to a plurality of sequence indices taking the frequency offset into account. A procedure will be described below that further takes into account criteria other than frequency offset.

Next, a procedure that takes the sequence index into account will be described further considering the correlation characteristics.

For example, the Zadoff-Chu sequence serves as a CAZAC sequence, so it is preferable that a specific sequence can be selected that exhibits ideal autocorrelation characteristics and superior cross-correlation characteristics. For example, if the length is 35, the set of three sequences (1, 2, 34) or (1, 33, 34) can be selected considering Equation 19, the frequency offset characteristics, and the PAPR characteristics.

In FIG. 19 shows the cross-correlation characteristics of the set of indices (1, 2, 34).

The characteristics of a sequence of length 35 according to the present invention will now be described.

Preferably, the sequence of length 35 can be used for the LTE system.

The SCH signal is assumed to be transferred to six radio blocks (corresponding to 73 subcarriers including the DC component).

If the 2x repeat structure is generated in the time domain using all 73 subcarriers, a sequence of length 36 can be used. All frequency or time domain occurrences can be made available. By

For example, even if the sequence is not repeated in the time domain or is repeated three times, all instances of the frequency or time domain can also become available.

In this case, the present invention requires the receive end of the interpolator (1.08 x MHz).

However, based on the criteria mentioned above (i.e. references), an optimal group of indices is (1, 2, 35). In this case, the cross-correlation is shown in FIG. twenty.

In the worst case scenario, the group of indices in FIG. 20 can have a cross-correlation of 40%.

In this case, it is preferable that the present invention can use a sequence with a length less than "36.

In this case, it is preferable that the present invention approaches a desired length that will be generated initially and at the same time selects an odd-length sequence, so it is more preferable that the length can be set to 35.

The sequence of length 35 can search for the set that has correlation characteristics greater than those of an even-length sequence.

For reference, the selection of the sequence index (1, 2, 34) in FIGS. 19 and 20 refer to the 2x repeat of the sequence.

When generating the PSC for P-SCH, the present invention can use a corresponding sequence without repeating the sequence after generating the sequence.

The present invention is supposed to use three Zadoff-Chu sequences as multiple sequences for the PSC. In this case, the present invention must select two root indices from three Zadoff-Chu sequences so that the sum of the two root indices is "63" in case of using a sequence of length 63. As a result, the property of conjugate symmetry between corresponding sequences is satisfied.

Also, the remaining root index, different from the two root indexes, can be selected using other conditions, and it is preferable that the remaining root index can be selected taking into account the aforementioned frequency offset problem (and / or PAPR ( CM)).

According to the above-mentioned assumption, if the sensitivity to frequency shift and / or the degree of PAPR for each root index is (are) expressed according to various conditions, the following result can be obtained.

FIG. 21 is a graph illustrating frequency shift sensitivity and CM under various conditions in accordance with the present invention.

Referring to FIG. 21, "Nzc" indicates the length of a Zadoff-Chu (ZC) sequence. Case 1 indicates that a ZC sequence of length 63 is used. Case 2 indicates that a ZC sequence of length 63 is used according to the circular extension scheme.

Case 3 indicates that a ZC sequence of length 64 is used. Case 4 indicates that a ZC sequence of length 64 is used using a truncated scheme.

In greater detail, FIG. 21 (a) shows the frequency shift sensitivity of the cases 1 to 4 mentioned above, and FIG. 21 (b) shows the CM of each of the cases 1 to 4 mentioned above.

Based on the result mentioned above, the present invention provides a method to select the set of root indices, as shown in the following Table 25.

IS 2 380 698 T3

[Table 25]

<td>Root index</td><td> 34</td><td> 29</td><td> 25</td><td> 34</td><td> 29</td><td> 25</td><td> 29</td><td> 31</td><td> 27</td><td> 31</td><td> 34</td><td> 38</td>

<td>Sensitivity to</td><td> 0,2</td><td> 0,2</td><td> 0,2</td><td> 0,1</td><td> 0,1</td><td> 0,2</td><td> 0,3</td><td> 0,3</td><td> 0,3</td><td> 0,1</td><td> 0,1</td><td> 0, 17</td>

<td>frequency offset</td><td> 020 4</td><td> 020 4</td><td> 288 5</td><td> 863 1</td><td> 863 1</td><td> 161 3</td><td> 744 7</td><td> 756 4</td><td> 815 1</td><td> 654 7</td><td> 654 7</td><td> 94 2</td>

<td>Approximate CM</td><td> 2,2</td><td> 2,2</td><td> 2,3</td><td> 2,2</td><td> 2,2</td><td> 2,2</td><td> 2,9</td><td> 4,6</td><td> 4,2</td><td> 4,2</td><td> 4,2</td><td> 2, 64</td>

<td>Average value of</td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td>

<td>correlation</td><td colspan="2"> 0,015622</td><td></td><td colspan="2"> 0,015569</td><td></td><td colspan="2"> 0,015185</td><td></td><td colspan="2"> 0,015019</td><td></td>

<td>crusade</td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td>

<td>Root symmetry with a master frequency of 0.96 MHz</td><td colspan="3">OR</td><td colspan="3">OR</td><td colspan="3">X</td><td colspan="3">OR</td>

In other words, if the root index of the first sequence, the root index of the second sequence, and the root index of the third sequence are denoted as (x, yz), then (34, 29, 25) is selected according to case 1 and (34, 29, 25) is selected according to case 2. On the other hand, (29, 31, 27) is selected according to case 3 and (31, 34, 38) is selected according to case 4 . Except for the set of root indices in case 3 out of the sets of root indices, all sets, each of which has the conjugate symmetry property mentioned above, are included in the sequence selection process.

When using the set of root indices selected as described above, the autocorrelation profile is as follows.

FIGS. 22 to 25 are graphs illustrating autocorrelation profiles of individual sets when selecting a set of root indices in accordance with the present invention.

In FIGS. 22 to 25, the one-part correlation is assumed to indicate the 0.1 ppm frequency shift condition, and the 2-part correlation indicates the 5.0 ppm frequency shift condition. In case of using the set of root indices according to the present invention, it can be recognized that the superior autocorrelation characteristics can be obtained.

On the other hand, a procedure for the transmission of signals using sequences generated when using the set of root indices of case 1 and a ZC sequence of length 63 will be described below. In this case, in the set of root indices of the Case 1, the root index of the first sequence is 34, the root index of the second sequence is 29, and the root index of the third sequence is 25.

If the values "34", 29 "and 25" are used as the root indices of three sequence combinations, the sum of the root indices 34 and 29 is 63, corresponding to the length of the corresponding ZC sequence, so that the property of conjugate symmetry mentioned above is satisfied. Therefore, if the sequence generated by the above root indices is transmitted as a communications signal, the receiving end can easily calculate the cross-correlation operation using the generated sequence.

On the other hand, as long as any of the root indexes from the above-mentioned set of root indexes is selected so that a sequence of length 62 is generated, then a procedure to map the generated sequence with the domain resource element will be described below. of frequency.

FIG. 26 is a conceptual diagram illustrating a method for mapping a sequence of length 63 to a frequency domain resource element in accordance with the present invention.

After generating the sequence of length 63, the present invention continuously maps the sequence generated with the frequency resource element in order to maintain the characteristics of the sequence ZC as far as possible, indicating that the sequence ZC has an amplitude constant in the time and frequency domains, which is described in detail below.

As can be seen in FIG. 26, in the Zadoff-Chu (ZC) sequence of length 63, the components corresponding to point (30) are continuously mapped to resource elements from a frequency resource element with a frequency resource element index of -31 up to a frequency resource item with

ES 2 380 698 T3 has a frequency resource element index of "-1", and components corresponding to "P (32) ~ P (62)" are continuously mapped to resource elements from a frequency resource element with a Frequency resource element index of 1 up to a frequency resource element with a frequency resource element index of 31. According to the aforementioned correlation operation, the thirty-second element (ie, P (31)) of the generated sequence is mapped to the frequency part "0".

Therefore, this embodiment provides a method of selectively removing the part "P (31)" mapped to the part having the frequency "0", as shown in FIG. 26. However, if necessary, the present invention can also use another method capable of selectively eliminating the part having frequency 0 during time domain transmissions.

The frequency domain mapped sequence can be converted to a time domain signal by IFFT or equivalent operation (eg IDFT or IFT), so that it can also be transmitted as an OFDM symbol signal.

The signal transmitted by the above-mentioned embodiments can be received at the receiving end, so that the receiving end can detect a corresponding signal using the cross-correlation operation. In this case, in case of using the set of sequences exhibiting the aforementioned conjugate symmetry property, the receiving end can more easily detect the signal.

Next, the receiving end signal detection process, that is, a procedure for calculating the cross-correlation value, will be described.

The look of the receiving end

Next, operations of the receiving end will be described.

There is a predetermined rule among the Tx sequences generated by the aforementioned embodiments. Thus, the receiving endpoint can obtain the sequence correlation values corresponding to the remaining root sequence indices by using a correlation value of a specific sequence corresponding to a single root sequence index, instead of calculating the value of cross correlation of all sequences.

Next, a procedure for calculating the cross-correlation value according to this embodiment will be described. This embodiment calculates the cross-correlation value between the Rx signal and each of the multiple sequences. In this case, the present invention determines several intermediate values generated while calculating the cross-correlation value between the Rx signal and the specific sequence (ie, the first sequence). Furthermore, the present invention can calculate not only the cross-correlation value between the Rx signal and the first sequence by adding or subtracting the intermediate values, but also another cross-correlation value between the Rx signal and another sequence (i.e. a second sequence).

Various cases where multiple available sequences are selected will be described in detail.

This example shows a procedure to calculate the cross-correlation value of the selected sequences, which have a length of 36 and the values m0 = 1, m1 = 17, m2 = 19, and m3 = 35.

The receiving end stores the sequence having a sequence index of "1" and calculates the cross-correlation value between the stored sequence and the received sequence. In this case, in case of using the intermediate results generated when calculating the cross-correlation value between the Rx signal and the sequence having a sequence index "1", the cross-correlation value between the Rx signal and the sequence index can be calculated. sequence that has sequence index "17", The cross-correlation value between the Rx signal and the sequence having the sequence index "19" can be calculated and at the same time the cross-correlation value between the Rx signal and the sequence having the sequence index 35 can be calculated.

This example will be described based on a specific case where the cross-correlation value of the delay τ-th is calculated. In other words, if the Rx signal is denoted r (n), this example will be described as a function of the cross-correlation value associated with the delayed d-th sample r (n + d).

In this case, the result of the correlation value of the sequence index "m" is shown in the following equation 22:

[Equation 22] *

ES 2 380 698 T3 in which m0= 1, mi = 17, m2= 19 ym3= 35, so the following relationship can be provided.

[Equation 23]. when k is even otherwise when k is even

In addition, tom1=17(k) indicates a conjugate of am0=1(k) provided that the value of k is an even number. If the value of k is an odd number, the real part of am0=1(k) is substituted for the imaginary part of it, and the substituted result is multiplied by the value "-1".

In addition, tom2=19(k) indicates a conjugate of am0=1(k) provided that the value of k is an even number. If the value of k is an odd number, am2=19(k) indicates a conjugate of the result obtained when the real part is replaced by the imaginary part.

tom3=35(k) is obtained when the value "-1" is multiplied only by the real part of am0=1(k) provided that the value of k is an even number. If the value of k is an odd number, am3=35(k) is equal to the conjugate symmetry property of am0=1(k).

The Rx signal r (k + d) can be calculated using an instantaneous correlation value of each sequence in association with "r_i (k + d) + jr_q (k + d)". In this case, "r_i ()" indicates the real part of the Rx signal, and r_q () indicates the imaginary part of the Rx signal.

For descriptive purposes, the cross-correlation value of the Rx signal (that is, the cross-correlation value between the Rx signal and the known sequence of the receiving end) can be defined as follows.

For descriptive purposes, the cross-correlation value Zr (2l + d) (am°=1(2l) between the known sequence of the receiving end and the even sequences of the signal Rx is divided into a real part and an imaginary part, as represented by the following Equation 24:

The result of Equation 24 can be divided into a real part (hereinafter referred to as Rpar (0)) and an imaginary part (hereinafter referred to as Ipar (0)).

If the cross-correlation value associated with the odd sequences of the Rx signal is divided into a real part and an imaginary part, the following Equation 25 can be obtained:

IS 2 380 698 T3

[Equation 25] r .

Γ (27 +1 + í /) ¿Z ''J '(27 + 1) = (Rimpar_i_í- Rimpar_q_q) J (Jimpar_ Í_q + Iimpar_q_r) i ~ ó = Rimpar' + Jlimpar '

The result of Equation 25 can be divided into a real part (hereinafter referred to as "Rimpar (0)") and an imaginary part (hereinafter referred to as "Iimpar (0)").

If the cross-correlation value Σγ (2 / + 3) (Ο10=1(2 /)) associated with the even sequences of the conjugate of the Rx signal is divided into a real part and an imaginary part, the following Equation 26 can be obtained:

[Equation 26]

1' .

r (27 +1 + ¿7) Cl ^ '(27+ 1) = (Rimpar_J_Í - Rimpar_q_qy — .J ^ Iimpar_Í_q + Iimpar_q_l) i-9. '= Rimpar' + Jlimpar '

The result of Equation 26 can be divided into a real part (hereinafter referred to as "Rpar (1)") and an imaginary part (hereinafter referred to as "Ipar (1)").

If the cross-correlation value Σγ (2 / + 1 + o) (am0=1(2 + 1)) associated with the odd sequences of the conjugate of the Rx signal is divided into a real part and an imaginary part, the following Equation 27 can be obtained:

[Equation 27] i ”.

f (27 + 1 + ¿7 (27 + 1) = (Rimpar_Í_i- Rimpar_ yF j (.Iimp3r_i_q [+ limpar_q_ 7) / = 0 = Rimpar '+ Jlimpar

The result of Equation 27 can be divided into a real part (hereinafter referred to as "Rimpar (1)") and an imaginary part (hereinafter referred to as "Iimpar (1)").

In this case, the calculation of the “Rpar0”, “Ipar0”, “Rimpar0”, “Iimpar0”, “Rpar1”, “Ipar1”, Rimpar1 ”and“ Iimpar1 ”values can be considered identical to the calculation of the“ Rpar_i_i ” , "Rpar_q_q", "Ipar_i_q", "Ipar_q_i", "Rimpar_i_i", "Rimpar_q_q", "Iimpar_i_q" and "Iimpar_q_i" shown in Equations 24 to 27.

The procedure to calculate the values "Rpar_i_i", "Rpar_q_q", "Ipar_i_q", "Ipar_q_i", "Rimpar_i_i", "Rimpar_q_q", "Iimpar_i_q" and "Iimpar_q_i", mentioned above, with reference to the following will be described below. Equation 28:

IS 2 380 698 T3

[Equation 28]

Rpar Jj r + r_i (2 - d) · ♦ 0, $ 3969 + r í (4 - dj * 0: l7365 + r _i (6 + d) * (- l j + r_i (S; + tf) * Q; 76 «M · + r_i (10 + dj * (- 0.76604) + r_i (t2 + d) * í. + R_ * A4+<0*(-0-.l ~ 365) + r_i (16 + d) * (- 0.93969) + F._í (18 + d) * (- i) + r_í (20 + d) * (- 0 $ 3969) + rj (22 + d) * (-0.173 65) +. / _ ¡(24 + i) »l + r _í (26 + d) * (+ 0.76604 j + r _ / (2S + d) * 0.76604 + r J (3Ó + d) * (-1) + r _ í (32 + d) * 0. L7363 + r_íi (34 + d) * 0.93969 (> _í (0 + d) -r _ ((6 + d) + r _ / ( 12 + d) -r_i (18. + d) + r_í (24- + d) -F_.Í(3Q + d)} + {r_i (2 + d) - r_í (16 + d) - r _i (20 + d) + r _í (34 + d) [♦ 0.93969 + (r_í (4+ d) - rj (14+ d) - r _í (22 + d) -rr _f (3? + d) | * 0: 17365 + {r_í (S + d) + ¡: _i (lÓ + d} -r .4 ( 26+ d) + r_i (2S + d) l * 0.766Ó4

Λ par_4_S a

r_g (0 + d) * 0 + r_g (2 + d) * (- 034202) -r_g (4- + d) * (- 4> 58481) + r_g (6-d) * 0 + r_g (8 + < f) * 0.64279 «• _g (10 + d) * (- +) 64279) + r_g (P + d) * fr + r_g (14 + d) * 0 $ 8431-r_g (16 + d) * 034202 + r_ír ( l8 + d) * 0 + r_g (20 + d) * 0J4202-r_g (22-d) * 0J8481 + r_g (24 '+ d) * 0-i-r_g (2e + dy * (- O.64279) - »-R_g (2S + d) * 0: 6« 7-9 + r _ $ (30+ d) * O + r _n (32 - d) * (-0: 98431) ~ r_g (34-d) * ( -034202) (-r_g ('- d) i-r_o (16 + ¿) r _g (20-í-d) - r_g (34 - ^)) ^ 0-34202 + {- r_g (4-rd) * r_g (14-í-rf) * i-_g (22 -rd'j-r _g (32 + d)] * 0.93431 + {r_g (S-í-d) -r_g (10 + d) .- rj_g ( 26-rd) + r_g (28 + d)} * 0.64279 'í

ES 2 380 698 T3 ¡par _'_ q ρ_ί (0 + -α ') · »0 ^ ί · _ί (2 + 4) * (- 034202') · + κ_1 (4 + ^) * (- 09'848ΐ ) + ι · _ί (6 ^ 4 ·) * 0 + Γ_ <8 +. </) Ό.64279, r-_¿ (l0 + d) * (- 0.64279) + r_i (12 + d) * 0 + r_í (14 + 4) »0.98481. + r_i (16 + d) * 0j4202. + r_í (18 + d) * 0 -; _ í (20: + d) * Ó34202 + r_í (22- + d) * 0- 98481. + r_i (24:+ d) * 0 + r_í (26 + d) * (- 0.64279) -r _ / (2'3 + d) * 0; 64279 * r _í (3O + rf) »0 + r _i (32 + rf)» (-0 AM8i) +> _i (34 + d) * (- 0.34202)

E-P_f (Í + <0 + r _í (16 + -rf) + F_í (20 + d) -f_Í (34 + d)} * Ó34202 + © _i ¡μ A d) + r _i (14 + rf) + t _f (22 + rf) - r _ í (32 + 4)} · 0/98481 + E _ / (8 + d) -r_j (10 + d) -r_¡ (26 + rf) tr_í (23 + d )} * p; 642 * 9

Spar_íJ s

r _? (0- + rf) * l + r_e (2 + .tf) * tt9S9 »+ 'r _« (4 + d) * 0.I7365 + r_a (6. + d) * í-l) + r_? (8 + di * 0.76604 + r_ <7IL + d) * (- (1766O4) + r _? (Í2 + d) 'I + r_olM + d | * |' -O.17365j + r_c (16-rd) »( -O.93969) -r_aíl8 + dj * (- l) + r _ ^ (»+ <f) * (- 0559W) '+ r¿í (22 * rf) f (-0il7365) + r_f (2 * + d) »l + .r_írí2e4.rf) * (- O.T6604): * r_? í28-rf) * 0-7e« M + r_ < (3O + rf.? (- t) + r _ e (32 + d) »0.17365 + r_q f 34, 41 * 093969 ''

E _ «(0 + 4) -r _« ([6+ d> r_e (P + d) -r _? (13 + d) + r _? (24 -! - d) -y_ffí30 + d; i} + {r _ ?. (.- + 4) - + dj - r. _? (3) + d) + r_? (34 + d)}; *0.93969

+. {r _? (4 + 4) -r _? (14 + d) -r _a (22 +?) -rr_p [: 32 + rf)}. * 0.17365 +: {r_? Jí¿-d) -r_eilO-d) -r_5 (26> dj + r_of28 + d) E<:'i’6604

XimPaLi_i s

r _! (t + rf) * CL99619 + r_í (3 + d) r * 0.7071 t + rjí> + rf) * (- O.5? 35S) + r_i [7 + d) '(-0.42262) + r_fi9 + d) * 0.'0711 -r_í (U + d) * (-0.42262) + r_.í (V3 + rf) * (+ OJ73 «UΓ_ί (15 · * d) * 0; 7071t + r_> ÍÍ7. + d) »aS96l9 + r_í (l9 + rf) * 0.99619 ir_í (21 + d) * CL70; ll + r_¿ (23 + d) * (- 0.:⁄353)+r_ri;25.+ rf) * ( -0.42262) + r_f (27 + d) * 0: 70711 + r_i (29 + rf.) * (+ 0. «262) + rj (3 l + rf) * (- a57358) + r_if33 + a) * O : 70711, r_í {35 + d) * 0.99619 a

[r_fil + d) + r _. '(17, d) + r_! í! 9. + d) + r_J (3S + d)) * 0.99619 i (? _! (3 + dj + r_'i9 + d ) + r_rílS + d) + r_f (-2l + d) + r_i (.27 + d | +? _ '(33 + dlj; * O.7O711 + HJ © © r _ :( 13 + di-r J (25 + rf) - r _f (31- rf)} * 0.5.7353

- (-r _í (7 + dj - r _ / (lI - di- rj (2S + d) - r_í (29, d)} * 0.42262

3 odd_ 5'_?

r _o (l + dj * (- 0.087156) + r_o (3 + rf) »(-0.70711). + r_ qi '5+ d) ♦ (-0.81915) + r _d (7 + <1 * 0/9063 í ^ r © 9 ^ dy (-Q. ~ 0-ll¡ ^ r_c (U + d) * 0.906> l. + r_c (13 + 4) * (- 0.81915j + r_5 (15 + d) »(- 0.707 ll) + r_d (17 + dj * (-O.OS7156J + r_o (19 + <) * (- 0.037156) -rr _5 (21+ <j. * (- 0. ”O71.l) + 7_5 (23 + 4) »(- 0.31915), r_o (25 + d) * 0.9063L + r_a (27 + di * (- 0.70ll) + r_c (29 + d)» 0.90631 + r_ff (31. + d) * (- 0.8 L915) + r_e (33 + rf) * | -Ο.Ο71Τ) τΓ_σ (35 + .4) * (- 0.08; 156) fr _o (1+ d) ~ r _d {17 + d) -r _d (19 ¿-.Rf) -r_qí, 35 + di} * O / OS7.156

- {- r_ff | -3 + d) -r_fff.9 + d) -r_?(15 + d | -! -_?(21 + íf) -r_tfÍ27 + dj-r_ff (33 + d)} * O.7O-ll + f-r _? (5 + <#) - r - «(i3 + -rf) -r_e (23+ 14-d.) | * O.8191S 4{r_? l / + 4) +J'_? (H + 4) + r_s (25-d) + r_oi'29 + d)} * 0.90631.

ES 2 380 698 T3 r_i (l + 4) »(- 0.087156) + 7_í (3 + 4) * (ja? 07íl). + 7j (3 + a) * (- 0.8l9«) + 7_í (7 + íí ) »OL90631 + 7 ^ í (9 + 4) + (? A7!)? Ll) + r_í (ll — á) * 0 ^ C631 + r_! (13 + ¿j + (- O: 31915) + r_fi 15; + ¢ 1) + (- 0170711) +7 _if. 7 + ¢ /) + (- 0.082156) + r _ '(l9 + 4) * (- 0.087156) + r_l (21 + d) * (- 0.7071i} + r_i (23 + rf ') + (- O.S1915). + r_f (25 + 4) +. 03053Í + r_f (27 + rf) »(- 0.7071.1) +7 _. (29 + 4) * 03053l + 'r _' (31 + d) + (- <18l915) + r_í (.33+ 4) + (- 0.7071 l) + r_i (35 + ¢ /) + (- 0: 087156) (-r_i (I + 4 ) -rJí (l- + 4} Tr (19 + 4) -r_ / (35. + 4)} +!aqS7Í5e + {- r _íÍ3 + d) - r_r <? + d) -r_í (l S + d} _ r_f {21 + 4) - r_i (27 + dj- r_t (33 + d) [+ 0.70711 * {- <Jí- +4.) - r_i (13 + 4 ) -7 _í (23+ d \ - r_1 (3 t + 4)} i »0.31915 + {r_í (7-i - </) + r_lfll¿.rf) -r_í (2 '+ rf) -í-r_í ( 39W)} »O.9C631

7 _? (1 + rf) *. 0J95194.r_e (3 * -rf) * O.7O? U + r _ «(3 + rf) * (- aST3S) + r_?(7 + 4) * (- 0.42262) + Γ_α (9 + 4) + 0.7.0Τ11 • w_e (n · * 4) * | '-Ι>. · Ε252) + 7_7 (13 + 4) + (- 0.57358 ) + Γ_ο (ΐ5 + 4) * 0.70711 + 7_ο (17 + 4) + 039619 + Γ_σ (19 + 4) »0.99619 + r_f (2Γ + 4) · Ο.7Ο711 + r_a \ 23- 4) + (-: 0.57353 ) + r_?(3+ 4) + (- 0.42262) + 7.1 (37+ 4) +0.70711+ r _; (29 +.4) + (- 0.42262) + r_?(3L-4) '(- 037353) -r_?(33 + 4) »0.7071l + r_?(35-d) »OJ9519 {r-4 (t + '4) + r_f (Í7. + D.) + - 7_e (l9. + D) + rjgX? 544)) ia99eW ^ {r-9Í97dHr_a (9.Td ') ^ r._G.íl5- ¥ d] vr_q {21 ~ d \ Fr ·> σ. (37 + 4} + r_ó (33 + d)} * 0.'0711 - + ( - ^. 4 (5 + 4) -7.0 (13 + 4) -7.0 (23-4) -7 ^ 7 (31 + 4)) + 037358 + {-7_7 (7 + 4j - 7_o (ll + i ) -7_o (25 + 4) -7_7l »+4)}; + 0.«: 262

The process in Equation 28 can be calculated by approximation. In other words, the calculation of Equation 28 can easily be done by quantization.

For example, it is preferable that the above approximation can be performed in the form of 0.93969> 1; 0.17365> 0.125 5 (= 1/8); 0.76604> 0.75 (= 1/2 + 1/4); 0.34202> 0.375 (= 1/4 + 1/8); 0.98481> 1; 0.64279> 0.625 (= 1/2 + 1/8); 0.99619> 1;

0,70711>0,75(=1/2+1/4); 0,57358>0,625 (=1/2+1/8); 0,42262>0,375(=1/4+1/8); 0,087156>0,125(=1/8);

0.81915> 0.875 (= 1-1 / 8) and 0.90631> 0.875 (= 1-1 / 8).

If the concept of Equation 28 approximates, the following Equation 29 can be obtained:

IS 2 380 698 T3

[Equation 29]

R pair J_í

[+ r _ f (2 + dj - r _ / (16 + d 'l- f _ í (20 + d). + r _ / (3 4 + ·. d) J + {f_í (4+ d' ) —R (14 + di- r _i (.22+ d) + r _i (32+ dj} * 0: 125 + fr J (& + dj - r _ i (10 + d) - r _i (26 + d.) + r _f (2S + .d $> 0.75

RPar Fí—to.

{-r _ g (Z + d] + r _ q (r16 + D'i. + · R _ q (20 + d) - r _q (34 + d ')} * 0.3 75 + [-r _ q (4 + d) + - r _ <? (> 4 + · d · j + · r _ q (.22 + d 'j - r _ q (32 + d 1} + {f _ q (S + dj - r _ q (1 O + d) - r _ q (26 + d} - + r _ qf 2 S + - d)} * 0.6 2.5 í par _i_q r _ f (2 - + d ¡+ r _ ¿(ló + d J + r _í (20 + · dj - r _ ¿f 3 4 + d * 03 75

[-r_2 (4 + di + f_i (1'4 + d) + r_i (22 + · d ·) -r_f (32 ~ d)} + (7_f (S-Í-d) -r _i'Í.10 + -d) —r _ · '(26 + d) ¿-r _f (28- + d) | * 0.625

Z par _q_i ír _ c (0 + d) - r _q (6 + d) + r _q (12 + d); - r _ q (18 + d) + r _ q (24 + dj - r_ q (30 + dj ^ + r _ q ( 2 + d) - r _ q (16 + dj - r _ d (20 + d) + r _ q (34 + dj + (* + d) ~ r- <Al4 + d) -r _a (22 + d ') + r_q (32 + d)} ♦ 0.125 + ^ r-_c (S + dl - r_a (10 + dj-r_ff (26 + d) + r _p (28 + djy * 0.75

IS 2 380 698 T3

Rimpar _l_ i {r_ ^ + d) + r J (17 + dj. + R_í (19 + d) -rr_j (35rd)} + {r_i33 + d) + F_¿ (9- * d ^ r_iO5 + d.) + r_f (2Í + d) + r_í (27 + d) + r_¿ (33 + d)} * a75 + [-FJ ¢ 5- + d) -r_¿ (13+ d) - r _ jf23 + d) -r _φ 1 + d)}. * Q.625 + fr _f (7. + d) -r _ϊ (11 + d} - r _i (.25+ d) -rj (29 + d)} * 0.375

Rimpar_ q _q {-r_q (.1 + dj-r_q (17 + d} -r_q (19-id ·} -ra (3 5 </)} ♦ 0.125 + (-r _f (3 '+ d) -r_q (9+ d) - r_q (15d) - r_q (21 + d) -r_q (27+ d) - r _q (33 + d)} · ♦ 0.75 + í-r_q (5 + dj-r _-e (13+ dj- r _ * (23 + d] -r_a (31 + d)] * θ

V '_? (+ Dj + r _ <? (11 + d] + r _ <? (25 + d) + r _q (29 + d) | limpar_i _a'

[-r_j (l + d) - r _- (17 + d) - r_i (19¿-d) - r _. (35 + d)} * 0.125 + {-r_f (3 + d) -r_i (9-id ) -F_¿ (15-rdj-r_í (21 + d) -r_i (27-rd) - / -_ ¿(33-rd)} * 0.75 f-r_f (54-dj-r _! (13 ^ d) -r j (23 + d) -r J (31 + ¿n __ '[+ r_f (7. + d) + rj (.ll ^ d) + rj (25 + d) + iv f (29 + d)}' '* limpar_ q _i (r _ σ (Γ + tí) .7- r _ a (17 + d) + r _ q119 + d) + r _ qi 3 5 + d)} * í' '_ e (3 + d) + r_tí (9 + d) + r_ff (15 + d.) + r _ «(21 + d) + r _? (27 + d) + r_fl (35 + d)} - * a75 + rr _? (5 + d) - r _q (13+ d) - r _ q (23 + dj - r _ q (31 dj] * 0.625

5- {~ r _q (~ d) - r _q (ll4 · d) - r _qt25 ^ rd] - r _a (29-rd) \ * O.3 ~ 5

In this case, it should be noted that the result of Equation 29 is generated by a single known sequence (ie, a sequence corresponding to the parent sequence index) of the receiving end and the Rx signal. Although the receiving end must carry out the correlation operation associated with the four PSCs under the condition that a cell transmits any of the four PSCs, the receiving end calculates the values of Equation 29 using only a sequence corresponding to the parent sequence index. Furthermore, the cross-correlation value of the four PSCs can be calculated using the values from Equation 29.

A procedure for calculating the cross-correlation value associated with the four PSCs using the result of Equation 29 is as follows.

[Equation 30] = (d) +. ^ 'Id) = ¿+ ^ 7) (^ -1 (2¿jf + V r (22 +1+ d) (21 + · ϊ}) '= 6 ^ Par * Simpar ') + even' + / odd)

IS 2 380 698 T3

[Equation 31] jr1·1'(<*) - (a> Λ'ς; · (d)

17v = yr (22 + (22)) \ yz (22 + l - (21 -r 1) ') ΐ-ΰ = ^ Γ (2 / + ί?) [(Α ^ -Σ(22)) j + yr (2í + lr¿j [-j (a * Y2Al)) '| ít.r, = yr (2¿ + d ') ax*~z (21) -r¿ f (2¿ +1 -rd) (j ατ~ζ (22 4 1)) = {R par '- clean'] ~ J © par 'm Rimpar'}

[Equation 33] j _ ^.4Y(d í i. r.

= yr (22-r ¿O (αν- ~ * (22)) Γ (22 1. + ¿) (a *5-”(22V1)); · £ · rQ

£ r (22 + 6) (0 ^ (2 (}) + Vr (22 ^ (2? + Lj)

Zs' '' 'iz' '' (Rpar - R odd. 'J + j (4par' —I odd \

IS 2 380 698 T3

Equation 30 indicates a cross-correlation value between a sequence corresponding to the parent sequence index (m0) and the Rx signal. Equation 31 indicates a cross-correlation value between a sequence corresponding to the remaining sequence index (m1) and the Rx signal. Equation 32 indicates a cross-correlation value between a sequence corresponding to the remaining sequence index (m2) and the Rx signal. Equation 33 indicates a cross-correlation value between a sequence corresponding to the remaining sequence index (m3) and the Rx signal.

In summary, if multiple sequences are generated according to the inventive methods of the aforementioned embodiments, the present invention can calculate the cross-correlation value of multiple sequences corresponding to multiple sequence indices using both the sequence corresponding to a single sequence index and the Rx signal.

FIG. 27 is a structural diagram illustrating the receiving end according to the present invention.

Referring to FIG. 27, the receiving end Rx signal and the receiving end known sequence are applied to an index demapper 1900. The receiving end unit 1950 of FIG. 27 can calculate "Rpar_i_i", "Rpar_q_q", "Ipar_i_q", "Ipar_q_i", "Rimpar_i_i", "Rimpar_q_q", "Iimpar_i_q" and "Iimpar_q_i" using Equation 28 or 29.

The values "Rpar_i_i", "Rpar_q_q", "Ipar_i_q", "Ipar_q_i", "Rimpar_i_i", "Rimpar_q_q", "Iimpar_i_q" and "Iimpar_q_i" are calculated as "Rpar0", "Ipar0", I "Rimimpar0" , "Rpar1", "Ipar1", "Rimpar1 and" Iimpar1 ", respectively, using Equations 24 to 27.

For example, “Rpar_i_i + Rpar_q_q” is calculated as “Rpar0"," -Ipar_i_q + Ipar_q_i "is calculated as" Ipar0”.

Unit 1960 performs the operations in Equations 24 through 27.

If the addition or subtraction of Equations 30 to 33 is applied to the result of Rpar0, Ipar0, Rimpar0, Iimpar0, Rpar1, Ipar1, Rimpar1, and Odd1 from unit 1960, four correlation values can be calculated from the individual sequence indices ( m0, m1, m2, m3).

For example, the correlation value of the value of m0 is calculated using Equation 30. In greater detail, the sum of Rpar0 and from Rimpar0 is used as the real part of the correlation value of the value of m0, and the sum of Ipar0 and odd0 is used as the imaginary part of the value of m0.

Referring to Equations 24 to 33 and FIG. 27, the final result can be obtained by the result of the unit 1850 even though the unit 1960 does not exist independently, and it can be recognized that the final result can be obtained by using only the unit 1960 without using the unit 1950.

The concept of FIG. 27 will also be described according to another scheme, which will now be described in detail.

In case of calculating the cross-correlation value between the Rx signal and the sequence corresponding to the value of m0As long as the real part of the cross-correlation value associated with the even sequences of "m0" is set to a first result, the first result can be denoted as Rpar0 according to Equation 24. In FIG. 27, reference number 1901 in FIG. 27 indicates the first result.

Provided that the imaginary part of the cross-correlation value associated with the even sequences of m0 is fixed to a second result, the second result can be denoted as Ipar0 according to Equation 24. In FIG. 27, reference number 1902 in FIG. 27 indicates the second result.

Provided that the real part of the cross-correlation value associated with the odd sequences of m0”Is set to a third result, the third result can be denoted as Rimpar0 according to Equation 25. In FIG. 27, reference number 1903 in FIG. 27 indicates the third result.

Provided that the imaginary part of the cross-correlation value associated with the odd sequences of m0”Is set to a fourth outcome, the fourth outcome can be denoted as Odd0 according to Equation 25. In FIG. 27, reference number 1904 in FIG. 27 indicates the fourth result.

Provided that the actual part of the cross-correlation value associated with a conjugate of the even sequences of m0 "is set to a fifth result, the fifth result can be denoted Rpar1 according to Equation 26. In FIG. 27, reference number 1905 in FIG. 27 indicates the fifth result.

Provided that the imaginary part of the cross-correlation value associated with a conjugate of the even sequences of m0 "is set to a sixth result, the sixth result can be denoted by Ipar1 according to Equation 26. In FIG. 27, reference number 1906 in FIG. 27 indicates the sixth result.

Provided that the real part of the cross-correlation value associated with a conjugate of the odd sequences of

ES 2 380 698 T3 m0”Is set to a seventh result, the seventh result can be denoted as Rimpar1 according to Equation 27. In FIG. 27, reference number 1907 in FIG. 27 indicates the seventh result.

Provided that the imaginary part of the cross-correlation value associated with a conjugate of the odd sequences of m0”Is set to an eighth result, the eighth result can be denoted as Odd1 according to Equation 27. In FIG. 27, reference number 1908 in FIG. 27 indicates the eighth result.

According to the procedure mentioned above, the eight results are determined. If two results of the eight results mentioned above are added or subtracted from each other, the calculation value of the unit 1970 is obtained.

For example, the real part of the correlation value of the sequence of "m0”Is equal to the sum of unit 1901 and unit 1903. The imaginary part of the correlation value of the sequence“ m0”Is equal to the sum of the unit 1906 and the unit 1906.

In summary, the receiving end calculates the eight results mentioned above and can perform addition or subtraction between two different results from among the eight results, so that it can calculate the cross-correlation value of the sequences m0 to m3.

FIG. 27 shows a specific case where the sequence length is denoted by an even number. It is clear to those skilled in the art that the above-mentioned concept can also be applied not only to an even number but also to an odd number.

An odd-length sequence receiver will now be described with reference to FIG. 18 and the following equations.

First, if the sequence length is 35, two sequence indices can be selected.

For example, the length of the parent sequence index can be set to "1" and the length of the remaining sequence index can be set to "34".

In this case, the expression corresponding to Equation 23 is represented by the following Equation 34:

In this case, the cross-correlation value can be represented by the following Equation 35:

[Equation 35] (¿) = Lgr »'X ~ 4 = Σfe« h'2 (í' (») - r.

.V; 1 - . - .

-V ’· ‘ · .

In order to briefly express the result of Equation 35, the variables shown in the following Equation 36 are defined as follows:

IS 2 380 698 T3

[Equation 36] t .saw

Λ '' i Xl ♦ .Vl ζ — 0 vi

-* neither

Based on the above Equation 36, the result of Equation 35 can be represented by the following Equation 37:

[Equation 37]

? (á) - (.¾ - .¾} - J {is «· Zand)

In FIG. 28 shows the receiving end as an example to calculate Equation 37.

In FIG. 28, four variables are calculated by Equation 36, so that the correlation value of the odd-length sequences is calculated at the same time. Therefore, in case of using the above-mentioned structure, the present invention can appropriately process the case of receiving the sequence of length 63.

As described above, a receiving end can be designed associated with sequences of different lengths.

This example shows a procedure to calculate the cross-correlation value of the selected sequences, which have a length of 32 and the values m0= 1, m1= 15, m2= 17 ym3=32.

This embodiment of case 2 will show detailed equations since case 1 has already described the detailed procedures. Furthermore, it can be recognized that any of the equations shown in FIG. 1 is considered identical to each equation in case 2.

As is well known to those skilled in the art, case 2 and a reception procedure for various sequence indices can be carried out based on the explanation of case 1.

[Equation 38]

IV-3 * Λ(£/) = 7πΣ '· (Λ + ίί)(α(Β))

Equation 38 is equal to Equation 22.

IS 2 380 698 T3

[Equation 39] ^ - • μ-μέχρΗ / τ-ι- ^) < j2J «*WÍ (I-) = exp? - /, <15 = expi-j ~ (16-1<img file="ES2380698T3_D0013.tif" />, when k is even (-J «: í (*)) ' sat home° contrary - \ = exo | - / - (16 +1) · -22 / 4λ V?

when k is even

Λ '.

32J —i- = 7j

j) r

(4-j = exp j ~ -17-T A] otherwise r ri-v. ·, ·. ί. „Ai <1 = exn i - o • ·4 i J x

= r

[ odd s when k is even

otherwise

Equation 39 is equal to Equation 23.

[Equation 40] li . . TO

V 7 ('2 · + d) (a' · '-1 (2; j) = (Rpar + R even _G J & -I even _t_q +1 even _Q_ i)

77o '' '' = Λ even * + jl even 5

Equation 40 corresponds to Equation 24.

[Equation 41] 15 . .

^ Γ (2: + 1+ dj (¿Zr1 (2i + I.) j ~ (R odd 'i ~ R¡mpar d) ~ 1 (-Iimpar l -O ~ í¡impar GO:

= RimpaL + jl odd '

Equation 40 corresponds to Equation 25.

[Equation 42] _ 'y ^ r (2¡ fi-d (21) = (Λ even _J_i - R even J3_G) j G even _j_q - I even _c_0; -o' '' = Rpar 1+ - jipar '

Equation 42 corresponds to Equation 26.

[Equation 43] i $

Y 7 (2¿ - 1 τ dj Cl (2ΐ - 1 j - {R¡mpar_l_l ~ Rimpar_q_d) — j (.Iimpar ~ Iimpar G i) = R odd '-r jlimpar'

IS 2 380 698 T3

Equation 43 corresponds to Equation 27.

[Equation 4 4]

Rpar rj (Q + d) * 1 + r _i (2 + dj * 0) 92388+ r_ i (* + d] * 0 + r_i¡6 + d'Y * (- 0.92333ji-r _í (3rd ef) * l + r _ '(10 + d) * (-0.923 38) + r _ i (12 + d) * 0 + r _ f (14 + d) ♦ 0/92383 + r _ j (16 + rf j » l + r_fC18 + ¿):* .0J2383 + r_f (2O '+. Rf), * O' + r_i (22 + rf) * (- O-.92383) '+ r_i (24 + -4),* l + r J (26 + rf) * (- 0.92383) + r_ - (28+ rf) ♦ 0 + r _í (30 + rf) * O ^ 238S

Rpar α c.

rd) * 0 ± τ_σ (2-7rf) * (- 0.3S268) -7 r_ff ('4-rrf) * (- l) -r r_α \ 6β · rf) * O.33268-í-r_ei3-rd. ) ^ & i-r_a (lQ-7rf) * 0.38263¿-r_oil2-7rf) »(- l] ¿-r_ff (147-rf) * (- 033268) -7r_g (16¿-rf)» 0-rr_ « (l3.7-.rfj * (- Oj8268) + -Γ_σ (20 ^ ξ /) * (- 1) 7r_o (22-í-rfi * 0.38263-r _σ (-4-? rf) * 0-r r_o (26-7 rf | * 0.38263-r r_gí -8-7íZ) * í-L1 + r _σι3θ-rf) * f-0_3S26S) · : *0.33263 1par_i_ ° r _ί (θ-ί · <ί) * Ο · ί-Γ _.;(2-rd) * [-0.38263) -7 r_ i'í4.-r 4) ^ (- 1) -7 r_; (6 + if) * 0.38263-ir _i (8 + .ί / | * Ο ♦ r_f (10-í-rf) * 03326S> rj (12 ^ rf) * (- l} + r_i (14 + rf) * (- 0.38268) -rr _> (l «.frrf)» 0-rr _ / (lS -i-rf) * (- a332 «S) ·

-7r _. '(20-rrf) * (- ii¿-r _j (22¿-rf) * 0.35263 + r_í (24-í-rf) * 0 ^? · _Ί (26-; · rfj * 0; 38268 + r_n28-7rf | * (- 1) + r_f (30+ rf) * (- 0.38265)> * 0.3326 8 J ¿(12-rrfj-r

IS 2 380 698 T3

Zpar α i r_a (0 + rf) · * 1 + r _ q (2 + d) ★ 0: 92338 + r _ $ (4 + rf) «0 + r _ σ (or + rf) * (- 0.92. 3 83} + r_qÍ 8+ rf) * 1 + r_ff (10 + rf) * (- 052383) + r_5 (12 + d) * 0 + r_c (14. + rf) * 0.9'2333 + r _ «(16 + rf) * l + r _ «'(18+ rf)« 052388+ r _ «(2O + rf' | * 0 + r _.« (22+ d) * (- 0.92383) + r _ «(24 + rf ) «L + r _« (26 + rf) * (- 052388) + r _ <? (28+ rf) = * O + r _ «(30 + rf> O5238S (r _q (O + rf) + r_q ( S + rf) - * - r _? (16 + rf) + r _ q (24 + rf)} r «(2 + rf) -r oíó + rf'l-r σίΐθ + rfl + r αí 14 + rf '|) + · ".."'. '~ .---' · '.- «0.923 S8 +' · _? (18 + rf) -r _q (22 + rf) - r _qít 26 + rfj + r_o (30 + rfjj

R. odd) _í r_f (t + d) * (- 0.09301? j + r_fi / + d) * (- O.773Ol) + r JÍ5 + rf | * í-0.: 63439j + r_í [7 + 4? j * 0.99 flS + r_í (9 +! /) + (- Ó.S95íSj + r_i (ll + 4) + 0.63439 + r_í '(13 + rf) + 0.7730I ++ _i (í5 + c / j * 0.09S017 + r _' (17 + í / 'í + 0.G9S017 + r _f (19-r dj + 0.77301 ++. / (31 + </) »0.63439+ rj (Z3 + </) * (-0.995lS) + r_rl'25 + rfi * 0.995lS + r _; (27+ d) * f -0.63439) + + _í (29 + í / i * (- 0.77301j ++. 1 (31 + d'j + (- 0.095017) (-r_; (t + </) ++ _, '(15 + 4) + +. / (17 + 4) - + _ :( 3l +4)} * 0.09S017 + Fr_: Í3 + £?) + r_: ¡l3 + </.) + r _? (19 + rf.) - r _! (29 + rf)} + a77301 + {- + _¿ (5 + 4) + r _ (11 + d) + r _; i 21 + d) - + _ il 27 + 4)> »0.63439 + {+ _ r (7 + 4j - + _ íÍ9 + .4f- + _! (- 5 + d) ++ _ í (25 + 4)} * Q .9951S.

Rimpar_q _q r_o (1 + 4) / (- 0.09801 “) + r _qÍ.S ~ d) ♦ (-0: 77301) + r _e [5 + d) * (- 0.63439) + r_q (7+ rf) * 0.99518 +r_? (9 + d) * (- 0.99518) + z _ «(ll + d) * 0.63439 + r _« (13 + d):* 0.7301 ++ _ σ (15 + 4) * 0ί098017 + r _ «(17 + rfj * 0.0980.17 + r _« (19 + d) * 0.77301 + Γ_4 (21. + 4) * 0: 63439τ + _ «( 23 + d) * (- 0.99518) + r _ «(25+ d) * Ó5951S + r _« (2 “+ d) * (- 0.63439) + r _« (29 + d) * (- 0.77301) + r _q (3 l + rfj * (- 0.098017) {- + jj (1 + 4) ++ _ «(15 + rf) + r _« (17 + d) - r _ «. (31 + rf)} ♦ 0.098017 * r '' _ € i? + 4) + r _c (13 + d) + r _ «(19 + rf) -> · _« Í29 + 4)} * 0.77301

-} -r _q (5 + 4) + r _q (11 + rf) + r _ «f 21 + rf) - r _q (2“ + 4)} * 0.63439 + [* · _? (? + d) -r _ «(9 + dj - + _« (23 + 4j + + _ «(25+ d) j * 0: 99518

IS 2 380 698 T3

Iimpar_ ϊ_C¡ rj (l + rf) * ('- O.09801) ^ r_í {Í3YÉ /) * (- p:' “301) ¿-rj (5. ^):* (- O.63439) -Fr _? (74-d) * 0.S95-18 -rr_i (9 + d) * (- 0.99518) + / _ í (11 + rf) * 0.63439 + r J (13 + rf) * 0.77301 r _i (15 + rf) * 0109801.7 + r _- 'fl 7 ± rf) * 0.09S017 + r_ / (19 + rf) * 0.7'30í + r _ / (. 2Ú rf) * 0.63439 + r J. (23 + rf) ♦ (-0J9SI8) + r_í (25 + rf) * 09951S + r_í (27+ rf) * (- 0.63439) + F_ / f29 + rf) * (- 0.77301) + r_f (31 + rf) * (- 0.095017).

(-? J (1 * dr J (15 + rf) -rr _ί (i 7 + rf) - r _ f (31 + rf)} ♦ 0.098017 + h'A - ^ + rfE r _ / (13.4- rf) + r_i '(l9 + rf} -r __ / f.29- + rf)} * 0.77301 + {-r _ / (5 + rf) + r _ / [1.1 + rf H- r _i (2 1. + - rf) - r _ / ('27 + rf)} ♦ 0.63439 + [/ _ / (7 + rf) -r _ / (9+ rff-r _ / (23 + rf) + r_ f (25 + rf' i} * 0.995 IS / impa £ 5 ^ fs

r_tf (l ^ d) * (- 0.09S017) + r_?(3 ^ rf) '* (- 0.77301FF_af5 + d) »(.- 0.63439) + r_fl (7 + d) * Oj9951S-F_e (9 + rf | * | -0; S95l8). + r_ff (ll + rf)i* or.6j439 + r_ff (l3 + rf '|' »0.77301 + r_G (15 + rf)» 0.09SOn + r_ffLlT4d) * 0.a930l7 + r_G (I9 + d) * 0: 77301 + T _? (21 ~ d) * 0.63439 + r _a (3 + d) »(- 099518j +? _q (25 + d)« 0.99518 + r_a (27 + d) * (- 0.43439 j + r _?(29 + d) * (- Cl77301) + r _ a (31 + d ') ♦ (-0.098017) (~z_and(14Rf) + F_a (15 + rf) + r _ «(17 4 d'i — r _? Ι'3ϊ + dj) * 0.09S017 + {- r - o (3 ♦ dj ~ r _ g (13 + d) + r _qí 19 ~ rf) - r _ q {29-rd 'fi · 0.77301 + (~ F _ q (S - rf.) rr _ q ( 11 + rf) - r _ a í 21 + rf.) - r _a (27 ~ rf) J * 0: 63439 '(r _? L'7 + rf) -F_G (9 + rf) - f_g (23 + .rf i + r_tfi.25 + rfj} * 0.99518

Equation 44 corresponds to Equation 28.

[Equation 4 5]

S par _kJ {r _ f (0 + rf i + r _ / (8 + rf) + r _ i (16 + cl). + - r _ ii '24+ rf)} r £ Í2 + rf) -r - '(or + rfí-F fílO + rfj + r ífl4 + rf'l]

-H ~ '. · '} * O.S75 + F _- (lS-r rf} - r _ :. (22 + rf) - / - 26-r rf j + ~ _ / (30 + rf)]

IS 2 380 698 T3

Λ par_q_q

-r _q (2 + rf) + r_q (6+ rf) + r_q (10 + d) - r _ <? (14+ rf) -r _σ (13+ d) + r_q (22+ d) + r _q { 26 + d) -r _q (3.0 + d'j _ + | -r _q (4+ d) -r _? (12 + d) -r _c (20 + rf) - r_a (2S + d)}

I par_i_a

-r _¿ (2 + rf) + r_f (6 + rf j + r_i (10 + rfj- r_z (14+ rf) -7_i (18+ rf) _ + r _f (22 + rf) + r _ «( 26 + rf) - r _ i (3 0 + d] + f-r_f (4 + rf) -r_i (12 + rf) -r _ / (20 + rfj-r_j (23 + rf)}? Par _q_i

['_ <? (0 + rf) + r _ σ (8 + rf) + r _ σ (16 + rf) + f _ α (24 + rf)}. r_? (- ^ d) -? '_ rf (6 + d) -r_tf (l0 + rf) + r_c (L4 + rf)] __ jr _ $ (18+ rf) - r _ rf (22 + d) - r_q (26 + rf) + r _ <7 (30 + rf) J

Rimpar_ i _ i {-r_í (l + rf) + r_f (15 + rf) + r_í (17 + rf) -rj (31 + rf)} * O.125 + {-r _i (3 + rf j + r_ ? (13 + rf) + r _ '(19 + rf) - r _f (29+ rf)} * 0.75 + [-r_i (5 + d) + r_j (ll + rfj + r_j (21 + rfj-r_¿ (27 + rf)} * 0.625 + [r 7 + rf t - r _r (9 + rf) - r _ i (23 + rf) + r _i (25 + d) |

Rimpar_c _q

[-r _? (1 * d} r_ q (15 + rf I + r _ q (17 + rf) - r _ q (31 + rf i} * 0.125 + í-r _? (3 + d) + r_g (13 + d) + r_?(t9 + rf) -r_5(29 + d)} * 0.75 + {-r _ 5 (5 + d) + _ <2 (i 1 + rf) + f_rf (21 + rf i - r_q (27 + rf)} * 0.625 + [r _ q (7 + rf) - r_rf (9-rfj- r _q ( 23 + rf) + r _g (2> + rf)}

IS 2 380 698 T3

Iimpar_ i _q {-r _ f (l + rf) + r J (l 5 + d) + r _ f (17 + d) - r _ í (31 + dj} * 0.125 + {- r _ i (3 + d'j + r _ i (13 + d) + r_if 19 + rf) - r (29+ d) J · 0. 75 + [-r _f (5+ rf) + r _ '(l 1 + d) + r_í (2l- * d) -r _ / (27 + d) J * 0.625 + (r _í (7 + d) - »- _¡ (9- = · d) -r _¡ (23+ d) + r_í (25 + d))

Iimpar_ G _i 'lT tí) ^ r_tí (15- d} + 7 _ $ (17 ¿í) - τ _a (314- 0.125 + [^ _ ^ (5 + ¿/) ^ r_a (13-4 ^ Vr_5(í9-rrfj-r_g (j29-í- <í)} * 0.75 + {“r_e (> * rf) +r_tf (nAtí) t K_G (21-Γtí) -r_q (27 4-d)} * 0.625 + {r _ ? (* )~ Γ_ <£ i'9-rd) - 7 _Ú (23-r tí jr T _G (25r d)}

Equation 45 corresponds to Equation 29.

Equation 46 corresponds to Equation 30.

[Equation 41]

X 'w: (di -R%or (di-r (d) = Σr (~ + (:?)) '+ ΣΓ ¢ - + 1 + d (2Í +!>) I-0 í-3

- Σζί2^ rf>”s'W)' + ^ + 1+ ^ - / (^ (2 / ^ 1))-) = ¿R (2¿ + (2 '} + ¿r (2¿ +1+ (2 / - + 1))' ¡_.j '' '' = (R even '- I odd' |. + j (rf even 'rR odd')

Equation 47 corresponds to Equation 31.

ES 2 380 698 T3 {Equation 48] a ·2· * · (<Í) - JS *? (d).

Í-0i-o = ¿r (2í + r (2 < + Ud) (- j í-δí-3 = (Rpar J -Unmatched ~ | -i- pair1 -r Rimpar '}

Equation 48 corresponds to Equation 32.

[Equation 4 9] ^ - (^) = ^ - (^) - ^1^) . 15 .

= 7 / (2 / + ^) (α ^ · (2ΐ)) + ^ 7 (2 ^ 1 - ^) (^ - ^ (2 ^ 1)) .'- V '7? * '' * ií 'í-.

= ^ 7 (2 / - ^) ((^ - (2 /)) I ^ 7 (2 / ^ 1 - ^) (- (^ (2 / + 1)) ^ io '' ¿7o ”'*' ·

15H = 5V (2 / -dJia '0-5 (2 /)) + ^ 7 (2 / -1 + ^) (- ^ --- (2 / ^ 1)) fo '' - (Rpar ~ R odd ') Í j (lpar' - odd '}

Equation 49 corresponds to Equation 33.

This embodiment can greatly reduce the number of calculations, which will be described in detail below.

To calculate the d-th correlation value associated with a PSC sequence, which has a length L = 36 and is classified into four types, the conventional procedure requires 575 multiplications of real values and 568 sums of real values assuming that the calculations are ignored generated by the sign converter.

However, the present invention requires 28 real value multiplications and 140 real value sums. In case of quantization, the present invention does not require any multiplication of real values, it requires 156 sums of real values and a 54-bit shift operation.

The sign converter and the bit shift operation are not included in the number of calculations when the hardware is implemented, so the number of calculations of each technique is shown in the following Table 26. The present invention can calculate the value cross-correlation of four PSC sequences using only 156 actual value sums.

[Table 26]

<td>Number of calculations</td><td>Number of multiplications of real values</td><td>Number of sums of actual values</td>

<td>Conventional procedure</td><td> 576</td><td> 568</td>

<td>This realization</td><td> 28</td><td> 140</td>

<td>Approximate realization by quantification</td><td> 0</td><td> 156</td>

Furthermore, if the length (L) is set to 32, a performance difference arises between the conventional technique and the present invention, as represented by the following Table 27:

[Table 27]

IS 2 380 698 T3

<td>Number of calculations</td><td>Number of multiplications of real values</td><td>Number of sums of actual values</td>

<td>Conventional procedure</td><td> 512</td><td> 504</td>

<td>This realization</td><td> 20</td><td> 120</td>

<td>Approximate realization by quantification</td><td> 0</td><td> 132</td>

It should be noted that most of the terminology used in the present invention is defined in relation to the functions of the present invention and may be determined differently depending on the intention of the person skilled in the art or common practice. Therefore, it is preferable that the terminology mentioned above is understood on the basis of all the contents disclosed in the present invention.

It will be apparent to those skilled in the art that various modifications and variations can be made to the present invention without departing from the spirit or scope of the invention. Therefore, the present invention covers modifications and variations of this invention as long as they are within the scope of the appended claims and their equivalents.

The sequence generated by the present invention maintains correlation characteristics of at least a predetermined level in the time domain, and has low PAPR characteristics. Furthermore, using the sequence generated by an embodiment of the present invention, the receiving end can easily detect the sequence by a correlation operation.

The present invention can configure a higher performance channel provided that the sequence is applied to a communication standard such as the LTE system.

From the above description it will be apparent that the sequence generated by the present invention maintains the correlation characteristics of more than a predetermined level and has low PAPR characteristics.

If the sequence provided by the present invention is applied to a communication standard, such as the LTE system, you can configure a channel that has superior performance.

Although the preferred embodiments of the present invention have been described for illustrative purposes, those skilled in the art will appreciate that various modifications, additions, and substitutions are possible without departing from the scope of the invention described in the appended claims.

Contents52

169 members in 17 offices

This recordMember, by publication datePriority claim7 more offices are in the list below

Priority claims40

Priority claims
Document	Office	Kind	Date
870786P	United States of America	–	2006-12-19
87078606	United States of America	P	2006-12-19
87078606	United States of America	P	2006-12-19
884399P	United States of America	–	2007-01-10
88439907	United States of America	P	2007-01-10
88439907	United States of America	P	2007-01-10
885387P	United States of America	–	2007-01-17
88538707	United States of America	P	2007-01-17
88538707	United States of America	P	2007-01-17
888304P	United States of America	–	2007-02-05
88830407	United States of America	P	2007-02-05
88830407	United States of America	P	2007-02-05
20070025175	Republic of Korea	A	2007-03-14
20070025175	Republic of Korea	A	2007-03-14
20070025175	Republic of Korea	–	2007-03-14
20070048353	Republic of Korea	A	2007-05-17
20070048353	Republic of Korea	A	2007-05-17
20070048353	Republic of Korea	–	2007-05-17
20070057531	Republic of Korea	A	2007-06-12
20070057531	Republic of Korea	A	2007-06-12
20070057531	Republic of Korea	–	2007-06-12
968556P	United States of America	–	2007-08-28
96855607	United States of America	P	2007-08-28
96855607	United States of America	P	2007-08-28
20070025175	–	–	–
20070048353	–	–	–
20070057531	–	–	–
870786P	–	–	–
884399P	–	–	–
885387P	–	–	–
888304P	–	–	–
968556P	–	–	–
KR20070025175	–	–	–
KR20070048353	–	–	–
KR20070057531	–	–	–
US20060870786P	–	–	–
US20070884399P	–	–	–
US20070885387P	–	–	–
US20070888304P	–	–	–
US20070968556P	–	–	–

Members169

Family members, oldest first
Document	Office	Kind
KR20080057122A	Republic of Korea	A	2008-06-24
KR20080057138A	Republic of Korea	A	2008-06-24
EP1936902A2	European Patent Office (EPO)	A2	2008-06-25
WO2008075881A2	World Intellectual Property Organization (WIPO)	A2	2008-06-26
KR20080073197A	Republic of Korea	A	2008-08-08
WO2008097045A2	World Intellectual Property Organization (WIPO)	A2	2008-08-14
TW200836567A	Taiwan Province of China	A	2008-09-01
US2008240285A1	United States of America	A1	2008-10-02
KR20080095731A	Republic of Korea	A	2008-10-29
WO2008130206A1	World Intellectual Property Organization (WIPO)	A1	2008-10-30
WO2008143443A1	World Intellectual Property Organization (WIPO)	A1	2008-11-27
US2009010312A1	United States of America	A1	2009-01-08
US2009011761A1	United States of America	A1	2009-01-08
US2009011762A1	United States of America	A1	2009-01-08
HK1117313A1	Hong Kong, China	A1	2009-01-09
KR20090004315A	Republic of Korea	A	2009-01-12
WO2009008623A2	World Intellectual Property Organization (WIPO)	A2	2009-01-15
WO2009008624A2	World Intellectual Property Organization (WIPO)	A2	2009-01-15
WO2009008625A2	World Intellectual Property Organization (WIPO)	A2	2009-01-15
TW200908763A	Taiwan Province of China	A	2009-02-16
WO2009008624A3	World Intellectual Property Organization (WIPO)	A3	2009-03-12
WO2009008625A3	World Intellectual Property Organization (WIPO)	A3	2009-03-12
WO2009008623A3	World Intellectual Property Organization (WIPO)	A3	2009-03-19
TW200917678A	Taiwan Province of China	A	2009-04-16
TW200920004A	Taiwan Province of China	A	2009-05-01
GB0912511D0	United Kingdom	D0	2009-08-26
WO2008097045A3	World Intellectual Property Organization (WIPO)	A3	2009-09-11
WO2008075881A3	World Intellectual Property Organization (WIPO)	A3	2009-09-17
KR20090099515A	Republic of Korea	A	2009-09-22
GB2458418A	United Kingdom	A	2009-09-23
KR20090100328A	Republic of Korea	A	2009-09-23
KR20090115969A	Republic of Korea	A	2009-11-10
EP2117194A1	European Patent Office (EPO)	A1	2009-11-11
EP1936902A3	European Patent Office (EPO)	A3	2009-12-02
US2009310703A1	United States of America	A1	2009-12-17
EP2145420A1	European Patent Office (EPO)	A1	2010-01-20
KR100938756B1	Republic of Korea	B1	2010-01-26
KR100938757B1	Republic of Korea	B1	2010-01-26
KR100938758B1	Republic of Korea	B1	2010-01-26
CN101641924A	China	A	2010-02-03
US2010046663A1	United States of America	A1	2010-02-25
CN101682498A	China	A	2010-03-24
GB201001764D0	United Kingdom	D0	2010-03-24
GB201001766D0	United Kingdom	D0	2010-03-24
GB201001768D0	United Kingdom	D0	2010-03-24
CN101689930A	China	A	2010-03-31
CN101689931A	China	A	2010-03-31
CN101689933A	China	A	2010-03-31
EP2168266A2	European Patent Office (EPO)	A2	2010-03-31
EP2168267A2	European Patent Office (EPO)	A2	2010-03-31
EP2168268A2	European Patent Office (EPO)	A2	2010-03-31
GB2464056A	United Kingdom	A	2010-04-07
GB2464057A	United Kingdom	A	2010-04-07
GB2464058A	United Kingdom	A	2010-04-07
US2010099408A1	United States of America	A1	2010-04-22
US2010099409A1	United States of America	A1	2010-04-22
US2010110873A1	United States of America	A1	2010-05-06
KR100958031B1	Republic of Korea	B1	2010-05-19
KR100964691B1	Republic of Korea	B1	2010-06-21
JP2010525656A	Japan	A	2010-07-22
JP2010531610A	Japan	A	2010-09-24
JP2010531611A	Japan	A	2010-09-24
JP2010531612A	Japan	A	2010-09-24
US7808967B2	United States of America	B2	2010-10-05
JP2011502365A	Japan	A	2011-01-20
US7907592B2	United States of America	B2	2011-03-15
US7916714B2	United States of America	B2	2011-03-29
US7924808B2	United States of America	B2	2011-04-12
GB2458418B	United Kingdom	B	2011-08-03
RU2430473C1	Russian Federation	C1	2011-09-27
EP2145420A4	European Patent Office (EPO)	A4	2011-11-02
RU2434329C2	Russian Federation	C2	2011-11-20
RU2434330C2	Russian Federation	C2	2011-11-20
TWI356646B	Taiwan Province of China	B	2012-01-11
US8098647B2	United States of America	B2	2012-01-17
EP2168266A4	European Patent Office (EPO)	A4	2012-02-08
EP2168267A4	European Patent Office (EPO)	A4	2012-02-08
EP2168268A4	European Patent Office (EPO)	A4	2012-02-08
EP1936902B1	European Patent Office (EPO)	B1	2012-02-29
EP2424183A1	European Patent Office (EPO)	A1	2012-02-29
US8130863B2	United States of America	B2	2012-03-06
AT547878T	Austria	T	2012-03-15
ATE547878T1	Austria	T1	2012-03-15
DK1936902T3	Denmark	T3	2012-04-10
US8155106B2	United States of America	B2	2012-04-10
ES2380698T3This record	Spain	T3	2012-05-17
PT1936902E	Portugal	E	2012-05-21
US2012163348A1	United States of America	A1	2012-06-28
US2012170520A1	United States of America	A1	2012-07-05
JP4988040B2	Japan	B2	2012-08-01
JP4988041B2	Japan	B2	2012-08-01
TWI371176B	Taiwan Province of China	B	2012-08-21
PL1936902T3	Poland	T3	2012-08-31
JP5026592B2	Japan	B2	2012-09-12
JP5031037B2	Japan	B2	2012-09-19
EP2145420B1	European Patent Office (EPO)	B1	2012-10-17
US8295389B2	United States of America	B2	2012-10-23
GB2464056B	United Kingdom	B	2012-11-21
GB2464057B	United Kingdom	B	2012-11-21
DK2145420T3	Denmark	T3	2013-01-07

Showing 100 of 169

Abstract

Term

IS 2 380 698 T3

DESCRIPTION

IS 2 380 698 T3

IS 2 380 698 T3

IS 2 380 698 T3

IS 2 380 698 T3

IS 2 380 698 T3

IS 2 380 698 T3

IS 2 380 698 T3

IS 2 380 698 T3

IS 2 380 698 T3

IS 2 380 698 T3

IS 2 380 698 T3

IS 2 380 698 T3

IS 2 380 698 T3

IS 2 380 698 T3

IS 2 380 698 T3

IS 2 380 698 T3

IS 2 380 698 T3

IS 2 380 698 T3

IS 2 380 698 T3

IS 2 380 698 T3

IS 2 380 698 T3

IS 2 380 698 T3

IS 2 380 698 T3

IS 2 380 698 T3

IS 2 380 698 T3

IS 2 380 698 T3

IS 2 380 698 T3

IS 2 380 698 T3

IS 2 380 698 T3

IS 2 380 698 T3

IS 2 380 698 T3

IS 2 380 698 T3

IS 2 380 698 T3

IS 2 380 698 T3

IS 2 380 698 T3

IS 2 380 698 T3

IS 2 380 698 T3

IS 2 380 698 T3

IS 2 380 698 T3

IS 2 380 698 T3

IS 2 380 698 T3

IS 2 380 698 T3

IS 2 380 698 T3

IS 2 380 698 T3

IS 2 380 698 T3

IS 2 380 698 T3

IS 2 380 698 T3

IS 2 380 698 T3

IS 2 380 698 T3

IS 2 380 698 T3

Priority claims40

Members169

Numbers

Titles2

Classification