SHERP

Fast Slot Synchronization for Intercell Asynchronous DS/CDMA Systems

Cited 0 time in webofscience Cited 0 time in scopus
Authors
Jeong, Yeon Kyoon; Shin, Oh-Soon; Lee, Kwang Bok
Issue Date
2002-04
Publisher
Institute of Electrical and Electronics Engineers (IEEE)
Citation
IEEE Trans. Wireless Commun., vol. 1, pp. 353-360, April 2002
Keywords
Acquisitioncell searchdifferentially coherent combiningintercell asynchronous direct sequence-code division multiple access systemslot synchronization
Description
Manuscript received August 4, 2000; revised January 17, 2001; accepted January
17, 2001. The editor coordinating the review of this paper and approving it
for publication is Q. Bi.
Abstract
Slot synchronization is a critical step for fast and
reliable cell search in intercell asynchronous direct sequence-code
division multiple access systems. To increase reliability, observations
over a number of slots may be combined. In this paper,
combining schemes of multiple observations are studied for
slot synchronization. The optimal combining rule is determined
based on detection theory. It is found that two known combining
schemes correspond to special cases of the optimal combining.
These schemes may not work well in typical environments, since
the schemes are optimized for specific environments. To improve
slot synchronization performance in typical environments, a new
combining scheme is proposed in this paper. The performance
of the proposed combining scheme as well as other combining
schemes is analyzed for Rayleigh fading channels with frequency
offset. Numerical analysis shows that the proposed combining
scheme significantly outperforms other combining schemes in
typical environments.
ISSN
1536-1276
Language
English
URI
http://hdl.handle.net/10371/7452
DOI
https://doi.org/10.1109/7693.994829
Files in This Item:
Appears in Collections:
College of Engineering/Engineering Practice School (공과대학/대학원)Dept. of Electrical and Computer Engineering (전기·정보공학부)Journal Papers (저널논문_전기·정보공학부)
  • mendeley

Items in S-Space are protected by copyright, with all rights reserved, unless otherwise indicated.

Browse