On systolic arrays for recursive complex Householder transformations with applications to array processing

Authors:
C. F. T. Tang;K. J. R. Liu;S. A. Tretter
Affiliations:
Maryland Univ., College Park, MD, USA;Maryland Univ., College Park, MD, USA;Maryland Univ., College Park, MD, USA
Venue:
ICASSP '91 Proceedings of the Acoustics, Speech, and Signal Processing, 1991. ICASSP-91., 1991 International Conference
Year:
1991

Citing 0
Cited 2

A unified co-processor architecture for matrix decomposition

Journal of Computer Science and Technology
Scalable matrix decompositions with multiple cores on FPGAs

Microprocessors & Microsystems

Quantified Score

Hi-index	0.00

Visualization

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.