2026-06-04T06:13:20Zhttps://riuma.uma.es/rest/oai/request

oai:riuma.uma.es:10630/102732026-02-03T10:53:16Zcom_10630_2254col_10630_37953

High-Throughput FPGA Implementation of QR Decomposition Muñoz, Sergio D. Hormigo-Aguilar, Javier Arquitectura de ordenadores Munoz, S.D.; Hormigo, J. "High-Throughput FPGA Implementation of QR Decomposition" IEEE Transactions on in Circuits and Systems II: Express Briefs,vol.62, no.9, pp.861-865, Sept. 2015 doi: 10.1109/TCSII.2015.2435753 This brief presents a hardware design to achieve high-throughput QR decomposition, using Givens Rotation Method. It utilizes a new two-dimensional systolic array architecture with pipelined processing elements, which are based on the COordinate Rotation DIgital Computer (CORDIC) algorithm. CORDIC computes vector rotations through shifts and additions. This approach allows a continuous computation of QR factorizations with simple hardware. A fixed-point FPGA architecture for 4 x 4 matrices has been optimized by balancing the number of CORDIC iterations with the final error. As a result, compared to other previous proposals for FPGA, our design achieves at least 50% more throughput, and much less resource utilization. 2015-09-17T09:41:59Z 2015-09-17T09:41:59Z 2014 2015-09-17 journal article http://hdl.handle.net/10630/10273 eng open access by-nc-nd