北京邮电大学学报

  • EI核心期刊

北京邮电大学学报 ›› 2006, Vol. 29 ›› Issue (3): 107-109.doi: 10.13190/jbupt.200603.107.011

• 研究报告 • 上一篇    下一篇

一种新的生成级联No序列的快速迭代算法

陈嘉兴1,3, 许成谦2, 周廷显3   

  1. 1. 河北师范大学 电子系, 石家庄 050031; 2. 燕山大学 信息科学与工程学院,秦皇岛 066004;
    3. 哈尔滨工业大学 通信技术研究所, 哈尔滨 150001
  • 收稿日期:2005-03-15 修回日期:1900-01-01 出版日期:2006-06-30 发布日期:2006-06-30
  • 通讯作者: 陈嘉兴

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

摘要:

级联No序列是1类包括级联GMW序列的序列族,且具有理想的互相关性能和大线性复杂度的特点。通过对级联No序列和移位序列的研究,提出了1种新的快速生成级联No序列的算法。该算法采用迭代的方式,借助级联GMW序列和小集合Kasami序列的移位序列可以快速生成任何长度的级联No序列,比以往的生成方法简单易行且易于理解。

关键词: 移位序列, 级联GMW序列, 级联No序列

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

中图分类号: