Method for generating downlink frame, and method for searching cell

[Technical Field]

0001The present invention relates to a method of generating a downlink frame and a method of searching a cell, and more particularly, to a method of generating a downlink frame in a cellular system based on an orthogonal frequency division multiplexing (OFDM) scheme and a method of searching a cell by using the downlink frame.

0002This work was supported by the IT R&D program of MIC/IITA [2005-S-404-13, Development of Radio Wireless Transmission Technology for 3G Evolution].

[Background Art]

0003In 3^rd Generation Long Term Evolution (3G LTE), a total of 504 cell identifiers are defined, and the 504 cell identifiers are divided into 168 cell identifier groups. Therefore, three cell identifiers exist in each cell identifier group. A downlink frame for 3G LTE includes two synchronization channels, that is, a primary synchronization channel and a secondary synchronization channel. The primary synchronization channel provides 5 msec-timing and information on three cell identifiers in the cell identifier group to a terminal. Accordingly, three primary synchronization channel sequences are used in the LTE system, and the primary synchronization channel sequences transmitted in a cell are equal to each other at each location of primary synchronization channel symbols. Since the secondary synchronization channel provides information on the cell identifier group and 10 msec-frame timing to the terminal, the secondary synchronization channel sequences transmitted from the location of two secondary synchronization channel symbols in the 10 msec-frame are different from each other. Therefore, the number of secondary synchronization channel sequences becomes 336 (=168*2).

0004<figref idref="f0001">FIG. 1</figref> is a view illustrating a method of generating a secondary synchronization channel symbol according to the conventional art. As shown in <figref idref="f0001">FIG. 1</figref>, the secondary synchronization channel symbol according to the conventional art is an OFDM signal in which two short binary sequences are combined to each other in a frequency domain, thereby providing cell group information and frame boundary information to the terminal. The length of the binary sequences is 31, and the number of binary sequences is also 31. Ultimately, the number of sequences (62 in length) of the secondary synchronization symbol that can be generated as a pair of binary sequences is 961 in total, and only 336 sequences of these are used.

0005In the 3G LTE technique, four short binary sequences are used during a 10 msec-frame interval. At this time, the four short binary sequences may be different from one another or may be equal to one another, and four short binary sequences are provided to every cell by the cell group identifier. It can use at least one same sequence or two same sequences among four short binary sequences between adjacent cells, particularly between adjacent cells when 10 msec synchronization of two cells match with each other. In this case, interference between adjacent cells largely operates during a cell search process in the terminal, and performance can be significantly deteriorated. <nplcit id="ncit0001" npl-type="s"><text>Motorola: "Scrambling Method for Two S-SCH Code", R1-072661, 20 June 2007</text></nplcit><i>,</i><nplcit id="ncit0002" npl-type="s"><text>NTT Docomo et al: "S-SCH Structure for E-UTRA Downlink", R1-072941, 20 June 2007</text></nplcit><i>,</i><nplcit id="ncit0003" npl-type="s"><text> NTT Docomo et al: "Scrambling Method for S-SCH on E-UTRA Downlink", R1-072940, 20 June 2007</text></nplcit> and <i>3GPP; TSG; RAN; WG1; FDD: TS 25.213 V2.1.0</i> all provide certain disclosures in the field cellular systems.

[DETAILED DESCRIPTION]

[Technical Problem]

0006The present invention has been made in an effort to provide a method of generating a downlink frame that can reduce interference between adjacent cells and a method of efficiently searching a cell by receiving the downlink frame.

[Technical Solution]

0007The invention is defined by the appended claims. In the following, embodiments not falling within the scope of the claims are to be understood as examples useful for understanding the invention.

[Advantageous Effects]

0008According to the above-described present invention, interference between sectors is reduced by scrambling two sequences to be allocated to a secondary synchronization channel with different scrambling code, thereby improving cell searching performance.

[Brief Description of the Drawings]

0009<ul id="ul0001" list-style="none" compact="compact"><li><figref idref="f0001">FIG. 1</figref> is a view illustrating a method of generating a secondary synchronization channel symbol according to the conventional art.</li><li><figref idref="f0002">FIG. 2</figref> is a view illustrating a downlink frame of an OFDM system according to an example.</li><li><figref idref="f0003">FIG. 3</figref> is a block diagram of a downlink frame generating apparatus according to an example.</li><li><figref idref="f0003">FIG. 4</figref> is a flowchart of a downlink frame generating method according to an example.</li><li><figref idref="f0004">FIG. 5</figref> is a view illustrating an m-sequence generator.</li><li><figref idref="f0005">FIG. 6</figref> is a view illustrating a Gold sequence generator.</li><li><figref idref="f0006">FIG. 7</figref> is a view illustrating a sequence generator and a scrambling sequence generator.</li><li><figref idref="f0007">FIG. 8</figref> is a view illustrating the first secondary synchronization signal generating method according to an example.</li><li><figref idref="f0008">FIG. 9</figref> is a view illustrating the second secondary synchronization signal generating method according to an example.</li><li><figref idref="f0008">FIG. 10</figref> is a view illustrating the third secondary synchronization signal generating method according to an example.</li><li><figref idref="f0009">FIG. 11</figref> is a view illustrating the fourth secondary synchronization signal generating method according to an example.</li><li><figref idref="f0009">FIG. 12</figref> is a view illustrating the fifth secondary synchronization signal generating method according to an example.</li><li><figref idref="f0010">FIG. 13</figref> is a block diagram of a terminal according to an example.</li><li><figref idref="f0011">FIG. 14</figref> is a block diagram of a second-stage searcher according to an example.</li><li><figref idref="f0012">FIG. 15</figref> is a flowchart illustrating a cell searching method according to an example.</li></ul>

[Best Mode]

0010In the following detailed description, only certain exemplary embodiments of the present invention have been shown and described, simply by way of illustration. As those skilled in the art would realize, the described embodiments may be modified in various different ways. Accordingly, the drawings and description are to be regarded as illustrative in nature and not restrictive. Like reference numerals designate like elements throughout the specification.

0011Throughout this specification, unless explicitly described to the contrary, the word "comprise" and variations such as "comprises" or "comprising" will be understood to imply the inclusion of stated elements but not the exclusion of any other elements. In addition, the terms "-or", "-er", or the like described in the specification represent a unit for processing at least one function and operation, which can be implemented by hardware components or software components and combinations thereof.

0012First, a configuration of a downlink frame and a synchronization channel in an OFDM system according to an example will be described with reference to <figref idref="f0002">FIG. 2</figref>.

0013<figref idref="f0002">FIG. 2</figref> is a view illustrating a downlink frame of an OFDM system according to an example. In <figref idref="f0002">FIG. 2</figref>, the horizontal axis represents a time axis, and the vertical axis represents a frequency axis or a sub-carrier axis.

0014As shown in <figref idref="f0002">FIG. 2</figref>, according to the example, one downlink frame 110 has a time interval of 10 msec and includes ten sub-frames 120. Moreover, one sub-frame 120 has a time interval of 1 msec and includes two slots 130, and one slot 130 includes seven OFDM symbols.

0015As shown in <figref idref="f0002">FIG. 2</figref>, according to the example, one downlink frame 110 has two synchronization intervals 140 in total including a synchronization interval in slot No. 0 and slot No. 10, respectively. However, it is not necessarily limited thereto. That is, one downlink frame 110 may include the synchronization interval in any slot, and may include one synchronization interval or three synchronization intervals or more. Furthermore, each slot includes a pilot interval.

0016The synchronization interval according to the example includes a primary synchronization channel symbol and a secondary synchronization channel symbol that are disposed so as to be adjacent to each other in view of time. As shown in <figref idref="f0002">FIG. 2</figref>, the primary synchronization channel symbol is located at the end of the slot and the secondary synchronization channel symbol is located right ahead of the primary synchronization channel.

0017In an mobile communication system according to the example, a plurality of cells are grouped into a plurality of cell groups, and each of the cell groups includes at least two cells.

0018The primary synchronization channel includes information for identifying symbol synchronization and frequency synchronization and cell identifier information for identifying the cells in the cell groups, and the secondary synchronization channel includes information for identifying the cell group information and the frame synchronization.

0019A downlink frame generating apparatus according to the example will now be described with reference to <figref idref="f0003">FIG. 3. FIG. 3</figref> is a block diagram of the downlink frame generating apparatus according to the example.

0020As shown in <figref idref="f0003">FIG. 3</figref>, the downlink frame generating apparatus according to the example includes a sequence generator 310, a synchronization signal generator 320, a frequency mapper 330, and an OFDM transmitter 340.

0021The sequence generator 310 generates a sequence for identifying cell groups and frame boundaries and a scrambling sequence, and transmits them to the synchronization signal generator 320. The scrambling sequence is for scrambling the sequence.

0022The synchronization signal generator 320 generates a secondary synchronization signal by using the sequence and the scrambling sequence.

0023The frequency mapper 330 maps transmission data to the time and frequency domains by using the synchronization signal generated in the synchronization signal generator 320, and frame control information and transmission traffic data transmitted from the outside, thereby generating the downlink frame.

0024The OFDM transmitter 340 receives the downlink frame from the frequency mapper 330 and transmits the downlink frame through a transmission antenna.

0025Referring to <figref idref="f0003 f0004 f0005 f0006 f0007 f0008 f0009">FIG. 4 through FIG. 12</figref>, a downlink frame generating method according to the example will now be described. <figref idref="f0003">FIG. 4</figref> is a flowchart of the downlink frame generating method according to the example.

0026As shown in <figref idref="f0003">FIG. 4</figref>, the sequence generator 310 generates a plurality of sequences and a plurality of scrambling sequences and transmits them to the synchronization signal generator 320 (S410).

0027First, a method of generating the sequences will be described with reference to <figref idref="f0004">FIG. 5</figref>. The sequence is a cyclic shift of an m-sequence that has a length of 31. A primitive polynomial can make the m-sequence that has a length of 31, and six primitive polynomials are in existence, as indicated in Equation 1. <maths id="math0001" num="(Equation 1)"><math display="block"><mtable columnalign="left"><mtr><mtd><mrow><mi mathvariant="normal">P</mi><mn>0</mn><mo>:</mo><msup><mi mathvariant="normal">x</mi><mn>5</mn></msup><mo>+</mo><msup><mi mathvariant="normal">x</mi><mn>2</mn></msup><mo>+</mo><mn>1</mn></mrow></mtd></mtr><mtr><mtd><mrow><mi mathvariant="normal">P</mi><mn>1</mn><mo>:</mo><msup><mi mathvariant="normal">x</mi><mn>5</mn></msup><mo>+</mo><msup><mi mathvariant="normal">x</mi><mn>3</mn></msup><mo>+</mo><mn>1</mn></mrow></mtd></mtr><mtr><mtd><mrow><mi mathvariant="normal">P</mi><mn>2</mn><mo>:</mo><msup><mi mathvariant="normal">x</mi><mn>5</mn></msup><mo>+</mo><msup><mi mathvariant="normal">x</mi><mn>3</mn></msup><mo>+</mo><msup><mi mathvariant="normal">x</mi><mn>2</mn></msup><mo>+</mo><mi mathvariant="normal">x</mi><mo>+</mo><mn>1</mn></mrow></mtd></mtr><mtr><mtd><mrow><mi mathvariant="normal">P</mi><mn>3</mn><mo>:</mo><msup><mi mathvariant="normal">x</mi><mn>5</mn></msup><mo>+</mo><msup><mi mathvariant="normal">x</mi><mn>4</mn></msup><mo>+</mo><msup><mi mathvariant="normal">x</mi><mn>2</mn></msup><mo>+</mo><mi mathvariant="normal">x</mi><mo>+</mo><mn>1</mn></mrow></mtd></mtr><mtr><mtd><mrow><mi mathvariant="normal">P</mi><mn>4</mn><mo>:</mo><msup><mi mathvariant="normal">x</mi><mn>5</mn></msup><mo>+</mo><msup><mi mathvariant="normal">x</mi><mn>4</mn></msup><mo>+</mo><msup><mi mathvariant="normal">x</mi><mn>3</mn></msup><mo>+</mo><mi mathvariant="normal">x</mi><mo>+</mo><mn>1</mn></mrow></mtd></mtr><mtr><mtd><mrow><mi mathvariant="normal">P</mi><mn>5</mn><mo>:</mo><msup><mi mathvariant="normal">x</mi><mn>5</mn></msup><mo>+</mo><msup><mi mathvariant="normal">x</mi><mn>4</mn></msup><mo>+</mo><msup><mi mathvariant="normal">x</mi><mn>3</mn></msup><mo>+</mo><msup><mi mathvariant="normal">x</mi><mn>2</mn></msup><mo>+</mo><mn>1</mn></mrow></mtd></mtr></mtable></math><img file="EP2179556B1_D0001.tif" /></maths>

0028<figref idref="f0004">FIG. 5</figref> is a view illustrating an m-sequence generator. As shown in <figref idref="f0004">FIG. 5</figref>, the m-sequence generator includes a plurality of delay operators 510, 520, 530, 540, and 550, and an exclusive OR operator 560. In <figref idref="f0004">FIG. 5</figref>, g₀, g₁, g₂, g₃, g₄, and g₅ represent coefficients in the primitive polynomial of Equation 1. The coefficients g₀ and g₅ always have a value of 1, and the remaining coefficients g₁, g₂, g₃, and g₄ have a value of 0 or 1 according to the primitive polynomial. For example, when the primitive polynomial is x⁵+x²+1, the coefficients g₁, g₃, and g₄ have a value of 0, and the coefficient g₂ has a value of 1. When the value of the coefficient is 1, the output of a corresponding delay operator is connected to the output of the exclusive OR operator 560. Meanwhile, when the value of the coefficient is 0, the output of the corresponding delay operator is not connected to the output of the exclusive OR operator 560.

0029The downlink frame generating method according to the example uses the cyclic shift sequence of the m-sequence, which is defined by the primitive polynomial of x⁵+x²+1, as a sequence. That is, assuming that <b>c</b>⁰={c⁰ 0, c⁰ 1, c⁰ 2, •••, c⁰ 30} is referred to as the m-sequence generated by counting any value in the sequence generator having the primitive polygonal of x⁵+x²+1, 31 m-sequences may be generated as indicated in Equation 2. <maths id="math0002" num="(Equation 2)"><math display="block"><mtable columnalign="left"><mtr><mtd><mrow><msup><mi mathvariant="bold">c</mi><mn>0</mn></msup><mo>=</mo><mfenced open="{" close="}" separators=""><msup><mi mathvariant="normal">c</mi><mn>0</mn></msup><mspace width="1ex" /><mn>0</mn><mo>,</mo><msup><mrow><mspace width="1ex" /><mi mathvariant="normal">c</mi></mrow><mn>0</mn></msup><mspace width="1ex" /><mn>1</mn><mo>,</mo><msup><mrow><mspace width="1ex" /><mi mathvariant="normal">c</mi></mrow><mn>0</mn></msup><mspace width="1ex" /><mn>2</mn><mo>,</mo><mspace width="1ex" /><mo>⋯</mo><mo>,</mo><msup><mrow><mspace width="1ex" /><mi mathvariant="normal">c</mi></mrow><mn>0</mn></msup><mspace width="1ex" /><mn>30</mn></mfenced></mrow></mtd></mtr><mtr><mtd><mrow><msup><mi mathvariant="bold">c</mi><mn>1</mn></msup><mo>=</mo><mfenced open="{" close="}" separators=""><msup><mi mathvariant="normal">c</mi><mn>1</mn></msup><mspace width="1ex" /><mn>0</mn><mo>,</mo><msup><mrow><mspace width="1ex" /><mi mathvariant="normal">c</mi></mrow><mn>1</mn></msup><mspace width="1ex" /><mn>1</mn><mo>,</mo><msup><mrow><mspace width="1ex" /><mi mathvariant="normal">c</mi></mrow><mn>1</mn></msup><mspace width="1ex" /><mn>2</mn><mo>,</mo><mspace width="1ex" /><mo>⋯</mo><mo>,</mo><msup><mrow><mspace width="1ex" /><mi mathvariant="normal">c</mi></mrow><mn>1</mn></msup><mspace width="1ex" /><mn>30</mn></mfenced><mo>=</mo><mfenced open="{" close="}" separators=""><msup><mi mathvariant="normal">c</mi><mn>0</mn></msup><mspace width="1ex" /><mi mathvariant="normal">1</mi><mo>,</mo><msup><mrow><mspace width="1ex" /><mi mathvariant="normal">c</mi></mrow><mn>0</mn></msup><mspace width="1ex" /><mi mathvariant="normal">2</mi><mo>,</mo><msup><mrow><mspace width="1ex" /><mi mathvariant="normal">c</mi></mrow><mn>0</mn></msup><mspace width="1ex" /><mi mathvariant="normal">3</mi><mo>,</mo><mspace width="1ex" /><mo>⋯</mo><mo>,</mo><msup><mrow><mspace width="1ex" /><mi mathvariant="normal">c</mi></mrow><mn>0</mn></msup><mspace width="1ex" /><mn>0</mn></mfenced></mrow></mtd></mtr><mtr><mtd><mrow><msup><mi mathvariant="bold">c</mi><mn>2</mn></msup><mo>=</mo><mfenced open="{" close="}" separators=""><msup><mi mathvariant="normal">c</mi><mn>2</mn></msup><mspace width="1ex" /><mn>0</mn><mo>,</mo><msup><mrow><mspace width="1ex" /><mi mathvariant="normal">c</mi></mrow><mn>2</mn></msup><mspace width="1ex" /><mn>1</mn><mo>,</mo><msup><mrow><mspace width="1ex" /><mi mathvariant="normal">c</mi></mrow><mn>2</mn></msup><mspace width="1ex" /><mn>2</mn><mo>,</mo><mspace width="1ex" /><mo>⋯</mo><mo>,</mo><msup><mrow><mspace width="1ex" /><mi mathvariant="normal">c</mi></mrow><mn>2</mn></msup><mspace width="1ex" /><mn>30</mn></mfenced><mo>=</mo><mfenced open="{" close="}" separators=""><msup><mi mathvariant="normal">c</mi><mn>0</mn></msup><mspace width="1ex" /><mi mathvariant="normal">2</mi><mo>,</mo><msup><mrow><mspace width="1ex" /><mi mathvariant="normal">c</mi></mrow><mn>0</mn></msup><mspace width="1ex" /><mi mathvariant="normal">3</mi><mo>,</mo><msup><mrow><mspace width="1ex" /><mi mathvariant="normal">c</mi></mrow><mn>0</mn></msup><mspace width="1ex" /><mi mathvariant="normal">4</mi><mo>,</mo><mspace width="1ex" /><mo>⋯</mo><mo>,</mo><msup><mrow><mspace width="1ex" /><mi mathvariant="normal">c</mi></mrow><mn>0</mn></msup><mspace width="1ex" /><mn>1</mn></mfenced></mrow></mtd></mtr><mtr><mtd><mo>…</mo></mtd></mtr><mtr><mtd><mrow><msup><mi mathvariant="bold">c</mi><mn>30</mn></msup><mo>=</mo><mfenced open="{" close="}" separators=""><msup><mi mathvariant="normal">c</mi><mn>30</mn></msup><mspace width="1ex" /><mn>0</mn><mo>,</mo><msup><mrow><mspace width="1ex" /><mi mathvariant="normal">c</mi></mrow><mn>30</mn></msup><mspace width="1ex" /><mn>1</mn><mo>,</mo><msup><mrow><mspace width="1ex" /><mi mathvariant="normal">c</mi></mrow><mn>30</mn></msup><mspace width="1ex" /><mn>2</mn><mo>,</mo><mspace width="1ex" /><mo>⋯</mo><mo>,</mo><msup><mrow><mspace width="1ex" /><mi mathvariant="normal">c</mi></mrow><mn>30</mn></msup><mspace width="1ex" /><mn>30</mn></mfenced><mo>=</mo><mfenced open="{" close="}" separators=""><msup><mi mathvariant="normal">c</mi><mn>0</mn></msup><mspace width="1ex" /><mi mathvariant="normal">3</mi><mn>0</mn><mo>,</mo><msup><mrow><mspace width="1ex" /><mi mathvariant="normal">c</mi></mrow><mn>0</mn></msup><mspace width="1ex" /><mi mathvariant="normal">0</mi><mo>,</mo><msup><mrow><mspace width="1ex" /><mi mathvariant="normal">c</mi></mrow><mn>0</mn></msup><mspace width="1ex" /><mi mathvariant="normal">1</mi><mo>,</mo><mspace width="1ex" /><mo>⋯</mo><mo>,</mo><msup><mrow><mspace width="1ex" /><mi mathvariant="normal">c</mi></mrow><mn>0</mn></msup><mspace width="1ex" /><mi>29</mi></mfenced></mrow></mtd></mtr></mtable></math><img file="EP2179556B1_D0002.tif" /></maths> In Equation 2, the value of each element of the m-sequence is 1 or -1.

0030Next, a method of generating a scrambling sequence will be described with reference to <figref idref="f0005">FIG. 6</figref> and <figref idref="f0006">FIG. 7</figref>.

0031A Gold sequence having a good correlation characteristic may be used as the scrambling sequence. The Gold sequence is formed by combining two m sequences having the same length.

0032Preferred pairs refer to pairs of m-sequences that are capable of generating the Gold sequence among the m-sequences defined by the six primitive polynomials in Equation 1. That is, the preferred pairs are capable of generating the Gold sequence that has a length of 31, and the number of preferred pairs is 12, for example [P0 P2], [P0 P3], [P0 P4], [P0 P5], [P1 P2], [P1 P3], [P1 P4], [P1 P5], [P2 P3], [P2 P4], [P3 P5], and [P4 P5]. <figref idref="f0005">FIG. 6</figref> is a view illustrating a Gold sequence generator. The Gold sequence generator shown in <figref idref="f0005">FIG. 6</figref> generates the Gold sequence by using the preferred pair [P1 P2].

0033The Gold sequence may be generated by using one of the remaining preferred pairs except the preferred pair including the polynomial, which is used for generating the sequence, among the 12 preferred pairs. In the downlink frame generating method according to the example, since the polynomial x⁵+x²+1 is used as a polynomial of the sequence, the Gold sequence is generated by one of the preferred pairs [P1 P2], [P1 P3], [P1 P4], [P1 P5], [P2 P3], [P2 P4], [P3 P5], and [P4 P5]. The number of Gold sequences generated by selecting one of 8 preferred pairs is 33, which is two more than the sequence length. In 33 Gold sequences generated from the selected preferred pair, any sequence may be used as the scrambling sequence.

0034When one of the preferred pairs including the polynomial used for generating the sequence, that is, [P0 P2], [P0 P3], [P0 P4], and [P0 P5], is selected as a preferred pair for generating the Gold sequence, the remaining Gold sequences, which exclude the sequence from (N+2) Gold sequences (where N is 31 as a length of the Gold sequence) to be generated, should be used as a scrambling sequence. That is, 33 Gold sequences are generated by one of the preferred pairs [P0 P2], [P0 P3], [P0 P4], and [P0 P5] including the polynomial used for generating the sequence, and 33 Gold sequences include the sequence. Accordingly, it should use the remaining Gold sequences except the sequence as a scrambling sequence.

0035With respect to the scrambling sequence, the m-sequence that is the same length as the sequence but is different from the sequence in the primitive polynomial and the cyclic shift sequence of the m-sequence may be used. That is, as the scrambling sequence of the present invention, the m-sequence that is generated by using one of other polynomials except the polynomial x⁵+x²+1 in the polynomials expressed by Equation 1 and the cyclic shift sequence of the m-sequence is used. <figref idref="f0006">FIG. 7</figref> is a view illustrating a sequence generator and a scrambling sequence generator. As shown in <figref idref="f0006">FIG. 7</figref>, when the m-sequence and the cyclic shift sequence of the m-sequence are used as the scrambling sequence, the scrambling sequence may be generated by varying only a connection part of the sequence generator having the same structure as the sequence. Accordingly, this has the merit of reducing complexity of a terminal.

0036The synchronization signal generator 320 generates the secondary synchronization signal by using the plurality of sequences and the plurality of scrambling sequences received from the sequence generator 310 (S420). The example describes the case where one frame includes two secondary synchronization channels, but is not limited thereto.

0037Five kinds of secondary synchronization signal generating methods according to the example will be described with reference to <figref idref="f0007 f0008 f0009">FIG. 8 through FIG. 12</figref>.

0038<figref idref="f0007">FIG. 8</figref> is a view illustrating a first secondary synchronization signal generating method according to the example. As shown in <figref idref="f0007">FIG. 8</figref>, according to the first secondary synchronization signal generating method of the example, a first sequence <maths id="math0003" num=""><math display="inline"><msup><mi mathvariant="bold">c</mi><msubsup><mi>h</mi><mn>0</mn><mfenced><mi>g</mi></mfenced></msubsup></msup><mfenced><mi>n</mi></mfenced></math><img file="EP2179556B1_D0003.tif" /></maths> is scrambled with a first scrambling sequence s^p, and the scrambled first sequence is allocated to even-numbered sub-carriers of the secondary synchronization channel in the sub-frame No. 0. Furthermore, in the first secondary synchronization signal generating method, a second sequence <maths id="math0004" num=""><math display="inline"><msup><mi mathvariant="bold">c</mi><msubsup><mi>h</mi><mn>1</mn><mfenced><mi>g</mi></mfenced></msubsup></msup><mfenced><mi>n</mi></mfenced></math><img file="EP2179556B1_D0004.tif" /></maths> is scrambled with a second scrambling sequence <b>s</b>^q that is different from the first scrambling sequence <b>s</b>^p, and the scrambled second sequence is allocated to odd-numbered sub-carriers of the secondary synchronization channel in the sub-frame No. 0. In addition, according to the first secondary synchronization signal generating method of the example, a third sequence <maths id="math0005" num=""><math display="inline"><msup><mi mathvariant="bold">c</mi><msubsup><mi>h</mi><mn>2</mn><mfenced><mi>g</mi></mfenced></msubsup></msup><mfenced><mi>n</mi></mfenced></math><img file="EP2179556B1_D0005.tif" /></maths> is scrambled with a third scrambling sequence, and the scrambled third sequence is allocated to even-numbered sub-carriers of the secondary synchronization channel in the sub-frame No. 5. Furthermore, in the first secondary synchronization signal generating method, a fourth sequence <maths id="math0006" num=""><math display="inline"><msup><mi mathvariant="bold">c</mi><msubsup><mi>h</mi><mn>3</mn><mfenced><mi>g</mi></mfenced></msubsup></msup><mfenced><mi>n</mi></mfenced></math><img file="EP2179556B1_D0006.tif" /></maths> is scrambled with a fourth scrambling sequence that is different from the third scrambling sequence, and the scrambled fourth sequence is allocated to odd-numbered sub-carriers of the secondary synchronization channel in the sub-frame No. 5.

0039That is, according to the first secondary synchronization signal generating method, each element of the first sequence <maths id="math0007" num=""><math display="inline"><msup><mi mathvariant="bold">c</mi><msubsup><mi>h</mi><mn>0</mn><mfenced><mi>g</mi></mfenced></msubsup></msup><mfenced><mi>n</mi></mfenced></math><img file="EP2179556B1_D0007.tif" /></maths> is multiplied by a corresponding element of the first scrambling sequence <b>s</b>^p, and the product is allocated to even-numbered sub-carriers of the secondary synchronization channel in the sub-frame No. 0. Moreover, each element of the second sequence <maths id="math0008" num=""><math display="inline"><msup><mi mathvariant="bold">c</mi><msubsup><mi>h</mi><mn>1</mn><mfenced><mi>g</mi></mfenced></msubsup></msup><mfenced><mi>n</mi></mfenced></math><img file="EP2179556B1_D0008.tif" /></maths> is multiplied by a corresponding element of the second scrambling sequence <b>s</b>^q, and the product is allocated to odd-numbered sub-carriers of the secondary synchronization channel in the sub-frame No. 0. In addition, according to the first secondary synchronization signal generating method, each element of the third sequence <maths id="math0009" num=""><math display="inline"><msup><mi mathvariant="bold">c</mi><msubsup><mi>h</mi><mn>2</mn><mfenced><mi>g</mi></mfenced></msubsup></msup><mfenced><mi>n</mi></mfenced></math><img file="EP2179556B1_D0009.tif" /></maths> is multiplied by a corresponding element of the third scrambling sequence, and the product is allocated to even-numbered sub-carriers of the secondary synchronization channel in the sub-frame No. 5. Moreover, each element of the fourth sequence <maths id="math0010" num=""><math display="inline"><msup><mi mathvariant="bold">c</mi><msubsup><mi>h</mi><mn>3</mn><mfenced><mi>g</mi></mfenced></msubsup></msup><mfenced><mi>n</mi></mfenced></math><img file="EP2179556B1_D0010.tif" /></maths> is multiplied by a corresponding element of the fourth scrambling sequence, and the product is allocated to odd-numbered sub-carriers of the secondary synchronization channel in the sub-frame No. 5.

0040The first scrambling sequence is expressed as <b>s</b>^p={s^p 0, s^p 1, s^p 2, ···, s^p 30}, and the second scrambling sequence is expressed as <b>s</b>^q={s^q 0, s^q 1, s^q 2, •••, s^q 30}. Here, p and q represent a scrambling sequence number, respectively.

0041The same scrambling sequence is used in the secondary synchronization channel of the sub-frame No. 0 and the secondary synchronization channel of the sub-frame No. 5 within one frame, or a different scrambling sequence is used in the secondary synchronization channel of the sub-frame No. 0 and the secondary synchronization channel of the sub-frame No. 5 within one frame. <figref idref="f0007">FIG. 8</figref> illustrates the case where the same scrambling sequence is used. That is, in <figref idref="f0007">FIG. 8</figref>, the first scrambling sequence and the third scrambling sequence are the same, and the second scrambling sequence and the fourth scrambling sequence are the same.

0042In the first secondary synchronization signal generating method according to the example, the scrambling sequence numbers p and q are one-to-two mapped to a sequence number, which is allocated to the primary synchronization channel. That is, as described above, three primary synchronization channel sequences are defined in the system of current 3G LTE. Therefore, according to the first secondary synchronization signal generating method of the example, two scrambling sequences of the secondary synchronization channel are two-to-one mapped to the primary synchronization signal, as indicated in Equation 3.

(Equation 3)

0043Sequence number of primary synchronization channel: Scrambling sequence numbers p and q of secondary synchronization channel <tables id="tabl0001" num="0001"><table frame="none"><tgroup cols="4" colsep="0" rowsep="0"><colspec colnum="1" colname="col1" colwidth="21mm" /><colspec colnum="2" colname="col2" colwidth="20mm" /><colspec colnum="3" colname="col3" colwidth="22mm" /><colspec colnum="4" colname="col4" colwidth="21mm" /><tbody><row><entry>0</entry><entry>:</entry><entry>0,</entry><entry>1</entry></row><row><entry>1</entry><entry>:</entry><entry>2,</entry><entry>3</entry></row><row><entry>2</entry><entry>:</entry><entry>4,</entry><entry>5</entry></row></tbody></tgroup></table></tables>

0044When the scrambling sequence is given with a cyclic shifted sequence of one m-sequence, p and q correspond to a cyclic shift index, respectively.

0045When the scrambling sequence numbers are one-to-two mapped to the sequence number that is allocated to the primary synchronization channel, the sequence number of the primary synchronization channel is detected at a first cell searching stage of a terminal, thereby being capable of scrambling with the scrambling sequence number of the secondary synchronization channel corresponding to the sequence number of the primary synchronization channel, which is detected at the first cell searching stage.

0046<figref idref="f0008">FIG. 9</figref> is a view illustrating a second secondary synchronization signal generating method according to the example.

0047According to the second secondary synchronization signal generating method according to the example, a first sequence and a second sequence are scrambled with the same scrambling sequence, respectively, and the scrambled first and second sequences are alternately allocated to the sub-carrier of the secondary synchronization channel.

0048The second secondary synchronization signal generating method has the merit that the number of scrambling sequences is reduced by half as compared with the first secondary synchronization signal generating method. In addition, as a scrambling sequence, the Gold sequence, the m-sequence, the cyclic shift sequence of the Gold sequence, or the cyclic shift sequence of the m-sequence can be used. According to the second secondary synchronization signal generation method, as indicated in Equation 4, the scrambling sequence numbers are one-to-one mapped to the sequence number allocated to the primary synchronization channel.

(Equation 4)

0049Sequence number of primary synchronization channel: Scrambling sequence numbers p and q of secondary synchronization channel <tables id="tabl0002" num="0002"><table frame="none"><tgroup cols="4" colsep="0" rowsep="0"><colspec colnum="1" colname="col1" colwidth="21mm" /><colspec colnum="2" colname="col2" colwidth="20mm" /><colspec colnum="3" colname="col3" colwidth="22mm" /><colspec colnum="4" colname="col4" colwidth="21mm" /><tbody><row><entry>0</entry><entry>:</entry><entry>0,</entry><entry>0</entry></row><row><entry>1</entry><entry>:</entry><entry>1,</entry><entry>1</entry></row><row><entry>2</entry><entry>:</entry><entry>2,</entry><entry>2</entry></row></tbody></tgroup></table></tables>

0050<figref idref="f0008">FIG. 10</figref> is a view illustrating a third secondary synchronization signal generating method according to the example. According to the third secondary synchronization signal generating method of the example, the first sequence and the second sequence are scrambled with one long-scrambling sequence, and the scrambled first and second sequences are alternately allocated to the secondary synchronization channel.

0051The length of the one long-scrambling sequence used in the third synchronization signal generating method is the sum of the length of the first sequence, the length of the second sequence, and the length of a DC sub-carrier component. That is, the first sequence and the second sequence have a length of 31, respectively, while the scrambling sequence used in the third synchronization signal generating method has a length of 63.

0052According to the third secondary synchronization signal generating method, a Gold sequence having the length of 63, an m-sequence having the length of 63, a shifted sequence of the Gold sequence having the length of 63, or a shifted sequence of the m-sequence having the length of 63 are used as a scrambling sequence. Furthermore, the scrambling sequence is also mapped to the DC sub-carrier. That is, the third secondary synchronization signal generating method is characterized by the fact that the sequence is not mapped to the DC sub-carrier, but the scrambling sequence is mapped to the DC sub-carrier. However, an element of the scrambling sequence mapped to the DC sub-carrier may not be actually transmitted. According to the third secondary synchronization signal generating method, the scrambling sequence number is one-to-one mapped to the sequence number allocated to the primary synchronization channel.

0053<figref idref="f0009">FIG. 11</figref> is a view illustrating a fourth secondary synchronization signal generating method according to the example. According to the fourth secondary synchronization signal generating method, the first sequence is allocated to even-numbered sub-carriers of the secondary synchronization channel, the second sequence is scrambled with the scrambling sequence, and the scrambled second sequence is allocated to odd-numbered sub-carriers of the secondary synchronization channel. That is, the fourth secondary synchronization signal generating method relates to a method of applying the scrambling process to only the second sequence.

0054The length of the scrambling sequence used in the fourth synchronization signal generating method is the same as that of the second sequence. In addition, the scrambling sequence number, which is the same as the first sequence number, may be used. Furthermore, a Gold sequence, an m-sequence, a cyclic shift sequence of the Gold sequence, or a cyclic shift sequence of the m-sequence can used as a scrambling sequence.

0055<figref idref="f0009">FIG. 12</figref> is a view illustrating a fifth synchronization signal generating method according to the example. According to the fifth secondary synchronization signal generating method, the first sequence is scrambled with the scrambling sequence corresponding to the sequence number allocated to the primary synchronization channel, and the scrambled first sequence is allocated to even-numbered sub-carriers of the secondary synchronization channel. Moreover, the second sequence is scrambled with the scrambling sequence corresponding to the first sequence number, and the scrambled second sequence is allocated to odd-numbered sub-carriers of the secondary synchronization channel.

0056In the fifth secondary synchronization signal generating method, a Gold sequence, an m-sequence, a cyclic shift sequence of the Gold sequence, or a cyclic shift sequence of the m-sequence can be used as a scrambling sequence. However, the scrambling sequence for scrambling the first sequence and the second sequence should use different polynomials.

0057The frequency mapper 330 maps transmission data to the time and frequency domains by using the synchronization signal and transmission traffic data generated in the synchronization signal generator 320, thereby generating the frame of downlink signals (S430).

0058The OFDM transmitter 340 receives the frame of downlink signals and transmits the received downlink frame through the transmission antenna (S440).

0059Hereinafter, a method of searching cells in the terminal by using the downlink signals generated in accordance with the example will be described with reference to <figref idref="f0010 f0011 f0012">FIG. 13 through FIG. 15</figref>.

0060<figref idref="f0010">FIG. 13</figref> is a block diagram of a terminal according to the example, <figref idref="f0011">FIG. 14</figref> is a block diagram of a second-stage searcher according to the example, and <figref idref="f0012">FIG. 15</figref> is a flowchart illustrating a cell searching method according to the example.

0061As shown in <figref idref="f0010">FIG. 13</figref>, the terminal according to the example includes a receiving antenna 610, a down converter 620, a cell searcher 630, a data channel demodulator 640, a controller 650, and a clock generator 660. In addition, the cell searcher 630 includes a synchronization channel band-pass filter 631, a first-stage cell searcher 632, and a second-stage searcher 633.

0062The synchronization channel band-pass filter 631 receives received signals S1 and S2 and filters only a synchronization channel in an entire received band. The first-stage searcher 632 receives output signals S3 and S4 of the synchronization channel band-pass filter 631 and acquires 5msec-timing-information S5 of the downlink signal and sequence number S6 of the primary synchronization channel. Furthermore, the second-stage searcher 633 acquires a cell group identifier S7 and 10 msec-frame-boundary S8 by using the secondary synchronization channel structure of the present invention based on the information S5 and S6 received from the first-stage searcher 632. Moreover, the second-stage searcher 633 extracts a cell identifier S9 by combining the sequence number S6 of the primary synchronization channel and the cell group identifier S7, and can transfer the extracted cell group identifier S7 to the controller 650.

0063As shown in <figref idref="f0011">FIG. 14</figref>, the second-stage searcher 633 includes cyclic prefix (CP) removers 633a, fast Fourier transform transformers (FFTs) 633b, channel estimators 633c, channel compensators 633d, an antenna coupler 633e, a scrambling sequence generator 633f, a sequence generator 633g, a descrambling block 633h, and a maximum value selector 633i.

0064As shown in <figref idref="f0012">FIG. 15</figref>, the CP removers 633a receive the output signals S3 and S4 of the synchronization channel band-pass filter 631 and remove the CP from the position of the primary synchronization channel symbol and the secondary synchronization channel symbol based on the 5 msec-timing-information S5 received from the first-stage searcher 632 (S710).

0065The fast Fourier transformers 633b perform fast Fourier transform on the output signals of the CP removers 633a and change a time domain signal into a frequency domain signal (S720).

0066The channel estimators 633c estimate the channel by using a primary synchronization channel component S10 among the outputs of the fast Fourier transformer (FFT) 633b (S730), and the channel compensators 633d compensate channel distortion of a secondary synchronization channel component among the outputs of the fast Fourier transformer (FFT) 633b by using channel values received from the channel estimators 633c (S740).

0067The antenna coupler 633e performs diversity combination for two receiving antenna signals that are outputs of two channel compensators 633d (S750). The descrambling block 633h descrambles the output of the antenna coupler 633e by using the scrambling sequence generated by the scrambling sequence generator 633f and the sequence generated by the sequence generator 633g (S760).

0068The maximum value selector 633i selects the maximum value among the outputs of the descrambling block 633h, determines the cell group identifier S7 and the 10 msec-frame-boundary S8 from the maximum index value, and outputs the determined cell group identifier S7 and 10 msec-frame-boundary S8 (S770). Moreover, the maximum value selector 633i can also analogize the cell identifier number S9 by using the sequence number S6 of the primary synchronization channel and the cell group identifier number S7 (S780).

0069The exemplary embodiment of the present invention is not necessarily implemented by only the above-described apparatus and/or method, but can be implemented by, for example, a program that achieves the function corresponding to the configuration of the exemplary embodiment of the present invention and a recording medium in which the program is recorded. This can be easily implemented from the above-described exemplary embodiment of the present invention by those skilled in the related art.