Wireless Personal Communications

, Volume 71, Issue 4, pp 3105–3113

PN Code Acquisition Using Belief Propagation with Adaptive Parity Check Matrix



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.


PN code acquisition Belief propagation (BP) Adaptive parity check matrix 


  1. 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. 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.Google Scholar
  3. 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.CrossRefGoogle Scholar
  4. 4.
    Yang, L. L., & Hanzo, L. (2004). Acquisition of m-sequences using recursive soft sequential estimation. IEEE Transactions on Communications, 52(2), 199–204.CrossRefGoogle Scholar
  5. 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.MathSciNetCrossRefGoogle Scholar
  6. 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).Google Scholar
  7. 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.MATHCrossRefGoogle Scholar
  8. 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.MathSciNetCrossRefGoogle Scholar
  9. 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.MathSciNetCrossRefGoogle Scholar
  10. 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.MATHCrossRefGoogle Scholar
  11. 11.
    Casado, A. I., Girot, M., & Wesel, R. D. (2010). LDPC decoders with informed dynamic scheduling. IEEE Transactions on Communications, 58(12), 3470–3479.CrossRefGoogle Scholar
  12. 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.CrossRefGoogle Scholar
  13. 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.CrossRefGoogle Scholar
  14. 14.
    Sharon, E., Ashikhmin, A., & Litsyn, S. (2006). EXIT functions for binary input memoryless symmetric channels. IEEE Transactions on Communications, 54(7), 1207–1214.CrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media New York 2013

Authors and Affiliations

  1. 1.Department of Electronic EngineeringTsinghua UniversityBeijingChina

Personalised recommendations