DocumentCode :
1942191
Title :
On systolic arrays for recursive complex Householder transformations with applications to array processing
Author :
Tang, C.F.T. ; Liu, K.J.R. ; Tretter, S.A.
Author_Institution :
Maryland Univ., College Park, MD, USA
fYear :
1991
fDate :
14-17 Apr 1991
Firstpage :
1033
Abstract :
The Householder transformation outperforms the Givens rotation in numerical stability under finite-precision implementation, and requires fewer arithmetic operations than the modified Gram-Schmidt. As a result, the QR decomposition using the Householder transformation is promising for VLSI implementation and real-time throughput signal processing. A recursive complex Householder transformation with a fast initializing algorithm is presented, and its associated parallel/pipelined architecture is discussed
Keywords :
VLSI; digital signal processing chips; parallel algorithms; parallel architectures; systolic arrays; Householder algorithm; QR decomposition; VLSI; arithmetic operations; array processing; fast initializing algorithm; finite-precision; multiprocessor system; numerical stability; parallel/pipelined architecture; real-time throughput signal processing; recursive complex Householder transformation; systolic arrays; Arithmetic; Array signal processing; Computer architecture; Matrix decomposition; Numerical stability; Robust stability; Signal processing algorithms; Systolic arrays; Throughput; Very large scale integration;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Acoustics, Speech, and Signal Processing, 1991. ICASSP-91., 1991 International Conference on
Conference_Location :
Toronto, Ont.
ISSN :
1520-6149
Print_ISBN :
0-7803-0003-3
Type :
conf
DOI :
10.1109/ICASSP.1991.150519
Filename :
150519
Link To Document :
بازگشت