Journal of Beijing University of Posts and Telecommunications

  • EI核心期刊

JOURNAL OF BEIJING UNIVERSITY OF POSTS AND TELECOM ›› 2010, Vol. 33 ›› Issue (1): 38-42.doi: 10.13190/jbupt.201001.38.haoyl

• Papers • Previous Articles     Next Articles

A Gold Code Factor Graph Iterative Acquisition Method

HAO Yan-ling;DENG Zhi-xin   

  1. (Automation School, Harbin Engineering University, Harbin 150001, China)
  • Received:2009-04-24 Revised:2009-06-14 Online:2010-02-28 Published:2010-02-28
  • Contact: DENG Zhi-xin

Abstract:

To decrease the acquisition time and complexity of Gold code acquisition, m-sequence iterative acquisition algorithm is applied to Gold code. In considering global position system (GPS) C/A code, a group of sparse check relations are found according to creating polynomials of Gold code. And for the purpose of decreasing the complexity of iterative computation, the ordinal check and mixed check method are proposed. Finally, the influences on iterative acquisition performance made by different check relations and different check method are verified by simulation, it shows that the ordinal check with degressive iterative number is getting optimized and effectively decrease the complexity and acquisition time.

Key words: Gold code, iterative acquision, factor graphs, ordinal check, mixed check

CLC Number: