Fast Hadamard Transform Based on a Simple Matrix Factorization

M. H. Lee; M. Kaveh

doi:10.1109/TASSP.1986.1164972

Fast Hadamard Transform Based on a Simple Matrix Factorization

M. H. Lee, M. Kaveh

Electrical and Computer Engineering

Research output: Contribution to journal › Article › peer-review

67 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 language	English (US)
Pages (from-to)	1666-1667
Number of pages	2
Journal	IEEE Transactions on Acoustics, Speech, and Signal Processing
Volume	34
Issue number	6
DOIs	https://doi.org/10.1109/TASSP.1986.1164972
State	Published - Dec 1986

Access

10.1109/TASSP.1986.1164972

OpenUrl availability

Full text

Cite this

@article{abe633b96ad840b3adcd77bfb3d3e2e6,

title = "Fast Hadamard Transform Based on a Simple Matrix Factorization",

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.",

author = "Lee, {M. H.} and M. Kaveh",

year = "1986",

month = dec,

doi = "10.1109/TASSP.1986.1164972",

language = "English (US)",

volume = "34",

pages = "1666--1667",

journal = "IEEE Transactions on Acoustics, Speech, and Signal Processing",

issn = "0096-3518",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

number = "6",

}

TY - JOUR

T1 - Fast Hadamard Transform Based on a Simple Matrix Factorization

AU - Lee, M. H.

AU - Kaveh, M.

PY - 1986/12

Y1 - 1986/12

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0022907786&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0022907786&partnerID=8YFLogxK

U2 - 10.1109/TASSP.1986.1164972

DO - 10.1109/TASSP.1986.1164972

M3 - Article

AN - SCOPUS:0022907786

SN - 0096-3518

VL - 34

SP - 1666

EP - 1667

JO - IEEE Transactions on Acoustics, Speech, and Signal Processing

JF - IEEE Transactions on Acoustics, Speech, and Signal Processing

IS - 6

ER -

Fast Hadamard Transform Based on a Simple Matrix Factorization

Abstract

Access

OpenUrl availability

Other files and links

Fingerprint

Cite this