Importance

Loading Importance Indicators...

Abstract

In a method for performing a fast-Fourier transform (FFT), input data samples are written to a storage instance in a data input step, then subjected to a processing step in which the stored input samples are read out of the storage instance and processed in accordance with a transformation algorithm. The resulting output data samples are written back to the storage instance and, in a transformed data output step, read out of the storage instance, successively received batches of the input data samples being fed cyclically to a plurality of such multiple-function storage instances. Each batch is fed to a respective storage instance such that, at any given time during performance of the method, the input, processing and output steps are being performed simultaneously in respect of different batches using different respective storage instances. For each received data input batch, the processing step comprises a plurality of calculation passes creating intermediate data values which are stored between passes in both the respective multiple function storage instance and a further storage instance which is substantially dedicated for use in such processing steps. The invention also includes a related method for performing an inverse fast-Fourier transform (IFFT), as well as FFT and IFFT systems.

Loading the Abstract Image...

First Claim