1. Field of the Invention
The present invention relates to a code division multiple access (CDMA) mobile communication system. In particular, the present invention relates to a cell search method using a long code masked symbol (search code) in perch channels.
2. Description of the Related Art
When a mobile terminal starts communication, or a mobile terminal moves from one base station area (cell) in which the mobile terminal is currently conducting communication to an adjacent cell (i.e., in the case of hand over) in CDMA mobile communication systems, it is necessary to conduct spread code detection or frame/slot timing synchronization. Such processing is called cell search.
As for an example of a conventional cell search method, a method of spreading only one symbol located at the end of a slot by using a special short code called long code masked symbol instead of the ordinary long code and short code is described in Technical Report of IEICE (the Institute of Electronics, Information and Communication Engineers) DSP-96-116, SAT96-111, RCS96-122 (1997-01).
This cell search method using the long code masked symbol will now be described. The cell search uses perch channels shown in
The long code is a long period spreading code assigned uniquely to the base station. The short code is a short period spreading code assigned uniquely to each of channels under communication (including the control channel and transmission channel). The long code has a long code length and includes many kinds. In order to facilitate its timing synchronization, therefore, the long code is classified into a plurality of groups. The GISC is a short period code provided so as to correspond to the classification of the long code. In the case where the mobile terminal is to conduct timing synchronization of the perch channels, the mobile terminal lightens the load of synchronization of the long code used by the base station (i.e., decreases time, circuit means, electric power, etc. required for the timing synchronization), by detecting the GISC and narrowing down the long code to a fixed range (i.e., by limiting candidates for the long code which may be used). The CSC is a short period spreading code defined uniquely to the mobile communication system.
The detection of the long code and the frame/slot timing used by the base station, utilizing the perch channels is conducted as follows: (1) the mobile terminal despreads the perch channels by using the CSC, and detects the slot timing on the basis of the height of the correlation value; (2) the mobile terminal conducts despreading in all GISCs in conformity to the synchronized slot timing, and detects the GISC on the basis of the height of the correlation value; (3) the mobile terminal conducts despreading by using all long codes belonging to a group associated with the GISC, and detects the long code on the basis of the height of the correlation value.
The format and transmission power of the perch channels of the conventional method are shown in
In the conventional system which conducts spreading process in the long code masked symbol section at the same symbol rate as in the data symbol section, it took the longest time in a first stage (slot timing synchronization) of the cell search. In order to conduct timing synchronization in a short time, a matched filter (MF) capable of deriving correlation results at a plurality of timing instants at once is used in many cases.
If the MF with 64 taps is used, coefficient mode switchover becomes necessary in order to derive correlation values at all timing instants. This results in a problem that the time required for timing synchronization, in turn the time required for cell search becomes longer. On the other hand, if a MF with 256 taps is used, then the received signal can be despread with coefficients corresponding to one symbol set in the MF intact. Since the coefficient mode switchover thus becomes unnecessary, correlation at all timing instants can be derived at high speed. However, both the gate size and power consumption of the MF become very large.
In order to conduct the cell search at high speed while suppressing the gate size and the power consumption, the spreading factor of the long code masked symbol is made smaller than spreading factors of other portions of the perch channels.
In particular, a symbol rate according to typical number of taps of the MF used in the mobile terminal is determined. For example, in the case where the spreading factor of the mask symbol is 64, timing synchronization is conducted by using a MF with 64 taps. In this case, the symbol length coincides with the number of taps of the MF. With coefficients corresponding to one symbol set in the MF intact, therefore, it is possible to conduct despreading of the received signal and conduct search of all timing instants in the 64 chip section. Without increasing the gate size and power consumption, fast cell search thus becomes possible.
By referring to detailed description of preferred embodiments described below and accompanied drawing, these or other objects, features, and advantages will become more apparent.
First of all, the configuration of a mobile terminal used in a CDMA mobile communication system according to the present invention will be described by referring to
(Digital Signal Processor)
The GISC detection unit 811 (
The first long code detection unit (
For the long code designated by the first long code detection unit, the second long code detection unit (
A CDMA communication system performing a cell search method using the long code mask symbol will now be described centering around an example in which only the long code masked symbol portion of the perch channels typically transmitted at 16 Ksps (spreading factor 256) is made to have a spreading factor of 64.
The spreading factor is not limited to 64. Similar effects can be obtained so long as the spreading factor is less than 256.
As a first embodiment,
If the symbol length is shortened, the number of times of possible accumulation times decreases. For obtaining the same receiving sensitivity, therefore, the transmission power must be raised. However, the perch channels are always subjected to transmission with constant power. In addition, the long code masked symbol portion is poor in orthogonality, and therefore, tends to exert interference power to other channels. Therefore, it is desirable to suppress the transmission power as low as possible. In the present embodiment, therefore, the CSC and GISC are not multiplexed, but the CSC and GISC are transmitted by time division in the long code masked symbol portion. Even if the spreading factor is reduced to ¼ at this time, transmission power P3 of the CSC is twice the transmission power P1 of the conventional technique and the same reception sensitivity is obtained. The same is true of the transmission power P4 of the GISC.
As a second embodiment,
As a third embodiment,
As a fourth embodiment,
In
By thus making the spreading factor of the long code masked symbol small, the time required for timing synchronization can be made shorter than that of the conventional method, and the number of taps of the MF can be shortened, resulting in reduced gate size and power consumption.
The present invention has been disclosed in connection with the preferred embodiments. Those skilled in the art can apply various modifications to the embodiments on the basis of the disclosure. All modifications existing within the true spirit and scope of the present invention are incorporated in the claims.
Number | Date | Country | Kind |
---|---|---|---|
10-129995 | May 1998 | JP | national |
This application is a continuation of U.S. patent application Ser. No. 12/836,237, filed Jul. 14, 2010; which is a continuation of U.S. patent application Ser. No. 10/869,920, filed Jun. 18, 2004, now U.S. Pat. No. 7,778,310; which is a continuation of U.S. patent application Ser. No. 09/518,690, filed Mar. 3, 2000, now U.S. Pat. No. 6,879,571; which is a continuation of U.S. patent application Ser. No. 09/257,002, filed Feb. 25, 1999, now U.S. Pat. No. 6,507,576, the contents of which are hereby incorporated by reference into this application.
Number | Name | Date | Kind |
---|---|---|---|
4969159 | Belcher et al. | Nov 1990 | A |
5280472 | Gilhausen et al. | Jan 1994 | A |
5692155 | Iskiyan et al. | Nov 1997 | A |
5790588 | Fukawa et al. | Aug 1998 | A |
5907673 | Hirayama et al. | May 1999 | A |
6018667 | Ghosh et al. | Jan 2000 | A |
6038250 | Shou et al. | Mar 2000 | A |
6167037 | Higuchi et al. | Dec 2000 | A |
6208632 | Kowalski et al. | Mar 2001 | B1 |
6226315 | Sriram et al. | May 2001 | B1 |
6370134 | Aramaki | Apr 2002 | B1 |
6385232 | Terashima | May 2002 | B1 |
6459724 | Yoneyama | Oct 2002 | B1 |
6665277 | Sriram | Dec 2003 | B1 |
6754251 | Sriram et al. | Jun 2004 | B1 |
6891817 | Miya et al. | May 2005 | B2 |
20040057414 | Sriram | Mar 2004 | A1 |
20050213643 | Iwamoto et al. | Sep 2005 | A1 |
20050213644 | Iwamoto et al. | Sep 2005 | A1 |
20100323747 | Tiedemann et al. | Dec 2010 | A1 |
Number | Date | Country |
---|---|---|
693834 | Jan 1996 | EP |
0825737 | Feb 1998 | EP |
0388910 | Apr 1998 | EP |
0852430 | Jul 1998 | EP |
61-248698 | May 1986 | JP |
8-79131 | Mar 1996 | JP |
08-307316 | Nov 1996 | JP |
09-261121 | Oct 1997 | JP |
WO9912273 | Mar 1999 | WO |
Entry |
---|
Translation of The Institute of Electronics, Information and Communication Engineers, Technical Report of IEICE DSP98-116, SAT96-111, RCS96-122 (Jan. 1997). |
K. Higuchi et al, “Fast Cell Search Algorithm in DS-CDMA Mobile Radio Using Long Spreading Codes”, IEEE, 47th, May 4-7, 1997, pp. 1430-1434. |
IEEE, K. Higushi et al, “Fast Cell Research Algorithm in DS-CDMA Mobile Radio Using Long Spreading Codes”, May 4, 1997, pp. 1430-1434. |
Number | Date | Country | |
---|---|---|---|
20130077602 A1 | Mar 2013 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 12836237 | Jul 2010 | US |
Child | 13681458 | US | |
Parent | 10869920 | Jun 2004 | US |
Child | 12836237 | US | |
Parent | 09518690 | Mar 2000 | US |
Child | 10869920 | US | |
Parent | 09257002 | Feb 1999 | US |
Child | 09518690 | US |