A Radix-2 DIT FFT with Reduced Arithmetic Complexity

Qadeer, S and Khan, Mohammed Zafar Ali and Sattar, S A and Ahmed, . (2014) A Radix-2 DIT FFT with Reduced Arithmetic Complexity. In: 3rd International Conference on Advances in Computing, Communications and Informatics (ICACCI), 24-27 Sep, 2014, New Delhi, INDIA.

Full text not available from this repository. (Request a copy)

Abstract

The efficient computation of Discrete Fourier Transform (DFT) is an important issue as it is used in almost all fields of engineering for signal processing. This paper presents a different form of Radix-2 Fast Fourier Transform (FFT) based on Decimation in time (DIT) to compute DFT, discuss their implementation issues and derive it's signal to quantization noise ratio(SQNR) that further decreases the number of multiplication counts without affecting the number of additions of Radix-2 discrete Fourier Transform. It is achieved by simple scaling of Twiddle factor (TF) using a special scaling factor. This modification not only decreases the total flop counts from 5Nlog(2)N to approximate to 4 2/3Nlog(2)N (6.66% fewer than the standard Radix-2 FFT algorithm) but also improves SQNR from to 1/2N2(-2b) to 9/15N2(-2b) (1. 6dB more than the standard Radix-2 FFT algorithm).

[error in script]

IITH Creators: