一种生成平衡Gold序列的算法  

An Algorithm of Generating Balanceable Gold Sequence

作　　者：樊炳亮[1] 李晓辉[1] 

机构地区：[1]安徽大学电子科学与技术学院,安徽合肥230039

出　　处：《微机发展》2005年第9期18-20,共3页Microcomputer Development

基　　金：安徽省自然科学基金资助项目(03042209)

摘　　要：文中在分析m序列、m序列优选对、Gold序列以及平衡Gold序列产生方法的基础上,提出了一种计算机搜索平衡Gold序列方法。该方法首先用相关验证产生m序列优选对,然后用循环移位模二加生成Gold序列,最后搜索得到平衡Gold序列。结果表明该方法简练,易于工程应用。On the basis of analyzing the generating of m sequences optimum pairs and balaneeable Gold sequences, a method of producing balanceable Gold sequence by computer is presented. At first,m sequence optimum pairs are generated by correlation verifying, then Gold sequences are made, finally balanceable Gold sequences are searched. The result shows that it is concise and practical by contrasting with other methods.

关 键 词：码分多址 互相关特性 平衡Gold序列 

分 类 号：TN929.533[电子电信—通信与信息系统] TP301.6[电子电信—信息与通信工程]