Abstract:
A method for synchronizing and identifying the cell code (scrambling code) of a cell in an orthogonal frequency division multiplexing (OFDM) based cellular communication system is provided. In this method, desired cell is found by utilizing a frame structure of OFDM symbols and through a corresponding cell search procedure, where the frame structure has periodic signal pattern and contains the information about the cell code of the desired cell in common pilot channel (CPICH) signal. And, the cell search method utilizes the periodic property of the frame structure to detect frame timing, and the correlation property of CPICH signal to identify the cell code. The cell search method of the present invention offers the advantages of good link quality, fast acquisition, and low power consumption.

Description:
CROSS-REFERENCES TO RELATED APPLICATIONS 
     This is a division of U.S. patent application Ser. No. 10/748,550, filed Dec. 29, 2003, now U.S. Pat. No. 7,336,600, issued Feb. 26, 2008, which is incorporated herewith by reference in its entirety. 
    
    
     FIELD OF THE INVENTION 
     The present invention generally relates to orthogonal frequency division multiplexing (OFDM) based technology such as orthogonal frequency division multiple access (OFDMA) technology and combination of OFDM and code division multiple access (CDMA) technologies, known as OFDM-CDMA technology, and more particularly to a cell search method for OFDM based cellular communication systems. 
     BACKGROUND OF THE INVENTION 
     In an OFDM based cellular communication system, a mobile station (MS) may receive downlink-transmitted signals from different cells and may need to differentiate these signals by using different cell codes. For example, in an OFDM-CDMA cellular system, the downlink-transmitted signals from different cells are differentiated by using scrambling codes (cell codes), thereby allowing for reuse of frequency and spreading codes in contiguous cells. As such, an MS terminal, when switched on, needs to search for a cell (i.e., synchronizing to the associated downlink scrambling code) before any communication. This procedure is known as initial cell search. On the other hand, during active or idle modes of an MS terminal, searching for a cell is also needed for identifying handoff candidates. This procedure is known as target cell search. The performance of cell search method directly impacts the perceived switch-on delay, link quality and power consumption of an MS. Therefore, cell search is important for the design of OFDM based cellular communication systems. 
     For brevity, cell search methods here are described in terms of only multi-carrier CDMA (MC-CDMA) system, one type of OFDM-CDMA systems, although they may also be applied to other OFDM based systems. Conventional cell search methods for MC-CDMA cellular systems include two types of methods, synchronization channel (SCH)-based method and common pilot channel (CPICH)-based method, in which cell search procedure is highly dependent on the frame structure of downlink-transmitted signal. 
     Consider that there are J downlink scrambling codes, denoted by C (i) [k], k=0˜K−1, i=1˜J, allowing for unique cell identification in every cluster of J cells where K is the length of the scrambling codes. Assume that cell j with the scrambling code C (j) [k] is the desired cell to be searched for. Typically, the J cells are further divided into several groups to reduce the number of scrambling codes to be searched for, where each group is represented by a group code. 
       FIG. 1  shows the frame structure of the SCH-based cell search method. Each frame consists of M OFDM symbols. Each OFDM symbol consists of not only N FFT -sample useful data but also N GI -sample cyclic prefix (CP), namely, guard interval (GI), for avoiding intersymbol interference (ISI) as well as inter-carrier interference (ICI). Accordingly, the length of an OFDM symbol is N OFDM =N FFT +N GI . The downlink-transmitted signal in  FIG. 1  includes three types of signals, CPICH signal, SCH signal, and traffic channel (TCH) signal. CPICH signal contains the information about the scrambling code, while SCH signal about the group code and frame timing. TCH signal is used for transmitting TCH data. In the transmitter of the base station (BS) in cell j, the data of TCHs and CPICH are spread in frequency domain by different spreading codes, and then added and scrambled by the scrambling code C (j) [k]. The scrambled signal is further combined with SCH signal, modulated via an N FFT -point inverse discrete Fourier transform (IDFT) (or, more efficiently, inverse fast Fourier transform (IFFT)), and inserted with GI to generate the downlink-transmitted signal. The number of sub-carriers is exactly identical to the length of the scrambling code (K), and the IFFT size N FFT ≧K. 
     In the receiver of an MS, the received signal is processed by the cell search procedure shown in  FIG. 2 . The procedure involves three steps: (S 1 ) symbol synchronization to detect OFDM symbol timing (OFDM symbol boundary), (S 2 ) frame synchronization and group identification to detect frame timing (frame boundary) and the group code, and (S 3 ) scrambling-code identification to detect the scrambling code C (j) [k]. In step S 1 , the symbol timing is detected by using the correlation property of CP. In step S 2 , after removing GI from the received signal and performing N FFT -point discrete Fourier transform (DFT) (or, more efficiently, fast Fourier transform (FFT)), the frame timing and group code are simultaneously detected by using SCH signal in frequency domain. In step S 3 , the scrambling code C (j) [k] is identified from the detected group by using CPICH signal, and verification is conducted to avoid false detection, thereby minimizing unnecessary MS activities. 
     Because SCH signal is not orthogonal to TCH signal and CPICH signal, cell detection performance of the SCH-based method is degraded due to the interference from TCH signal and CPICH signal, and data detection performance is also degraded due to the interference from SCH signal. For this reason, the CPICH-based method (to be described next) does not include SCH signal into the frame structure, and thus performs much better than the SCH-based method. 
       FIG. 3  shows the frame structure of the CPICH-based cell search method. Each frame consists of M OFDM symbols. Each OFDM symbol of length N OFDM  samples consists of N FFT -sample useful data and N GI -sample CP (GI). The first and last OFDM symbols, indicated by CPICH 1  and CPICH 2 , respectively, correspond to CPICH signal, while the remaining (M−2) OFDM symbols are used for transmitting TCH data, where R CPICH  is the power ratio of CPICH signal to the signal of one TCH. CPICH signal contains the information about the scrambling code, group code and frame timing. Because CPICH signal and TCH signal are allocated in different OFDM symbols (i.e., different time slots), no interference between them is incurred. Similar to the SCH-based method, the receiver of an MS for the CPICH-based method also uses the three-step cell search procedure shown in  FIG. 2 . The only difference is that in step S 2 , the frame timing and group code are simultaneously detected by using CPICH signal, instead of SCH signal, in frequency domain. 
     Recall that step S 1  for both the SCH-based and CPICH-based methods is performed in time domain, while steps S 2  and S 3  in frequency domain using N FFT -point DFT (or FFT). In step S 2 , a lot of candidates for detecting the frame boundary need to be tested in frequency domain to find an optimum one. This implies that step S 2  requires a lot of DFT (or FFT) operations for frame synchronization. Accordingly, the conventional cell search methods require high computation complexity. Furthermore, cell detection performance of the CPICH-based method is sensitive to channel effects because of a restrictive assumption for channel response in step S 3 . When this assumption is not satisfied that is the typical case in practical application, it may lead to false detection. 
     In the European patent application EP0940942, a synchronization preamble and synchronization protocol for an MC-CDMA mobile communication system is disclosed. The communication method enables remote stations to synchronize in time and frequency to their serving base station. It enables a base station and its remote stations in a cell to synchronize in a noisy environment where signal is interfered by other base stations and remote stations in other cells. One major drawback of the communication method is the cell detection performance also sensitive to channel effects. 
     SUMMARY OF THE INVENTION 
     The present invention has been made to overcome the above-mentioned shortcomings of conventional cell search methods for OFDM based cellular communication systems. An object of the present invention is to provide a low-complexity and robust cell search method, whereby a new frame structure is introduced. For low-complexity cell search, the frame structure is designed to exhibit periodic signal pattern and meanwhile contains the information about the cell code of desired cell in CPICH signal. Furthermore, the cell search method utilizes the periodic property to detect frame timing, and the correlation property of CPICH signal to identify the cell code. 
     According to the preferred embodiments of the invention, the cell search method taking advantage of the property of periodic signal pattern requires only one or two DFT (or FFT) operations of small size, and is quite robust against channel effects. Simulation results demonstrate that the cell search method of the present invention outperforms the conventional CPICH-based method for both initial and target cell search. Better cell detection performance implies fewer iterations in cell search procedure for finding a cell-code candidate with high-confidence score, and accordingly less average acquisition time as well as lower power consumption. As a consequence, the cell search method of the present invention provides the advantages of better link quality, faster acquisition, and lower power consumption. 
     The foregoing and other objects, features, aspects and advantages of the present invention will become better understood from a careful reading of the detailed description provided herein below with appropriate reference to the accompanying drawings. 
    
    
     
       BRIEF DESCRIPTION OF THE DRAWINGS 
       The present invention can be understood in more detail by reading the subsequent detailed description in conjunction with the examples and references made to the accompanying drawings, wherein: 
         FIG. 1  shows the frame structure of the conventional SCH-based cell search method; 
         FIG. 2  is a flowchart showing the cell search procedure for conventional cell search methods; 
         FIG. 3  shows the frame structure of the conventional CPICH-based cell search method; 
         FIG. 4  shows a time-domain frame structure according to the invention; 
         FIG. 5  is a flowchart showing a cell search procedure according to the invention; 
         FIGS. 6 and 7  show other time-domain frame structures according to the invention; 
         FIG. 8   a  shows the time-domain frame structure according to the first embodiment of the invention; 
         FIG. 8   b  shows another view of the frame structure in  FIG. 8   a;    
         FIG. 9   a  shows the detailed structure of CPICH 1  in  FIG. 8   a;    
         FIG. 9   b  shows the detailed structure of CPICH 2  in  FIG. 8   a;    
         FIG. 10  is a flowchart showing a cell search procedure according to the first and second embodiments of the invention; 
         FIG. 11  illustrates step  1001  in  FIG. 10 , in which the correlation property of CP in received signal is used; 
         FIG. 12   a  shows the time-domain structure according to the second embodiment of the invention; 
         FIG. 12   b  shows the detailed structure of CPICH in  FIG. 12   a;    
         FIG. 13  shows the number of complex multiplication operations required for an iteration of cell search procedure versus FFT size for the conventional CPICH-based method and the first embodiment of the present invention; and 
         FIG. 14   a  and  FIG. 14   b  plot the scrambling-code identification performance of desired cell versus geometry factor g for the conventional CPICH-based method and the first embodiment of the present invention for R CPICH =6 dB and R CPICH =9 dB, respectively. 
     
    
    
     DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS 
     In an OFDM based cellular system, suppose that there are J cells in a cluster and cell j is the desired cell to be searched for. The J cells are differentiated by using J different cell codes, denoted by C (i) [k], k=0˜L C −1, i=1˜J, where L C  is the length of the cell codes. The length L C  is chosen such that unique cell identification in every cluster of J cells can be achieved, and it is not necessary to be identical to the number of sub-carriers (K). To reduce the complexity of cell identification, every cell code can be further represented by two or more sequences. Without loss of generality, let a cell code be represented by two sequences P (i) [k], k=0˜L P −1, iε{1, 2, . . . , P−1}, and Q (l) [k], k=0˜L Q −1, lε{1, 2, . . . , Q−1}, where L P  and L Q  are the length of P (i) [k] and Q (l) [k], respectively, and P·Q≧J. Furthermore, let the cell code C (j) [k] associated with cell j be represented by the two sequences P (p) [k] and Q (q) [k]. Then, identification of the cell code C (j) [k] is turned into the problem of identifying both the sequences P (p) [k] and Q (q) [k]. 
       FIG. 4  shows a time-domain frame structure of the cell search method according the present invention. Referring to  FIG. 4 , each frame consists of M OFDM symbols, and each OFDM symbol of length N OFDM  samples consists of N FFT -sample useful data and N GI -sample CP (GI). The ith OFDM symbol, indicated by CPICHi, is comprised of CP and N i  repetitive duplicates of a v i -point short sequence, where N FFT =v i ·N i  and N i ≧1. The other OFDM symbols in the frame may include TCH signal or another CPICH signal. CPICH signal and TCH signal are allocated in different OFDM symbols (different time slots) to avoid interference problem. In a frame as shown in  FIG. 4 , there is at least one OFDM symbol (without considering GI) that exhibits periodic signal pattern. Also, there is at least one OFDM symbol in a frame that contains the information about the sequences P (p) [k] and Q (q) [k]. 
       FIG. 5  shows the procedure of the cell search method according to the invention. Referring to  FIG. 5 , the procedure includes two steps: (step  501 ) timing synchronization to detect OFDM symbol timing and frame timing, and (step  502 ) cell code identification to detect the cell code C (j) [k]. Verification is included in step  502  to avoid false detection. In step  501 , timing can be detected by using the correlation property of CP and the periodic property of the frame structure. In step  502 , the sequences P (p) [k] and Q (q) [k] are detected using the correlation property of CPICH signal. 
       FIGS. 6 and 7  show other time-domain frame structures of the cell search method according the invention. Referring to  FIGS. 6 and 7 , no OFDM symbol exhibits periodic signal pattern in a frame. Instead, in  FIG. 6 , there are at least two OFDM symbols in a frame that have the same data in some portions leading to periodic signal pattern in a frame. In  FIG. 7 , CPICHi and CPICH(i+1) are viewed as a CPICH unit of length 2N OFDM  in which the length of CP is doubled, namely, 2N GI . For the frame structure in  FIG. 7 , there is at least a CPICH unit of length 2N OFDM  having periodic signal pattern in a frame. The periodic signal patterns in  FIGS. 6 and 7  therefore can be used to detect the frame timing. Also, there is at least one OFDM symbol in a frame that contains the information about the sequences P (p) [k] and Q (q) [k] for cell code identification. Accordingly, the cell search procedure shown in  FIG. 5  can also be applied to the frame structures in  FIGS. 6 and 7 . 
       FIG. 8   a  shows the time-domain frame structure according to the first embodiment of the invention. Referring to  FIG. 8   a , the first and second OFDM symbols in a frame are CPICH 1  and CPICH 2 , respectively. The remaining (M−2) OFDM symbols in a frame, indicated by TCHs, are used for transmitting TCH data. Clearly, CPICH signal is orthogonal to TCH signal. Let s (j) [n] denote the downlink-transmitted signal associated with cell j. In a frame as shown in  FIG. 8   a , the transmitted signal of mth OFDM symbol is represented as s m   (j) [n], n=0˜N FFT −1, without taking GI into account.  FIG. 8   b  shows another view of the frame structure in  FIG. 8   a , where R CPICH  is the power ratio of CPICH signal to the signal of one TCH and K is the number of sub-carriers used in an OFDM symbol. 
       FIG. 9   a  shows the detailed structure of CPICH 1  in  FIG. 8   a . The time-domain CPICH1 signal, s 0   (j) [n], n=0˜N FFT −1, is comprised of N R  replica of the time-domain short sequence, x 1   (j) [n], n=0˜v−1, as follows:
   s   0   (j)   [n]=x   1   (j) [(( n )) v   ], n= 0˜ N   FFT −1  (1) 
where the notation ‘((n)) v ’ denotes ‘(n modulo v)’. In other words, the time-domain CPICH1 signal s 0   (j) [n] is periodic with period v. The time-domain short sequence x 1   (j) [n] can be obtained by taking v-point IDFT (IFFT) of the frequency-domain short sequence, X 1   (j) [k], k=0˜u−1, where u·N R =K and u≦v.
 
       FIG. 9   b  shows the detailed structure of CPICH 2  in  FIG. 8   a . The time-domain CPICH2 signal, s 1   (j) [n], n=0˜N FFT −1, is comprised of N R  replica of the time-domain short sequence, x 2   (j) [n], n=0˜v−1, as follows:
   s   1   (j)   [n]=x   2   (j) [(( n )) v   ], n= 0 ˜N   FFT −1  (2) 
In other words, the time-domain CPICH2 signal s 1   (j) [n] is also periodic with period v. The time-domain short sequence x 2   (j) [n] can be obtained by taking v-point IDFT (IFFT) of the following frequency-domain short sequence:
   X   2   (j)   [k]=X   1   (j)   [k]·A   (j)   [k], k= 0˜ u −1  (3) 
     The frequency-domain short sequences X 1   (j) [k] and X 2   (j) [k] (or, equivalently, X 1   (j) [k] and A (j) [k]), k=0˜u−1, can be designed to contain the information about the sequences P (p) [k], k=0˜L P −1, and Q (q) [k], k=0˜L Q −1. In particular, the sequence A (j) [k] can be designed as follows:
 
 A   (j)   [k]=P   (p) [(( k )) L     P   ], for kεΩ 1   (4a)
 
and
 
 A   (j)   [k]=Q   (q) [(( k )) L     Q   ], for kεΩ 2   (4b)
 
where Ω 1  and Ω 2  are two disjoint sets of the indices of A (j) [k], and Ω 1 ∪Ω 2 ⊂{0, 1, . . . , u−1}. In this design, the cell search procedure shown in  FIG. 5  can be implemented as the one shown in  FIG. 10 . Other implementations, however, are also feasible since the short sequence X 1   (j) [k] appeared in both CPICH 1  and CPICH 2  can be set arbitrarily. For example, the short sequence X 1   (j) [k] can be set to be identical for all cells, and thus it can be used as a training sequence for simultaneous symbol and frame synchronization as well as for channel estimation.
 
     Let the downlink-transmitted signal s (j) [n] be received, after c units of time delay, by the receiver of an MS as
 
 r[n]=h   (j)   [n]*s   (j)   [n−τ]+w   (j)   [n]   (5)
 
where the notation ‘*’ denotes linear convolution operation. In (5), r[n] is the received signal, h (j) [n] is the channel impulse response, and w (j) [n] is the noise component including not only background noise but also interference from other cells and other MS&#39;s. The channel h (j) [n] is assumed to be a linear time-invariant (LTI) finite impulse response (FIR) system of length L h . The unknown time delay τ can be further expressed as
 
τ= D·N   OFDM   +d   (6)
 
where D and d are non-negative integers, and 0≦d&lt;N OFDM . According to the cell search procedure shown in  FIG. 10 , the goal of the cell search method of the embodiment is to estimate the unknown time delay d (OFDM symbol timing) in step  1001 , estimate the unknown time delay D (frame timing) in step  1002 , and identify the sequences P (p) [k] and Q (q) [k] (the cell code C (j) [k]) in step  1003 .
 
     In step  1001 , the OFDM symbol timing d is detected by virtue of the correlation property of CP in the received signal r[n], as illustrated in  FIG. 11 . Correlations between the received signal and its delayed version of N FFT  samples are computed and averaged as follows: 
                       Γ   1     ⁡     [   ⅈ   ]       =       ∑   m     ⁢       ∑     n   =   i       i   +     N   GI     -   1       ⁢       r   ⁡     [       mN   OFDM     +   n     ]       ⁢       r   *     ⁡     [       mN   OFDM     +   n   +     N   FFT       ]                     (   7   )               
where the superscript ‘*’ denotes complex conjugation. From (7), it follows that the symbol timing d can be detected by finding the maximum of |Γ 1 [i]|. Other symbol synchronization methods such as the well-known maximum-likelihood (ML) method and minimum mean-square-error (MMSE) method can also be applied in this step.
 
     After the symbol timing d has been detected in step  1001 , there still remains an unknown time delay D·N OFDM  (see (6)) between the transmitted signal s (j) [n] and the received signal r[n+d]. In step  1002 , the frame timing D is detected by virtue of the property of the periodic signal pattern in both CPICH 1  and CPICH 2 . This is demonstrated from the following derivations. 
     By assuming the channel length L h ≦N GI +1 (i.e., no ISI and ICI) and removing GI from the received signal r[n] given by (5), the received mth OFDM symbol is obtained as: 
                               r   m     ⁡     [   n   ]       ≡       ⁢     r   ⁡     [       mN   OFDM     +   d   +     N   GI     +   n     ]                       =       ⁢         ∑     l   =   0         L   h     -   1       ⁢         h     (   j   )       ⁡     [   l   ]       ·       s     m   -   D       (   j   )       ⁡     [       (     (     n   -   l     )     )       N   FFT       ]           +       w   m     (   j   )       ⁡     [   n   ]           ,     ⁢                   ⁢     
     ⁢           ⁢     n   =       0   ~     N             ⁢   FFT         -   1               (   8   )               
where s m−D   (j) [n]≡s (j) [(m−D)N OFDM +N GI +n] and w m   (j) [n]≡w (j) [mN OFDM +d+N GI +n] are the transmitted signal (without GI) and the noise associated with the received mth OFDM symbol, respectively. By ignoring noise effect, the received Dth OFDM symbol r D [n] and (D+1)th OFDM symbol r D+1 [n], corresponding to CPICH 1  and CPICH 2 , respectively, can be shown to be periodic with period v. Accordingly, the frame timing D can be detected by computing the autocorrelations of two successive received OFDM symbols as follows:
 
                       Γ   2     ⁡     [   m   ]       =       ∑     i   =   0         N   R     -   1       ⁢       ∑     n   =   0       v   -   1       ⁢     {                 r   m     ⁡     [       v   ⁢           ⁢   ⅈ     +   n     ]       ⁢       r   m   *     ⁡     [       (     (       v   ⁡     (     ⅈ   +   1     )       +   n     )     )       N   FFT       ]         +                 r     m   +   1     *     ⁡     [       (     (       v   ⁡     (     ⅈ   +   1     )       +   n     )     )       N   FFT       ]             }                 (   9   )               
The searching range of frame timing should involve at least (M+1) OFDM symbols in (9) to ensure that two CPICHs, CPICH 1  and CPICH 2 , are included in the computation. Since both r D [n] and r D+1 [n], n=0˜N FFT −1, are periodic with period v, F 2  [m] given by (9) has a maximum value at m=D and, thus, the frame timing D is detected by finding the maximum of |Γ 2  [m]| given by (9).
 
     After the frame timing D has been detected in step  1002 , the cell code C (j) [k] is identified in step  1003  by identifying the associated two sequences P (p) [k] and Q (q) [k] by virtue of the frequency-domain relationship between CPICH 1  and CPICH 2  given by (3), (4a) and (4b). 
     For reducing noise effect and computational complexity, the received OFDM symbol r D [n] corresponding to CPICH 1  is averaged over N R  replica to obtain 
                           r   _     D     ⁡     [   n   ]       =       1     N   R       ⁢       ∑     i   =   0         N   R     -   1       ⁢       r   D     ⁡     [       v   ⁢           ⁢   ⅈ     +   n     ]             ,     n   =       0   ~   v     -   1               (     10   ⁢   a     )               
In the same way, averaging the received OFDM symbol r D+1 [n] yields
 
                           r   _       D   +   1       ⁡     [   n   ]       =       1     N   R       ⁢       ∑     i   =   0         N   R     -   1       ⁢       r     D   +   1       ⁡     [       v   ⁢           ⁢   ⅈ     +   n     ]             ,     n   =       0   ~   v     -   1               (     10   ⁢   b     )               
Taking v-point DFTs of  r   D [n] and  r   D+1 [n], respectively, gives
     R     D   [k]={tilde over (H)}   (j)   [k]X   1   (j)   [k], k= 0˜ u −1  (11a) and     R     D+1   [k]={tilde over (H)}   (j)   [k]X   1   (j)   [k]A   (j)   [k], k= 0 ˜u− 1  (11b) 
where {tilde over (H)} (j) [k] is the v-point DFT of
 
                         h   ~       (   j   )       ⁡     [   n   ]       =     {                 h     (   j   )       ⁡     [   n   ]       +       h     (   j   )       ⁡     [     n   +   v     ]       +   …   +       h     (   j   )       ⁡     [     n   +       (       ⌈       L   h     v     ⌉     -   1     )     ⁢   v       ]         ,           n   =       0   ~   v     -   1                 0   ,         otherwise                   (   12   )               
in which ┌a┐ denotes the smallest integer no less than a. From (12), it follows that when L h ≦v, {tilde over (h)} (j) [n]=h (j) [n]; otherwise, {tilde over (h)} (j) [n] is an aliasing version of h (j) [n].
 
     According to (11a), (11b) and (4a), the desired sequence P (p) [k] can be identified by computing 
                       Γ     3   ⁢   a       ⁡     [   ⅈ   ]       =       ∑     k   ∈     Ω   1         ⁢           R   _     D     ⁡     [   k   ]       ⁢           R   _       D   +   1     *     ⁡     [   k   ]       ·       P     (   i   )       ⁡     [       (     (   k   )     )       L   P       ]                     (   13   )               
which has a maximum value for i=p. Thus, the desired sequence P (p) [k] is identified by searching for the maximum of |Γ 3a [i]| given by (13) over P candidates of P (p) [k]. In a similar way, according to (11a), (11b) and (4b), the desired sequence Q (q) [k] can be identified by computing
 
                       Γ     3   ⁢   b       ⁡     [   ⅈ   ]       =       ∑     k   ∈     Ω   2         ⁢           R   _     D     ⁡     [   k   ]       ⁢           R   _       D   +   1     *     ⁡     [   k   ]       ·       Q     (   i   )       ⁡     [       (     (   k   )     )       L   Q       ]                     (   14   )               
which has a maximum value for i=q. As a result, the desired sequence Q (q) [k] is identified by searching for the maximum of |Γ 3b [i]| given by (14) over Q candidates of Q (q) [k].
 
     Unlike the conventional SCH-based and CPICH-based cell search methods, the process of finding the maximum of |ΓF 3a [i]| given by (13) is independent of that of |Γ 3b [i]| given by (14). When both the sequences P (p) [k] and Q (q) [k] are identified, the cell code C (j) [k] is correspondingly found. 
     The verification is included in step  1003  to avoid false detection. Let {circumflex over (p)} and {circumflex over (q)} be the indices obtained by maximizing |Γ 3a [i]| and |Γ 3b [i]|, respectively. Then, the identified cell code (i.e., the identified sequences P ({circumflex over (p)}) [k] and Q ({circumflex over (q)}) [k]) can be verified via the following ratios: 
                       Δ     3   ⁢   a       =              Γ     3   ⁢   a       ⁡     [     p   ^     ]              max   ⁢     {              Γ     3   ⁢   a       ⁡     [   ⅈ   ]            ,     i   ≠     p   ^         }           ⁢     
     ⁢   and           (     15   ⁢   a     )                 Δ     3   ⁢   b       =              Γ     3   ⁢   b       ⁡     [     q   ^     ]              max   ⁢     {              Γ     3   ⁢   b       ⁡     [   ⅈ   ]            ,     i   ≠     q   ^         }                 (     15   ⁢   b     )               
When both Δ 3a  and Δ 3b  exceed a pre-assigned threshold, the identified cell code is thought as a cell-code candidate with a high-confidence score. For this case, MS determines that the cell search procedure is completed successfully, and it then proceeds the subsequent processes such as frequency synchronization, read of broadcast information, and measurement of signal-to-interference-plus-noise ratio. Otherwise, MS continues the cell search procedure until a reliable cell-code candidate is obtained.
 
     As shown above, the cell search procedure of the first embodiment requires only two v-point DFT operations for step  1003 . This implies that compared with the conventional SCH-based and CPICH-based methods, the computation complexity of the cell search method for the first embodiment of the present invention is relatively low. Moreover, the cell search method for the first embodiment of the present invention requires no further assumption on the LTI FIR channel h (j) [n], implying that it is quite robust against channel effects. 
     Subsequently, a second embodiment of the present invention with relatively low complexity is provided. 
       FIG. 12   a  shows the time-domain frame structure according to the second embodiment of the present invention. Referring to  FIG. 12   a , the first OFDM symbol in a frame is CPICH. The remaining (M−1) OFDM symbols in a frame are used for transmitting TCH data.  FIG. 12   b  shows the detailed structure of CPICH in  FIG. 12   a . The time-domain CPICH signal, s 0   (j) [n], n=0˜N FFT −1, is comprised of N R  replica of the time-domain short sequence, x (j) [n], n=0˜v−1, as follows:
   s   0   (j)   [n]=x   (j) [(( n )) v   ], n= 0˜ N   FFT −1  (16) 
In other words, the time-domain CPICH signal s 0   (j) [n] is periodic with period v. The time-domain short sequence x (j) [n] can be obtained by taking v-point IDFT (IFFT) of the following frequency-domain short sequence:
 
     
       
         
           
             
               
                 
                   
                     
                       
                         
                           X 
                           
                             ( 
                             j 
                             ) 
                           
                         
                         ⁡ 
                         
                           [ 
                           
                             2 
                             ⁢ 
                             k 
                           
                           ] 
                         
                       
                       = 
                       
                         
                           B 
                           
                             ( 
                             j 
                             ) 
                           
                         
                         ⁡ 
                         
                           [ 
                           k 
                           ] 
                         
                       
                     
                     , 
                     
                         
                     
                     ⁢ 
                     
                       k 
                       = 
                       
                         
                           0 
                           ~ 
                           
                             u 
                             2 
                           
                         
                         - 
                         1 
                       
                     
                   
                   ⁢ 
                   
                     
 
                   
                   ⁢ 
                   and 
                 
               
               
                 
                   ( 
                   
                     17 
                     ⁢ 
                     a 
                   
                   ) 
                 
               
             
             
               
                 
                   
                     
                       
                         X 
                         
                           ( 
                           j 
                           ) 
                         
                       
                       ⁡ 
                       
                         [ 
                         
                           
                             2 
                             ⁢ 
                             k 
                           
                           + 
                           1 
                         
                         ] 
                       
                     
                     = 
                     
                       
                         
                           B 
                           
                             ( 
                             j 
                             ) 
                           
                         
                         ⁡ 
                         
                           [ 
                           k 
                           ] 
                         
                       
                       · 
                       
                         
                           A 
                           
                             ( 
                             j 
                             ) 
                           
                         
                         ⁡ 
                         
                           [ 
                           k 
                           ] 
                         
                       
                     
                   
                   , 
                   
                       
                   
                   ⁢ 
                   
                     k 
                     = 
                     
                       
                         0 
                         ~ 
                         
                           u 
                           2 
                         
                       
                       - 
                       1 
                     
                   
                 
               
               
                 
                   ( 
                   
                     17 
                     ⁢ 
                     b 
                   
                   ) 
                 
               
             
           
         
       
     
     The frequency-domain short sequence X (j) [k] (or, equivalently, B (j) [k] and A (j) [k]) can be designed to contain the information about the sequences P (p) [k], k=0˜L P −1, and Q (q) [k], k=0˜L Q −1. In particular, the sequence A (j) [k] can be designed as follows:
 
 A   (j)   [k]=P   (p) [(( k )) L     P   ], for kεΩ 1   (18a)
 
and
 
 A   (j)   [k]=Q   (q) [(( k )) L     Q   ], for kεΩ 2   (18b)
 
where Ω 1  and Ω 2  are two disjoint sets of the indices of A (j) [k], and Ω 1 ∪Ω 2 ⊂{0, 1, . . . , (u/2)−1}. In this design, the sequence B (j) [k] in (17a) and (17b) can be set arbitrarily.
 
     Similar to the first embodiment of the present invention, the cell search procedure shown in  FIG. 10  can also be used for the second embodiment of the present invention. In step  1001 , the OFDM symbol timing d is detected by finding the maximum of |Γ 1 [i]| given by (7). After the symbol timing d has been detected in step  1001 , the frame timing D can be detected by computing the autocorrelations of received OFDM symbols as follows: 
                       Γ   2     ⁡     [   m   ]       =       ∑     i   =   0         N   R     -   1       ⁢       ∑     n   =   0       v   -   1       ⁢         r   m     ⁡     [       v   ⁢           ⁢   i     +   n     ]       ⁢       r   m   *     ⁡     [       (     (       v   ⁡     (     i   +   1     )       +   n     )     )       N   FFT       ]                     (   19   )               
where r m [n] is given by (8). Since the received Dth OFDM symbol r D [n], corresponding to CPICH signal, is periodic with period v, Γ 2  [m] given by (19) has a maximum value at m=D. Thus, in step  1002 , the frame timing D is detected by finding the maximum of |Γ 2  [m]‥ given by (19).
 
     After the frame timing D has been detected in step  1002 , the cell code C (j) [k] is identified in step  1003  by identifying the associated two sequences P (p) [k] and Q (q) [k] by virtue of the frequency-domain relationship given by (17a), (17b), (18a) and (18b). For reducing noise effect and computational complexity, the received OFDM symbol r D [n], corresponding to CPICH, is averaged over N R  replica to obtain the averaged time-domain signal  r   D [n] as given by (10a). Taking v-point DFT of  r   D [n] gives
 
   R     D   [k]={tilde over (H)}   (j)   [k]X   (j)   [k], k= 0˜ u −1  (20)
 
where {tilde over (H)} (j) [k] is the v-point DFT of {tilde over (h)} (j) [n] given by (12).
 
     According to (20), (17a), (17b), and (18a), the desired sequence P (p) [k] can be identified by computing 
                       Γ     3   ⁢   a       ⁡     [   i   ]       =       ∑     k   ∈     Ω   1         ⁢           R   _     D     ⁡     [     2   ⁢   k     ]       ⁢           R   _     D   *     ⁡     [       2   ⁢   k     +   1     ]       ·       P     (   i   )       ⁡     [       (     (   k   )     )       L   P       ]                     (   21   )               
which has a maximum value for i=p as {tilde over (H)} (j) [2k]≅{tilde over (H)} (j) [2k+1]. Thus, the desired sequence P (p) [k] is identified by searching for the maximum of |Γ 3a [i]| given by (21) over P candidates of P (p) [k]. In a similar way, according to (20), (17a), (17b), and (18b), the desired sequence Q (q) [k] can be identified by computing
 
                       Γ     3   ⁢   b       ⁡     [   i   ]       =       ∑     k   ∈     Ω   2         ⁢           R   _     D     ⁡     [     2   ⁢   k     ]       ⁢           R   _     D   *     ⁡     [       2   ⁢   k     +   1     ]       ·       Q     (   i   )       ⁡     [       (     (   k   )     )       L   Q       ]                     (   22   )               
which has a maximum value for i=q as {tilde over (H)} (j) [2k]≅{tilde over (H)} (j) [2k+1]. As a result, the desired sequence Q (q) [k] is identified by searching for the maximum of |Γ 3b [i]| given by (22) over Q candidates of Q (q) [k]. When both the sequences P (p) [k] and Q (q) [k] are identified, the cell code C (j) [k] is correspondingly found. Finally, the identified cell code is also verified as that in the first embodiment of the present invention.
 
     As shown above, the cell search procedure for the second embodiment of the present invention requires only one v-point DFT operation for step  1003 , and thus its computation complexity is relatively low. Moreover, the cell search method for the second embodiment of the present invention requires only the channel assumption of {tilde over (H)} (j) [2k]≅{tilde over (H)} (j) [2k+1], which holds for typical applications. This therefore implies that the cell search method for the second embodiment of the present invention is robust against typical channel effects. 
     In the following, some calculation and simulation results regarding the first embodiment of the present invention are provided for verifying the present invention. An MC-CDMA cellular system was considered, in which the scrambling code (cell code) C (j) [k], k=0˜K−1 (i.e., L C =K), was used and represented by only the sequence P (p) [k], k=0˜u−1 (i.e., L P =u). In other words, the sequence Q (q) [k], k=0˜L Q −1, was inexistent and the set Ω 2  in (4b) was accordingly an empty set for the illustration. 
       FIG. 13  shows the number of complex multiplication operations required for an iteration of the cell search procedure versus FFT size for the conventional CPICH-based method and the first embodiment of the present invention. Less computation complexity means more power savings. From  FIG. 13 , it can be seen that the computation complexity of the conventional CPICH-based method is about 4˜5 times higher than that of the first embodiment of the present invention. 
       FIG. 14   a  and  FIG. 14   b  plot the performance of scrambling-code identification versus geometry factor, g, for the conventional CPICH-based method and the first embodiment of the present invention for R CPICH =6 dB and R CPICH =9 dB, respectively. The geometry factor g of cell j is defined as 
                   g   =       E   ⁢     {              s   0     (   j   )       ⁡     [   n   ]            2     }           E   ⁢     {              w   1     ⁡     [   n   ]            2     }       +     E   ⁢     {              w   2     ⁡     [   n   ]            2     }                   (   23   )               
where w 1 [n] is the inter-cell interference and w 2 [n] is the background noise. A high value of g indicates that MS is close to BS in cell j, whereas a low value of g indicates that MS is near cell boundary. From  FIGS. 14   a  and  14   b , it can be seen that the cell search method of the present invention outperforms the conventional CPICH-based method for both initial and target cell search, especially for the condition of low value of g. This reveals that the cell search method of the present invention requires fewer iterations in the cell search procedure for finding a cell-code candidate with a high-confidence score and accordingly less average acquisition time as well as lower power consumption.
 
     Although the present invention has been described with reference to the preferred embodiments, it should be understood that the invention is not limited to the details described thereof. Various substitutions and modifications have been suggested in the foregoing description, and others will occur to those of ordinary skill in the art. For example, the frame structure may have a number of CPICHs other than one or two. CPICHs may be arranged in various OFDM symbols other than the first and second OFDM symbols in a frame. CPICHs may be periodic with different periods. Therefore, all such substitutions and modifications are intended to be embraced within the scope of the invention as defined in the appended claims.