计算机应用 ›› 2013, Vol. 33 ›› Issue (05): 1255-1259.DOI: 10.3724/SP.J.1087.2013.01255

• 网络与通信 • 上一篇    下一篇

序列捕获的序列核变换方法

田竹梅1,吉江2,任国凤1,李海霞1   

  1. 1. 忻州师范学院 电子系,山西 忻州 034000
    2. 国家数字交换系统工程技术研究中心,郑州 450002
  • 收稿日期:2012-11-06 修回日期:2012-12-20 出版日期:2013-05-01 发布日期:2013-05-08
  • 通讯作者: 吉江
  • 作者简介:田竹梅(1980-),女,山西原平人,讲师,硕士,主要研究方向:通信及电子技术;吉江(1983-),男,山西忻州人,博士研究生,主要研究方向:无线通信、物理层安全;任国凤(1979-),女,山西忻州人,讲师,硕士,主要研究方向:信号处理及电子技术;李海霞(1983-),女,山西忻州人,讲师,硕士,主要研究方向:电气自动化、电子技术。
  • 基金资助:

    忻州师范学院院级基金资助项目(201116);忻州师范学院重点课程建设项目

Sequential acquisition method based on sequence core transform

TIAN Zhumei1,JI Jiang2,REN Guofeng1,LI Haixia2   

  1. 1. Department of Electronics, Xinzhou Teachers University, Xizhou Shanxi 034000, China
    2. National Digital Switching System Engineering and Technological Research Center, Zhengzhou Henan 450002, China
  • Received:2012-11-06 Revised:2012-12-20 Online:2013-05-08 Published:2013-05-01
  • Contact: JI Jiang

摘要: 在序列扩频、加扰通信系统中,通常采用连续接收信号并进行滑动相关运算的方法,通过搜索相关峰进行序列捕获,需要接收多个完整周期的序列。随着序列周期的加大,一方面需要花费大量的接收端存储资源,另一方面,相关运算的计算开销会呈指数增长,导致很难实时捕获长周期序列。为解决这一问题,提出了一种序列核变换方法,变换后的每个元素均包含有完整的序列信息,实现了序列信息压缩。然后,基于该变换方法将捕获过程分为序列检测和序列捕获两个阶段,只在检测到目标序列后才开始捕获,进一步降低了计算开销。理论分析和仿真验证表明,算法通过牺牲部分低信噪比环境下的捕获成功率换取了计算资源的大量减少,算法可在一个序列周期内快速捕获不同周期的m序列,并且所节省的计算资源随序列周期变大而增多。

关键词: 序列核变换, 序列捕获, m序列, 离散傅里叶变换

Abstract: The existing sequential acquisition methods search the correlation peak continuously in receiving signals, thus wasting a great deal of calculation resources to search correlation peak in the received signal containing no target sequence. In another case, with the sequence period increasing, the calculation resources perform exponential growth. As a result, the target sequence can be hardly got. In order to reduce the calculation resources, the paper presented a sequence core transform method to acquire the sequence. The method compressed the entire sequence information into the local sequence core, and by this sequence core, the acquiring process was divided into two steps: sequence detection and sequence acquisition. In this process, the calculation resources were reduced because the sequence acquisition only occured in the second step. Furthermore, by using the down-sampling on received signals, the sequence core transform could decrease the sequence amount needed in the acquiring process. The theoretical analysis and simulation results show that, by losing some acquiring performance, the algorithm can reduce the calculation resources to complete acquisition in one sequence period. And the reduced calculation resources increase with the sequence period.

Key words: sequence core transform, sequential acquisition, m sequence, Discrete Fourier Transform (DFT)

中图分类号: