用递推法查找伪随机码和本原多项式  

Finding pseudo noise code with recurrence method and primitive polynomial

作　　者：吴明捷[1] 田小平[1] 胡鑫[1] 

机构地区：[1]北京石油化工学院通信工程系,北京102617

出　　处：《辽宁工程技术大学学报（自然科学版）》2005年第1期89-92,共4页Journal of Liaoning Technical University (Natural Science)

基　　金：北京市教育委员会科技发展计划基金资助项目(Z02-06)

摘　　要：为适应扩频通信的广泛应用,寻找快速查找伪随机码和本原多项式的方法。通过分析伪随机码的产生过程,提出利用“递推法”查找任意长度的 m 系列伪随机码和本原多项式的方法,并借助 MATLAB 语言将“递推法”实现。寻找到了全部小于 19 阶的共计 48 793 个伪随机码和本原多项式,并更正和补充了某些参考文献中的部分数据,建立了伪随机码和本原多项式库,可供科技工作者随时使用参考。To adapt to the wide application of spread spectrum communication, people request to acquire more and better pseudo noise code. To quickly find pseudo noise code and primitive polynomial, research workers always search. Through analyzing the process of generating pseudo noise code, this paper provides a method which using recursive method to find pseudo noise code of m series and primitive polynomial in arbitrary length, and realizes it by MATLAB language. At last, with this method all together to 48793 pseudo noise code and primitive polynomial are found whose ranks are smaller than 19 ranks and together some data of conference are corrected. At the same time, in order to offer use and reference to research workers at any time, we establish base of pseudo noise code and primitive polynomial.

关 键 词：伪随机码 本原多项式 m系列 扩频通信 查找 MATLAB语言 数据 递推法 分数 科技工作者 

分 类 号：N941.4[自然科学总论—系统科学] G633[文化科学—教育学]