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

K. Higuchi, M. Sawahashi, F. Adachi

研究成果: Article査読

5 被引用数 (Scopus)

抄録

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.

本文言語English
ページ(範囲)1046-1047
ページ数2
ジャーナルElectronics Letters
35
13
DOI
出版ステータスPublished - 1999 6月 24
外部発表はい

ASJC Scopus subject areas

  • 電子工学および電気工学

フィンガープリント

「Experiments on fast cell search algorithm for intercell asynchronous W-CDMA mobile radio」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル