Iterative message passing techniques for rapid code acquisition

Authors:
Mingrui Zhu;Keith M. Chugg
Affiliations:
Communication Science Institute, Dept. of Electrical Engineering, University of Southern California, Los Angeles;Communication Science Institute, Dept. of Electrical Engineering, University of Southern California, Los Angeles
Venue:
MILCOM'03 Proceedings of the 2003 IEEE conference on Military communications - Volume I
Year:
2003

Citing 6
Cited 3

Probabilistic reasoning in intelligent systems: networks of plausible inference

Probabilistic reasoning in intelligent systems: networks of plausible inference
Introduction to algorithms

Introduction to algorithms
An Introduction to Spread-Spectrum Communications

An Introduction to Spread-Spectrum Communications
Iterative Detection: Adaptivity, Complexity Reduction, and Applications

Iterative Detection: Adaptivity, Complexity Reduction, and Applications
Shift Register Sequences

Shift Register Sequences
The generalized distributive law

IEEE Transactions on Information Theory

Rapid Hybrid Acquisition of Ultra-Wideband Signals

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

Journal of VLSI Signal Processing Systems
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

Quantified Score

Hi-index	0.00

Visualization

Abstract

Iterative message passing algorithms (MPAs) have found application in a wide range of data detection problems because they can provide near optimal performance and significant complexity reduction. In this paper, we demonstrate that they can be used to efficietly solve the pseudo random code acquisition problem as well. To do this, we represent good pseudo-noise (PN) patterns using sparse graphical models, then apply the standard iterative message passing algonthm over this graph to approximate maximum likelihood synchronization. Simulation results show that this algorithm achieves better performance than traditional serial search code acquisition in the sense that it works at low signal-to-noise ratios (SNRs) and is much faster. Compared to full parallel search, this approach typically provides significant complexity reduction.