IEICE TRANSACTIONS on Communications
Fast Cell Search Algorithm in Inter-Cell Asynchronous DS-CDMA Mobile Radio
Summary :
Inter-cell asynchronous DS-CDMA cellular mobile radio allows continuous system deployment from outdoors to indoors since no outer timing source is required. All the forward link channels(control and traffic channels)of each cell site are first spread by orthogonal short spreading codes and then randomized by a long random code uniquely assigned to each cell site. However, inter-cell asynchronous systems generally require much longer cell search time than inter-cell synchronous systems. This paper proposes a fast cell search algorithm based on the periodic masking of the long random code when transmitting the control channel(CCH)signal. The same short spreading code is used for the CCHs of all cell sites. The same short spreading code periodically appears in the signals transmitted from all cell sites so the mobile station can detect the long random code timing(or more precisely the masking timing)by using a matched filter. By grouping the long random codes used in the system and transmitting a group identification(GI)code from each cell site during the masking period, we can avoid searching all long random codes. This significantly reduces the cell search time. Simulation results demonstrate that cell search can be accomplished in less than 500 ms at 90% of the locations when the number of long random codes(having a repetition period of 10 ms)is 512 and the number of those per group is 32.
- Publication
- IEICE TRANSACTIONS on Communications Vol.E81-B No.7 pp.1527-1534
- Publication Date
- 1998/07/25
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- Category
- Mobile Communication
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Kenichi HIGUCHI, Mamoru SAWAHASHI, Fumiyuki ADACHI, "Fast Cell Search Algorithm in Inter-Cell Asynchronous DS-CDMA Mobile Radio" in IEICE TRANSACTIONS on Communications,
vol. E81-B, no. 7, pp. 1527-1534, July 1998, doi: .
Abstract: Inter-cell asynchronous DS-CDMA cellular mobile radio allows continuous system deployment from outdoors to indoors since no outer timing source is required. All the forward link channels(control and traffic channels)of each cell site are first spread by orthogonal short spreading codes and then randomized by a long random code uniquely assigned to each cell site. However, inter-cell asynchronous systems generally require much longer cell search time than inter-cell synchronous systems. This paper proposes a fast cell search algorithm based on the periodic masking of the long random code when transmitting the control channel(CCH)signal. The same short spreading code is used for the CCHs of all cell sites. The same short spreading code periodically appears in the signals transmitted from all cell sites so the mobile station can detect the long random code timing(or more precisely the masking timing)by using a matched filter. By grouping the long random codes used in the system and transmitting a group identification(GI)code from each cell site during the masking period, we can avoid searching all long random codes. This significantly reduces the cell search time. Simulation results demonstrate that cell search can be accomplished in less than 500 ms at 90% of the locations when the number of long random codes(having a repetition period of 10 ms)is 512 and the number of those per group is 32.
URL: https://global.ieice.org/en_transactions/communications/10.1587/e81-b_7_1527/_p
Copy
@ARTICLE{e81-b_7_1527,
author={Kenichi HIGUCHI, Mamoru SAWAHASHI, Fumiyuki ADACHI, },
journal={IEICE TRANSACTIONS on Communications},
title={Fast Cell Search Algorithm in Inter-Cell Asynchronous DS-CDMA Mobile Radio},
year={1998},
volume={E81-B},
number={7},
pages={1527-1534},
abstract={Inter-cell asynchronous DS-CDMA cellular mobile radio allows continuous system deployment from outdoors to indoors since no outer timing source is required. All the forward link channels(control and traffic channels)of each cell site are first spread by orthogonal short spreading codes and then randomized by a long random code uniquely assigned to each cell site. However, inter-cell asynchronous systems generally require much longer cell search time than inter-cell synchronous systems. This paper proposes a fast cell search algorithm based on the periodic masking of the long random code when transmitting the control channel(CCH)signal. The same short spreading code is used for the CCHs of all cell sites. The same short spreading code periodically appears in the signals transmitted from all cell sites so the mobile station can detect the long random code timing(or more precisely the masking timing)by using a matched filter. By grouping the long random codes used in the system and transmitting a group identification(GI)code from each cell site during the masking period, we can avoid searching all long random codes. This significantly reduces the cell search time. Simulation results demonstrate that cell search can be accomplished in less than 500 ms at 90% of the locations when the number of long random codes(having a repetition period of 10 ms)is 512 and the number of those per group is 32.},
keywords={},
doi={},
ISSN={},
month={July},}
Copy
TY - JOUR
TI - Fast Cell Search Algorithm in Inter-Cell Asynchronous DS-CDMA Mobile Radio
T2 - IEICE TRANSACTIONS on Communications
SP - 1527
EP - 1534
AU - Kenichi HIGUCHI
AU - Mamoru SAWAHASHI
AU - Fumiyuki ADACHI
PY - 1998
DO -
JO - IEICE TRANSACTIONS on Communications
SN -
VL - E81-B
IS - 7
JA - IEICE TRANSACTIONS on Communications
Y1 - July 1998
AB - Inter-cell asynchronous DS-CDMA cellular mobile radio allows continuous system deployment from outdoors to indoors since no outer timing source is required. All the forward link channels(control and traffic channels)of each cell site are first spread by orthogonal short spreading codes and then randomized by a long random code uniquely assigned to each cell site. However, inter-cell asynchronous systems generally require much longer cell search time than inter-cell synchronous systems. This paper proposes a fast cell search algorithm based on the periodic masking of the long random code when transmitting the control channel(CCH)signal. The same short spreading code is used for the CCHs of all cell sites. The same short spreading code periodically appears in the signals transmitted from all cell sites so the mobile station can detect the long random code timing(or more precisely the masking timing)by using a matched filter. By grouping the long random codes used in the system and transmitting a group identification(GI)code from each cell site during the masking period, we can avoid searching all long random codes. This significantly reduces the cell search time. Simulation results demonstrate that cell search can be accomplished in less than 500 ms at 90% of the locations when the number of long random codes(having a repetition period of 10 ms)is 512 and the number of those per group is 32.
ER -
English
