By Topic

Rapid Acquisition of Gold Codes and Related Sequences Using Iterative Message Passing on Redundant Graphical Models

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Principe, F. ; Dipartimento Ingegneria dell''Informazione, University of Pisa, Pisa 56122 - Italy. E-mail: fabio.principe@iet.unipi.it ; Chugg, K.M. ; Luise, M.

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-to-noise 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.

Published in:

Military Communications Conference, 2006. MILCOM 2006. IEEE

Date of Conference:

23-25 Oct. 2006