This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
An Algorithm for a Fast Hadamard Matrix Transform of Order Twelve
December 1969 (vol. 18 no. 12)
pp. 1131-1132
W.K. Pratt, IEEE
a matrix factorization is presented for a Hadamard matrix of order twelve that permits a Hadamard transform of this order to be computed with substantially fewer operations than by simple matrix multiplication. The matrix factorization is extended to Hadamard matrices of order 2nX 12 where n is an integer.
Index Terms:
Algorithm, data reduction, Hadamard matrix, Hadamard transform, matrix factorization.
Citation:
W.K. Pratt, "An Algorithm for a Fast Hadamard Matrix Transform of Order Twelve," IEEE Transactions on Computers, vol. 18, no. 12, pp. 1131-1132, Dec. 1969, doi:10.1109/T-C.1969.222597
Usage of this product signifies your acceptance of the Terms of Use.