A systolic rank revealing QR algorithm

Author

Lorenzelli, F. ; Yao, K. ; Chan, T.F. ; Hansen, P.C.

Author_Institution

Dept. of Electr. Eng., California Univ., Los Angeles, CA, USA

fYear

1992

fDate

4-7 Aug 1992

Firstpage

430

Lastpage

444

Abstract

In many fields of signal and image processing control, and telecommunication there is much interest today in the numerical techniques offered by linear algebra. The singular value decomposition (SVD) is one of the techniques which have proven useful in many engineering applications, but unfortunately its computation is a costly procedure. The QR factorization (QRF) requires much less computational effort, but rank and null-space estimates are not necessarily reliable. This paper presents a version of rank revealing QR (RRQR) algorithm which is suited for implementation on a VLSI systolic array. The implementation of the RRQRF requires n(n+1)/2 processors and O(n) external buffers, for a problem of order n. The execution time for the algorithm is O(nr), where r is A´s numerical rank

Keywords

VLSI; linear algebra; systolic arrays; QR factorization; VLSI systolic array; linear algebra; rank revealing; singular value decomposition; systolic rank revealing QR algorithm; Image processing; Linear algebra; Process control; Reliability engineering; Signal processing; Singular value decomposition; Systolic arrays; Telecommunication computing; Telecommunication control; Very large scale integration;

fLanguage

English

Publisher

ieee

Conference_Titel

Application Specific Array Processors, 1992. Proceedings of the International Conference on

Conference_Location

Berkeley, CA

ISSN

1063-6862

Print_ISBN

0-8186-2967-3

Type

conf

DOI

10.1109/ASAP.1992.218554

Filename

218554