Method for generating downlink frame, and method for searching cell
5 claims: 2 independent, 3 dependent
- 1A method of generating a downlink frame (110) including a primary synchronization signal and secondary synchronization signals, comprising:generating a first short sequence and a second short sequence indicating cell group information;generating a first scrambling sequence and a second scrambling sequence determined by the primary synchronization signal;generating a third scrambling sequence determined by a short sequence group - the wireless communication system uses a plurality of short sequences and the plurality of short sequences are grouped into a plurality of short sequence group - to which the first short sequence is assigned and a fourth scrambling sequence determined by a short sequence group to which the second short sequence is assigned;scrambling the first short sequence with the first scrambling sequence and scrambling the second short sequence with the second scrambling sequence and the third scrambling sequence;scrambling the second short sequence with the first scrambling sequence and scrambling the first short sequence with the second scrambling sequence and the fourth scrambling sequence;and mapping the secondary synchronization signal that includes the first short sequence scrambled with the first scrambling sequence, the second short sequence scrambled with the second scrambling sequence and the third scrambling sequence, the second short sequence scrambled with the first scrambling sequence and the first short sequence scrambled with the second scrambling sequence and the fourth scrambling sequence to a frequency domain.
- 4A method of searching a cell by a mobile station in wireless communication system, comprising:receiving a downlink frame (110) including a primary synchronization signal and two secondary synchronization signals;and identifying a cell by-using the primary synchronization signal and at least one of the two secondary synchronization signals, wherein, in one secondary synchronization signal of the two secondary synchronization signals, a first short sequence scrambled with a first scrambling sequence and a second short sequence scrambled with a second scrambling sequence and a third scrambling sequence are alternately disposed on a plurality of sub-carriers, in the other secondary synchronization signal of the two secondary synchronization signals, the second short sequence scrambled with the first scrambling sequence and the first short sequence scrambled with the second scrambling sequence and a fourth scrambling sequence are alternatively disposed on a plurality of sub-carrier, the first short sequence and the second short sequence indicate cell group information, the first scrambling sequence and the second scrambling sequence are determined by the primary synchronization signal, and the third scrambling sequence is determined by a short sequence group - the wireless communication system uses a plurality of short sequences and the plurality of short sequences are grouped into a plurality of short sequence group - to which the first short sequence is assigned, and the fourth scrambling sequence is determined by a short sequence group to which the second short sequence is assigned.
Independent claims2
116 paragraphs, as filed
[Technical Field]
0001The present invention relates to a method of generating a downlink frame and a method of searching cells. More particularly, the present invention relates to a method of generating a downlink frame and a method of searching cells by using the downlink frame in an orthogonal frequency division multiplexing (OFDM)-based cellular system.
[Background Art]
0002In a direct sequence code division multiple access (DS-CDMA) system, a sequence hopping method is applied to a pilot channel so as to acquire cell synchronization and unique cell identification information. According to the sequence hopping method, a mobile station easily performs a cell search without a separating synchronization channel by introducing a sequence hopping technology to the pilot channel. However, in the OFDM system, a number of channels that are capable of being distinguished by a frequency domain in a symbol duration of one time domain is greater than that of those that are capable of being distinguished by a spread of CDMA in the symbol duration of one time domain. Accordingly, when only the time domain is used, resources may be wasted in terms of capacity. For this reason, it is inefficient to directly apply the sequence hopping method to the time domain of the pilot channel in the OFDM-based system. Therefore, it is preferable to search the cell by efficiently using received signals in both time domain and frequency domain.
0003An example of an existing technology for searching a cell in the OFDM system includes a method that allocates synchronization information and cell information by dividing one frame into four time blocks. For the above-described method, two frame structures have been proposed. In a first frame structure, synchronization identification information, cell group identification information, and cell unique identification information are allocated to four time blocks, respectively. In a second frame structure, the synchronization identification information and the cell unique identification information are allocated to a first time block and a third time block, and the synchronization identification information and the cell group identification information are allocated to a second time block and a fourth time block.
0004According to the first frame structure, since the symbol synchronization is acquired in only the first time block, it is impossible for the mobile station to conduct rapid synchronization acquisition within a prescribed 5ms during power-on or handover between heterogeneous networks. In addition, it is difficult to acquire diversity gain by accumulating synchronization identification information so as to conduct rapid synchronization acquisition.
0005According to the second frame structure, the unique cell identification information or the cell group identification information is correlated along with the synchronization acquisition. Therefore, a cell searching process is complex and a rapid cell search is difficult.
0006As an example of another technology for searching the cell, a method of acquiring the synchronization and searching the cell by using a separate preamble has been proposed. However, this method cannot be applied to a system in which the preamble does not exist. Moreover, the preamble is disposed in front of the frame. Accordingly, in a case in which the mobile station would like to acquire the synchronization at a time location that is not the start of the frame, there is a problem in that it must wait for the next frame. Particularly, the mobile station should acquire initial symbol synchronization within 5 msec during the handover among a GSM mode, a WCDMA mode, and a 3GPP LTE mode, but may acquire the synchronization by a frame unit. For this reason, in some cases, the mobile station cannot acquire the initial symbol synchronization within 5 msec.
0007As an example of another technology for searching a cell, there is a method of searching the cell by allocating two short sequences to a secondary synchronization channel and by mapping cell ID information to a combination of two short sequences. According to this method, since interference occurs between cells when the same short sequence is allocated to sectors adjacent to each other, there is a problem in that performance in searching cells is reduced.
0008This problem was addressed in ZTE: "Scrambling method for S-SCH" 3GPP Draft R1-072910, wherein a scrambling method using two short sequences for the secondary synchronization channel based on Fourier series sequences was proposed. Moreover, two of the scrambling methods for two short sequences were evaluated in Motorola: "Scrambling Method for Two S-SCH Short Code" 3GPP Draft R1-072661.
[DETAILED DESCRIPTION]
[Technical Problem]
0009The present invention has been made in an effort to provide a method of generating a downlink frame that is capable of averaging interference between sectors and a method of efficiently searching cells by receiving the downlink frame.
[Technical Solution]
0010An exemplary embodiment of the present invention provides a method of generating a downlink frame, including : generating a first short sequence and a second short sequence indicating cell group information; generating a first scrambling sequence and a second scrambling sequence determined by the primary synchronization signal; generating a third scrambling sequence determined by a short sequence group-a wireless communication system uses a plurality of short sequences and the plurality of short sequences are grouped into a plurality of short sequence group-to which the first short sequence is assigned; scrambling the first short sequence with the first scrambling sequence and scrambling the second short sequence with the second scrambling sequence and the third scrambling sequence; and mapping the secondary synchronization signal that includes the scrambled first short sequence and the scrambled second short sequence to a frequency domain.
0011Another exemplary embodiment of the present invention provides a method of generating a downlink frame, including : generating a first short sequence and a second short sequence indicating cell group information; generating a first scrambling sequence and a second scrambling sequence determined by the primary synchronization signal; generating a third scrambling sequence determined by a short sequence group-a wireless communication system uses a plurality of short sequences and the plurality of short sequences are grouped into a plurality of short sequence group-to which the first short sequence is assigned and a fourth scrambling sequence determined by a short sequence group to which the second short sequence is assigned; scrambling the first short sequence with the first scrambling sequence and scrambling the second short sequence with the second scrambling sequence and the third scrambling sequence; scrambling the second short sequence with the first scrambling sequence and scrambling the first short sequence with the second scrambling sequence and the fourth scrambling sequence; and mapping the secondary synchronization signal that includes the first short sequence scrambled with the first scrambling sequence, the second short sequence scrambled with the second scrambling sequence and the third scrambling sequence, the second short sequence scrambled with the first scrambling sequence and the first short sequence scrambled with the second scrambling sequence and the fourth scrambling sequence to a frequency domain.
0012Yet another embodiment of the present invention provides an apparatus for generating a downlink frame including: a sequence generating unit that generates a first short sequence and a second short sequence indicating cell group information, a first scrambling sequence and a second scrambling sequence determined by the primary synchronization signal, and a third scrambling sequence determined by a short sequence group-the wireless communication system uses a plurality of short sequences and the plurality of short sequences are grouped into a plurality of short sequence group-to which the first short sequence is assigned; and a synchronization signal generating unit that scrambles the first short sequence with the first scrambling sequence and scrambles the second short sequence with the second scrambling sequence and the third scrambling sequence, and then generates a secondary synchronization signal including the scrambled first short sequence and the scrambled second short sequence respectively.
0013Yet another embodiment of the present invention provides a method of searching a cell, including: receiving a downlink frame including a primary synchronization signal and a secondary synchronization signal; and estimating cell information by using the primary synchronization signal and the secondary synchronization signal. In this case, in the downlink frame, a first short sequence scrambled with a first scrambling sequence and a second short sequence scrambled with a second scrambling sequence and a third scrambling sequence are alternately disposed on a plurality of sub-carriers, and the first short sequence and the second short sequence indicate cell group information, the first scrambling sequence and the second scrambling sequence are determined by the primary synchronization signal, and the third scrambling sequence is determined by a short sequence group-a wireless communication system uses a plurality of short sequences and the plurality of short sequences are grouped into a plurality of short sequence group-to which the first short sequence is assigned;
0014Still another embodiment of the present invention provides an apparatus for searching a cell, including: a receiving unit that receives a downlink frame including a primary synchronization signal and a secondary synchronization signal; a cell group estimating unit that identifies a cell group information by using the secondary synchronization signal; and a cell estimating unit that identifies a cell in the cell group by using the primary synchronization signal. In this case, in the downlink frame, a first short sequence scrambled with a first scrambling sequence and a second short sequence scrambled with a second scrambling sequence and a third scrambling sequence are alternately disposed on a plurality of sub-carriers, and the first short sequence and the second short sequence indicate cell group information, the first scrambling sequence and the second scrambling sequence are determined by the primary synchronization signal, and the third scrambling sequence is determined by a short sequence group-the wireless communication system uses a plurality of short sequences and the plurality of short sequences are grouped into a plurality of short sequence group-to which the first short sequence is assigned;
0015Still another embodiment of the present invention provides a recording medium that records a program for executing the method of generating the downlink frame. The recording medium records a program including: generating a first short sequence and a second short sequence indicating cell group information; generating a first scrambling sequence and a second scrambling sequence determined by the primary synchronization signal; generating a third scrambling sequence determined by a short sequence group-the wireless communication system uses a plurality of short sequences and the plurality of short sequences are grouped into a plurality of short sequence group-to which the first short sequence is assigned; scrambling the first short sequence with the first scrambling sequence and scrambling the second short sequence with the second scrambling sequence and the third scrambling sequence; and mapping the secondary synchronization signal that includes the scrambled first short sequence and the scrambled second short sequence to a frequency domain.
0016Still another embodiment of the present invention provides a recording medium that records a program for executing the method of generating the downlink frame. The recording medium records a program including: generating a first short sequence and a second short sequence indicating cell group information; generating a first scrambling sequence and a second scrambling sequence determined by the primary synchronization signal; generating a third scrambling sequence determined by a short sequence group-the wireless communication system uses a plurality of short sequences and the plurality of short sequences are grouped into a plurality of short sequence group-to which the first short sequence is assigned and a fourth scrambling sequence determined by a short sequence group to which the second short sequence is assigned; scrambling the first short sequence with the first scrambling sequence and scrambling the second short sequence with the second scrambling sequence and the third scrambling sequence; scrambling the second short sequence with the first scrambling sequence and scrambling the first short sequence with the second scrambling sequence and the fourth scrambling sequence; and mapping the secondary synchronization signal that includes the first short sequence scrambled with the first scrambling sequence, the second short sequence scrambled with the second scrambling sequence and the third scrambling sequence, the second short sequence scrambled with the first scrambling sequence and the first short sequence scrambled with the second scrambling sequence and the fourth scrambling sequence to a frequency domain.
[Advantageous Effects]
0017According to the above-mentioned present invention, interference between sectors can be reduced by scrambling the short sequences due to the scrambling sequences, thereby improving performance for searching cells.
[Brief Description of the Drawings]
0018<ul id="ul0001" list-style="none" compact="compact"><li><figref idref="f0001">FIG. 1</figref> is a diagram illustrating a downlink frame in an OFDM system according to an exemplary embodiment of the present invention.</li><li><figref idref="f0002">FIG. 2</figref> is a diagram illustrating a configuration of a secondary synchronization channel when two sequences are mapped to a frequency domain in a localization form.</li><li><figref idref="f0002">FIG. 3</figref> is a diagram illustrating a configuration of a secondary synchronization channel when two sequences are mapped to a frequency domain in a distribution form.</li><li><figref idref="f0003">FIG. 4</figref> is a block diagram of an apparatus for generating a downlink frame according to the exemplary embodiment of the present invention.</li><li><figref idref="f0003">FIG. 5</figref> is a flowchart illustrating a method of generating a downlink frame according to the exemplary embodiment of the present invention.</li><li><figref idref="f0004">FIG. 6</figref> is a diagram illustrating a first method of generating a secondary synchronization signal according to the exemplary embodiment of the present invention.</li><li><figref idref="f0005">FIG. 7</figref> is a diagram illustrating a second method of generating a secondary synchronization signal according to the exemplary embodiment of the present invention.</li><li><figref idref="f0005">FIG. 8</figref> is a diagram illustrating a third method of generating a secondary synchronization signal according to the exemplary embodiment of the present invention.</li><li><figref idref="f0006">FIG. 9</figref> is a block diagram of an apparatus for searching cells according to an exemplary embodiment of the present invention.</li><li><figref idref="f0006">FIG. 10</figref> is a flowchart illustrating a method of searching a cell according to a first exemplary embodiment of the present invention.</li><li><figref idref="f0007">FIG. 11</figref> is a flowchart illustrating a method of searching a cell according to a second exemplary embodiment of the present invention.</li></ul>
[Best Mode]
0019In 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, all without departing from the scope of the present invention. In addition, parts that are irrelevant to the description of the present invention are omitted in the drawings, to clarify the present invention. Like reference numerals designate like elements throughout the specification.
0020Throughout the 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 term "unit" described in the specification means a unit for processing at least one function and operation, and can be implemented by hardware components or software components and combinations thereof.
0021First, referring to <figref idref="f0001 f0002">FIGS. 1 to 3</figref>, a downlink frame of an OFDM system and a configuration of a synchronization channel according to an exemplary embodiment of the present invention will be described.
0022<figref idref="f0001">FIG. 1</figref> is a diagram illustrating a downlink frame of an OFDM system according to an exemplary embodiment of the present invention. In <figref idref="f0001">FIG. 1</figref>, a horizontal axis represents a time axis and a vertical axis represents a frequency axis or sub-carrier axis.
0023As shown in <figref idref="f0001">FIG. 1</figref>, a downlink frame 110 according to the exemplary embodiment of the present invention has a time duration of 10msec and includes ten sub-frames 120. Each sub-frame 120 has a time duration of 1 msec and includes two slots 130. Each slot 130 includes six or seven OFDM symbols. The length of a cyclic prefix in a case in which one slot includes six symbols is greater than that of a cyclic prefix in a case in which one slot includes seven symbols.
0024As shown in <figref idref="f0001">FIG. 1</figref>, the downlink frame 110 according to the exemplary embodiment of the present invention includes two synchronization durations 140 in total, including synchronization durations 140 in slot No. 0 and slot No. 10, respectively. However, it is not necessarily limited thereto. The downlink frame 110 may include a synchronization duration in any slot, and may include one synchronization duration or three or more synchronization durations. Since the length of the cyclic prefix may be different in each slot, it is preferable that the synchronization duration is located at an end of the slot.
0025Each slot includes a pilot duration.
0026The synchronization duration according to the exemplary embodiment of the present invention includes a primary synchronization channel and a secondary synchronization channel, and the primary synchronization channel and the secondary synchronization channel are disposed so as to be adjacent to each other in view of time. As shown in <figref idref="f0001">FIG. 1</figref>, the primary synchronization channel is located at the end of the slot, and the secondary synchronization channel is located right ahead of the primary synchronization channel.
0027The primary synchronization channel includes a primary synchronization signal having information for identifying symbol synchronization and frequency synchronization, and some information for cell identification(ID). The secondary synchronization channel includes a secondary synchronization signal having remaining information for the cell ID, and information for identifying frame synchronization. A mobile station identifies the cell ID of cell by combining the cell ID information of the primary synchronization channel and the cell ID information of the secondary synchronization channel.
0028For instance, assuming that the total number of cell IDs is 510, if three identification sequences are allocated to the primary synchronization channel to divide all 510 cell IDs into three groups and if 170 sequences are allocated to the secondary synchronization channel (3x170=510), the information on all of the 510 cell IDs can be represented.
0029Another method is that the 510 cell IDs are divided into 170 groups by using 170 secondary synchronization signals that are allocated to the secondary synchronization channel, and information on cell IDs in each cell group can be represented by three primary synchronization signals that are allocated to the primary synchronization channel.
0030Since the secondary synchronization channel includes the information for identifying the frame synchronization as well as information for the cell ID, two secondary synchronization channels included in one frame are different from each other.
0031<figref idref="f0002">FIG. 2</figref> is a diagram illustrating a configuration of a secondary synchronization channel when two short sequences are mapped to a frequency domain in a localization form, and <figref idref="f0002">FIG. 3</figref> is a diagram illustrating a configuration of a secondary synchronization channel when two short sequences are mapped to a frequency domain in a distribution form.
0032Referring to <figref idref="f0002">FIG. 2 to FIG. 3</figref>, a secondary synchronization signal, which is inserted into a secondary synchronization channel, according to an exemplary embodiment of the present invention is formed by combining two short sequences. Cell group information and frame synchronization information are mapped to the two short sequences.
0033As shown in <figref idref="f0002">FIG. 2</figref>, a first short sequence may be locally allocated to sub-carriers, and then the second short sequence may be locally allocated to remaining sub-carriers. In addition, as shown in <figref idref="f0002">FIG. 3</figref>, the first short sequence may be allocated to every even-numbered sub-carriers (n=0, 2, 4, ···, 60), and the second short sequence may be allocated to every odd-numbered sub-carrier (n=1, 3, 5, ···, 61).
0034The short sequence length corresponds to half of the number of sub-carriers allocated to the secondary synchronization channel. That is, the number of short sequence elements that can be generated is up to half of the number of sub-carriers allocated to the secondary synchronization channel. For instance, when the number of sub-carriers allocated to the secondary synchronization channel is 62, the short sequence length corresponds to 31 and the number of short sequence elements that can be generated is up to 31.
0035Since two short sequences are allocated to each secondary synchronization channel, the number of secondary synchronization sequences generated by a combination of two short sequences is 961 (=31x31) at maximum. However, since the information that should be included in the secondary synchronization channel is cell group information and frame boundary information, 170 or 340 (=170x2) secondary synchronization sequences are required. Accordingly, the number 961 is a sufficiently large value in comparison with the number 170 or 340.
0036Next, an apparatus for generating a downlink frame according to an exemplary embodiment of the present invention will be described with reference to <figref idref="f0003">FIG. 4. FIG. 4</figref> is a block diagram of the apparatus for generating the downlink frame according to the exemplary embodiment of the present invention.
0037As shown in <figref idref="f0003">FIG. 4</figref>, the apparatus for generating the downlink frame according to the exemplary embodiment of the present invention includes a sequence generating unit 410, a synchronization signal generating unit 420, a frequency mapping unit 430, and an OFDM transmitting unit 440.
0038The sequence generating unit 410 generates a sequence for acquiring time and frequency synchronization, a cell identification sequence, a plurality of short sequences, and a scrambling sequence for reducing adjacent cell interference, respectively, and transmits them to the synchronization signal generating unit 420.
0039The synchronization signal generating unit 420 generates a primary synchronization signal, a secondary synchronization signal, and a pilot pattern by using sequences received from the sequence generating unit 410.
0040The synchronization signal generating unit 420 generates the primary synchronization signal by using the sequence for acquiring time and frequency synchronization and the cell identification sequence. In addition, the synchronization signal generating unit 420 generates the secondary synchronization signal by using the plurality of short sequences and the scrambling sequences for reducing adjacent cell interference.
0041The synchronization signal generating unit 420 generates the pilot pattern of downlink signals by allocating a unique scrambling sequence allocated to each cell for encoding a common pilot symbol and data symbol of a cellular system to the pilot channel.
0042The frequency mapping unit 430 generates the downlink frame by mapping the primary synchronization signal, the secondary synchronization signal, and the pilot pattern that are generated from the synchronization signal generating unit 420 and frame control information and transmission traffic data that are transmitted from external sources to the time and frequency domains.
0043The OFDM transmitting unit 440 receives the downlink frame from the frequency mapping unit 430 and transmits the downlink frame through given transmission antenna.
0044Referring to <figref idref="f0003 f0004 f0005">FIG. 5 to FIG. 8</figref>, a method of generating a downlink frame according to an exemplary embodiment of the present invention will be described. <figref idref="f0003">FIG. 5</figref> is a flowchart illustrating the method of generating the downlink frame according to the exemplary embodiment of the present invention.
0045As shown in <figref idref="f0003">FIG. 5</figref>, the sequence generating unit 410 generates a plurality of short sequences and a plurality of scrambling sequences for reducing interference of a plurality of adjacent cells and transmits them to the synchronization signal generating unit 420 (S510).
0046The synchronization signal generating unit 420 generates a secondary synchronization signal by using the short sequences and the scrambling sequences for reducing interference of the plurality of adjacent cells received from the sequence generating unit 410 (S520). In the exemplary embodiment of the present invention, it is described that one frame includes two secondary synchronization channels. However, it is not limited thereto.
0047Referring to <figref idref="f0004 f0005">FIG. 6 to FIG. 8</figref>, three different methods of generating a secondary synchronization signal according to an exemplary embodiment of the present invention will be described. <figref idref="f0004">FIG. 6</figref> is a diagram illustrating the first method of generating a secondary synchronization signal according to the exemplary embodiment of the present invention, <figref idref="f0005">FIG. 7</figref> is a diagram illustrating the second method of generating a secondary synchronization signal according to the exemplary embodiment of the present invention, and <figref idref="f0005">FIG. 8</figref> is a diagram illustrating the third method of generating a secondary synchronization signal according to the exemplary embodiment of the present invention.
0048A short sequence (wn) is a binary sequence (or binary code) representing cell group information. That is, the short sequence (wn) is the binary sequence allocated to a cell group number and frame synchronization. Moreover, the length of the short sequence corresponds to half of the number of sub-carriers allocated to the secondary synchronization channel. In the exemplary embodiment of the present invention, it is described that the number of sub-carriers allocated to the secondary synchronization channel is 62. However, it is not limited thereto. Accordingly, the short sequence length according to the exemplary embodiment of the present invention is 31.
0049The first short sequence w0 is allocated to even-numbered sub-carriers of the first secondary synchronization channel and is defined as given in Equation 1. <maths id="math0001" num="(Equation 1)"><math display="block"><mi mathvariant="normal">w</mi><mo></mo><mn mathvariant="normal">0</mn><mo mathvariant="normal">=</mo><mfenced open="[" close="]"><mi mathvariant="normal">w</mi><mo></mo><mn mathvariant="normal">0</mn><mfenced><mn mathvariant="normal">0</mn></mfenced><mo mathvariant="normal">,</mo><mi mathvariant="normal">w</mi><mo></mo><mn mathvariant="normal">0</mn><mfenced><mn mathvariant="normal">1</mn></mfenced><mo mathvariant="normal">,</mo><mo mathvariant="normal">⋯</mo><mo mathvariant="normal">,</mo><mi mathvariant="normal">w</mi><mo></mo><mn mathvariant="normal">0</mn><mfenced><mi mathvariant="normal">k</mi></mfenced><mo mathvariant="normal">,</mo><mo mathvariant="normal">⋯</mo><mo mathvariant="normal">,</mo><mi mathvariant="normal">w</mi><mo></mo><mn mathvariant="normal">0</mn><mfenced><mn mathvariant="normal">30</mn></mfenced></mfenced></math><img file="EP2207300B1_D0001.tif" /></maths>
0050Here, k denotes an index of the even-numbered sub-carriers used for a secondary synchronization channel.
0051The second short sequence w1 is allocated to odd-numbered sub-carriers of the first secondary synchronization channel and is defined as given in Equation 2. <maths id="math0002" num="(Equation 2)"><math display="block"><mi mathvariant="normal">w</mi><mo></mo><mn>1</mn><mo mathvariant="normal">=</mo><mfenced open="[" close="]"><mi mathvariant="normal">w</mi><mo></mo><mn>1</mn><mfenced><mn mathvariant="normal">0</mn></mfenced><mo mathvariant="normal">,</mo><mi mathvariant="normal">w</mi><mo></mo><mn>1</mn><mfenced><mn mathvariant="normal">1</mn></mfenced><mo mathvariant="normal">,</mo><mo>⋯</mo><mo mathvariant="normal">,</mo><mi mathvariant="normal">w</mi><mo></mo><mn>1</mn><mfenced><mi mathvariant="normal">m</mi></mfenced><mo mathvariant="normal">,</mo><mo>⋯</mo><mo mathvariant="normal">,</mo><mi mathvariant="normal">w</mi><mo></mo><mn>1</mn><mfenced><mn mathvariant="normal">30</mn></mfenced></mfenced></math><img file="EP2207300B1_D0002.tif" /></maths>
0052Here, m denotes an index of the odd-numbered sub-carriers used for the secondary synchronization channel.
0053The third short sequence w2 is allocated to even-numbered sub-carriers of the second secondary synchronization channel and is defined as given in Equation 3. <maths id="math0003" num="(Equation 3)"><math display="block"><mi mathvariant="normal">w</mi><mo></mo><mn>2</mn><mo mathvariant="normal">=</mo><mfenced open="[" close="]"><mi mathvariant="normal">w</mi><mo></mo><mn>2</mn><mfenced><mn mathvariant="normal">0</mn></mfenced><mo mathvariant="normal">,</mo><mi mathvariant="normal">w</mi><mo></mo><mn>2</mn><mfenced><mn mathvariant="normal">1</mn></mfenced><mo mathvariant="normal">,</mo><mo>⋯</mo><mo mathvariant="normal">,</mo><mi mathvariant="normal">w</mi><mo></mo><mn>2</mn><mfenced><mi mathvariant="normal">k</mi></mfenced><mo mathvariant="normal">,</mo><mo>⋯</mo><mo mathvariant="normal">,</mo><mi mathvariant="normal">w</mi><mo></mo><mn>2</mn><mfenced><mn mathvariant="normal">30</mn></mfenced></mfenced></math><img file="EP2207300B1_D0003.tif" /></maths>
0054The fourth short sequence w3 is allocated to odd-numbered sub-carriers of the second secondary synchronization channel and is defined as given in Equation 4. <maths id="math0004" num="(Equation 4)"><math display="block"><mi mathvariant="normal">w</mi><mo></mo><mn>3</mn><mo mathvariant="normal">=</mo><mfenced open="[" close="]"><mi mathvariant="normal">w</mi><mo></mo><mn>3</mn><mfenced><mn mathvariant="normal">0</mn></mfenced><mo mathvariant="normal">,</mo><mi mathvariant="normal">w</mi><mo></mo><mn>3</mn><mfenced><mn mathvariant="normal">1</mn></mfenced><mo mathvariant="normal">,</mo><mo>⋯</mo><mo mathvariant="normal">,</mo><mi mathvariant="normal">w</mi><mo></mo><mn>3</mn><mfenced><mi mathvariant="normal">m</mi></mfenced><mo mathvariant="normal">,</mo><mo>⋯</mo><mo mathvariant="normal">,</mo><mi mathvariant="normal">w</mi><mo></mo><mn>3</mn><mfenced><mn mathvariant="normal">30</mn></mfenced></mfenced></math><img file="EP2207300B1_D0004.tif" /></maths>
0055Here, the short sequences w0, w1, w2, and w3 may be different sequences. In addition, the relationship between the short sequences w0, w1, w2, and w3 may be represented as w0 = w3 and w1 = w2 (or w0 = w2 and w1 = w3). Given that w0 = w3 and w1 = w2, then the pattern of short sequences allocated to the second secondary synchronization channel can be determined only through the pattern of short sequences allocated to the first secondary synchronization channel. Accordingly, by storing only 170 secondary synchronization sequences generated by a combination of two short sequences allocated to the first secondary synchronization channel, a mobile station can reduce the complexity needed to obtaining the cell group information and frame boundary information.
0056According to the first method of generating a secondary synchronization signal as shown in <figref idref="f0004">FIG. 6</figref>, the first short sequence is allocated to every even-numbered sub-carrier of the first secondary synchronization channel and the second short sequence is allocated to every odd-numbered sub-carrier of the first secondary synchronization channel. In addition, the third short sequence is allocated to every even-numbered sub-carrier of the second secondary synchronization channel and the fourth short sequence is allocated to every odd-numbered sub-carrier of the second secondary synchronization channel.
0057According to the first method of generating the secondary synchronization signal, the secondary synchronization signal is formed by a combination of two short sequences having the length of 31. Accordingly, the number of secondary synchronization signals is 961 which is a sufficiently large value in comparison with the number 170 or 340.
0058According to the second method of generating the secondary synchronization signal shown in <figref idref="f0005">FIG. 7</figref>, a first sequence determined by Equation 5 is allocated to every even-numbered sub-carrier of the first secondary synchronization channel(slot 0), and a second sequence determined by Equation 6 is allocated to every odd-numbered sub-carrier of the first secondary synchronization channel(slot 0). In addition, a third sequence determined by Equation 7 is allocated to every even-numbered sub-carrier of the second secondary synchronization channel(slot 10), and a fourth sequence determined by Equation 8 is allocated to every odd-numbered sub-carrier of the second secondary synchronization channel(slot 10).
0059A scrambling sequence <b>P</b><sub>j,0,1</sub> scrambling the first short sequence <b>w</b>0 is defined by <b>P</b><sub>j,0,1</sub>= [P<sub>j,0,1</sub>(0), P<sub>j,0,1</sub>(1),···, P<sub>j,0,1</sub>(k), ···, P<sub>j,0,1</sub>(30)], where j (j=0,1, 2) is the number of the cell identification sequence allocated to the primary synchronization channel. Accordingly, the scrambling sequence <b>P</b><sub><b>j,</b>0,1</sub> is determined by the primary synchronization signal. The scrambling sequence <b>P</b><sub>j,0,1</sub> is a known value when a sequence is demapped to find a cell ID group and a frame boundary in the mobile station.
0060As indicated in Equation 5, each element of a first sequence c<sub>0</sub> according to the second method of generating the secondary synchronization signal is a product of each element of the first short sequence <b>w</b>0 and each element of the scrambling sequence <b>P</b><sub>j,0,1</sub> corresponding thereto. <maths id="math0005" num="(Equation 5)"><math display="block"><msub><mi mathvariant="normal">c</mi><mn mathvariant="normal">0</mn></msub><mo mathvariant="normal">=</mo><mfenced open="[" close="]"><mi mathvariant="normal">w</mi><mo></mo><mn mathvariant="normal">0</mn><mfenced><mn mathvariant="normal">0</mn></mfenced><mo></mo><msub><mi mathvariant="normal">P</mi><mrow><mi mathvariant="normal">j</mi><mo mathvariant="normal">,</mo><mn mathvariant="normal">0</mn><mo mathvariant="normal">,</mo><mn mathvariant="normal">1</mn></mrow></msub><mfenced><mn mathvariant="normal">0</mn></mfenced><mo mathvariant="normal">,</mo><mi mathvariant="normal">w</mi><mo></mo><mn mathvariant="normal">0</mn><mfenced><mn mathvariant="normal">1</mn></mfenced><mo></mo><msub><mi mathvariant="normal">P</mi><mrow><mi mathvariant="normal">j</mi><mo mathvariant="normal">,</mo><mn mathvariant="normal">0</mn><mo mathvariant="normal">,</mo><mn mathvariant="normal">1</mn></mrow></msub><mfenced><mn mathvariant="normal">1</mn></mfenced><mo mathvariant="normal">,</mo><mo>⋯</mo><mo mathvariant="normal">,</mo><mi mathvariant="normal">w</mi><mo></mo><mn mathvariant="normal">0</mn><mfenced><mi mathvariant="normal">k</mi></mfenced><mo></mo><msub><mi mathvariant="normal">P</mi><mrow><mi mathvariant="normal">j</mi><mo mathvariant="normal">,</mo><mn mathvariant="normal">0</mn><mo mathvariant="normal">,</mo><mn mathvariant="normal">1</mn></mrow></msub><mfenced><mi mathvariant="normal">k</mi></mfenced><mo mathvariant="normal">,</mo><mo>⋯</mo><mo mathvariant="normal">,</mo><mi mathvariant="normal">w</mi><mo></mo><mn mathvariant="normal">0</mn><mfenced><mn mathvariant="normal">30</mn></mfenced><mo></mo><msub><mi mathvariant="normal">P</mi><mrow><mi mathvariant="normal">j</mi><mo mathvariant="normal">,</mo><mn mathvariant="normal">0</mn><mo mathvariant="normal">,</mo><mn mathvariant="normal">1</mn></mrow></msub><mfenced><mn mathvariant="normal">30</mn></mfenced></mfenced></math><img file="EP2207300B1_D0005.tif" /></maths>
0061Here, k denotes an index of the even-numbered sub-carriers used for the secondary synchronization channel.
0062The scrambling sequence scrambling the second short sequence w1 is <b>P</b><sub>j,1,1</sub> and <b>S</b><sub>w0</sub>.
0063The scrambling sequence <b>P</b><sub>j,1,1</sub> is <b>P</b><sub>j,1,1</sub>=[P<sub>j,1,1</sub>(0), P<sub>j,1,1</sub>(1),···, P<sub>J,1,1</sub>(m), ···, P<sub>j,1,1</sub>(30)], where j (j=0, 1, 2) is the number of the cell identification sequence allocated to the primary synchronization channel. Accordingly, the scrambling sequence <b>P</b><sub>j,1,1</sub> is determined by the primary synchronization signal. In addition, the scrambling sequence <b>P</b><sub>j,1,1</sub> may be the same as the scrambling sequence <b>P</b><sub>j,0,1</sub> or may be different from the scrambling sequence <b>P</b><sub>j,0,1.</sub> When the scrambling sequence <b>P</b><sub>j,1,1</sub> is different from the scrambling sequence <b>P</b><sub>j,0,1</sub>, it can be possible to reduce interference.
0064The scrambling sequence <b>P</b><sub>j,1,1</sub> is a previously known value when a sequence is demapped to find a cell ID group and a frame boundary in the mobile station.
0065In addition, the scrambling sequence <b>S</b><sub>w0</sub> is <b>S</b><sub>w0</sub> =[S<sub>w0</sub>(0), S<sub>w0</sub>(1),···, S<sub>w0</sub>(m), ···, S<sub>w0</sub>(30)], and the scrambling sequence <b>S</b><sub>w0</sub> is determined by the first short sequence <b>w</b>0.
0066At this time, a plurality of short sequences are grouped into a plurality of short sequence group and the <b>S</b><sub>w0</sub> may be determined by a short sequence group to which the first short sequence is assigned by grouping short sequences.
0067For example, according to the exemplary embodiment of the present invention, since the length of the first short sequence is 31, there are 31 short sequences. Accordingly, by assigning the short sequences Nos. 0-7 to the group 0, the short sequences Nos. 8-15 to the group 1, the short sequences Nos. 16-23 to the group 2, and the short sequences Nos. 24-30 to the group 3. Accordingly S<sub>w0</sub> is determined by mapping a length-31 scrambling code to the group to which the first short sequence number is assigned.
0068Furthermore, 31 short sequences may be classified into eight groups by grouping the numbers of the first short sequences having the identical remainder when we divide each number of short sequences by 8. That is, by assigning the short sequence number having the remainder of 0 when dividing the short sequence numbers by 8 to the group 0, the short sequence having the remainder of 1 when dividing the short sequence numbers by 8 to the group 1, the short sequence having the remainder of 2 when dividing the short sequence numbers by 8 to the group 2, the short sequence having the remainder of 3 when dividing the short sequence numbers by 8 to the group 3, the short sequence having the remainder of 4 when dividing the short sequence numbers by 8 to the group 4, the short sequence having the remainder of 5 when dividing the short sequence numbers by 8 to the group 5, the short sequence having the remainder of 6 when dividing the short sequence numbers by 8 to the group 6, and the short sequence having the remainder of 7 when dividing the short sequence numbers by 8 to the group 7. Accordingly S<sub>w0</sub> is determined by mapping a length-31 scrambling code to the group to which the first short sequence number is assigned.
0069As indicated in Equation 6, each element of a second sequence c<sub>1</sub> according to the second method of generating the secondary synchronization signal is a product of each element of the second short sequence w1 and each element of the scrambling sequences P<sub>j,1,1</sub> and S<sub>w0</sub> corresponding thereto. <maths id="math0006" num="(Equation 6)"><math display="block"><msub><mi mathvariant="normal">c</mi><mn mathvariant="normal">1</mn></msub><mo mathvariant="normal">=</mo><mfenced open="[" close="]"><mi mathvariant="normal">w</mi><mo></mo><mn mathvariant="normal">1</mn><mfenced><mn mathvariant="normal">0</mn></mfenced><mo></mo><msub><mi mathvariant="normal">S</mi><mrow><mi mathvariant="normal">w</mi><mo></mo><mn mathvariant="normal">0</mn></mrow></msub><mfenced><mn mathvariant="normal">0</mn></mfenced><mo></mo><msub><mi mathvariant="normal">P</mi><mrow><mi mathvariant="normal">j</mi><mo mathvariant="normal">,</mo><mn mathvariant="normal">1</mn><mo mathvariant="normal">,</mo><mn mathvariant="normal">1</mn></mrow></msub><mfenced><mn mathvariant="normal">0</mn></mfenced><mo mathvariant="normal">,</mo><mi mathvariant="normal">w</mi><mo></mo><mn mathvariant="normal">1</mn><mfenced><mn mathvariant="normal">1</mn></mfenced><mo></mo><msub><mi mathvariant="normal">S</mi><mrow><mi mathvariant="normal">w</mi><mo></mo><mn mathvariant="normal">0</mn></mrow></msub><mfenced><mn>1</mn></mfenced><mo></mo><msub><mi mathvariant="normal">P</mi><mrow><mi mathvariant="normal">j</mi><mo mathvariant="normal">,</mo><mn mathvariant="normal">1</mn><mo mathvariant="normal">,</mo><mn mathvariant="normal">1</mn></mrow></msub><mfenced><mn mathvariant="normal">1</mn></mfenced><mo mathvariant="normal">,</mo><mo mathvariant="normal">⋯</mo><mo mathvariant="normal">,</mo><mi mathvariant="normal">w</mi><mo></mo><mn mathvariant="normal">1</mn><mfenced><mi mathvariant="normal">m</mi></mfenced><mo></mo><msub><mi mathvariant="normal">S</mi><mrow><mi mathvariant="normal">w</mi><mo></mo><mn mathvariant="normal">0</mn></mrow></msub><mfenced><mi mathvariant="normal">m</mi></mfenced><mo></mo><msub><mi mathvariant="normal">P</mi><mrow><mi mathvariant="normal">j</mi><mo mathvariant="normal">,</mo><mn mathvariant="normal">1</mn><mo mathvariant="normal">,</mo><mn mathvariant="normal">1</mn></mrow></msub><mfenced><mi mathvariant="normal">m</mi></mfenced><mo mathvariant="normal">,</mo><mo mathvariant="normal">⋯</mo><mo mathvariant="normal">,</mo><mi mathvariant="normal">w</mi><mo></mo><mn mathvariant="normal">1</mn><mfenced><mn mathvariant="normal">30</mn></mfenced><mo></mo><msub><mi mathvariant="normal">S</mi><mrow><mi mathvariant="normal">w</mi><mo></mo><mn mathvariant="normal">0</mn></mrow></msub><mfenced><mn mathvariant="normal">30</mn></mfenced><mo></mo><msub><mi mathvariant="normal">P</mi><mrow><mi mathvariant="normal">j</mi><mo mathvariant="normal">,</mo><mn mathvariant="normal">1</mn><mo mathvariant="normal">,</mo><mn mathvariant="normal">1</mn></mrow></msub><mfenced><mn mathvariant="normal">30</mn></mfenced></mfenced></math><img file="EP2207300B1_D0006.tif" /></maths>
0070Herein, m denotes the index of odd-numbered sub-carriers used for the secondary synchronization channel.
0071A scrambling sequence <b>P</b><sub>j,0,2</sub> for scrambling a third short sequence <b>w</b>2 is <b>P</b><sub>j,0,2</sub>= [P<sub>j,0,2</sub>(0), P<sub>j,0,2</sub>(0), ···, P<sub>j,0,2</sub>(k) ···, P<sub>j,1,2</sub>(30)], where j (j=0, 1, 2) is the number of the cell identification sequence allocated to the primary synchronization channel. Accordingly, the scrambling sequence <b>P</b><sub>j,0,2</sub> is determined by the primary synchronization signal. In addition, the scrambling sequence <b>P</b><sub>j,0,2</sub> is a previously known value when the sequence is demapped to find the cell ID group and frame boundary in the mobile station.
0072As indicated in Equation 7, each element of a third sequence c<sub>2</sub> according to the second method of generating the secondary synchronization signal is a product of each element of the third short sequence <b>w2</b> and each element of the scrambling sequence <b>P</b><sub>j,0,2</sub> corresponding thereto. <maths id="math0007" num="(Equation 7)"><math display="block"><msub><mi mathvariant="normal">c</mi><mn>2</mn></msub><mo mathvariant="normal">=</mo><mfenced open="[" close="]"><mi mathvariant="normal">w</mi><mo></mo><mn>2</mn><mfenced><mn mathvariant="normal">0</mn></mfenced><mo></mo><msub><mi mathvariant="normal">P</mi><mrow><mi mathvariant="normal">j</mi><mo mathvariant="normal">,</mo><mn mathvariant="normal">0</mn><mo mathvariant="normal">,</mo><mn>2</mn></mrow></msub><mfenced><mn mathvariant="normal">0</mn></mfenced><mo mathvariant="normal">,</mo><mi mathvariant="normal">w</mi><mo></mo><mn>2</mn><mfenced><mn mathvariant="normal">1</mn></mfenced><mo></mo><msub><mi mathvariant="normal">P</mi><mrow><mi mathvariant="normal">j</mi><mo mathvariant="normal">,</mo><mn mathvariant="normal">0</mn><mo mathvariant="normal">,</mo><mn>2</mn></mrow></msub><mfenced><mn mathvariant="normal">1</mn></mfenced><mo mathvariant="normal">,</mo><mo>⋯</mo><mo mathvariant="normal">,</mo><mi mathvariant="normal">w</mi><mo></mo><mn>2</mn><mfenced><mi mathvariant="normal">k</mi></mfenced><mo></mo><msub><mi mathvariant="normal">P</mi><mrow><mi mathvariant="normal">j</mi><mo mathvariant="normal">,</mo><mn mathvariant="normal">0</mn><mo mathvariant="normal">,</mo><mn mathvariant="normal">2</mn></mrow></msub><mfenced><mi mathvariant="normal">k</mi></mfenced><mo mathvariant="normal">,</mo><mo>⋯</mo><mo mathvariant="normal">,</mo><mi mathvariant="normal">w</mi><mo></mo><mn>2</mn><mfenced><mn mathvariant="normal">30</mn></mfenced><mo></mo><msub><mi mathvariant="normal">P</mi><mrow><mi mathvariant="normal">j</mi><mo mathvariant="normal">,</mo><mn mathvariant="normal">0</mn><mo mathvariant="normal">,</mo><mn>2</mn></mrow></msub><mfenced><mn mathvariant="normal">30</mn></mfenced></mfenced></math><img file="EP2207300B1_D0007.tif" /></maths>
0073Herein, k denotes the index of even-numbered sub-carriers used for the secondary synchronization channel.
0074Scrambling sequences for scrambling a fourth short sequence are <b>P</b><sub>j,1,2</sub> and S<sub>w2</sub>.
0075The scrambling sequence <b>P</b><sub>j,1,2</sub> is <b>P</b><sub>j,1,2</sub>=[P<sub>j,1,2</sub>(0), P<sub>j,1,2</sub>(1), ···, P<sub>j,1,2</sub>(m), ···, <b>P</b><sub>j,1,2</sub>(30)], and j (j=0, 1, 2) is the number of the cell identification sequence allocated to the primary synchronization channel. Accordingly, the scrambling sequence <b>P</b><sub>j,1,2</sub> is determined by the primary synchronization signal. The scrambling sequence <b>P</b><sub>j,1,2</sub> is a previously known value when a sequence is demapped to find the cell ID group and frame boundary in the mobile station.
0076Furthermore, the scrambling sequence <b>S</b><sub>w2</sub> is <b>S</b><sub>w2</sub> =[S<sub>w2</sub>(0), S<sub>w2</sub>(1), S<sub>w2</sub>(m), ···, S<sub>w2</sub>(30)], and the scrambling sequence <b>S</b><sub>w2</sub> is determined by the third short sequence <b>w2.</b>
0077At this time, the <b>S</b><sub>w2</sub> may be determined by a short sequence group to which the third short sequence is assigned by grouping short sequences.
0078For example, according to the exemplary embodiment of the present invention, since the length of the third short sequence is 31 as well, there are 31 short sequences. Accordingly, by assigning the short sequences Nos. 0-7 to the group 0, the short sequences Nos. 8-15 to the group 1, the short sequences Nos. 16-23 to the group 2, and the short sequences Nos. 24-30 to the group 3. Accordingly S<sub>w2</sub> is determined by mapping a length-31 scrambling code to the group to which the third short sequence number is assigned.
0079Furthermore, 31 short sequences may be classified into eight groups by grouping the numbers of the third short sequences having the identical remainder when we divide each number of short sequences by 8. That is, by assigning the short sequence number having the remainder of 0 when dividing the short sequence numbers by 8 to the group 0, the short sequence having the remainder of 1 when dividing the short sequence numbers by 8 to the group 1, the short sequence having the remainder of 2 when dividing the short sequence numbers by 8 to the group 2, the short sequence having the remainder of 3 when dividing the short sequence numbers by 8 to the group 3, the short sequence having the remainder of 4 when dividing the short sequence numbers by 8 to the group 4, the short sequence having the remainder of 5 when dividing the short sequence numbers by 8 to the group 5, the short sequence having the remainder of 6 when dividing the short sequence numbers by 8 to the group 6, and the short sequence having the remainder of 7 when dividing the short sequence numbers by 8 to the group 7. Accordingly S<sub>w2</sub> is determined by mapping a length-31 scrambling code to the group to which the third short sequence number is assigned.
0080As indicated in Equation 8, each element of a fourth sequence c<sub>3</sub> according to the second method of generating the secondary synchronization signal is a product of each element of the fourth short sequence <b>w3</b> and each element of the scrambling sequences <b>P</b><sub>j,1,2</sub> and <b>S</b><sub>w2</sub> corresponding thereto. <maths id="math0008" num="(Equation 8)"><math display="block"><msub><mi mathvariant="normal">c</mi><mn>3</mn></msub><mo mathvariant="normal">=</mo><mfenced open="[" close="]"><mi mathvariant="normal">w</mi><mo></mo><mn>3</mn><mfenced><mn mathvariant="normal">0</mn></mfenced><mo></mo><msub><mi mathvariant="normal">S</mi><mrow><mi mathvariant="normal">w</mi><mo></mo><mn>2</mn></mrow></msub><mfenced><mn mathvariant="normal">0</mn></mfenced><mo></mo><msub><mi mathvariant="normal">P</mi><mrow><mi mathvariant="normal">j</mi><mo mathvariant="normal">,</mo><mn mathvariant="normal">1</mn><mo mathvariant="normal">,</mo><mn>2</mn></mrow></msub><mfenced><mn mathvariant="normal">0</mn></mfenced><mo mathvariant="normal">,</mo><mi mathvariant="normal">w</mi><mo></mo><mn>3</mn><mfenced><mn mathvariant="normal">1</mn></mfenced><mo></mo><msub><mi mathvariant="normal">S</mi><mrow><mi mathvariant="normal">w</mi><mo></mo><mn>2</mn></mrow></msub><mfenced><mn>1</mn></mfenced><mo></mo><msub><mi mathvariant="normal">P</mi><mrow><mi mathvariant="normal">j</mi><mo mathvariant="normal">,</mo><mn mathvariant="normal">1</mn><mo mathvariant="normal">,</mo><mn>2</mn></mrow></msub><mfenced><mn mathvariant="normal">1</mn></mfenced><mo mathvariant="normal">,</mo><mo mathvariant="normal">⋯</mo><mo mathvariant="normal">,</mo><mi mathvariant="normal">w</mi><mo></mo><mn>3</mn><mfenced><mi mathvariant="normal">m</mi></mfenced><mo></mo><msub><mi mathvariant="normal">S</mi><mrow><mi mathvariant="normal">w</mi><mo></mo><mn>2</mn></mrow></msub><mfenced><mi mathvariant="normal">m</mi></mfenced><mo></mo><msub><mi mathvariant="normal">P</mi><mrow><mi mathvariant="normal">j</mi><mo mathvariant="normal">,</mo><mn mathvariant="normal">1</mn><mo mathvariant="normal">,</mo><mn>2</mn></mrow></msub><mfenced><mi mathvariant="normal">m</mi></mfenced><mo mathvariant="normal">,</mo><mo mathvariant="normal">⋯</mo><mo mathvariant="normal">,</mo><mi mathvariant="normal">w</mi><mo></mo><mn>3</mn><mfenced><mn mathvariant="normal">30</mn></mfenced><mo></mo><msub><mi mathvariant="normal">S</mi><mrow><mi mathvariant="normal">w</mi><mo></mo><mn>2</mn></mrow></msub><mfenced><mn mathvariant="normal">30</mn></mfenced><mo></mo><msub><mi mathvariant="normal">P</mi><mrow><mi mathvariant="normal">j</mi><mo mathvariant="normal">,</mo><mn mathvariant="normal">1</mn><mo mathvariant="normal">,</mo><mn>2</mn></mrow></msub><mfenced><mn mathvariant="normal">30</mn></mfenced></mfenced></math><img file="EP2207300B1_D0008.tif" /></maths>
0081Herein, m denotes the index of odd-numbered sub-carriers used for the secondary synchronization channel.
0082Here, the relationship between the scrambling sequences and the short sequences may be set as <b>P</b><sub>j,0,1</sub>=<b>P</b><sub>j,0,2</sub>, <b>P</b><sub>j,1,1</sub>=<b>P</b><sub>j,1,2</sub>, <b>P</b><sub>j,0,1</sub> ≠ <b>P</b><sub>j,1,1</sub>, <b>P</b><sub>j,0,2</sub> ≠ <b>P</b><sub>j,1,2</sub>, and <b>w</b>0 ≠ <b>w</b>1 ≠ <b>w</b>2 ≠ <b>w</b>3 (or <b>w</b>0 = <b>w</b>3 and <b>w</b>1 = <b>w</b>2). In this case, the cell group and frame identify information are mapped to the combination of the first to fourth short sequences, and the number of descrambling hypotheses in the mobile station with respect to the scrambling of secondary synchronization channel determined by the cell identification sequence number of the primary synchronization channel is reduced to 3.
0083Furthermore, the relationship between the scrambling sequences and the short sequences may be set as <b>P</b><sub>j,0,1</sub> ≠ <b>P</b><sub>j,0,2</sub>, <b>P</b><sub>j,1,1</sub> ≠ <b>P</b><sub>j,1,2</sub>, <b>P</b><sub>j,0,1</sub> ≠ <b>P</b><sub>j,1,1</sub>, <b>P</b><sub>j,0,2</sub> ≠ <b>P</b><sub>j,1,2</sub>, <b>w</b>0 = <b>w</b>2, and <b>w</b>1 = <b>w</b>3. In this case, the cell group information is mapped to the combination of the first short sequence and the second short sequence, and the frame synchronization information is mapped to the scrambling sequences (<b>P</b><sub>j,0,1</sub>, <b>P</b><sub>j,1,2</sub>, <b>P</b><sub>j,1,1</sub>, <b>P</b><sub>j,1,2</sub>) of the secondary synchronization channel determined by the cell identification sequence number of the primary synchronization channel. Then, the number of descrambling hypotheses of the mobile station with respect to the scrambling of the secondary synchronization channel determined by the cell identification sequence number of the primary synchronization channel is increased to 6. However, the combination number of the cell group identification sequences is reduced to half, and the number of descrambling hypotheses of the mobile station with respect to the scrambling determined by the first and third short sequences is also reduced to half.
0084As shown in <figref idref="f0005">FIG. 8</figref>, in the third method of generating a secondary synchronization signal, a first sequence determined by Equation 9 is allocated to every even-numbered sub-carrier of a first secondary synchronization channel, and a second sequence determined by Equation 10 is allocated to every odd-numbered sub-carrier of the first secondary synchronization channel. Moreover, a third sequence determined by Equation 11 is allocated to every even-numbered sub-carrier of a second secondary synchronization channel, and a fourth sequence determined by Equation 12 is allocated to every odd-numbered sub-carrier of the second secondary synchronization channel.
0085That is, according to the second method of generating the secondary synchronization signal, the first short sequence is scrambled with a first scrambling sequence having the length of 31, which is determined by the cell identification sequence allocated to the primary synchronization channel, and the second short sequence is scrambled with a second scrambling sequence having the length of 31, which is determined by the cell identification sequence allocated to the primary synchronization channel. However, according to the third method of generating the secondary synchronization signal, the first short sequence and the second short sequence are scrambled with a scrambling sequence having the length of 62, which is determined by the cell identification sequence allocated to the primary synchronization channel.
0086<b>P</b><sub>j,1</sub> is the scrambling sequence that scrambles the first short sequence and the second short sequence, and <b>P</b><sub>j,2</sub> is the scrambling sequence that scrambles the third short sequence and the fourth short sequence. The scrambling sequences <b>P</b><sub>j,1</sub> and <b>P</b><sub>j,2</sub> are represented as <b>P</b><sub>j,1,</sub>=[P<sub>j,1,</sub>(0), P<sub>j,1,</sub>(1), ···, <b>P</b><sub>j,1,</sub>(k), ···, P<sub>j,1</sub>(61)], and <b>P</b><sub>j,2</sub>=[P<sub>j,2</sub>(0), P<sub>j,2</sub>(1), ···, P<sub>j,2</sub>(k), ···, P<sub>j,2</sub>(61)].
0087Here, j (j=0, 1, 2) is the number of the cell identification sequence allocated to the primary synchronization channel. Accordingly, the scrambling sequences <b>P</b><sub>j,1</sub> and <b>P</b><sub>j,2</sub> are determined by the number of the cell identification sequence allocated to the primary synchronization channel.
0088According to the third method of generating the secondary synchronization signal, the first sequence c<sub>0</sub> is as indicated in Equation 9, the second sequence <b>c</b><sub>1</sub> is as indicated in Equation 10, the third sequence c<sub>2</sub> is as indicated in Equation 11, and the fourth sequence c<sub>3</sub> is as indicated in Equation 12.<maths id="math0009" num="(Equatiion 9)"><math display="block"><msub><mi mathvariant="normal">c</mi><mn mathvariant="normal">0</mn></msub><mo mathvariant="normal">=</mo><mfenced open="[" close="]"><mi mathvariant="normal">w</mi><mo></mo><mn mathvariant="normal">0</mn><mfenced><mn mathvariant="normal">0</mn></mfenced><mo></mo><msub><mi mathvariant="normal">P</mi><mrow><mi mathvariant="normal">j</mi><mo mathvariant="normal">,</mo><mn mathvariant="normal">1</mn></mrow></msub><mfenced><mn mathvariant="normal">0</mn></mfenced><mo mathvariant="normal">,</mo><mi mathvariant="normal">w</mi><mo></mo><mn mathvariant="normal">0</mn><mfenced><mn mathvariant="normal">1</mn></mfenced><mo></mo><msub><mi mathvariant="normal">P</mi><mrow><mi mathvariant="normal">j</mi><mo mathvariant="normal">,</mo><mn mathvariant="normal">1</mn></mrow></msub><mfenced><mn mathvariant="normal">1</mn></mfenced><mo mathvariant="normal">,</mo><mspace width="1em" /><mn mathvariant="normal">...</mn><mo mathvariant="normal">,</mo><mi mathvariant="normal">w</mi><mo></mo><mn mathvariant="normal">0</mn><mfenced><mi mathvariant="normal">k</mi></mfenced><mo></mo><msub><mi mathvariant="normal">P</mi><mrow><mi mathvariant="normal">j</mi><mo mathvariant="normal">,</mo><mn mathvariant="normal">1</mn></mrow></msub><mfenced><mi mathvariant="normal">k</mi></mfenced><mo mathvariant="normal">,</mo><mn mathvariant="normal">...</mn><mo mathvariant="normal">,</mo><mi mathvariant="normal">w</mi><mo></mo><mn mathvariant="normal">0</mn><mfenced><mn mathvariant="normal">30</mn></mfenced><mo></mo><msub><mi mathvariant="normal">P</mi><mrow><mi mathvariant="normal">j</mi><mo mathvariant="normal">,</mo><mn mathvariant="normal">1</mn></mrow></msub><mfenced><mn mathvariant="normal">30</mn></mfenced></mfenced></math><img file="EP2207300B1_D0009.tif" /></maths><maths id="math0010" num="(Equatiion 10)"><math display="block"><msub><mi mathvariant="normal">c</mi><mn mathvariant="normal">1</mn></msub><mo mathvariant="normal">=</mo><mfenced open="[" close="]"><mi mathvariant="normal">w</mi><mo></mo><mn mathvariant="normal">1</mn><mfenced><mn mathvariant="normal">0</mn></mfenced><mo></mo><msub><mi mathvariant="normal">S</mi><mrow><mi mathvariant="normal">w</mi><mo></mo><mn mathvariant="normal">0</mn></mrow></msub><mfenced><mn mathvariant="normal">0</mn></mfenced><mo></mo><msub><mi mathvariant="normal">P</mi><mrow><mi mathvariant="normal">j</mi><mo mathvariant="normal">,</mo><mn mathvariant="normal">1</mn></mrow></msub><mfenced><mn mathvariant="normal">31</mn></mfenced><mo mathvariant="normal">,</mo><mn mathvariant="normal">...</mn><mo mathvariant="normal">,</mo><mi mathvariant="normal">w</mi><mo></mo><mn mathvariant="normal">1</mn><mfenced><mn mathvariant="normal">1</mn></mfenced><mo></mo><msub><mi mathvariant="normal">S</mi><mrow><mi mathvariant="normal">w</mi><mo></mo><mn mathvariant="normal">0</mn></mrow></msub><mfenced><mn mathvariant="normal">1</mn></mfenced><mo></mo><msub><mi mathvariant="normal">P</mi><mrow><mi mathvariant="normal">j</mi><mo mathvariant="normal">,</mo><mn mathvariant="normal">1</mn></mrow></msub><mfenced><mn mathvariant="normal">32</mn></mfenced><mo mathvariant="normal">,</mo><mi mathvariant="normal">w</mi><mo></mo><mn mathvariant="normal">1</mn><mo></mo><mi mathvariant="normal">m</mi><mo></mo><msub><mi mathvariant="normal">S</mi><mrow><mi mathvariant="normal">w</mi><mo></mo><mn mathvariant="normal">0</mn></mrow></msub><mfenced><mi mathvariant="normal">m</mi></mfenced><mo></mo><msub><mi mathvariant="normal">P</mi><mrow><mi mathvariant="normal">j</mi><mo mathvariant="normal">,</mo><mn mathvariant="normal">1</mn></mrow></msub><mo></mo><mfenced><mn mathvariant="normal">31</mn><mo mathvariant="normal">+</mo><mi mathvariant="normal">m</mi></mfenced><mo mathvariant="normal">,</mo><mn mathvariant="normal">...</mn><mo mathvariant="normal">,</mo><mi mathvariant="normal">w</mi><mo></mo><mn mathvariant="normal">1</mn><mfenced><mn mathvariant="normal">30</mn></mfenced><mo></mo><msub><mi mathvariant="normal">S</mi><mrow><mi mathvariant="normal">w</mi><mo></mo><mn mathvariant="normal">0</mn></mrow></msub><mfenced><mn mathvariant="normal">30</mn></mfenced><mo></mo><msub><mi mathvariant="normal">P</mi><mrow><mi mathvariant="normal">j</mi><mo mathvariant="normal">,</mo><mn mathvariant="normal">1</mn></mrow></msub><mfenced><mn mathvariant="normal">61</mn></mfenced></mfenced></math><img file="EP2207300B1_D0010.tif" /></maths><maths id="math0011" num="(Equation 11)"><math display="block"><msub><mi mathvariant="normal">c</mi><mn>2</mn></msub><mo mathvariant="normal">=</mo><mfenced open="[" close="]"><mi mathvariant="normal">w</mi><mo></mo><mn>2</mn><mfenced><mn mathvariant="normal">0</mn></mfenced><mo></mo><msub><mi mathvariant="normal">P</mi><mrow><mi mathvariant="normal">j</mi><mo mathvariant="normal">,</mo><mn>2</mn></mrow></msub><mfenced><mn mathvariant="normal">0</mn></mfenced><mo mathvariant="normal">,</mo><mi mathvariant="normal">w</mi><mo></mo><mn>2</mn><mfenced><mn mathvariant="normal">1</mn></mfenced><mo></mo><msub><mi mathvariant="normal">P</mi><mrow><mi mathvariant="normal">j</mi><mo mathvariant="normal">,</mo><mn>2</mn></mrow></msub><mfenced><mn mathvariant="normal">1</mn></mfenced><mo mathvariant="normal">,</mo><mo>⋯</mo><mo mathvariant="normal">,</mo><mi mathvariant="normal">w</mi><mo></mo><mn>2</mn><mfenced><mi mathvariant="normal">k</mi></mfenced><mo></mo><msub><mi mathvariant="normal">P</mi><mrow><mi mathvariant="normal">j</mi><mo mathvariant="normal">,</mo><mn mathvariant="normal">2</mn></mrow></msub><mfenced><mi mathvariant="normal">k</mi></mfenced><mo mathvariant="normal">,</mo><mo>⋯</mo><mo mathvariant="normal">,</mo><mi mathvariant="normal">w</mi><mo></mo><mn>2</mn><mfenced><mn mathvariant="normal">30</mn></mfenced><mo></mo><msub><mi mathvariant="normal">P</mi><mrow><mi mathvariant="normal">j</mi><mo mathvariant="normal">,</mo><mn>2</mn></mrow></msub><mfenced><mn mathvariant="normal">30</mn></mfenced></mfenced></math><img file="EP2207300B1_D0011.tif" /></maths><maths id="math0012" num="(Equation 12)"><math display="block"><msub><mi mathvariant="normal">c</mi><mn>3</mn></msub><mo mathvariant="normal">=</mo><mfenced open="[" close="]"><mi mathvariant="normal">w</mi><mo></mo><mn>3</mn><mfenced><mn mathvariant="normal">0</mn></mfenced><mo></mo><msub><mi mathvariant="normal">S</mi><mrow><mi mathvariant="normal">w</mi><mo></mo><mn>2</mn></mrow></msub><mfenced><mn mathvariant="normal">0</mn></mfenced><mo></mo><msub><mi mathvariant="normal">P</mi><mrow><mi mathvariant="normal">j</mi><mo mathvariant="normal">,</mo><mn>2</mn></mrow></msub><mfenced><mn>31</mn></mfenced><mo mathvariant="normal">,</mo><mi mathvariant="normal">w</mi><mo></mo><mn>3</mn><mfenced><mn mathvariant="normal">1</mn></mfenced><mo></mo><msub><mi mathvariant="normal">S</mi><mrow><mi mathvariant="normal">w</mi><mo></mo><mn>2</mn></mrow></msub><mfenced><mn>1</mn></mfenced><mo></mo><msub><mi mathvariant="normal">P</mi><mrow><mi mathvariant="normal">j</mi><mo mathvariant="normal">,</mo><mn>2</mn></mrow></msub><mfenced><mn>32</mn></mfenced><mo mathvariant="normal">,</mo><mo mathvariant="normal">⋯</mo><mo mathvariant="normal">,</mo><mi mathvariant="normal">w</mi><mo></mo><mn>3</mn><mfenced><mi mathvariant="normal">m</mi></mfenced><mo></mo><msub><mi mathvariant="normal">S</mi><mrow><mi mathvariant="normal">w</mi><mo></mo><mn>2</mn></mrow></msub><mfenced><mi mathvariant="normal">m</mi></mfenced><mo></mo><msub><mi mathvariant="normal">P</mi><mrow><mi mathvariant="normal">j</mi><mo mathvariant="normal">,</mo><mn>2</mn></mrow></msub><mo></mo><mfenced><mn>31</mn><mo>+</mo><mi mathvariant="normal">m</mi></mfenced><mo mathvariant="normal">,</mo><mo mathvariant="normal">⋯</mo><mo mathvariant="normal">,</mo><mi mathvariant="normal">w</mi><mo></mo><mn>3</mn><mfenced><mn mathvariant="normal">30</mn></mfenced><mo></mo><msub><mi mathvariant="normal">S</mi><mrow><mi mathvariant="normal">w</mi><mo></mo><mn>2</mn></mrow></msub><mfenced><mn mathvariant="normal">30</mn></mfenced><mo></mo><msub><mi mathvariant="normal">P</mi><mrow><mi mathvariant="normal">j</mi><mo mathvariant="normal">,</mo><mn>2</mn></mrow></msub><mfenced><mn>61</mn></mfenced></mfenced></math><img file="EP2207300B1_D0012.tif" /></maths>
0089In Equation 9 to Equation 12, k denotes the index of the even-numbered sub-carriers to be used for the secondary synchronization channel, and m denotes the index of the odd-numbered sub-carriers to be used for the secondary synchronization channel.
0090The frequency mapping unit 430 generates the downlink frame by mapping the secondary synchronization signal that are generated from the synchronization signal generating unit 420, and transmission traffic data to the time and frequency domains S530.
0091The OFDM transmitting unit 440 receives the downlink frame from the frequency mapping unit 430 and transmits the downlink frame through given transmission antenna S540.
0092A method of searching cells by the mobile station by using the downlink frame generated by the exemplary embodiment of the present invention will now be described with reference to <figref idref="f0006">FIG. 9</figref> and <figref idref="f0007">FIG. 11</figref>.
0093<figref idref="f0006">FIG. 9</figref> is a block diagram of an apparatus for searching cells according to the exemplary embodiment of the present invention, <figref idref="f0006">FIG. 10</figref> is a flowchart illustrating a cell searching method according to a first exemplary embodiment of the present invention, and <figref idref="f0007">FIG. 11</figref> is a flowchart illustrating a cell searching method according to a second exemplary embodiment of the present invention.
0094As shown in <figref idref="f0006">FIG. 9</figref>, the apparatus for searching the cells according to the exemplary embodiment of the present invention includes a receiving unit 710, a symbol synchronization estimating and frequency offset compensating unit 720, a Fourier transforming unit 730, and a cell ID estimating unit 740.
0095A cell searching method according to the first exemplary embodiment of the present invention will now be described with reference to <figref idref="f0006">FIG. 10</figref>.
0096As shown in <figref idref="f0006">FIG. 10</figref>, the receiving unit 710 receives the frames transmitted from the base station, and the symbol synchronization estimating and frequency offset compensating unit 720 filters the received signal by as much as a bandwidth allocated to the synchronization channel and acquires the symbol synchronization by respectively correlating the filtered received signal and a plurality of known primary synchronization signals, and compensates the frequency offset by estimating frequency synchronization (S810). The symbol synchronization estimating and frequency offset compensating unit 720 respectively correlates the filtered received signal and the plurality of known primary synchronization signals and estimates a time of the largest correlation value as the symbol synchronization, and transmits a number of a primary synchronization signal having the largest correlation value to the cell ID estimating unit 740. At this time, the frequency offset may be compensated in the frequency domain after performing the Fourier transform.
0097The Fourier transforming unit 730 performs Fourier transform of the received signals on the basis of the symbol synchronization estimated by the symbol synchronization estimating and frequency offset compensating unit 720 (S820).
0098The cell ID estimating unit 740 estimates a cell ID group and frame synchronization by respectively correlating the Fourier transformed received signal with a plurality of known secondary synchronization signals S830. The cell ID estimating unit 740 respectively correlates a plurality of secondary synchronization signals with the Fourier transformed received signal, and estimates the frame synchronization and the cell ID group by using a secondary synchronization signal that has the largest correlation value. Herein, the plurality of secondary synchronization signals are given by applying P<sub>j,0,1</sub>, P<sub>j,1,2</sub>, P<sub>j,1,1</sub> and P<sub>j,1,2</sub> that are determined in accordance with a primary synchronization signal that corresponds to the number of a primary synchronization signal transmitted from the symbol synchronization estimating and frequency offset compensating unit 720 to Equation 5 to Equation 8, At this time, in the case that a synchronization channel symbol exists in one slot or one OFDM symbol within one frame, the symbol synchronization becomes frame synchronization, and therefore, it is not necessary to additionally acquire frame synchronization.
0099In addition, the cell ID estimating unit 740 estimates cell IDs by using the number of a primary synchronization signal transmitted from the symbol synchronization estimating and frequency offset compensating unit 720 and the estimated cell ID group S840. At this time, the cell ID estimating unit 740 estimates the cell ID with reference to a known mapping relationship between cell ID, the cell ID group, and a number of primary synchronization signal.
0100The estimated cell ID information may be verified by using scrambling sequence information included in the pilot symbol duration.
0101A cell searching method according to the second exemplary embodiment of the present invention will now be described with reference to <figref idref="f0007">FIG. 11</figref>.
0102As shown in <figref idref="f0007">FIG. 11</figref>, the receiving unit 710 receives a frame transmitted from the base station, and the symbol synchronization estimating and frequency offset compensating unit 720 filters the received signal by as much as a bandwidth allocated to the synchronization channel and acquires the symbol synchronization by respectively correlating the filtered received signal and a plurality of known primary synchronization signals, and compensates the frequency offset by estimating frequency synchronization S910. The symbol synchronization estimating and frequency offset compensating unit 720 respectively correlates the filtered received signal and the plurality of known primary synchronization signals and estimates a time of the largest correlation value as the symbol synchronization, and transmits a plurality of correlation values of the plurality of known primary synchronization signals and filtered received signal to the cell ID estimating unit 740. At this time, the frequency offset compensation may be performed in the frequency domain after Fourier-transformed.
0103The Fourier transforming unit 730 Fourier-transforms the received signal with reference to the symbol synchronization that is estimated by the symbol synchronization estimating and frequency offset compensating unit 720 S920.
0104The cell ID estimating unit 740 estimates cell IDs by using the plurality of correlation values transmitted from the symbol synchronization estimating and frequency offset compensating unit 720, and correlation values of the Fourier-transformed received signal and a plurality of known secondary synchronization signals S930. The cell ID estimating unit searches a secondary synchronization signal having the largest correlation value by correlating each of the plurality of known secondary synchronization signals with the Fourier-transformed received signal for each of the plurality of known primary synchronization signals. Here, the plurality of secondary synchronization signals are given by applying P<sub>j,0,1</sub>, P<sub>j,0,2</sub>, P<sub>j,1,1</sub> and P<sub>j,1,2</sub> that are determined in accordance with the corresponding primary synchronization signal to Equation 5 to Equation 8.
0105In addition, the cell ID estimating unit 740 combines the correlation value of each known primary synchronization signal transmitted from the symbol synchronization estimating and frequency offset compensating unit 720 and the correlation value of the secondary synchronization signal having the largest correlation value for each of the plurality of known primary synchronization signals.
0106The cell ID estimating unit 740 estimates frame synchronization and a cell ID group by using a secondary synchronization signal having the largest combined value among the combined values of the correlation values of a primary synchronization signal and a secondary synchronization signal. In addition, the cell ID estimating unit 740 estimates a cell ID by using the primary synchronization signal having the largest combined value and the estimated cell ID group. At this time, the cell ID estimating unit 740 estimates the cell ID with reference to a known mapping relationship between the cell ID group, cell ID and the primary synchronization signal number.
0107The exemplary embodiment of the present invention can be not only implemented by 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 will be easily implemented from the above-described exemplary embodiment of the present invention by those skilled in the related art.
0108While this invention has been described in connection with what is presently considered to be practical exemplary embodiments, it is to be understood that the invention is not limited to the disclosed embodiments, but, on the contrary, is intended to cover various modifications and equivalent arrangements included within the scope of the appended claims.
19 sheets
Sheet 1 Sheet 2 Sheet 3 Sheet 4 Sheet 5 Sheet 6 Sheet 7 Sheet 8 Sheet 9 Sheet 10 Sheet 11 Sheet 12 Sheet 13 Sheet 14 Sheet 15 Sheet 16 Sheet 17 Sheet 18 Sheet 19
Every citation, both ways
| Document | Relation | Office |
|---|---|---|
| WO2007055526A1 | Cites | World Intellectual Property Organization (WIPO) |
| WO2007073116A1 | Cites | World Intellectual Property Organization (WIPO) |
| ZTE: "Scrambling Method for S-SCH", 3GPP DRAFT; R1-072910-SCRAMBLING METHOD FOR S-SCH, 3RD GENERATION PARTNERSHIP PROJECT (3GPP), MOBILE COMPETENCE CENTRE ; 650, ROUTE DES LUCIOLES ; F-06921 SOPHIA-ANTIPOLIS CEDEX ; FRANCE, vol. RAN WG1, no. Orlando, USA; 20070620, 20 June 2007 (2007-06-20), XP050106587, | Non-patent | – |
| MOTOROLA: "Scrambling Method for Two S-SCH Short Code", 3GPP DRAFT; R1-072661_SSC_SCRAMBLING_METHOD, 3RD GENERATION PARTNERSHIP PROJECT (3GPP), MOBILE COMPETENCE CENTRE ; 650, ROUTE DES LUCIOLES ; F-06921 SOPHIA-ANTIPOLIS CEDEX ; FRANCE, vol. RAN WG1, no. Orlando, USA; 20070620, 20 June 2007 (2007-06-20), XP050106359, | Non-patent | – |
| ETRI: "S-SCH Scrambling Methods", 3GPP DRAFT; R1-074053 S-SCH SCRAMBLING, 3RD GENERATION PARTNERSHIP PROJECT (3GPP), MOBILE COMPETENCE CENTRE ; 650, ROUTE DES LUCIOLES ; F-06921 SOPHIA-ANTIPOLIS CEDEX ; FRANCE, vol. RAN WG1, no. Shanghai, China; 20071002, 2 October 2007 (2007-10-02), XP050107595, | Non-patent | – |
| ETRI: "Comparison of S-SCH mapping methods", 3GPP DRAFT; R1-074052 S-SCH MAPPING, 3RD GENERATION PARTNERSHIP PROJECT (3GPP), MOBILE COMPETENCE CENTRE ; 650, ROUTE DES LUCIOLES ; F-06921 SOPHIA-ANTIPOLIS CEDEX ; FRANCE, vol. RAN WG1, no. Shanghai, China; 20071002, 2 October 2007 (2007-10-02), XP050107594, | Non-patent | – |
| MARVELL SEMICONDUCTOR: "SSCH Mapping to Group ID and Frame Timing", 3GPP DRAFT; R1-074485 SSCH MAPPING TO GROUP ID AND FRAME TIMING, 3RD GENERATION PARTNERSHIP PROJECT (3GPP), MOBILE COMPETENCE CENTRE ; 650, ROUTE DES LUCIOLES ; F-06921 SOPHIA-ANTIPOLIS CEDEX ; FRANCE, vol. RAN WG1, no. Shanghai, China; 20071015, 15 October 2007 (2007-10-15), XP050107988, | Non-patent | – |
| NTT DOCOMO ET AL: "S-SCH Structure for E-UTRA Downlink", 3GPP DRAFT; R1-072598 S-SCH STRUCTURE, 3RD GENERATION PARTNERSHIP PROJECT (3GPP), MOBILE COMPETENCE CENTRE ; 650, ROUTE DES LUCIOLES ; F-06921 SOPHIA-ANTIPOLIS CEDEX ; FRANCE, vol. RAN WG1, no. Kobe, Japan; 20070514, 14 May 2007 (2007-05-14), XP050106295, | Non-patent | – |
84 members in 11 offices
Members84
| Document | Office | Kind | |
|---|---|---|---|
| KR20090009693A | Republic of Korea | A | |
| KR20090009694A | Republic of Korea | A | |
| KR20090009696A | Republic of Korea | A | |
| KR20090009703A | Republic of Korea | A | |
| KR20090009704A | Republic of Korea | A | |
| KR20090009705A | Republic of Korea | A | |
| AU2008279971A1 | Australia | A1 | |
| AU2008279972A1 | Australia | A1 | |
| AU2008279973A1 | Australia | A1 | |
| WO2009014354A1 | World Intellectual Property Organization (WIPO) | A1 | |
| WO2009014355A1 | World Intellectual Property Organization (WIPO) | A1 | |
| WO2009014356A1 | World Intellectual Property Organization (WIPO) | A1 | |
| KR100912512B1 | Republic of Korea | B1 | |
| KR100912513B1 | Republic of Korea | B1 | |
| KR100918501B1 | Republic of Korea | B1 | |
| US2009252334A1 | United States of America | A1 | |
| US2009252335A1 | United States of America | A1 | |
| US2009252336A1 | United States of America | A1 | |
| CN101578808A | China | A | |
| CN101578809A | China | A | |
| CN101578810A | China | A | |
| EP2127188A1 | European Patent Office (EPO) | A1 | |
| EP2127189A1 | European Patent Office (EPO) | A1 | |
| EP2137872A1 | European Patent Office (EPO) | A1 | |
| EP2137872A4 | European Patent Office (EPO) | A4 | |
| EP2127188A4 | European Patent Office (EPO) | A4 | |
| EP2127189A4 | European Patent Office (EPO) | A4 | |
| EP2207300A2 | European Patent Office (EPO) | A2 | |
| JP2010534425A | Japan | A | |
| JP2010534426A | Japan | A | |
| JP2010534427A | Japan | A | |
| EP2137872B1 | European Patent Office (EPO) | B1 | |
| AT488067T | Austria | T | |
| ATE488067T1 | Austria | T1 | |
| EP2127188B1 | European Patent Office (EPO) | B1 | |
| EP2127189B1 | European Patent Office (EPO) | B1 | |
| EP2207300A3 | European Patent Office (EPO) | A3 | |
| AT490616T | Austria | T | |
| AT490617T | Austria | T | |
| ATE490616T1 | Austria | T1 | |
| ATE490617T1 | Austria | T1 | |
| DE602008003424D1 | Germany | D1 | |
| DE602008003767D1 | Germany | D1 | |
| DE602008003768D1 | Germany | D1 | |
| AU2008279971B2 | Australia | B2 | |
| ES2356030T3 | Spain | T3 | |
| ES2357002T3 | Spain | T3 | |
| ES2357181T3 | Spain | T3 | |
| AU2008279972B2 | Australia | B2 | |
| AU2008279973B2 | Australia | B2 | |
| EP2207300B1This record | European Patent Office (EPO) | B1 | |
| AT539513T | Austria | T | |
| ATE539513T1 | Austria | T1 | |
| ES2380065T3 | Spain | T3 | |
| US8320565B2 | United States of America | B2 | |
| US8320571B2 | United States of America | B2 | |
| US8331564B2 | United States of America | B2 | |
| JP5140727B2 | Japan | B2 | |
| JP5140728B2 | Japan | B2 | |
| US2013100902A1 | United States of America | A1 | |
| JP2013102510A | Japan | A | |
| CN101578810B | China | B | |
| CN101578808B | China | B | |
| CN101578809B | China | B | |
| JP5232859B2 | Japan | B2 | |
| BRPI0809496A2 | Brazil | A2 | |
| BRPI0810397A2 | Brazil | A2 | |
| JP5676660B2 | Japan | B2 | |
| US2015230219A1 | United States of America | A1 | |
| US9144064B2 | United States of America | B2 | |
| BRPI0810700A2 | Brazil | A2 | |
| US9204438B2 | United States of America | B2 | |
| US2016066260A1 | United States of America | A1 | |
| US9888435B2 | United States of America | B2 | |
| US2018160366A1 | United States of America | A1 | |
| US10383041B2 | United States of America | B2 | |
| US2019357127A1 | United States of America | A1 | |
| BRPI0810700B1 | Brazil | B1 | |
| US11425633B2 | United States of America | B2 | |
| US2022407594A1 | United States of America | A1 | |
| US11870546B2 | United States of America | B2 | |
| US2024146409A1 | United States of America | A1 | |
| US12316438B2 | United States of America | B2 | |
| US2025286620A1 | United States of America | A1 |
79 legal events, as 9 offices reported them to INPADOC
Over the term
Point at a mark for the eventEvents
| Event | Code | Office | |
|---|---|---|---|
| Annual fee paid to national office [announced via postgrant information from national office to epo]GrantedPGFP | PGFP | EP | |
| Annual fee paid to national office [announced via postgrant information from national office to epo]GrantedPGFP | PGFP | EP | |
| Annual fee paid to national office [announced via postgrant information from national office to epo]GrantedPGFP | PGFP | EP | |
| Annual fee paid to national office [announced via postgrant information from national office to epo]GrantedPGFP | PGFP | EP | |
| Annual fee paid to national office [announced via postgrant information from national office to epo]GrantedPGFP | PGFP | EP | |
| Annual fee paid to national office [announced via postgrant information from national office to epo]GrantedPGFP | PGFP | EP | |
| Annual fee paid to national office [announced via postgrant information from national office to epo]GrantedPGFP | PGFP | EP | |
| Opt-out of the competence of the unified patent court (upc) registeredP01 | P01 | EP | |
| Fee paymentPLFP | PLFP | FR | |
| Fee paymentPLFP | PLFP | FR | |
| Fee paymentPLFP | PLFP | FR | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Patent lapsedLapsedMM4A | MM4A | IE | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Patent ceasedCeasedPL | PL | CH | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| No opposition filed against granted patent, or epo opposition proceedings concluded without decisionGrantedR097 | R097 | DE | |
| No opposition filedOpposition26N | 26N | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| No opposition filed within time limitOppositionORIGINAL CODE: 0009261PLBE | PLBE | EP | |
| Information on the status of an ep patent application or granted ep patentGrantedSTATUS: NO OPPOSITION FILED WITHIN TIME LIMITSTAA | STAA | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Deletion acc. to par. 5 (withdrawal of the translation of the ep patent)MK05 | MK05 | AT | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lt: invalidation of european patent or patent extensionLTIE | LTIE | EP | |
| Definitive protectionFG2A | FG2A | ES | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Dpma publication of mentioned ep patent grantGrantedR096 | R096 | DE | |
| Translation filed for an european patent granted for nl, confirming art. 52 par. 1 or 6 of the patents act 1995GrantedT3 | T3 | NL | |
| European patents granted designating irelandGrantedFG4D | FG4D | IE | |
| Reference to at number (ep patent validated in austria)REF | REF | AT | |
| European patent takes effect as a national patent in ch/liEP | EP | CH | |
| Divisional application: reference to earlier applicationAC | AC | EP | |
| Designated contracting statesAK | AK | EP | |
| European patent grantedGrantedFG4D | FG4D | GB | |
| (expected) grantORIGINAL CODE: 0009210GRAA | GRAA | EP | |
| Grant fee paidORIGINAL CODE: EPIDOSNIGR3GRAS | GRAS | EP | |
| Information on inventor provided before grant (corrected)RIN1 | RIN1 | EP | |
| Information on inventor provided before grant (corrected)RIN1 | RIN1 | EP | |
| Information on inventor provided before grant (corrected)RIN1 | RIN1 | EP | |
| Information on inventor provided before grant (corrected)RIN1 | RIN1 | EP | |
| Information on inventor provided before grant (corrected)RIN1 | RIN1 | EP | |
| Information on inventor provided before grant (corrected)RIN1 | RIN1 | EP | |
| Information on inventor provided before grant (corrected)RIN1 | RIN1 | EP | |
| Information on inventor provided before grant (corrected)RIN1 | RIN1 | EP | |
| Information provided on ipc code assigned before grantRIC1 | RIC1 | EP | |
| Information provided on ipc code assigned before grantRIC1 | RIC1 | EP | |
| Information provided on ipc code assigned before grantRIC1 | RIC1 | EP | |
| Information provided on ipc code assigned before grantRIC1 | RIC1 | EP | |
| Information provided on ipc code assigned before grantRIC1 | RIC1 | EP | |
| Despatch of communication of intention to grant a patentORIGINAL CODE: EPIDOSNIGR1GRAP | GRAP | EP | |
| Request for examination filed17P | 17P | EP | |
| Designated contracting statesAK | AK | EP | |
| Search report despatchedORIGINAL CODE: 0009013PUAL | PUAL | EP | |
| Divisional application: reference to earlier applicationAC | AC | EP | |
| Designated contracting statesAK | AK | EP | |
| Public reference made under article 153(3) epc to a published international application that has entered the european phaseORIGINAL CODE: 0009012PUAI | PUAI | EP |
Numbers
- Publication
- 2207300
- Application
- 101602712
Titles3
- German
- Verfahren zur Erzeugung eines Downlink-Rahmens und Verfahren zur Zellensuche
- English
- Method for generating downlink frame, and method for searching cell
- French
- Procédé de génération de trame descendante et procédé de recherche de cellule
Classification
- CPC, 13
- H04J11/0069
- H04B7/2656
- H04L7/02
- H04L27/2613
- H04L27/2655
- H04W48/16
- H04W72/0446
- H04W72/23
- H04B1/70735
- H04W88/08
- H04W56/00
- H04L27/26
- H04L7/043
- IPC, 6
- H04L7 04
- H04L27 26
- H04L7 02
- H04B1 707
- H04J13 00
- H04J13 10
Designated states34
- Contracting states, 34
- Austria
- Belgium
- Bulgaria
- Switzerland
- Cyprus
- Czechia
- Germany
- Denmark
- Estonia
- Spain
- Finland
- France
- United Kingdom
- Greece
- Croatia
- Hungary
- Ireland
- Iceland
- Italy
- Liechtenstein
- Lithuania
- Luxembourg
- Latvia
- Monaco
and 10 moreShow fewer
- Malta
- Netherlands (Kingdom of the)
- Norway
- Poland
- Portugal
- Romania
- Sweden
- Slovenia
- Slovakia
- Türkiye
