| 含错扰码序列的快速恢复 |
| |
| 引用本文： | 伍文君,黄芝平,唐贵林,刘纯武.含错扰码序列的快速恢复[J].兵工学报,2009,30(8):1134-1138. |
| |
| 作者姓名： | 伍文君 黄芝平 唐贵林 刘纯武 |
| |
| 作者单位： | 国防科学技术大学,机电工程与自动化学院,湖南,长沙,410073;国防科学技术大学,机电工程与自动化学院,湖南,长沙,410073;国防科学技术大学,机电工程与自动化学院,湖南,长沙,410073;国防科学技术大学,机电工程与自动化学院,湖南,长沙,410073 |
| |
| 摘 要： | 对含错扰码序列的快速恢复问题进行探讨。采用Walsh变换法对扰码序列的生成多项式进行了测定。该方法较穷举法，计算复杂度大为降低。采用快速相关算法中的算法A对扰码序列的初态进行恢复。改进了算法A，使用不同于原算法的校验方程构造方法，使得新算法的性能不再受制于生成多项式的抽头数，同时保持了原算法计算复杂度低及实现简单的特点。
|
| 关 键 词： | 通信技术 扰码序列 Walsh变换 快速相关攻击 |
Fast Recovery of Interfered Scrambling Code Sequence |
| |
| WU Wen-jun,HUANG Zhi-ping,TANG Gui-lin,LIU Chun-wu.Fast Recovery of Interfered Scrambling Code Sequence[J].Acta Armamentarii,2009,30(8):1134-1138. |
| |
| Authors: | WU Wen-jun HUANG Zhi-ping TANG Gui-lin LIU Chun-wu |
| |
| Affiliation: | School of Mechanic Engineering and Automatization, National University of Defence Technology,Changsha 410073, Hunan, China |
| |
| Abstract: | The fast recovery of interfered scrambling code sequence was inguired into.A method based on the Walsh-Hadamard transformation to solve the scrambler generator polynomial was proposed,which improved the exhausted method.The initial state of the sequence was recovered with the algorithm A of fast correlation attack. With a different way of parity-check construction,the algorithm A was improved.The new algorithm is no longer restricted by the number of scrambler generator polynomial's tap,and its original adv... |
| |
| Keywords: | communication technique scrambling code sequence Walsh transformation fast correlation attack |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
| 点击此处可从《兵工学报》浏览原始摘要信息 |
|
点击此处可从《兵工学报》下载全文 |
|
