Three-Step Cell Search Algorithm Exploiting Common Pilot Channel for OFCDM Broadband Wireless Access

Motohiro TANNO; Hiroyuki ATARASHI; Kenichi HIGUCHI; Mamoru SAWAHASHI

Three-Step Cell Search Algorithm Exploiting Common Pilot Channel for OFCDM Broadband Wireless Access

Motohiro TANNO, Hiroyuki ATARASHI, Kenichi HIGUCHI, Mamoru SAWAHASHI

Full Text Views

0

Cite this

Summary :

This paper proposes a three-step cell search algorithm that utilizes only the common pilot channel (CPICH) in the forward link and employs spreading by a combination of a cell-specific scrambling code (CSSC) and an orthogonal short code for Orthogonal Frequency and Code Division Multiplexing (OFCDM) broadband packet wireless access. In the proposed cell search algorithm, the OFCDM symbol timing, i.e., Fast Fourier Transform (FFT) window timing, is estimated by detecting the guard interval timing in the first step. Then, in the second step, the frame timing and CSSC group are simultaneously detected by taking the correlation of the CPICH based on the property yielded by shifting the CSSC phase in the frequency domain. Finally, the CSSC within the group is identified in the third step. The most prominent feature of the proposed cell search algorithm is that it does not employ the conventional synchronization channel (SCH), which is exclusively used for the cell search. Computer simulation results elucidate that when the transmission power ratio of the CPICH to one code channel of the traffic channel (TCH) is 12 dB, the proposed cell search method achieves faster cell search time performance compared to the conventional method using the SCH with the transmission power ratio of the SCH to one code channel of the TCH of 6 dB. Furthermore, the results show that it can accomplish the cell search within 1.7 msec at 95% of the locations in a 12-path Rayleigh fading channel with the maximum Doppler frequency of 80 Hz and the r.m.s. delay spread of 0.32 µs.

Publication: IEICE TRANSACTIONS on Communications Vol.E86-B No.1 pp.325-334

Publication Date: 2003/01/01

Publicized

Online ISSN

DOI

Type of Manuscript: Special Section PAPER (Special Issue on Multiple Access and Signal Transmission Techniques for Future Mobile Communications)

Category

Cite this

Copy

Motohiro TANNO, Hiroyuki ATARASHI, Kenichi HIGUCHI, Mamoru SAWAHASHI, "Three-Step Cell Search Algorithm Exploiting Common Pilot Channel for OFCDM Broadband Wireless Access" in IEICE TRANSACTIONS on Communications, vol. E86-B, no. 1, pp. 325-334, January 2003, doi: .
Abstract: This paper proposes a three-step cell search algorithm that utilizes only the common pilot channel (CPICH) in the forward link and employs spreading by a combination of a cell-specific scrambling code (CSSC) and an orthogonal short code for Orthogonal Frequency and Code Division Multiplexing (OFCDM) broadband packet wireless access. In the proposed cell search algorithm, the OFCDM symbol timing, i.e., Fast Fourier Transform (FFT) window timing, is estimated by detecting the guard interval timing in the first step. Then, in the second step, the frame timing and CSSC group are simultaneously detected by taking the correlation of the CPICH based on the property yielded by shifting the CSSC phase in the frequency domain. Finally, the CSSC within the group is identified in the third step. The most prominent feature of the proposed cell search algorithm is that it does not employ the conventional synchronization channel (SCH), which is exclusively used for the cell search. Computer simulation results elucidate that when the transmission power ratio of the CPICH to one code channel of the traffic channel (TCH) is 12 dB, the proposed cell search method achieves faster cell search time performance compared to the conventional method using the SCH with the transmission power ratio of the SCH to one code channel of the TCH of 6 dB. Furthermore, the results show that it can accomplish the cell search within 1.7 msec at 95% of the locations in a 12-path Rayleigh fading channel with the maximum Doppler frequency of 80 Hz and the r.m.s. delay spread of 0.32 µs.
URL: https://global.ieice.org/en_transactions/communications/10.1587/e86-b_1_325/_p

Copy

@ARTICLE{e86-b_1_325,
author={Motohiro TANNO, Hiroyuki ATARASHI, Kenichi HIGUCHI, Mamoru SAWAHASHI, },
journal={IEICE TRANSACTIONS on Communications},
title={Three-Step Cell Search Algorithm Exploiting Common Pilot Channel for OFCDM Broadband Wireless Access},
year={2003},
volume={E86-B},
number={1},
pages={325-334},
abstract={This paper proposes a three-step cell search algorithm that utilizes only the common pilot channel (CPICH) in the forward link and employs spreading by a combination of a cell-specific scrambling code (CSSC) and an orthogonal short code for Orthogonal Frequency and Code Division Multiplexing (OFCDM) broadband packet wireless access. In the proposed cell search algorithm, the OFCDM symbol timing, i.e., Fast Fourier Transform (FFT) window timing, is estimated by detecting the guard interval timing in the first step. Then, in the second step, the frame timing and CSSC group are simultaneously detected by taking the correlation of the CPICH based on the property yielded by shifting the CSSC phase in the frequency domain. Finally, the CSSC within the group is identified in the third step. The most prominent feature of the proposed cell search algorithm is that it does not employ the conventional synchronization channel (SCH), which is exclusively used for the cell search. Computer simulation results elucidate that when the transmission power ratio of the CPICH to one code channel of the traffic channel (TCH) is 12 dB, the proposed cell search method achieves faster cell search time performance compared to the conventional method using the SCH with the transmission power ratio of the SCH to one code channel of the TCH of 6 dB. Furthermore, the results show that it can accomplish the cell search within 1.7 msec at 95% of the locations in a 12-path Rayleigh fading channel with the maximum Doppler frequency of 80 Hz and the r.m.s. delay spread of 0.32 µs.},
keywords={},
doi={},
ISSN={},
month={January},}

Copy

TY - JOUR
TI - Three-Step Cell Search Algorithm Exploiting Common Pilot Channel for OFCDM Broadband Wireless Access
T2 - IEICE TRANSACTIONS on Communications
SP - 325
EP - 334
AU - Motohiro TANNO
AU - Hiroyuki ATARASHI
AU - Kenichi HIGUCHI
AU - Mamoru SAWAHASHI
PY - 2003
DO -
JO - IEICE TRANSACTIONS on Communications
SN -
VL - E86-B
IS - 1
JA - IEICE TRANSACTIONS on Communications
Y1 - January 2003
AB - This paper proposes a three-step cell search algorithm that utilizes only the common pilot channel (CPICH) in the forward link and employs spreading by a combination of a cell-specific scrambling code (CSSC) and an orthogonal short code for Orthogonal Frequency and Code Division Multiplexing (OFCDM) broadband packet wireless access. In the proposed cell search algorithm, the OFCDM symbol timing, i.e., Fast Fourier Transform (FFT) window timing, is estimated by detecting the guard interval timing in the first step. Then, in the second step, the frame timing and CSSC group are simultaneously detected by taking the correlation of the CPICH based on the property yielded by shifting the CSSC phase in the frequency domain. Finally, the CSSC within the group is identified in the third step. The most prominent feature of the proposed cell search algorithm is that it does not employ the conventional synchronization channel (SCH), which is exclusively used for the cell search. Computer simulation results elucidate that when the transmission power ratio of the CPICH to one code channel of the traffic channel (TCH) is 12 dB, the proposed cell search method achieves faster cell search time performance compared to the conventional method using the SCH with the transmission power ratio of the SCH to one code channel of the TCH of 6 dB. Furthermore, the results show that it can accomplish the cell search within 1.7 msec at 95% of the locations in a 12-path Rayleigh fading channel with the maximum Doppler frequency of 80 Hz and the r.m.s. delay spread of 0.32 µs.
ER -