Skip to Main Content
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 sparse-matrix factorization of the Hadamard matrix.
Acoustics, Speech and Signal Processing, IEEE Transactions on (Volume:34 , Issue: 6 )
Date of Publication: Dec 1986