基于CORDIC的无开方GIVENS旋转处理方法

CORDIC Based Root free Givens Rotation Processing

  • 摘要: 自适应阵列处理能提高通信雷达等电子系统的抗干扰能力,因而获得了广泛的应用。许多重要的高速实时自适应阵列处理算法均需要采用一系列Givens旋转处理将输入数据矩阵变成三角阵。标准的Givens旋转包含开方运算,该运算是限制有关算法速度的一个重要因素。文中提出一种基于坐标旋转计算机技术的无开方Givens旋转处理方法,可以显著提高自适应算法的处理速度,并给出了这一方法的推导、Givens处理节点运算式和采用,这种方法的QR分解自适应阵并行处理算法的计算机模拟结果。

     

    Abstract: Adaptive array processing can greatly improve anti-interference capability of communications and radar systems,and thus has wide applications.Many important high-speed adaptive array processing algorithms include a series of Givens rotations,which transform an input data matrix into a triangnlar matrix.A typical Givens rotation has square-root operation,which is one of the key factors limits the algorithm speed.This paper presents a new method to implement the Givens rotation without root operation based on coordinate rotation digital computer (CORDIC).The derivation of the method,the structure of the operation node,and a simulation result of QR-Decomposition adaptive algorithm based on the method are given in the paper.

     

/

返回文章
返回