IEICE TRANSACTIONS on Communications
Three-Step Cell Search Algorithm Employing Synchronization and Common Pilot Channels for OFCDM Broadband Wireless Access
Summary :
This paper proposes a three-step cell search algorithm utilizing a synchronization channel (SCH) and common pilot channel (CPICH) in the forward link for OFCDM (Orthogonal Frequency and Code Division Multiplexing) broadband packet wireless access, and evaluates the cell search time performance by computer simulation. In the proposed three-step cell search algorithm, the OFCDM symbol timing, i.e., Fast Fourier Transform (FFT) window timing is estimated employing SCH or guard interval (GI) correlation in the first step. Then, the frame timing is detected by employing the SCH and the cell-specific scrambling code (CSSC) is identified by the CPICH in the second and third steps, respectively. Computer simulation results elucidate that the proposed three-step cell search algorithm achieves fast cell search time performance, i.e., cell detection probability of 90% within approximately 50 msec, assuming the number of CSSCs of 512 in a 19 hexagonal-cell model. We also clarify that there is no prominent difference in cell search time performance between the two employed SCH structures, time-multiplexed and frequency-multiplexed, assuming that the total transmit power of the SCH is the same. Based on the comparison of four substantial cell search algorithms, the GI-plus-SCH correlation method, in which FFT windowing timing detection, frame timing detection, and CSSC identification are performed by GI correlation, frequency-multiplexed SCH, and CPICH, respectively, exhibits the cell search time of approximately 44 msec at the detection probability of 90% with an optimized averaging parameter in each step.
- Publication
- IEICE TRANSACTIONS on Communications Vol.E85-B No.12 pp.2672-2683
- Publication Date
- 2002/12/01
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- Special Section PAPER (Special Issue on Software Defined Radio Technology and Its Applications)
- Category
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
Yukiko ISHII, Kenichi HIGUCHI, Mamoru SAWAHASHI, "Three-Step Cell Search Algorithm Employing Synchronization and Common Pilot Channels for OFCDM Broadband Wireless Access" in IEICE TRANSACTIONS on Communications,
vol. E85-B, no. 12, pp. 2672-2683, December 2002, doi: .
Abstract: This paper proposes a three-step cell search algorithm utilizing a synchronization channel (SCH) and common pilot channel (CPICH) in the forward link for OFCDM (Orthogonal Frequency and Code Division Multiplexing) broadband packet wireless access, and evaluates the cell search time performance by computer simulation. In the proposed three-step cell search algorithm, the OFCDM symbol timing, i.e., Fast Fourier Transform (FFT) window timing is estimated employing SCH or guard interval (GI) correlation in the first step. Then, the frame timing is detected by employing the SCH and the cell-specific scrambling code (CSSC) is identified by the CPICH in the second and third steps, respectively. Computer simulation results elucidate that the proposed three-step cell search algorithm achieves fast cell search time performance, i.e., cell detection probability of 90% within approximately 50 msec, assuming the number of CSSCs of 512 in a 19 hexagonal-cell model. We also clarify that there is no prominent difference in cell search time performance between the two employed SCH structures, time-multiplexed and frequency-multiplexed, assuming that the total transmit power of the SCH is the same. Based on the comparison of four substantial cell search algorithms, the GI-plus-SCH correlation method, in which FFT windowing timing detection, frame timing detection, and CSSC identification are performed by GI correlation, frequency-multiplexed SCH, and CPICH, respectively, exhibits the cell search time of approximately 44 msec at the detection probability of 90% with an optimized averaging parameter in each step.
URL: https://global.ieice.org/en_transactions/communications/10.1587/e85-b_12_2672/_p
Copy
@ARTICLE{e85-b_12_2672,
author={Yukiko ISHII, Kenichi HIGUCHI, Mamoru SAWAHASHI, },
journal={IEICE TRANSACTIONS on Communications},
title={Three-Step Cell Search Algorithm Employing Synchronization and Common Pilot Channels for OFCDM Broadband Wireless Access},
year={2002},
volume={E85-B},
number={12},
pages={2672-2683},
abstract={This paper proposes a three-step cell search algorithm utilizing a synchronization channel (SCH) and common pilot channel (CPICH) in the forward link for OFCDM (Orthogonal Frequency and Code Division Multiplexing) broadband packet wireless access, and evaluates the cell search time performance by computer simulation. In the proposed three-step cell search algorithm, the OFCDM symbol timing, i.e., Fast Fourier Transform (FFT) window timing is estimated employing SCH or guard interval (GI) correlation in the first step. Then, the frame timing is detected by employing the SCH and the cell-specific scrambling code (CSSC) is identified by the CPICH in the second and third steps, respectively. Computer simulation results elucidate that the proposed three-step cell search algorithm achieves fast cell search time performance, i.e., cell detection probability of 90% within approximately 50 msec, assuming the number of CSSCs of 512 in a 19 hexagonal-cell model. We also clarify that there is no prominent difference in cell search time performance between the two employed SCH structures, time-multiplexed and frequency-multiplexed, assuming that the total transmit power of the SCH is the same. Based on the comparison of four substantial cell search algorithms, the GI-plus-SCH correlation method, in which FFT windowing timing detection, frame timing detection, and CSSC identification are performed by GI correlation, frequency-multiplexed SCH, and CPICH, respectively, exhibits the cell search time of approximately 44 msec at the detection probability of 90% with an optimized averaging parameter in each step.},
keywords={},
doi={},
ISSN={},
month={December},}
Copy
TY - JOUR
TI - Three-Step Cell Search Algorithm Employing Synchronization and Common Pilot Channels for OFCDM Broadband Wireless Access
T2 - IEICE TRANSACTIONS on Communications
SP - 2672
EP - 2683
AU - Yukiko ISHII
AU - Kenichi HIGUCHI
AU - Mamoru SAWAHASHI
PY - 2002
DO -
JO - IEICE TRANSACTIONS on Communications
SN -
VL - E85-B
IS - 12
JA - IEICE TRANSACTIONS on Communications
Y1 - December 2002
AB - This paper proposes a three-step cell search algorithm utilizing a synchronization channel (SCH) and common pilot channel (CPICH) in the forward link for OFCDM (Orthogonal Frequency and Code Division Multiplexing) broadband packet wireless access, and evaluates the cell search time performance by computer simulation. In the proposed three-step cell search algorithm, the OFCDM symbol timing, i.e., Fast Fourier Transform (FFT) window timing is estimated employing SCH or guard interval (GI) correlation in the first step. Then, the frame timing is detected by employing the SCH and the cell-specific scrambling code (CSSC) is identified by the CPICH in the second and third steps, respectively. Computer simulation results elucidate that the proposed three-step cell search algorithm achieves fast cell search time performance, i.e., cell detection probability of 90% within approximately 50 msec, assuming the number of CSSCs of 512 in a 19 hexagonal-cell model. We also clarify that there is no prominent difference in cell search time performance between the two employed SCH structures, time-multiplexed and frequency-multiplexed, assuming that the total transmit power of the SCH is the same. Based on the comparison of four substantial cell search algorithms, the GI-plus-SCH correlation method, in which FFT windowing timing detection, frame timing detection, and CSSC identification are performed by GI correlation, frequency-multiplexed SCH, and CPICH, respectively, exhibits the cell search time of approximately 44 msec at the detection probability of 90% with an optimized averaging parameter in each step.
ER -
English
