By Topic

Extension of Winograd multiplicative algorithm to transform size N=p2q and its implementation

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
$31 $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

2 Author(s)
Lu, C. ; Dept. of Electr. Eng., City Coll., Univ. of New York, NY, USA ; Tolimieri, R.

The authors continue a program of designing multiplicative FFT (fast Fourier transform) algorithms with highly structured data flow. They take up the case of transform size N, N=p2q, where p and q are distinct odd primes. Number-theoretical methods are used to decompose the indexing set into orbits based on its multiplicative ring structure of Z/N, N=p2q. A family of variants of the fundamental algorithm is designed, presenting options as to whether additions or multiplications dominate arithmetic cost

Published in:

Acoustics, Speech, and Signal Processing, 1989. ICASSP-89., 1989 International Conference on

Date of Conference:

23-26 May 1989