Advanced Search
Volume 30 Issue 3
Dec.  2010
Turn off MathJax
Article Contents
Liu Qing-ge, Shao Ding-rong, Li Shu-jian. General Quadratic Prime Codes[J]. Journal of Electronics & Information Technology, 2008, 30(3): 652-655. doi: 10.3724/SP.J.1146.2006.01194
Citation: Liu Qing-ge, Shao Ding-rong, Li Shu-jian. General Quadratic Prime Codes[J]. Journal of Electronics & Information Technology, 2008, 30(3): 652-655. doi: 10.3724/SP.J.1146.2006.01194

General Quadratic Prime Codes

doi: 10.3724/SP.J.1146.2006.01194
  • Received Date: 2006-08-14
  • Rev Recd Date: 2007-06-18
  • Publish Date: 2008-03-19
  • 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.
  • loading
  • 梅文华, 王淑波, 邱永红等. 跳频通信[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.
  • 加载中

Catalog

    通讯作者: 陈斌, bchen63@163.com
    • 1. 

      沈阳化工大学材料科学与工程学院 沈阳 110142

    1. 本站搜索
    2. 百度学术搜索
    3. 万方数据库搜索
    4. CNKI搜索

    Article Metrics

    Article views (2779) PDF downloads(711) Cited by()
    Proportional views
    Related

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return