Fast Hadamard Transform Based on a Simple Matrix Factorization

M. H. Lee, M. Kaveh

Research output: Contribution to journalArticlepeer-review

59 Scopus citations

Abstract

This correspondence presents a simple factorization of the Hadamard matrix which is used to develop a fast algorithm for the Hadamard transform. The matrix decomposition is of the form of the Kronecker products of identity matrices and successively lower order Hadamard matrices. This decomposition leads very clearly to a sparsematrix factorization of the Hadamard matrix.

Original languageEnglish (US)
Pages (from-to)1666-1667
Number of pages2
JournalIEEE Transactions on Acoustics, Speech, and Signal Processing
Volume34
Issue number6
DOIs
StatePublished - Dec 1986

Fingerprint Dive into the research topics of 'Fast Hadamard Transform Based on a Simple Matrix Factorization'. Together they form a unique fingerprint.

Cite this