Techniques for computing the DFT using the residue Fermat number systems and VLSI
Abstract
The integer complex multiplier and adder over the direct sum of two copies of a finite field is specialized to the direct sum of the rings of integers modulo Fermat numbers. Such multiplications and additions can be used in the implementation of a discrete Fourier transform (DFT) of a sequence of complex numbers. The advantage of the present approach is that the number of multiplications needed for the DFT can be reduced substantially over the previous approach. The architectural designs using this approach are regular, simple, expandable and, therefore, naturally suitable for VLSI implementation.
 Publication:

In its The Telecommun. Data Acquisition Rept. p 1830 (SEE N8527094 1632
 Pub Date:
 May 1985
 Bibcode:
 1985tdar.nasa...18T
 Keywords:

 Computation;
 Fourier Transformation;
 Integers;
 Very Large Scale Integration;
 Algorithms;
 Architecture (Computers);
 Arithmetic;
 Multiplication;
 Numbers;
 Rings (Mathematics);
 Electronics and Electrical Engineering