This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
May 1971 (vol. 20 no. 5)
pp. 588-590
S.R. Webb, Mathematical Sciences Dep. Inform. Sys. Div. McDonnell Douglas Astronautics Co.
An algorithm for a fast matrix transform of order twelve was given by Pratt [1]. The resulting transform matrix consists of plus and minus ones, is in order of sequency, but is not orthogonal, and hence is not a Hadamard matrix. This note proves it is impossible to construct a Hadamard matrix of order twelve with this increasing sequency property and gives a corrected algorithm of order twelve.
Index Terms:
Algorithm, data reduction, Hadamard matrix, Hadamard transform, matrix factorization.
Citation:
S.R. Webb, J.D. Kennedy, "Some Comments on the Fast Hadamard Transform of Order Twelve," IEEE Transactions on Computers, vol. 20, no. 5, pp. 588-590, May 1971, doi:10.1109/T-C.1971.223305
Usage of this product signifies your acceptance of the Terms of Use.