Efficient QR Decomposition Using Low Complexity Column-wise Givens Rotation (CGR)

Merchant, Farhad and Chattopadhyay, Anupam and Garga, Ganesh and Nandy, SK and Narayan, Ranjani and Gopalan, Nandhini (2014) Efficient QR Decomposition Using Low Complexity Column-wise Givens Rotation (CGR). In: 27th International Conference on VLSI Design / 13th International Conference on Embedded Systems (VLSID), JAN 05-09, 2014, Mumbai, INDIA, pp. 258-263.

PDF 27th_int_con_VSL-des_13th_int_con_emb_sys_258_2014.pdf - Published Version Restricted to Registered users only Download (813kB) | Request a copy

Abstract

QR decomposition (QRD) is a widely used Numerical Linear Algebra (NLA) kernel with applications ranging from SONAR beamforming 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 (2 D) 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.

Item Type:	Conference Proceedings
Publication:	2014 27TH INTERNATIONAL CONFERENCE ON VLSI DESIGN AND 2014 13TH INTERNATIONAL CONFERENCE ON EMBEDDED SYSTEMS (VLSID 2014)
Series.:	International Conference on VLSI Design
Publisher:	IEEE
Additional Information:	27th International Conference on VLSI Design / 13th International Conference on Embedded Systems (VLSID), Mumbai, INDIA, JAN 05-09, 2014
Keywords:	QR Decomposition; Systolic Arrays; CGRA
Department/Centre:	Division of Electrical Sciences > Electronic Systems Engineering (Formerly Centre for Electronic Design & Technology)
Date Deposited:	21 Apr 2015 07:29
Last Modified:	21 Apr 2015 07:29
URI:	http://eprints.iisc.ac.in/id/eprint/51333

Actions (login required)

View Item