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

Authors:
Fabio Principe;Keith M. Chugg;Marco Luise
Affiliations:
Dipartimento Ingegneria dell'Informazione, University of Pisa, Pisa, Italy;Communication Sciences Institute, University of Southern California, Los Angeles, CA;Dipartimento Ingegneria dell'Informazione, University of Pisa, Pisa, Italy
Venue:
MILCOM'06 Proceedings of the 2006 IEEE conference on Military communications
Year:
2006

Citing 5
Cited 1

Iterative Detection: Adaptivity, Complexity Reduction, and Applications

Iterative Detection: Adaptivity, Complexity Reduction, and Applications
An Iterative Algorithm and Low Complexity Hardware Architecture for Fast Acquisition of Long PN Codes in UWB Systems

Journal of VLSI Signal Processing Systems
Factor graphs and the sum-product algorithm

IEEE Transactions on Information Theory
Synchronization of Pseudorandom Signals by Forward-Only Message Passing With Application to Electronic Circuits

IEEE Transactions on Information Theory
A new approach to rapid PN code acquisition using iterative message passing techniques

IEEE Journal on Selected Areas in 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

Quantified Score

Hi-index	0.00

Visualization

Abstract

A recent study, [1], demonstrated that iterative message passing algorithms (iMPAs) can be applied to rapidly acquire pseudo-noise (PN) sequences with low-complexity. Furthermore, a second work, [2], showed that significant benefits can be obtained using redundant graphical models, in case of linear feedback shift register (LFSR) sequences with sparse generator polynomials. Starting from these results, we address the problem of fast detection to Gold codes and LFSR sequences with dense generators. We will prove that these two aspects are closely related, and that, constructing redundant Tanner Graphs (TGs) from sparse higher-degree generator polynomials, it is possible to rapidly acquire these PN sequences at low signal-tonoise ratio (SNR), and with a low complexity. We also propose another distinct approach for acquiring Gold sequences using iterative methods based on a hierarchical model for the two LFSR generators that comprise a Gold code.