一种基于二进制矩阵的CDMA长码状态快速算法

Performance Analysis for a New CDMA Long Code Fast Computing Method

本文介绍了一种基于二进制矩阵迭代运算的确定当前时刻CDMA长码状态的快速算法 ,对其性能进行了仿真和分析 .与传统的MSRG结构或SSRG结构的CDMA长码状态算法的运算量相比较 ,新方法将巨大的运算量 (可能出现 2 42 - 1次的长码发生器运算 )降为不超过 4 2× 4 2次长码发生器运算和 4 2次 4 2× 4 2阶矩阵模 2相乘运算 ,极大的提高了确定当前时刻长码状态的速度 ,在基本不增加硬件复杂性的基础上 。

This paper presents a new CDMA long code fast computing method based in binary matrix recursive operation.Simulation and analysis show that,compared with MSRG configuration,the new method requires no more hardware RAM,and it can turn the vast long code generating operation to no more than 42×42 times long code generating operation and 42 times 42×42 matrix mode 2 multiplication operations.So,the new method greatly accelerates the CDMA long code generating speed,thus improves the system performance.