Householder transforms in signal processing
- 1 July 1988
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE ASSP Magazine
- Vol. 5 (3) , 4-12
- https://doi.org/10.1109/53.9259
Abstract
The author explores Householder transforms and their applications in signal processing. He shows that these transforms can be viewed as mirror-image reflections of a data vector about any desired hyperplane. The virtue of reflections is that they are covariance invariant, that is, they preserve the covariance matrix of the data. One can construct a finite sequence of such reflections that maps a block of data vectors into a lower rectangular matrix. If only the covariance eigenvalues need to be preserved, one can map into a bidiagonal matrix. The former sparse form is useful for inverting covariance matrices and the latter is useful in finding eigenvalues of covariance matrices.Keywords
This publication has 11 references indexed in Scilit:
- Orthogonal transformation (square-root) implementations of the generalized Chandrasekhar and generalized Levinson algorithmsPublished by Springer Nature ,2005
- Stabilized hyperbolic Householder transformationsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Adaptive beamformingInternational Journal of Adaptive Control and Signal Processing, 1989
- Spatial analysis in passive listening using adaptive techniquesProceedings of the IEEE, 1987
- Eigenstructure methods for direction of arrival estimation in the presence of unknown noise fieldsIEEE Transactions on Acoustics, Speech, and Signal Processing, 1986
- The block-processing FTF adaptive algorithmIEEE Transactions on Acoustics, Speech, and Signal Processing, 1986
- Adaptive Signal ProcessingPublished by Springer Nature ,1986
- Adaptive Array PrinciplesPublished by Institution of Engineering and Technology (IET) ,1981
- Linear prediction: A tutorial reviewProceedings of the IEEE, 1975
- Unitary Triangularization of a Nonsymmetric MatrixJournal of the ACM, 1958