FPGA Implementations of QR Decomposition based Adaptive Beamforming Algorithm
Zhu Shao-bi · Wireless Communication Technology · 2013
To choose a better QR decomposition to be applied to the communication environment,the hardware performance of the algorithms needs to be known before they are implemented. The commonly QR decomposition algorithms including the Gram-Schmidt and Givens rotation are introduced briefly. The implementation of these QR decomposition algorithms with FPGA are offered in detail. Using the ISE software of the company Xilinx as the design tool,most parts of the algorithms are accomplished by using VHDL. The design of the system is realizes in the chip Kintex-7XC7K325T. The hardware performance and the cost of these algorithms are compared. Under the condition of the same input data's length,the errors of these two algorithms are almost the same.Compared with GR,MGS has a lower resource cost,as well as a inferior real-time. Therefore,GR algorithm is better to get the QR decomposition in the condition which has a strict requirement of the system real-time.