A new approach to rapid PN code acquisition using iterative message passing techniques

Authors:
K. M. Chugg;Mingrui Zhu
Affiliations:
Dept. of Electr. Eng., Univ. of Southern California, Los Angeles, CA, USA;-
Venue:
IEEE Journal on Selected Areas in Communications
Year:
2006

Citing 0
Cited 8

An Iterative Algorithm and Low Complexity Hardware Architecture for Fast Acquisition of Long PN Codes in UWB Systems

Journal of VLSI Signal Processing Systems
An Analog/Digital Baseband Processor Design of a UWB Channelized Receiver for Transmitted Reference Signals

Journal of VLSI Signal Processing Systems
A self-synchronizing method for asynchronous code acquisition in band-limited spread spectrum communications

IEEE Transactions on Communications
Initial acquisition performance of the multiple receive antenna assisted DS-UWB downlink using search space reduction and iterative code phase estimation

IEEE Transactions on Wireless Communications
Generalized zero-padding scheme for direct GPS P-code acquisition

IEEE Transactions on Wireless Communications
Rapid acquisition of gold codes and related sequences using iterative message passing on redundant graphical models

MILCOM'06 Proceedings of the 2006 IEEE conference on Military communications
Iterative signal processing for blind code phase acquisition of CDMA 1x signals for radio spectrum monitoring

Journal of Electrical and Computer Engineering - Special issue on iterative signal processing in communications
PN Code Acquisition Using Belief Propagation with Adaptive Parity Check Matrix

Wireless Personal Communications: An International Journal

Quantified Score

Hi-index	0.07

Visualization

Abstract

Iterative message passing algorithms on graphs, which are generalized from the well-known turbo decoding algorithm, have been studied intensively in recent years because they can provide near-optimal performance and significant complexity reduction. In this paper, we demonstrate that this technique can be applied to pseudorandom code acquisition problems as well. To do this, we represent good pseudonoise (PN) patterns using sparse graphical models, then apply the standard iterative message passing algorithms over these graphs to approximate maximum-likelihood synchronization. Simulation results show that the proposed algorithm achieves better performance than both serial and hybrid search strategies in that it works at low signal-to-noise ratios and is much faster. Compared with full parallel search, this approach typically provides significant complexity reduction.