Journal of Beijing University of Posts and Telecommunications

  • EI核心期刊

JOURNAL OF BEIJING UNIVERSITY OF POSTS AND TELECOM ›› 2006, Vol. 29 ›› Issue (3): 107-109.doi: 10.13190/jbupt.200603.107.011

• Reports • Previous Articles     Next Articles

A New Accelerating Iterative Algorithm for Constructing Cascade No Sequences

CHEN Jia-xing 1,3, XU Cheng-qian2, ZHOU Ting-xian3   

  1. 1. Department of electronic, Hebei Normal University, Shijiazhuang, 050031, China;
    2. School of Information Science and Engineering, Yanshan University, Qinhuangdao 066004, China
    3. Communication Research Center, Harbin Institute of Technology, Harbin 150001, China)
  • Received:2005-03-15 Revised:1900-01-01 Online:2006-06-30 Published:2006-06-30
  • Contact: CHEN Jia-xing

PDF

437

Abstract:

Cascade No sequences are a family of sequences which comprise cascade GMW sequences and have optimal correlation properties and large linear span. By studying cascade No sequences and shift sequences, an accelerating iterative algorithm for constructing cascade No sequences is presented. The algorithm adopts iterative method, the cascade No sequences with any period can be constructed quickly by using cascade GMW sequences and shift sequences of the small set of Kasami sequences. It is easy for understanding and implementing.

Key words: shift sequences, cascade Gordon-Mills-Welch(GMW) sequences, cascade No sequences

CLC Number: 

Copyright © 2018 Journal of Beijing University of Posts and Telecommunications 京ICP备14033833号

Adress: BEIJING UNIVERSITY OF POSTS AND TELECOMMUNICATIONS    Post Code: 100876    Tel: (010)62281995    QQ: 307514248    weibo    Message    E-mail: byxb@bupt.edu.cn