Skip to main content
SpringerLink
Log in

PN Code Acquisition Using Belief Propagation with Adaptive Parity Check Matrix

  • Published:
Wireless Personal Communications Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3

Similar content being viewed by others

References

  1. Simon, M. K., Omura, J. K., Scholtz, R. A., et al. (2001). Spread spectrum communications handbook (Electronic Edition). NY: McGraw-Hill.

    Google Scholar 

  2. Baek, J., Chong, D., Kim, J., Lee, Y., Kang, S. G., Yoon, S. (2011). Low complexity sequential estimation scheme for pseudo noise code acquisition. IEEE Vehicular Technology Conference (VTC Fall’2011), pp. 1–4.

  3. Chugg, K. M., & Zhu, M. (2005). A new approach to rapid PN code acquisition using iterative message passing techniques. IEEE Journal on Selected Areas in Communications, 23(5), 884–897.

    Article  Google Scholar 

  4. Yang, L. L., & Hanzo, L. (2004). Acquisition of m-sequences using recursive soft sequential estimation. IEEE Transactions on Communications, 52(2), 199–204.

    Article  Google Scholar 

  5. Vigoda, B., Dauwels, J., Frey, M., Gershenfeld, N., Koch, T., Loeliger, H. A., et al. (2006). Synchronization of pseudorandom signals by forward-only message passing with application to electronic circuits. IEEE Transactions on Information Theory, 52(8), 3843–3852.

    Article  MathSciNet  Google Scholar 

  6. Kerr, R., & Lodge, J. (2010, August). Iterative signal processing for blind code phase acquisition of CDMA \(1\times \) signals for radio spectrum monitoring. Journal of Electrical and Computer Engineering, 2010(ID 282493).

  7. Yeung, O. W., & Chugg, K. M. (2006). An iterative algorithm and low complexity hardware architecture for fast acquisition of long PN codes in UWB systems. The Journal of VLSI Signal Processing, 43(1), 25–42.

    Article  MATH  Google Scholar 

  8. Jiang, J., & Narayanan, K. R. (2006). Iterative Soft-Input Soft-Output Decoding of Reed Solomon Codes by Adapting the Parity-Check Matrix. IEEE Transactions on Information Theory, 52(8), 3746–3756.

    Article  MathSciNet  Google Scholar 

  9. Lan, L., Zeng, L., & Tai, Y. Y. (2007). Construction of quasi-cyclic LDPC codes for AWGN and binary erasure channels: A finite field approach. IEEE Transactions on Information Theory, 53(7), 2429–2458.

    Article  MathSciNet  Google Scholar 

  10. Johansson, T., & Honsson, F. (2002). Theoretical analysis of a correlaiton attack based on convolutional codes. IEEE Transactions on Information Theory, 48(8), 2173–2181.

    Article  MATH  Google Scholar 

  11. Casado, A. I., Girot, M., & Wesel, R. D. (2010). LDPC decoders with informed dynamic scheduling. IEEE Transactions on Communications, 58(12), 3470–3479.

    Article  Google Scholar 

  12. Li, H., Cui, X., Lu, M., & Feng, Z. (2008). Dual-folding based rapid search method for longPN code acquisition. IEEE Transaction on Wireless Communications, 7(12), 5286–5296.

    Article  Google Scholar 

  13. Fossorier, M. P. C., Mihaljevic, M., & Imai, H. (1999). Reduced complexity iterative decoding of low-density parity check codes based on belief propagation. IEEE Transactions on Communications, 47(5), 673–680.

    Article  Google Scholar 

  14. Sharon, E., Ashikhmin, A., & Litsyn, S. (2006). EXIT functions for binary input memoryless symmetric channels. IEEE Transactions on Communications, 54(7), 1207–1214.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Electronic Engineering, Tsinghua University, Beijing, 100084, China

    Jiaqi Zhang, Yukui Pei & Ning Ge

Authors
  1. Jiaqi Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yukui Pei
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Ning Ge
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Jiaqi Zhang.

Additional information

This work is supported by the National Nature Science Foundation of China No. 60972019 and No. 61132002 and Science Fund for Creative Research Groups of NSFC(No. 61021001).

Rights and permissions

Reprints and permissions

About this article

Cite this article

Zhang, J., Pei, Y. & Ge, N. PN Code Acquisition Using Belief Propagation with Adaptive Parity Check Matrix. Wireless Pers Commun 71, 3105–3113 (2013). https://doi.org/10.1007/s11277-013-0993-3

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11277-013-0993-3

Keywords

Search

Navigation