Experiments on Fast Cell Search Algorithm Using Scrambling Code Masking for Inter-Cell Asynchronous W-CDMA System

Kenichi HIGUCHI; Mamoru SAWAHASHI; Fumiyuki ADACHI

Experiments on Fast Cell Search Algorithm Using Scrambling Code Masking for Inter-Cell Asynchronous W-CDMA System

Kenichi HIGUCHI, Mamoru SAWAHASHI, Fumiyuki ADACHI

Full Text Views

0

Cite this

Summary :

This paper presents the fast cell search time performance based on laboratory and field experiments of a 2-step cell search algorithm that uses scrambling code masking for inter-cell asynchronous wideband DS-CDMA (W-CDMA) mobile radio. The scrambling code is masked at different time positions during each scrambling period on the forward-link common control channel (CCH) to detect the scrambling code timing at the mobile receiver. Experiments were conducted using the CCH-to-dedicated traffic channel (DTCH) power ratio, R of 3 dB, 10 DTCHs, and 16 scrambling codes in a single-cell and two-cell models. The field experimental results show that the cell search time of about 600 msec was achieved in vehicular environments at the detection probability of 90% and the average received E_b/N₀ (N₀ is the background noise without interference) of 13-15 dB for DTCH, even in the worst case scenario when the received signal power ratios of the CCH from two cell sites were 0 dB. The cell search time that was achieved with the 3-step cell search algorithm previously proposed by the authors is estimated from the experimental results; the cell search can be accomplished within about 720 msec at a probability of 96% for 512 scrambling codes and 16 scrambling code groups.

Publication: IEICE TRANSACTIONS on Fundamentals Vol.E83-A No.11 pp.2102-2109

Publication Date: 2000/11/25

Publicized

Online ISSN

DOI

Type of Manuscript: Special Section PAPER (Special Section on Spread Spectrum Techniques and Applications)

Category

Cite this

Copy

Kenichi HIGUCHI, Mamoru SAWAHASHI, Fumiyuki ADACHI, "Experiments on Fast Cell Search Algorithm Using Scrambling Code Masking for Inter-Cell Asynchronous W-CDMA System" in IEICE TRANSACTIONS on Fundamentals, vol. E83-A, no. 11, pp. 2102-2109, November 2000, doi: .
Abstract: This paper presents the fast cell search time performance based on laboratory and field experiments of a 2-step cell search algorithm that uses scrambling code masking for inter-cell asynchronous wideband DS-CDMA (W-CDMA) mobile radio. The scrambling code is masked at different time positions during each scrambling period on the forward-link common control channel (CCH) to detect the scrambling code timing at the mobile receiver. Experiments were conducted using the CCH-to-dedicated traffic channel (DTCH) power ratio, R of 3 dB, 10 DTCHs, and 16 scrambling codes in a single-cell and two-cell models. The field experimental results show that the cell search time of about 600 msec was achieved in vehicular environments at the detection probability of 90% and the average received E_b/N₀ (N₀ is the background noise without interference) of 13-15 dB for DTCH, even in the worst case scenario when the received signal power ratios of the CCH from two cell sites were 0 dB. The cell search time that was achieved with the 3-step cell search algorithm previously proposed by the authors is estimated from the experimental results; the cell search can be accomplished within about 720 msec at a probability of 96% for 512 scrambling codes and 16 scrambling code groups.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e83-a_11_2102/_p

Copy

@ARTICLE{e83-a_11_2102,
author={Kenichi HIGUCHI, Mamoru SAWAHASHI, Fumiyuki ADACHI, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Experiments on Fast Cell Search Algorithm Using Scrambling Code Masking for Inter-Cell Asynchronous W-CDMA System},
year={2000},
volume={E83-A},
number={11},
pages={2102-2109},
abstract={This paper presents the fast cell search time performance based on laboratory and field experiments of a 2-step cell search algorithm that uses scrambling code masking for inter-cell asynchronous wideband DS-CDMA (W-CDMA) mobile radio. The scrambling code is masked at different time positions during each scrambling period on the forward-link common control channel (CCH) to detect the scrambling code timing at the mobile receiver. Experiments were conducted using the CCH-to-dedicated traffic channel (DTCH) power ratio, R of 3 dB, 10 DTCHs, and 16 scrambling codes in a single-cell and two-cell models. The field experimental results show that the cell search time of about 600 msec was achieved in vehicular environments at the detection probability of 90% and the average received E_b/N₀ (N₀ is the background noise without interference) of 13-15 dB for DTCH, even in the worst case scenario when the received signal power ratios of the CCH from two cell sites were 0 dB. The cell search time that was achieved with the 3-step cell search algorithm previously proposed by the authors is estimated from the experimental results; the cell search can be accomplished within about 720 msec at a probability of 96% for 512 scrambling codes and 16 scrambling code groups.},
keywords={},
doi={},
ISSN={},
month={November},}

Copy

TY - JOUR
TI - Experiments on Fast Cell Search Algorithm Using Scrambling Code Masking for Inter-Cell Asynchronous W-CDMA System
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 2102
EP - 2109
AU - Kenichi HIGUCHI
AU - Mamoru SAWAHASHI
AU - Fumiyuki ADACHI
PY - 2000
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E83-A
IS - 11
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - November 2000
AB - This paper presents the fast cell search time performance based on laboratory and field experiments of a 2-step cell search algorithm that uses scrambling code masking for inter-cell asynchronous wideband DS-CDMA (W-CDMA) mobile radio. The scrambling code is masked at different time positions during each scrambling period on the forward-link common control channel (CCH) to detect the scrambling code timing at the mobile receiver. Experiments were conducted using the CCH-to-dedicated traffic channel (DTCH) power ratio, R of 3 dB, 10 DTCHs, and 16 scrambling codes in a single-cell and two-cell models. The field experimental results show that the cell search time of about 600 msec was achieved in vehicular environments at the detection probability of 90% and the average received E_b/N₀ (N₀ is the background noise without interference) of 13-15 dB for DTCH, even in the worst case scenario when the received signal power ratios of the CCH from two cell sites were 0 dB. The cell search time that was achieved with the 3-step cell search algorithm previously proposed by the authors is estimated from the experimental results; the cell search can be accomplished within about 720 msec at a probability of 96% for 512 scrambling codes and 16 scrambling code groups.
ER -