VLSI Architecture for Matrix Inversion using Modified Gram-Schmidt based QR Decomposition
Authors:
- 1 January 2007
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 836-841
Abstract
Matrix inversion and triangularization problems are common to a wide variety of communication systems, signal processing applications and solution of a set of linear equations. Matrix inversion is a computationally intensive process and its hardware implementation based on fixed-point (FP) arithmetic is a challenging problem. This paper proposes a fully parallel VLSI architecture under fixed-precision for the inverse computation of a real square matrix using QR decomposition with modified Gram-Schmidt (MGS) orthogonalization. The MGS algorithm is stable and accurate to the integral multiples of machine precision under fixed-precision for a well-conditioned non-singular matrix. For typical matrices (4 times 4) found in MIMO communication systems, the proposed architecture was able to achieve a clock rate of 277 MHz with a latency of 18 time units and area of 72K gates using 0.18-mum CMOS technology. For a generic square matrix of order n, the latency required is 5n - 2 which is better than all previously known architectures. With the use of LUTs and log-domain computations, the total area has been reduced compared to architectures based on linear-domain computationsKeywords
This publication has 9 references indexed in Scilit:
- A Fixed-Point Implementation for QR Decomposition2006
- An efficient regular matrix inversion circuit architecture for MIMO processing2006
- A fixed-point implementation of matrix inversion using Cholesky decomposition2006
- Capacity of Multi‐antenna Gaussian ChannelsEuropean Transactions on Telecommunications, 1999
- Numerical Methods for Least Squares Problems1996
- Numerics of Gram-Schmidt orthogonalizationLinear Algebra and its Applications, 1994
- Loss and Recapture of Orthogonality in the Modified Gram–Schmidt AlgorithmSIAM Journal on Matrix Analysis and Applications, 1992
- Parallel VLSI algorithm for stable inversion of dense matricesIEE Proceedings E Computers and Digital Techniques, 1989
- Solving linear least squares problems by Gram-Schmidt orthogonalizationBIT Numerical Mathematics, 1967