On systolic arrays for recursive complex Householder transformations with applications to array processing
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.<<ETX>>