We are experiencing minor difficulties with our submission forms, which we are working to resolve. If you have any issues while submitting items, please contact us at dspace-lib@mit.edu.

A Class of Finite Computations Structures Supporting the Fast Fourier Transform

Thumbnail Image
Download
Name

MIT-LCS-TM-031.pdf

Size

1.02 MB

Format

Adobe PDF

Checksum (MD5)

b00b6183af5e8f519b5f92c8bbe63d5a

Author(s)
Bonneau, Richard J.
Date Issued
March 1973
Series/Report no.
MIT-LCS-TM-031
MAC-TM-031
Abstract
The Fast Fourier Transform (FFT) and modular arithmetic are two distinct techniques which recently have been employed to increase the efficiency of numerous algorithms in the area of symbolic and algebraic manipulation.
Persistent DSpace Link
PrivacyPermissionsAccessibilityContact us
Notify us about copyright concerns.