About cookies on this site Our websites require some cookies to function properly (required). In addition, other cookies may be used with your consent to analyze site usage, improve the user experience and for advertising. For more information, please review your options. By visiting our website, you agree to our processing of information as described in IBM’sprivacy statement. To provide a smooth navigation, your cookie preferences will be shared across the IBM web domains listed here.
Publication
IEEE Transactions on Audio and Electroacoustics
Paper
Associative Parallel Processing for the Fast Fourier Transform
Abstract
An associative memory is proposed as a parallel processing unit for the fast Fourier transform; such a processing unit is well suited to implementation in large-scale integrated circuit technologies. Formulas are derived for the number of memory operations required to execute the algorithm and are tabulated for a range of the number of data points being transformed. It is shown that a 1024 word by 64 bit memory with an operation time of 100 ns could execute a 1024 point transform in 8.4 ms. Copyright © 1969 by The Institute of Electrical and Electronics Engineers, Inc.