具有最佳相关性和极大线性复杂度的CDMA序列  

CDMA Sequences with Optimal Correlation and Large Linear Span

作　　者：黄泽明[1] 李超[1] 

机构地区：[1]国防科技大学数学与系统科学系,湖南长沙410073

出　　处：《应用科学学报》2007年第4期348-353,共6页Journal of Applied Sciences

基　　金：国家自然科学基金(60573028);国家"863"高技术研究发展计划(2006AA701416)资助项目

摘　　要：Helleseth-Gong(HG)序列是一类具有理想自相关性的无线通信系统码分多址(CDMA)序列.对奇素数p和整数n,m,d满足n=(2d+1)m,本文利用有限域上的二次型理论和迹变换的性质在HG序列基础上构造一类序列数目众多,具有最佳相关性的非平衡p元CDMA序列族,其最佳相关性用Welch下界来衡量.同样,对偶数n=2(2d+1)m,在改进非平衡p元CDMA序列族基础上利用有限域上的迹变换构造了一类序列数目众多,具有最佳相关性的平衡p元CDMA序列族.文章证明了这两类CDMA序列族中的序列都具有大的周期与线性复杂度,适合在无线通信信道上传输.The Helleseth-Gong （HG） sequence is a kind of CDMA sequences used in wireless communication systems with ideal autocorrelation. For an odd prime p and integers n, m, d satisfying n = （2d ＋ 1 ） m, using the theory of quadratic forms and properties of trace transform over finite field, a new unbalanced p-ary CDMA sequence family with large family size and optimal correlation property is constructed based on HG sequences, which means the family has optimal correlation in terms of Welch＇ s lower bound. Similarly, for an even number n = 2 （2 d ＋ 1 ） m, using the trace transform, a family of balanced p-ary CDMA sequences with large family size has the property of optimal correlation, which is constructed from the unbalanced p-ary CDMA sequence family. It is shown that the two CDMA sequence families have large period and linear span, and are suitable for transmission in wireless communication systems.

关 键 词：p元序列 最佳相关性 平衡序列 线性复杂度 

分 类 号：TN918.1[电子电信—通信与信息系统]