An Asynchronous Implementation of Fast Fourier Transform Processor
Qiu Yu-lin · 2006
A novel asynchronous implementation of fast Fourier transform(FFT) processor is described.The(asynchronous) FFT processor controls the sequence of logic circuits by local handshake signals,instead of the globe clock.Circuits of asynchronous adder are proposed.An asynchronous multiplier using booth decode and based on Wallace tree architecture is designed.Results of the performance analysis of an 8-point asynchronous FFT processor show that the average case response time,which is 31.15 ns,is only 72.7% of the worst-case response time,which is 42.85 ns,for completing a transform.It reveals that the asynchronous FFT processor has some performance advantages than the synchronous one.