Approved for public release, distribution is unlimitedThe Fast Fourier Transfonn is an algorithm for the computation of Discrete Fourier Transforms in less time than allowed by any other algorithm available. The use of special purpose digital machines to reduce those times even further is of interest for real time spectral analysis. The main principles of Fast Fourier Transforms are presented. The design of a full-parallel eight sample processor is presented as a point of reference for comparison with serial and serial-parallel hybrid machines. Carry-Save Addition is introduced and used as the primary arithmetic logic.http://www.archive.org/details/applicabilityofs00adamCaptain, United States Marine Corp
To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.