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

2011 ◽  
Author(s):  
Dongdong Chen ◽  
Mihai Sima
Keyword(s):  
Fixed Point ◽  
Qr Decomposition ◽  
Givens Rotations

Modified Givens rotations for inverse updating in QR decomposition

1993 ◽  
Author(s):  
Terence J. Shepherd ◽  
John E. McWhirter
Keyword(s):  
Qr Decomposition ◽  
Givens Rotations

scholarly journals Hardware Architectures of the QR-Decomposition Based on a Givens Rotation Technique

2019 ◽  
pp. 606-613
Author(s):  
Alexey V. Sokolovskiy ◽  
Evgeny A. Veisov ◽  
Valery N. Tyapkin ◽  
Dmitry D. Dmitriev
Keyword(s):  
Fixed Point ◽  
Hardware Implementation ◽  
Qr Decomposition ◽  
Hardware Architecture ◽  
Cordic Algorithm ◽  
Matrix Size ◽  
Givens Rotation ◽  
Hardware Architectures ◽  
Rotation Technique ◽  
Suitable Technique

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

Sign in / Sign up

Export Citation Format

Share Document