2026-06-03T23:22:37Zhttps://riuma.uma.es/rest/oai/request

oai:riuma.uma.es:10630/411562026-02-03T12:23:54Zcom_10630_2254col_10630_37959

Hormigo Jiménez, Pablo Hormigo-Aguilar, Javier 2025-12-17T10:17:24Z 2025-12-17T10:17:24Z 2025-12-11 https://hdl.handle.net/10630/41156 10.1109/DCIS67520.2025.11281919 QR decomposition is an essential operation in matrix algebra that is applicable in many fields, such as signal processing, automatic control, communications, and physics simulations. The QRD computation is the system’s bottleneck in many of these applications. This paper presents a configurable ultra-high-throughput accelerator for FPGAs designed using High-Level Synthesis language. The accelerator is arranged as a 2D-systolic array of Givens rotators based on the CORDIC algorithm. Its dimension can be configured at compilation time to fit the matrix size. Similarly, the degree of parallelism in the rotators can be configured, such as the computation throughput goes from one n × n matrix every 2n clock cycles up to one matrix every clock cycle. eng embargoed access Algoritmos computacionales Factorización de operadores Matrices lógicas programables por el usuario Configurable Ultra-High-Throughput QRD FPGA Accelerators for small matrices. conference output