Electronic Resource
Springer
International journal of parallel programming
10 (1981), S. 27-37
ISSN:
1573-7640
Keywords:
Number theoretic transform
;
winograd fourier transform
;
residue arithmetic
;
chinese remainder theorem
Source:
Springer Online Journal Archives 1860-2000
Topics:
Computer Science
Notes:
Abstract The Winograd Fourier transform algorithm (WFTA) is receiving intensive study. The advantage of this class of transform is its potential high throughput due to reduced multiplication count. However, both input and output reorderings have to be performed when the algorithm is implemented. In this work, a technique for the WFTA input/output reorderings is developed. This technique is flexible to the choice of the base numbers of WFTA and capable of operating at high speed in digital hardware. This technique requires no extra memory for reordering when implementing the WFTA in the residue number system if the moduli set of RNS is carefully chosen to contain the base numbers of WFTA.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1007/BF00978376
Permalink
|
Location |
Call Number |
Expected |
Availability |