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 Tc/Δ, Δ=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.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copy
Sergei BYCHENKOV, Vladimir MIKHAILOV, Kohichi SAKANIWA, "Fast Acquisition of PN Sequences in DS-CDMA Systems with Incoherent Demodulator" in IEICE TRANSACTIONS on Communications,
vol. E89-B, no. 12, pp. 3319-3334, December 2006, doi: 10.1093/ietcom/e89-b.12.3319.
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 Tc/Δ, Δ=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.
URL: https://global.ieice.org/en_transactions/communications/10.1093/ietcom/e89-b.12.3319/_p
Copy
@ARTICLE{e89-b_12_3319,
author={Sergei BYCHENKOV, Vladimir MIKHAILOV, Kohichi SAKANIWA, },
journal={IEICE TRANSACTIONS on Communications},
title={Fast Acquisition of PN Sequences in DS-CDMA Systems with Incoherent Demodulator},
year={2006},
volume={E89-B},
number={12},
pages={3319-3334},
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 Tc/Δ, Δ=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.},
keywords={},
doi={10.1093/ietcom/e89-b.12.3319},
ISSN={1745-1345},
month={December},}
Copy
TY - JOUR
TI - Fast Acquisition of PN Sequences in DS-CDMA Systems with Incoherent Demodulator
T2 - IEICE TRANSACTIONS on Communications
SP - 3319
EP - 3334
AU - Sergei BYCHENKOV
AU - Vladimir MIKHAILOV
AU - Kohichi SAKANIWA
PY - 2006
DO - 10.1093/ietcom/e89-b.12.3319
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E89-B
IS - 12
JA - IEICE TRANSACTIONS on Communications
Y1 - December 2006
AB - 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 Tc/Δ, Δ=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.
ER -