Experiments on fast cell search algorithm for intercell asynchronous W-CDMA mobile radio

K. Higuchi, M. Sawahashi, F. Adachi

Research output: Contribution to journalArticlepeer-review

3 Citations (Scopus)

Abstract

Laboratory and field experiment results for a two-step cell search algorithm using scramble code masking for intercell asynchronous W-CDMA mobile radio are presented. The scramble code is masked at different time positions during each scramble period in the forward link common control channel (CCH) for scramble code timing detection at the mobile receiver. 16 scramble codes are used. The cell search time achievable with the authors' recently proposed three-step cell search algorithm is estimated from the experimental results; cell search can be accomplished within approximately 960 ms at a probability of 93% in the case of 512 scramble codes and 16 scramble code groups.

Original languageEnglish
Pages (from-to)1046-1047
Number of pages2
JournalElectronics Letters
Volume35
Issue number13
DOIs
Publication statusPublished - 1999 Jun 24
Externally publishedYes

ASJC Scopus subject areas

  • Electrical and Electronic Engineering

Fingerprint Dive into the research topics of 'Experiments on fast cell search algorithm for intercell asynchronous W-CDMA mobile radio'. Together they form a unique fingerprint.

Cite this