|
| 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
| ASCII Text | x | ||
| 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. | |||
| BibTex | x | ||
| @article{ 10.1109/T-C.1971.223305, author = {S.R. Webb and J.D. Kennedy}, title = {Some Comments on the Fast Hadamard Transform of Order Twelve}, journal ={IEEE Transactions on Computers}, volume = {20}, number = {5}, issn = {0018-9340}, year = {1971}, pages = {588-590}, doi = {http://doi.ieeecomputersociety.org/10.1109/T-C.1971.223305}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - JOUR JO - IEEE Transactions on Computers TI - Some Comments on the Fast Hadamard Transform of Order Twelve IS - 5 SN - 0018-9340 SP588 EP590 EPD - 588-590 A1 - S.R. Webb, A1 - J.D. Kennedy, PY - 1971 KW - Algorithm KW - data reduction KW - Hadamard matrix KW - Hadamard transform KW - matrix factorization. VL - 20 JA - IEEE Transactions on Computers ER - | |||
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.