A Class of Finite Computations Structures Supporting the Fast Fourier Transform

Author(s)
Bonneau, Richard J.
Thumbnail
DownloadMIT-LCS-TM-031.pdf (1.015Mb)
Metadata
Show full item record
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.
Date issued
1973-03
URI
https://hdl.handle.net/1721.1/148860
Series/Report no.
MIT-LCS-TM-031MAC-TM-031
Collections