Abstract

The implementation of a high-speed 128-complex-point FFT (fast Fourier transform) system is described. It is based on a low-cost programmable NMOS digital signal processor (DSP) with a limited amount of memory. For this reason, its use has been restricted so far, to short transforms (N or=128), performed at a lower speed. This inherent compromise has been overcome by subsequently calculating eight length-16 and sixteen length-8 FFTs, so that a limited data memory is occupied at each processing step. Moreover, the iteration of basics short transform subroutines allows sizable reduction of the requested program memory without sacrificing the processing speed. As a result, by using a single DSP in a simple architecture, 128 complex points are analyzed at a throughput rate of several tens of kilohertz. The possible application of the approach to larger FFTs, as well as to other transforms, is discussed. A brief description is also given of how a higher operating speed could be obtained by pipelining the FFT unit without having recourse to expensive devices. >

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call