Merchant F.,Indian Institute of Science |
Chattopadhyay A.,RWTH Aachen |
Garga G.,Morphing Machines Pvt. Ltd. |
Nandy S.K.,Indian Institute of Science |
And 2 more authors.
Proceedings of the IEEE International Conference on VLSI Design | Year: 2014
QR decomposition (QRD) is a widely used Numerical Linear Algebra (NLA) kernel with applications ranging from SONAR beam forming to wireless MIMO receivers. In this paper, we propose a novel Givens Rotation (GR) based QRD (GR-QRD) where we reduce the computational complexity of GR and exploit higher degree of parallelism. This low complexity Column-wise GR (CGR) can annihilate multiple elements of a column of a matrix simultaneously. The algorithm is first realized on a Two-Dimensional (2D) systolic array and then implemented on REDEFINE which is a Coarse Grained run-time Reconfigurable Architecture (CGRA). We benchmark the proposed implementation against state-of-the-art implementations to report better throughput, convergence and scalability. © 2014 IEEE. Source