Fixed-Point CORDIC-Based QR Decomposition by Givens Rotations on FPGA

• Published in: 2011 International Conference on Reconfigurable Computing and FPGAs pp. 327 - 332
• Main Authors: Dongdong Chen, Sima, M.
• Format: Conference Proceeding
• Language: English
• Published: IEEE 01.11.2011
• Subjects: Accuracy; Arrays; Field programmable gate arrays; Hardware; Matrix decomposition; Vectors
• ISBN: 9781457717345; 1457717344
• ISSN: 2325-6532
• DOI: 10.1109/ReConFig.2011.38

This paper presents a parallel architecture of an QR decomposition systolic array based on the Givens rotations algorithm on FPGA. The proposed architecture adopts a direct mapping by 21 fixed-point CORDIC-based process units that can compute the QR decomposition for an 4×4 real matrix. In order to achieve a comprehensive resource and performance evaluation, the computational error analysis, the resource utilized, and speed achieved on Virtex5 XC5VTX150T FPGA, are evaluated with the different precision of the intermediate word lengthes. The evaluation results show that 1) the proposed systolic array satisfies 99.9% correct 4×4 QR decomposition for the 2 -13 accuracy requirement when the word length of the data path is lager than 25-bit, 2) occupies about 2, 810 (13%) slices, and achieves about 2.06 M/sec updates by running at the maximum frequency 111 MHz.4x4 real matrix.