Name
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1109/VLSID.2014.51 | VLSI Design |
Keywords | Field | DocType |
computational complexity,linear algebra,reconfigurable architectures,systolic arrays,2D systolic array,CGRA,GR-QRD,NLA kernel,QR decomposition,REDEFINE,SONAR beamforming,coarse grained run-time reconfigurable architecture,computational complexity,givens rotation based qrd,low complexity column-wise GR,low complexity column-wise givens rotation,numerical linear algebra,two-dimensional systolic array,wireless MIMO receivers,CGRA,QR Decomposition,Systolic Arrays | Kernel (linear algebra),Beamforming,Computer science,Degree of parallelism,Parallel computing,Systolic array,Real-time computing,Givens rotation,QR decomposition,Numerical linear algebra,Computational complexity theory | Conference |
ISSN | Citations | PageRank |
1063-9667 | 6 | 0.49 |
References | Authors | |
11 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Merchant, F. | 1 | 6 | 0.49 |
| Anupam Chattopadhyay | 2 | 318 | 62.76 |
| Garga, G. | 3 | 6 | 0.49 |
| Nandy, S.K. | 4 | 43 | 7.29 |