By Topic

Fast algorithms for matrix multiplication using pseudo-number-theoretic transforms

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Yagle, A.E. ; Dept. of Electr. Eng. & Comput. Sci., Michigan Univ., Ann Arbor, MI, USA

We provide a novel approach to the design of fast algorithms for matrix multiplication. The operation of matrix multiplication is reformulated as a convolution, which is implemented using pseudo-number-theoretic transforms. Writing the convolution as multiplication of polynomials evaluated off the unit circle reduces the number of multiplications without producing any error, since the (integer) elements of the product matrix are known to be bounded. The new algorithms are somewhat analogous to the arbitrary precision approximation (APA) algorithms, but have the following advantages: (i) a simple design procedure is specified for them; (ii) they do not suffer from round-off error; and (iii) the reasons for their existence is clear. The new algorithms are also noncommutative; therefore, they may be applied recursively to block matrix multiplication. This work establishes a link between matrix multiplication and fast convolution algorithms and so opens another line of inquiry for the fast matrix multiplication problem. Some numerical examples illustrate the operation of the new proposed algorithms

Published in:

Signal Processing, IEEE Transactions on  (Volume:43 ,  Issue: 1 )