Hermite矩阵特征值分解的硬件加速

Hardware Acceleration of Hermite Matrix Eigenvalue Decomposition

  • 摘要: 在数字信号处理领域,Hermite矩阵的特征值分解有着非常广泛的应用. 为了解决其硬件实现问题,提出了一种基于复数域Jacobi算法的硬件加速架构,该设计方案可适用于不同大小的Hermite矩阵.为了在计算精度、计算速度和资源占用之间取得平衡,在Matlab平台上对定点运算的小数位量化位宽进行了仿真,以8×8大小的Hermite矩阵为例,确定了15位的小数位量化为最佳.分别介绍了复数域Jacobi算法硬件加速中寻找最大非对角线元素、构造酉矩阵和更新特征值矩阵和特征向量矩阵的硬件电路结构.在Zynq-7000系列FPGA开发板上进行了实现,仅需要17438 LUTs和24650 Registers即可在34.42 μs内完成对8×8大小的Hermite矩阵的特征值分解.

     

    Abstract: In the field of digital signal processing, the eigenvalue decomposition of Hermitian matrices possesses a very wide range of applications. To solve the problem of its hardware implementation, a hardware acceleration architecture was proposed based on Jacobi algorithm in complex domain, and the design scheme was arranged to be applied to Hermite matrices with different sizes. In order to achieve a balance among calculation accuracy, calculation speed and resource occupancy, the quantization bit width of the fixed-point operation was simulated on the Matlab platform firstly. Taking the Hermite matrix of size 8×8 as an example, the quantization of 15-bit decimal places was determined as the best. Then, the hardware circuit structure was introduced respectively for finding the largest off-diagonal element, constructing unitary matrix and updating eigenvalue matrix and eigenvector matrix in hardware acceleration of Jacobi algorithm for complex number domain. Finally, the hardware acceleration method was implemented on the Zynq-7000 series FPGA development board, taking only 17 438 LUTs and 24 650 Registers to complete the eigenvalue decomposition of an 8×8 Hermite matrix in 34.42 μs.

     

/

返回文章
返回
Baidu
map