This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Degrees of Freedom and Modular Structure in Matrix Multiplication
February 1971 (vol. 20 no. 2)
pp. 133-141
An algorithm is presented which enables certain matrix multiplications in a digital computer to be implemented with a considerable savings in storage and computational operations. For NxN matrix vector multiplication (that is a multiplication of a matrix by a vector) a maximum of N Sn-1 r=0 pr, storage words are necessary compared to normal full matrix storage requirements of N2
Index Terms:
Degrees of freedom, fast Hadamard/Walsh transform, generalized fast transforms, generalized spectral analysis, Kronecker product transforms.
Citation:
H.C. Andrews, K.L. Caspari, "Degrees of Freedom and Modular Structure in Matrix Multiplication," IEEE Transactions on Computers, vol. 20, no. 2, pp. 133-141, Feb. 1971, doi:10.1109/T-C.1971.223202
Usage of this product signifies your acceptance of the Terms of Use.