广义平方素数码

刘青格; 邵定蓉; 李署坚

doi:10.3724/SP.J.1146.2006.01194

广义平方素数码

doi: 10.3724/SP.J.1146.2006.01194

计量
- 文章访问数: 2794
- HTML全文浏览量: 93
- PDF下载量: 711
- 被引次数: 0
出版历程
- 收稿日期: 2006-08-14
- 修回日期: 2007-06-18
- 刊出日期: 2008-03-19

General Quadratic Prime Codes

摘要

摘要: 基于有限扩域与有限基域的对应关系,该文将素数码的构造思想延伸到有限扩域,基于有限扩域乘法,以一般二次既约多项式为模,构造出一类周期增大、序列数目增多的跳频序列族广义平方素数码,该码具有理想汉明自相关特性和最大互相关值为2的几乎理想的汉明互相关特性。通过分组,得到具有最大互相关值为1的理想汉明互相关特性的跳频序列组。
- 素数码; 跳频序列; 广义平方素数码; 有限扩域
Abstract: Based on the relationship between the extension Galois fields and the prime Galois fields, this paper presents a new construction of frequency-hopping sequences, here designated as general quadratic prime codes, by expanding the construct idea of prime codes to extension Galois fields. Taking a general quadratic irreducible polynomial as the module and based on the multiplication of extension Galois fields, quadratic prime codes with more sequences and longer period possess ideal Hamming autocorrelation and nearly ideal Hamming cross-correlation properties of no greater than two. Furthermore, general quadratic prime codes can be further partitioned to get frequency hopping sequences groups in which the maximum Hamming cross-correlation between any two FH sequences in the same group is at most one.

HTML全文

参考文献(1)

梅文华, 王淑波, 邱永红等. 跳频通信[M]. 北京: 国防工业出版社, 2005: 28-84.Mei W H, Wang S B, and Qiu Y H. Frequency HoppingCommunications [M]. Beijing: China National DefenseIndustry Press, 2005: 28-84.[2]Dixon R C. Spread Spectrum Systems [M]. 2nd Ed. New York:John-Wiley Sons, 1976: 26-38.[3]梅文华, 杨义先, 周炯槃. 跳频序列设计理论的研究进展 [J].通信学报, 2003, 24(2): 92-101.Mei W H, Yang Y X, and Zhou Q P. Survey of theoreticalbounds and practical constructions for frequency hoppingsequences [J]. Journal of China Institute of Communications,2003, 24(2): 92-101.[4]彭代渊. 新型扩频序列及其理论界研究[D]. 成都: 西南交通大学, 2005: 81-101.Peng D Y. Investigation of novel spreading sequences andtheir theoretical bounds. Chengdu: Southwest JiaotongUniversity, 2005: 81-101.[5]Titlebaum E L. Time-frequency hop signals Part I: Codingbased upon the theory of linear congruences[J]. IEEE Trans.on AES, 1981, 17(4): 490-493.[6]Shaar A A and Davies P A. Prime sequences: quasi-optimalsequences for OR channel code division multiplexing [J].Electronics Letters.1983, 19(21):888-890[7]Kwong W C, Yang G C, and Zhang J G. 2n prime codes andcoding architecture for optical code-division multiple- access[J].IEEE Trans. on Communications.1996, 44(9):1152-1162[8]Yang G C and Kwong W C. Prime Codes with Applicationsto CDMA Optical and Wireless Networks [M]. London:Artech House, 2002: 43-111.[9]Chi-Fu Hong and Guu-Chang Yang. Concatenated primecodes [J].IEEE Communications Letters.1999, 3(9):260-262[10]Rudolf L and Harald N. Finite Fields [M]. In Encyclopedia ofMathematics and Its Applications, vol. 20, Reading, MA:Addison-Wesley, 1983: 18-107.

施引文献

资源附件(0)

访问统计