PN Code Acquisition Using Belief Propagation with Adaptive Parity Check Matrix

Authors:
Jiaqi Zhang;Yukui Pei;Ning Ge
Affiliations:
Department of Electronic Engineering, Tsinghua University, Beijing, China 100084;Department of Electronic Engineering, Tsinghua University, Beijing, China 100084;Department of Electronic Engineering, Tsinghua University, Beijing, China 100084
Venue:
Wireless Personal Communications: An International Journal
Year:
2013

Citing 9
Cited 0

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

Journal of VLSI Signal Processing Systems
LDPC decoders with informed dynamic scheduling

IEEE Transactions on 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
Dual-folding based rapid search method for long PN-code acquisition

IEEE Transactions on Wireless Communications - Part 2
Theoretical analysis of a correlation attack based on convolutional codes

IEEE Transactions on Information Theory
Iterative Soft-Input Soft-Output Decoding of Reed–Solomon Codes by Adapting the Parity-Check Matrix

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

IEEE Transactions on Information Theory
Construction of Quasi-Cyclic LDPC Codes for AWGN and Binary Erasure Channels: A Finite Field Approach

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

Quantified Score

Hi-index	0.00

Visualization

Abstract

Pseudonoise (PN) code acquisition technique based on iterative message passing algorithm (iMPA) has been proposed due to its short acquisition time and low complexity. However, the cyclic and regular nature of constructed tanner graph makes it difficult to achieve promising performance. To address this problem, this correspondence proposes a new message passing algorithm based on adaptive parity check matrix. We find multiple sets of linear sparse constraints for PN sequence by squaring the generator polynomial. The topology of the graphic models as well as the parity check matrix is adapted every a few iterations to avoid local optima. The performance of proposed algorithm is evaluated in terms of detection probability. Simulation results show that this method provides more than 3 dB gains over iMPA with fixed parity check matrix.