Name
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 examines a recently proposed fast acquisition algorithm for a class of PN sequences, which includes m and GMW sequences as special cases, under conditions of unknown received RF phase and chip boundary timing. The result shows that under low input (chip) SNR and the required delay estimation accuracy of T-c/Delta, Delta = 2, 3, ..., the mean acquisition time can be considerably reduced compared to other known representative acquisition schemes. 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, estimated as 2/3 of the equivalent parallel correlators system. It can be applied as a (part of) acquisition scheme of a DS-CDMA system instead of a slow sliding correlator or a costly matched filter schemes. |
Year | DOI | Venue |
|---|---|---|
2006 | 10.1093/ietcom/e89-b.12.3319 | IEICE TRANSACTIONS ON COMMUNICATIONS |
Keywords | Field | DocType |
fast acquisition, PN sequence, decomposition of sequences, component sequence, DS-CDMA | Correlation function (quantum field theory),Demodulation,Cdma systems,Computer science,Signal-to-noise ratio,Algorithm,Chip,Matched filter,Estimation theory,Code division multiple access,Distributed computing,Embedded system | Journal |
Volume | Issue | ISSN |
E89B | 12 | 0916-8516 |
Citations | PageRank | References |
1 | 0.43 | 0 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Sergei Bychenkov | 1 | 1 | 0.77 |
| Vladimir Mikhailov | 2 | 1 | 1.11 |
| Kohichi Sakaniwa | 3 | 330 | 47.69 |