Hardware Architectures of the QR-Decomposition Based on a Givens Rotation Technique
Alexey V. Sokolovskiy, Е. А. Вейсов, Valery N. Tyapkin, D D Dmitriev
Abstract
Open-access reader
Alexey V. Sokolovskiy, Е. А. Вейсов, Valery N. Tyapkin, D D Dmitriev
Abstract
Open-access reader
The fixed-point hardware architecture of the QR decomposition is constrained by a several issues that leads to decrease of a compute accuracy depending on a matrix size. In this article described the hardware architectures based on CORDIC algorithm and approximation functions. As a basis technique is used a Givens rotation technique, because it is a most suitable technique for hardware implementation
OpenAlex reports 2 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
The fixed-point hardware architecture of the QR decomposition is constrained by a several issues that leads to decrease of a compute accuracy depending on a matrix size. In this article described the hardware architectures based on CORDIC algorithm and approximation functions. As a basis technique is used a Givens rotation technique, because it is a most suitable technique for hardware implementation
Key concepts: CORDIC, QR decomposition, Computer science, Decomposition, Rotation (mathematics), Parallel computing, Matrix decomposition, Computer hardware