Low Power and Complexity Implementation of the Modified FFT with a New Bit-Slicing Scheme

This paper talks over an efficient VLSI realization of the simplified arithmetic radix-2 Decimation In Time (DIT) Fast Fourier Transform (FFT) technique. High performance FFT processors are used in several types of signal processing, and in order to fulfil these performance demands, the processor must be parallel and pipelined. This enhanced radix-2 method is used to create an improved ASIC design that implements a fully pipelined and parallel architecture for the hardware realization of a 64 point FFT. This scheme uses lesser multipliers by reducing bit-width of twiddle representation for improved power, area and speed with a considerable Signal to Noise Ratio (SNR). A reduction of 32.8% is obtained in the area occupied, 25.08% reduction in power consumption and 20.8% improvement in speed in comparison to the Cooley–Tukey FFT realization. Compared with serial implementation an improvement of 90% and parallel implementation an improvement of 58% in latency count is observed. The design is simulated using Xilinx ISE WebPack 13.1 and synthesized using Cadence Encounter RTL Compiler with CMOS 180 nm technology.