Skip to main content
Article thumbnail
Location of Repository

A Fixed-Point Implementation for QR Decomposition

By Chitranjan K. Singh, Sushma H. Prasad and Poras T. Balsara

Abstract

Abstract — Matrix triangularization and orthogonalization are prerequisites to solving least square problems and find applications in a wide variety of communication systems and signal processing applications such as MIMO systems and matrix inversion. QR decomposition using Modified Gram-Schmidt(MGS) orthogonalization is one of the numerically stable techniques used in this regard. This paper presents a fixed point implementation of QR decomposition based on MGS algorithm using a novel LUT based approach. The proposed architecture is based on log-domain arithmetic operations. The error performance of various fixed-point arithmetic operations has been discussed and optimum LUT sizes are presented based on simulation results for various fractional-precisions. The proposed architecture also paves way for an efficient parallel VLSI implementation of QR decomposition using MGS

Year: 2009
OAI identifier: oai:CiteSeerX.psu:10.1.1.135.9794
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www.utdallas.edu/~cks02... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.