Abstract | ||
---|---|---|
DS/CDMA systems employing long-period PN sequences are becoming a widespread standard of wireless communication systems. However, fast acquisition of long-period PN sequences at a low hardware cost is conventionally a difficult problem. This paper proposes a new fast acquisition algorithm for a class of PN sequences, which includes m- and GMW sequences as special cases, and shows that the mean (correct) acquisition time can be considerably reduced under input SNR values well below those used in modern DS/CDMA systems. Its fast acquisition capability is based on a decomposition of long PN sequences into a number of short ones and achieves a significantly reduced code phase uncertainty of acquisition at relatively small hardware cost. It can be applied as a (part of) acquisition system of a DS/CDMA system instead of a slow sliding correlator or a costly matched filter. |
Year | Venue | Keywords |
---|---|---|
2002 | IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES | fast acquisition, PN sequence, decomposition of sequences, component sequence, DS/CDMA |
DocType | Volume | Issue |
Journal | E85A | 11 |
ISSN | Citations | PageRank |
0916-8508 | 0 | 0.34 |
References | Authors | |
0 | 3 |
Name | Order | Citations | PageRank |
---|---|---|---|
Sergei Bychenkov | 1 | 1 | 0.77 |
Vladimir Mikhailov | 2 | 1 | 1.11 |
Kohichi Sakaniwa | 3 | 330 | 47.69 |