By Topic

The tensor product: a mathematical programming language for FFTs and other fast DSP operations

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

3 Author(s)
J. Granata ; City Coll. of New York, NY, USA ; M. Conner ; R. Tolimieri

The use of the tensor product as a tool for modeling and developing digital signal processing algorithms is discussed. A precise mathematical definition of the tensor product is established along with several important properties. Special tensor matrices suited for implementation on various computer architectures are then identified. The notion of the stride permutation matrix is introduced as a method of modeling operand addressing. An important connection between tensor matrices and stride permutations is made explicit. By identifying particular tensor matrices suited for implementation on a given machine the tensor product has been transformed from a mathematical convenience into an extremely useful tool for matching algorithms to computer architectures. Several design examples in which a tensor matrix multiplication is implemented on several radically different types of computer architectures are presented.<>

Published in:

IEEE Signal Processing Magazine  (Volume:9 ,  Issue: 1 )