Patent Grant
RE49665
(a) Field
The present invention relates to a downlink frame generation method and a cell search method, and particularly relates to a method for generating a downlink frame and a method for searching for a cell by using the downlink frame in an orthogonal frequency division multiplexing (OFDM)-based cellular system.
(b) Description of the Related Art
In a direct sequence code division multiple access (DS-CDMA) system, the code hopping method is applied to a pilot channel in order to acquire cell synchronization and appropriate cell identification information. The code hopping method introduces a code hopping technique to the pilot channel so that a terminal may easily search for the cell without an additional synchronization channel. However, since the number of channels that are distinguishable by the frequency domain in the symbol interval is much greater than the number of channels that are distinguishable by the CDMA spread in one time domain symbol interval in the OFDM system, the usage of the time domain may waste resources with respect to capacity, and hence it is difficult to apply the code hopping method to the pilot channel time domain of the OFDM-based system. Therefore, it is desirable in the OFDM case to search for cells by efficiently using the received signals in the time domain and the frequency domain.
A conventional technique for searching for cells in the OFDM system includes divide a frame into four time blocks and allocating synchronization information and cell information. The technique proposes two frame structures. The first frame structure allocates synchronization recognition information, cell group recognition information, appropriate cell recognition information, and synchronization recognition information to four time blocks. The second frame structure allocates synchronization recognition information and appropriate cell recognition information to the first time block and the third time block, and synchronization recognition information and cell group recognition information to the second time block and the fourth time block.
In the case of following the first scheme, since symbol synchronization is acquired in the first time block, it is impossible to acquire fast synchronization within the standard of 5 ms when a terminal is turned on or in the case of a handover between heterogeneous networks. Also, it is difficult to acquire a diversity gain through accumulation of synchronization recognition information for fast synchronization acquisition.
In the case of following the second scheme, the cell search process is complicated and it is difficult to search for the cells quickly since it is required to acquire synchronization and simultaneously correlate appropriate cell recognition information or cell group recognition information so as to acquire frame synchronization.
Another method for searching for cells using an additional preamble to acquire synchronization and search for the cells has been proposed, but it is inapplicable to a system having no preamble. Further, since the preamble is disposed at the front part of the frame, the terminal must stand by for the next frame when attempting to acquire synchronization at a time position other than the first time position of the frame. Particularly, when the terminal performs a handover among the GSM mode, the WCDMA mode, and the 3GPP LTE mode, it must acquire the initial symbol synchronization within 5 msec, but the initial symbol synchronization may not be acquired within 5 msec since the synchronization can be acquired for each frame.
The present invention has been made in an effort to provide a downlink frame generating method for averaging interference between sectors, and an efficient cell searching method by receiving the downlink frame.
An exemplary embodiment of the present invention provides a method for generating a downlink frame including a first synchronization signal and a second synchronization signal, including: generating a first short sequence and a second short sequence indicating cell group information; generating a first scrambling sequence determined by the first synchronization signal; generating a second scrambling sequence determined by the first short sequence; scrambling the first short sequence with the first scrambling sequence, and scrambling the second short sequence with at least second scrambling sequence; and mapping a second synchronization signal including the scrambled first short sequence and the scrambled second short sequence in the frequency domain.
Another embodiment of the present invention provides a device for generating a downlink frame including a first synchronization signal and a second synchronization signal, including: a sequence generator for generating a first short sequence and a second short sequence indicating cell group information, a first scrambling sequence determined by the first synchronization signal, and a second scrambling sequence determined by the first short sequence; and a synchronization signal generator for scrambling the first short sequence with the first scrambling sequence, scrambling the second short sequence with at least the second scrambling sequence, and generating a second synchronization signal including the scrambled first short sequence and the scrambled second short sequence.
Yet another embodiment of the present invention provides a recording medium for recording a program for performing a method of generating a downlink frame including a first synchronization signal and a second synchronization signal, wherein the method includes: generating a first short sequence and a second short sequence indicating cell group information; generating a first scrambling sequence determined by the first synchronization signal; generating a second scrambling sequence determined by the first short sequence; scrambling the first short sequence with the first scrambling sequence, and scrambling the second short sequence with at least the second scrambling sequence; and mapping a second synchronization signal including the scrambled first short sequence and the scrambled second short sequence in the frequency domain.
According to the present invention, cell search performance is improved by scrambling a short sequence with a scrambling sequence and reducing interference between sectors.
In 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 spirit or scope of the present invention. For clarification of drawings in the present invention, parts that are not related to the description will be omitted, and the same part will have the same reference numeral throughout the specification.
Throughout 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. Also, the terms of a unit, a device, and a module in the present specification represent a unit for processing a predetermined function or operation, which can be realized by hardware, software, or combination of hardware and software.
A downlink frame and a synchronization channel of an OFDM system according to an exemplary embodiment of the present invention will now be described with reference to
As shown in
As shown in
Each slot includes a pilot interval.
A synchronization interval according to an 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 adjacently with respect to time. As shown in
The primary synchronization channel includes information for identifying symbol synchronization and frequency synchronization, and some cell ID (identification) information, and the secondary synchronization channel includes information for identifying other cell ID information and frame synchronization. The mobile station identifies the cell ID through combination of cell ID information of the primary and secondary synchronization channels.
For example, when there are 510 cell IDs, three primary synchronization signals are allocated to the primary synchronization channel to divide the entire 510 cell IDs into three groups, and when 170 secondary synchronization signals are allocated to the secondary synchronization channel, the entire 510 cell ID information (3×170=510) can be expressed.
Further, it is also possible to divide the 510 cell IDs into 170 groups by using the 170 secondary synchronization signals allocated to the secondary synchronization channel, and express the cell ID information in the cell groups by using the three primary synchronization signals allocated to the primary synchronization channel.
Since the secondary synchronization channel includes information for identifying frame synchronization as well as cell ID information, two secondary synchronization channels included in one frame are different.
Referring to
As shown in
The length of sequence is half the number of subcarriers allocated to the secondary synchronization channel. That is, the number of elements of the sequence that can be generated is as many as half the number of subcarriers allocated to the secondary synchronization channel. For example, when the number of subcarriers allocated to the secondary synchronization channel is 62, the length of the sequence is 31, and up to 31 elements of the sequence can be generated.
Therefore, since two sequences are allocated to one secondary synchronization channel, 961 (=31×31) secondary synchronization signals are generated. However, since the information to be included by the secondary synchronization channel includes cell group information and frame boundary information, 170 or 340 (=170×2) secondary synchronization signals are needed. That is, 961 is sufficiently greater than 170 or 340.
A downlink frame generating device according to an exemplary embodiment of the present invention will now be described with reference to
As shown in
The sequence generator 410 generates a time and frequency synchronization acquiring sequence, a cell identifying sequence, a plurality of short sequences, and an adjacent cell interference reducing scrambling sequence, and transmits them to the synchronization signal generator 420.
The synchronization signal generator 420 generates a primary synchronization signal, a secondary synchronization signal, and a pilot pattern by using the sequences transmitted by the sequence generator 410.
The synchronization signal generator 420 generates a primary synchronization signal by using a time and frequency synchronization acquiring sequence and a cell identifying sequence. The synchronization signal generator 420 generates a secondary synchronization signal by using a plurality of short sequences and an adjacent cell interference reducing scrambling sequence.
The synchronization signal generator 420 generates a pilot pattern of a downlink signal by allocating a proper scrambling sequence that is allocated for each cell to the pilot channel so as to encode a common pilot symbol and a data symbol of the cellular system.
The frequency mapper 430 maps the primary synchronization signal, the secondary synchronization signal, and the pilot pattern generated by the synchronization signal generator 420, and frame control information and transmission traffic data provided from the outside in the time and frequency domains to generate a downlink frame.
The OFDM transmitter 440 receives the downlink frame from the frequency mapper 430 and transmits it through a transmitting antenna.
A downlink frame generating method according to an exemplary embodiment of the present invention will now be described with reference to
As shown in
The synchronization signal generator 420 generates a secondary synchronization signal by using the short sequences and the adjacent cell interference reducing scrambling sequences transmitted by the sequence generator 410 (S520). The exemplary embodiment of the present invention will exemplify the frame including two secondary synchronization channels, but is not limited thereto.
Two secondary synchronization signal generating methods according to an exemplary embodiment of the present invention will now be described with reference to
A short sequence (wn) is a binary sequence (binary code) indicating cell group information. That is, the short sequence (wn) is a binary sequence allocated for the cell group number and the frame synchronization, and its length is half the number of subcarriers allocated to the secondary synchronization channel. The exemplary embodiment of the present invention describes the case in which the number of subcarriers allocated to the secondary synchronization channel symbol is 62, but is not limited thereto. Therefore, the length of the short sequence according to the exemplary embodiment of the present invention is 31.
The first short sequence (w0) is a sequence allocated to the even subcarrier of the first (slot 0) secondary synchronization channel and is expressed in Equation 1.
w0=[w0(0),w0(1), . . . ,w0(k), . . . ,w0(30)] [Equation 1]
Here, k represents an index of the even subcarrier used for the synchronization channel.
The second short sequence (w1) is a sequence allocated to the odd subcarrier of the first (slot 0) secondary synchronization channel and is expressed in Equation 2.
w1=[w1(0),w1(1), . . . ,w1(m), . . . ,w1(30)] [Equation 2]
Here, m represents an index of the odd subcarrier used for the synchronization channel.
The third short sequence (w2) is a sequence allocated to the even subcarrier of the second (slot 10) secondary synchronization channel and is expressed in Equation 3.
w2=[w2(0),w2(1), . . . ,w2(k), . . . ,w2(30)] [Equation 3]
The fourth short sequence (w3) is a sequence allocated to the odd subcarrier of the second (slot 10) secondary synchronization channel and is expressed in Equation 4.
w3=[w3(0),w3(1), . . . ,w3(m), . . . ,w3(30)] [Equation 4]
w0, w1, w2, and w3 may be different sequences from each other, and it may be that w0=w3 and w1=w2, or it may be that w0=w2 and w1=w3. When it is given that w0=w3 and w1=w2, the short sequences of the second secondary synchronization channel can be allocated by using the short sequences allocated to the first synchronization channel, and a terminal only needs to memorize the 170 short sequences allocated to the first secondary synchronization channel and thereby reduce the complexity.
The first method for generating the secondary synchronization signal is to allocate the first short sequence to every even subcarrier of the first secondary synchronization channel and the second short sequence to every odd subcarrier of the first secondary synchronization channel as shown in
According to the first method for generating the secondary synchronization signal, since the secondary synchronization signal is generated by the combination of two short sequences with the length of 31, the number of the secondary synchronization signals becomes 961 which is sufficiently greater than the required number of 170 or 340.
The second method for generating the secondary synchronization signal is to allocate the first sequence determined by Equation 5 to every even subcarrier of the first (slot 0) secondary synchronization channel, and the second sequence determined by Equation 6 to every odd subcarrier of the first (slot 0) secondary synchronization channel, as shown in
A scrambling sequence Pj,1 for scrambling the first short sequence w0 is given as Pj,1=[Pj,1(0), Pj,1(1), . . . Pj,1(k) . . . Pj,1(30)], and j (j=0, 1, 2) is a number of a cell identifying sequence allocated to the primary synchronization channel. Therefore, Pj,1 is determined by the primary synchronization signal. Pj,1 is a known value when the mobile station demaps the sequence in order to know the cell ID group and the frame boundary.
As expressed in Equation 5, respective elements of the first sequence c0 according to the second method for generating the secondary synchronization signal are products of respective elements of the first short sequence w0 and respective corresponding elements of Pj,1.
c0=[w0(0)Pj,1(0),w0(1)Pj,1(1), . . . ,w0(k)Pj,1(k), . . . ,w0(30)Pj,1(30)] [Equation 5]
Here, k is an index of the even subcarrier used for the synchronization channel.
A scrambling sequence Sw0 for scrambling the second short sequence w1 is given as Sw0=[Sw0(0), Sw0(1), . . . , Sw0(m), . . . , Sw0(30)], and Sw0 is determined by the first short sequence (w0).
In this instance, it is possible to determine Sw0 according to the short sequence group to which the first short sequence belongs by combining the short sequences into a group.
For example, since the length of the short sequence is 31 in the exemplary embodiment of the present invention, there are 31 short sequences. Therefore, the 0 to 7 short sequences are set to belong to the group 0, the 8 to 15 short sequences are set to belong to the group 1, the 16 to 23 short sequences are set to belong to the group 2, and the 24 to 30 short sequences are set to belong to the group 3, a scrambling code is mapped on each group, and the scrambling code mapped on the group to which the first short sequence belongs is determined to be Sw0.
It is possible to divide the number of the short sequence by 8, combine the short sequences having the same residuals, and thereby classify the 31 short sequences as 8 groups. That is, the number of the short sequence is divided by 8, the short sequence having the residual 0 is set to belong to the group 0, the short sequence having the residual 1 is set to belong to the group 1, the short sequence having the residual 2 is set to belong to the group 2, the short sequence having the residual 3 is set to belong to the group 3, the short sequence having the residual 4 is set to belong to the group 4, the short sequence having the residual 5 is set to belong to the group 5, the short sequence having the residual 6 is set to belong to the group 6, the short sequence having the residual 7 is set to belong to the group 7, a scrambling code is mapped on each group, and the scrambling code mapped on the group to which the first short sequence belongs is determined to be Sw0.
As expressed in Equation 6, the respective elements of the second sequence c1 according to the second method for generating the secondary synchronization signal are products of the respective elements of the second short sequence w1 and the corresponding respective elements of Sw0.
c1[w1(0)Sw0(0),w1(1)Sw0(1), . . . ,w1(m)Sw0(m), . . . ,w1(30)Sw0(30)] [Equation 6]
Here, m is an index of the odd subcarrier used for the synchronization channel.
The scrambling sequence Pj,2 for scrambling the third short sequence w2 is given as Pj,2=[Pj,2(0), Pj,2(1), . . . Pj,2(k) . . . Pj,2(30)], and j (j=0, 1, 2) is a number of a cell identifying sequence allocated to the primary synchronization channel. Therefore, Pj,2 is determined by the primary synchronization signal. Pj,2 is a known value when the terminal demaps the code in order to know the cell ID group and the frame boundary.
As expressed in Equation 7, the respective elements of the third sequence c2 according to the second method for generating the secondary synchronization signal are products of the respective elements of the third short sequence w2 and the corresponding respective elements of Pj,2.
c2=[w2(0)Pj,2(0),w2(1)Pj,2(1), . . . ,w2(k)Pj,2(k), . . . ,w2(30)Pj,2(30)] [Equation 7]
Here, k is an index of the even subcarrier used for the synchronization channel.
The scrambling sequence Sw2 for scrambling the fourth short sequence is given as Sw2=[Sw2(0), Sw2(1), Sw2(m), . . . Sw2(30)], and Sw2 is determined by the third short sequence w2.
In this instance, it is possible to combine the short sequences into a group and determine Sw2 according to the short sequence group to which the third short sequence belongs.
For example, since the length of the short sequence according to the exemplary embodiment of the present invention is 31, there are 31 short sequences. Therefore, the 0 to 7 short sequences are set to belong to the group 0, the 8 to 15 short sequences are set to belong to the group 1, the 16 to 23 short sequences are set to belong to the group 2, the 24 to 30 short sequences are set to belong to the group 3, a scrambling code is mapped on each group, and the scrambling code mapped on the group to which the third short sequence belongs is determine to be Sw2.
It is also possible to divide the number of the short sequence by 8, combine the short sequences with the same residual, and classify the 31 short sequences as 8 groups. That is, the number of the short sequence is divided by 8, the short sequence with the residual 0 is set to belong to the group 0, the short sequence with the residual 1 is set to belong to the group 1, the short sequence with the residual 2 is set to belong to the group 2, the short sequence with the residual 3 is set to belong to the group 3, the short sequence with the residual 4 is set to belong to the group 4, the short sequence with the residual 5 is set to belong to the group 5, the short sequence with the residual 6 is set to belong to the group 6, the short sequence with the residual 7 is set to belong to the group 7, a scrambling code is mapped on each group, and the scrambling code mapped on the group to which the third short sequence belongs is determined to be Sw2.
As expressed in Equation 8, the respective elements of the fourth sequence c3 according to the second method for generating the secondary synchronization signal are the products of the respective elements of the fourth short sequence and the corresponding respective elements of Sw2.
c3=[w3(0)Sw20,w3(1)Sw2(1), . . . ,w3(m)Sw2(m), . . . ,w3(30)Sw2(30)] [Equation 8]
Here, m is an index of the odd subcarrier used for the synchronization channel.
Here, it is given that Pj,1=Pj,2, and w0≠w1≠w2≠w3 or w0=w3, w1=w2. In this case, the cell group and frame identifying information are mapped on the combination of the first to fourth short sequences, and the number of descrambling hypotheses of the terminal for the scramble of the secondary synchronization channel defined by the cell identifying sequence number of the primary synchronization channel is reduced.
It is set that Pj,1≠Pj,2 and w0=w2, w1=w3. In this case, cell group information is mapped on the combination of the first short sequence and the second short sequence, and frame synchronization information is mapped on the scrambling sequences Pj,1 and Pj,2 of the secondary synchronization channel defined by the cell identifying sequence number of the primary synchronization channel. The number of descrambling hypotheses of the terminal for the scramble of the secondary synchronization channel defined by the cell identifying sequence number of the primary synchronization channel is increased, but the complexity is reduced since the combination of cell group identifying sequences is reduced to half.
The frequency mapper 430 maps the secondary synchronization signal and the transmission traffic data generated by the synchronization signal generator 420 in the time and frequency domains to generate a frame of the downlink signal (S530).
The OFDM transmitter 440 receives the frame of the downlink signal and transmits it through the transmitting antenna (S540).
A method for a terminal to search for the cell by using a downlink signal according to an exemplary embodiment of the present invention will now be described with reference to
As shown in
A cell searching method according to a first exemplary embodiment of the present invention will now be described with reference to
As shown in
The Fourier transformer 830 performs a Fourier transform process on the received signal with reference to the symbol synchronization estimated by the symbol synchronization estimation and frequency offset compensator 820 (S920).
The cell ID estimator 840 correlates the Fourier transformed received signal and a plurality of predetermined secondary synchronization signals to estimate a cell ID group and frame synchronization (S930). The cell ID estimator 840 correlates the Fourier transformed received signal and a plurality of secondary synchronization signals that are generated by applying Pj,1 and Pj,2 that are determined by the primary synchronization signal corresponding to the number of the primary synchronization signal transmitted by the symbol synchronization estimation and frequency offset compensator 820 to Equation 5 to Equation 8, and estimates the frame synchronization and the cell ID group by using the secondary synchronization signal having the greatest correlation value. In this instance, when the synchronization channel symbol in one frame is provided within one slot or one OFDM symbol, there is no need of additionally acquiring frame synchronization since the symbol synchronization becomes the frame synchronization.
The cell ID estimator 840 estimates the cell ID by using the number of the primary synchronization signal transmitted by the symbol synchronization estimation and frequency offset compensator 820 and the estimated cell ID group (S940). In this instance, the cell ID estimator 840 estimates the cell ID by referring to the mapping relation of the predetermined primary synchronization signal number, cell ID group, and cell ID.
The estimated cell ID information can be checked by using scrambling sequence information included in the pilot symbol interval.
A cell searching method according to a second exemplary embodiment of the present invention will now be described with reference to
The receiver 810 receives the frame from the base station, and the symbol synchronization estimation and frequency offset compensator 820 filters the received signal by the bandwidth allocated to the synchronization channel, correlates the filtered received signal and a plurality of predetermined primary synchronization signals to acquire symbol synchronization, and estimates frequency synchronization to compensate the frequency offset (S710). The symbol synchronization estimation and frequency offset compensator 820 correlates the filtered received signal and a plurality of predetermined primary synchronization signals to estimate the time having the greatest correlation value to be symbol synchronization, and transmits a plurality of correlation values that are generated by correlating the primary synchronization signals and the filtered received signal to the cell ID estimator 840. In this instance, the frequency offset can be compensated in the frequency domain after Fourier transform.
The Fourier transformer 830 performs a Fourier transform process on the received signal with reference to the symbol synchronization estimated by the symbol synchronization estimation and frequency offset compensator 820 (S720).
The cell ID estimator 840 estimates the cell ID by using a plurality of correlation values transmitted by the symbol synchronization estimation and frequency offset compensator 820, the Fourier transformed received signal, and correlation values of a plurality of predetermined secondary synchronization signals (S730). The cell ID estimator 840 correlates the Fourier transformed received signal and a plurality of secondary synchronization signals that are generated by applying Pj,1 and Pj,2 that are determined according to the corresponding primary synchronization signals to Equation 5 to Equation 8, and finds the secondary synchronization signal having the greatest correlation value, regarding a plurality of respective primary synchronization signals.
The cell ID estimator 840 combines the correlation value of the corresponding primary synchronization signal transmitted by the symbol synchronization estimation and frequency offset compensator 820 and the correlation value of the secondary synchronization signal having the greatest correlation value with the Fourier transformed received signal from among a plurality of secondary synchronization signals that are generated by applying Pj,1 and Pj,2 that are determined by the corresponding primary synchronization signal to Equation 5 to Equation 8, regarding a plurality of respective primary synchronization signals.
The cell ID estimator 840 estimates the frame synchronization and the cell ID group by using the secondary synchronization signal having the greatest value generated by combining the correlation value of the primary synchronization signal and the correlation value of the secondary synchronization signal. The cell ID estimator 840 estimates the cell ID by using the estimated cell ID group and the primary synchronization signal having the greatest value generated by combining the correlation value of the primary synchronization signal and the correlation value of the secondary synchronization signal. In this instance, the cell ID estimator 840 estimates the cell ID by referring to the mapping relation of the predetermined primary synchronization signal number, cell ID group, and cell ID.
The above-described embodiments can be realized through a program for realizing functions corresponding to the configuration of the embodiments or a recording medium for recording the program in addition to through the above-described device and/or method, which is easily realized by a person skilled in the art. Examples of the recording medium may include, but not limited to, a read only memory (ROM), a random access memory (RAM), an electrically programmable read-only memory (EEPROM), a flash memory, etc. The program may be executed by one or more hardware processors to achieve the function corresponding to the configuration of the exemplary embodiment. Examples of the hardware processor may include, but not limited to, a DSP (digital signal processor), a CPU (central processing unit), an ASIC (application specific integrated circuit), a programmable logic element, such as an FPGA (field programmable gate array), etc.
While 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 spirit and scope of the appended claims.
| Number | Date | Country | Kind |
|---|---|---|---|
| 10-2007-0070086 | Jul 2007 | KR | national |
| 10-2007-0082678 | Aug 2007 | KR | national |
| 10-2007-0083916 | Aug 2007 | KR | national |
| 10-2008-0061429 | Jun 2008 | KR | national |
Multiple reissue applications have been filed for the reissue of U.S. Pat. No. 8,982,911. The reissue applications are application Ser. No. 15/461,510, filed Mar. 17, 2017 and issued as U.S. Pat. No. RE47,910, on Mar. 17, 2020, and the present continuation reissue application, filed Mar. 10, 2020. This applicationThis continuation reissue application is a continuation reissue application of U.S. application Ser. No. 15/461,510, filed Mar. 17, 2017 and issued as U.S. Pat. No. RE47,910, on Mar. 17, 2020, which is a reissue application of U.S. Pat. No. 8,982,911 issued Mar. 17, 2015, which is issued from U.S. application Ser. No. 13/672,041, filed Nov. 8, 2012, which is a continuation of U.S. patent application Ser. No. 12/487,847, filed on Jun. 19, 2009, which is a continuation of PCT application No. PCT/KR2008/004093, filed on Jul. 11, 2008, which claims priority to, and the benefit of, Korean Patent Application No. 10-2007-0070086 filed on Jul. 12, 2007, Korean Patent Application No. 10-2007-0082678 filed on Aug. 17, 2007, Korean Patent Application No. 10-2007-0083916 filed on Aug. 21, 2007, Korean Patent Application No. 10-2008-0061429 filed on Jun. 27, 2008. The contents of the aforementioned applications are incorporated herein by reference.
| Number | Name | Date | Kind |
|---|---|---|---|
| 6822999 | Lee et al. | Nov 2004 | B1 |
| 6888880 | Lee et al. | May 2005 | B2 |
| 7158595 | Yang et al. | Jan 2007 | B2 |
| 7161988 | Lee et al. | Jan 2007 | B2 |
| 7221695 | Hwang et al. | May 2007 | B1 |
| 7236468 | Ryu et al. | Jun 2007 | B2 |
| 7386055 | Morita et al. | Jun 2008 | B2 |
| 7969964 | Kim et al. | Jun 2011 | B2 |
| 8125976 | Chang et al. | Feb 2012 | B2 |
| 8873488 | Cho et al. | Oct 2014 | B2 |
| 20020044538 | Lee | Apr 2002 | A1 |
| 20020048315 | Hanada et al. | Apr 2002 | A1 |
| 20030193922 | Ho et al. | Oct 2003 | A1 |
| 20050088987 | Ryu | Apr 2005 | A1 |
| 20060045000 | Morlier et al. | Mar 2006 | A1 |
| 20060062185 | Darwood et al. | Mar 2006 | A1 |
| 20060114812 | Kim et al. | Jun 2006 | A1 |
| 20060146867 | Lee et al. | Jul 2006 | A1 |
| 20060209670 | Gorokhov et al. | Sep 2006 | A1 |
| 20070041348 | Kwun et al. | Feb 2007 | A1 |
| 20070133386 | Kim et al. | Jun 2007 | A1 |
| 20080019314 | Gorokhov et al. | Jan 2008 | A1 |
| 20080019350 | Onggosanusi et al. | Jan 2008 | A1 |
| 20080043702 | Moon et al. | Feb 2008 | A1 |
| 20080107086 | Fukuta et al. | May 2008 | A1 |
| 20080212462 | Ahn et al. | Sep 2008 | A1 |
| 20080273522 | Luo et al. | Nov 2008 | A1 |
| 20080285433 | Akita et al. | Nov 2008 | A1 |
| 20080285529 | Kwak et al. | Nov 2008 | A1 |
| 20080291892 | Luo | Nov 2008 | A1 |
| 20080291945 | Luo | Nov 2008 | A1 |
| 20090067370 | Kim et al. | Mar 2009 | A1 |
| 20090086669 | McCoy et al. | Apr 2009 | A1 |
| 20090219883 | Cho et al. | Sep 2009 | A1 |
| 20090310782 | Dabak et al. | Dec 2009 | A1 |
| 20090323642 | Tanno et al. | Dec 2009 | A1 |
| 20100135257 | Higuchi et al. | Jun 2010 | A1 |
| 20110009138 | Kim et al. | Jan 2011 | A1 |
| 20110129008 | Chmiel et al. | Jun 2011 | A1 |
| Number | Date | Country |
|---|---|---|
| 1136668 | Jan 2004 | CN |
| 1494809 | May 2004 | CN |
| 1494809 | May 2004 | CN |
| 1669264 | Sep 2005 | CN |
| 1669264 | Sep 2005 | CN |
| 1879321 | Dec 2006 | CN |
| 1879321 | Dec 2006 | CN |
| 1957539 | May 2007 | CN |
| 1957539 | May 2007 | CN |
| 1432265 | May 2004 | EP |
| 1432265 | Jun 2004 | EP |
| 1453232 | Sep 2004 | EP |
| 2003-152595 | May 2003 | JP |
| 2004-129286 | Apr 2004 | JP |
| 2011-250457 | Dec 2011 | JP |
| 2011-250457 | Dec 2011 | JP |
| 1020060037101 | May 2006 | KR |
| 1020060037101 | May 2006 | KR |
| 1020070025944 | Mar 2007 | KR |
| 1020070025944 | Mar 2007 | KR |
| 1020070039760 | Apr 2007 | KR |
| 1020070039760 | Apr 2007 | KR |
| 1020070050338 | May 2007 | KR |
| 1020070050338 | May 2007 | KR |
| 2005043791 | May 2005 | WO |
| 2006134829 | Dec 2006 | WO |
| 2007029958 | Mar 2007 | WO |
| 2007055526 | May 2007 | WO |
| 2007073116 | Jun 2007 | WO |
| 2009008679 | Jan 2009 | WO |
| 2009014354 | Jan 2009 | WO |
| Entry |
|---|
| Notice of Allowance for U.S. Appl. No. 12/487,747 dated Aug. 30, 2012. |
| Office Action for U.S. Appl. No. 12/487,747 dated Mar. 26, 2012. |
| Office Action for U.S. Appl. No. 12/487,747 dated Nov. 3, 2011. |
| Notice of Allowance for U.S. Appl. No. 13/672,041 dated Nov. 5, 2014. |
| Office Action for U.S. Appl. No. 13/672,041 dated Jul. 16, 2014. |
| Office Action for U.S. Appl. No. 15/461,510 dated May 17, 2018. |
| Office Action for U.S. Appl. No. 15/461,510 dated Feb. 13, 2019. |
| Notice of Allowance for U.S. Appl. No. 15/461,510 dated Oct. 18, 2019. |
| Ericsson, “Information mapping on the Secondary Synchronization Signal,” 3GPP TSG-RAN WG 1 Meeting #50, R1-073736, 12 pages, (2007). |
| ETRI, “Comparison of S-SCH mapping methods,” 3GPP TSG WG1 #50bis, R1-074052 (2007). |
| ETRI, “Design of S-SCH sequences,” 3GPP TSG RAN1 WG1 #49bis, R1-072811, 5 pages (2007). |
| ETRI, “S-SCH Scrambling Methods,” 3GPP TSH RAN WG1 Meeting #50bis, R1-074053 (2007). |
| LG Electronics, “Time-domain PSC design using Zadoff-Chu sequence,” 3GPP TSG RAN WG1 #48 bis, R1-071530, 13 references, (2007). |
| Marvell Semiconductor, “SSCH Mapping to Group ID and Frame Timing,” 3GPP TSG RAN WG1 #50bis, R1-074485 (2007). |
| MCC Support, “Draft Report of 3GPP TSG RAN WG1 #49b v0.3.0,” 3GPP TSG RAN WG1 Meeting #50, R1-073815, 4 pages (2007). |
| Motorola, “Cell Search E-mail Reflector Summary,” 3GPP TSG RAN1#50, R1-073401, 1 page (2007). |
| Motorola, “Scrambling Method for Two S-SCH Short Code,” 3GPP TSG RAN WG1 Meeting #49bis, R1-072661 (2007). |
| Nortel, “Scrambling Code Designs for S-SCH,” 3GPP TSG-RAN WG1 Meeting #50, R1-073307, 6 pages (2007). |
| NTT DoCoMo, Mitsubishi Electric, Sharp, Toshiba Corporation, “S-SCH Structure for E-UTRA Downlink,” 3GPP TSG RAN WG1 Meeting #49, R1-072598 (2007). |
| NTT DoCoMo et al., “Scrambling Method for S-SCH in E-UTRA Downlink,” 3GPP TSG RAN WG1 Meeting #49bis, R1-072940, 4 pages, (2007). |
| NTT DoCoMo et al., “S-SCH Structure for E-UTRA Downlink,” 3GPP TSG RAN WG1 Meeting #49bis, R1-072941, 6 pages (2007). |
| ZTE, “Scrambling Method for S-SCH,” 3GPP TSG-RAN WG1 #49bis, R1-072910 (2007). |
| Supplementary European Search Report for Application No. 08778878.2, dated Feb. 15, 2010. |
| 3GPP TS 36.211 V8.1.0, “Synchronization signals,” Chapter 6.11, pp. 46-49 (2007). |
| 3GPP TS 36.211 V8.2.0, “Synchronization signals,” Chapter 6.11, pp. 57-60 (2008). |
| Ericsson, “Synchronization signals for LTE,” 3GPP TSG-RAN WG1 Meeting #49bis, R1-073023, 6 pages, (2007). |
| ETRI, “Cell Search approach 1: Further considerations,” 3GPP TSG RAN1 WG1 #47, R1-063520, 6 pages, (2006). |
| ETRI, “S-SCH scrambling and mapping methods,” 3GPP TSG RAN1 WG1 #50, R1-073414, 8 pages, (2007). |
| ETRI, “S-SCH scrambling and mapping methods,” 3GPP TSG RAN1 WG1 #50, R1-073798, 8 pages, (2007). |
| Huawei, “Scrambling and information encoding for the S-SCH,” TSG RAN WG1 meeting #50, R1-073514, 6 pages, (2007). |
| LG Electronics, “SSC mapping and scrambling; method,” 3GPP RSG RAN WG1 #50, R1-073496, 9 pages, (2007). |
| Nokia Siemens Networks, Nokia, “On the multiplexing structure of the primary broadcast channel,” 3GPP TSG RAN WG1 #49bis Meeting, R1-072962, 8 pages, (2007). |
| Sharp, “Proposed Scrambling sequences for S-SCH with embedded frame timing derivation,” 3GPP TSG RAN WG1 Meeting #50, R1-073323, 12 pages, (2007). |
| ZTE, Catt, “System Information Mapping Scheme for S-SCH Sequences,” 3GPP TSG-RAN WG1 #50, R1-073590, 6 pages, (2007). |
| Number | Date | Country | |
|---|---|---|---|
| Parent | 15461510 | Mar 2017 | US |
| Child | 13672041 | US | |
| Parent | 12487847 | Jun 2009 | US |
| Child | 13672041 | US | |
| Parent | PCT/KR2008/004093 | Jul 2008 | US |
| Child | 12487847 | US |
| Number | Date | Country | |
|---|---|---|---|
| Parent | 13672041 | Nov 2012 | US |
| Child | 16813737 | US | |
| Parent | 13672041 | Nov 2012 | US |
| Child | 15461510 | US |
