An efficient approach to the computation of fast fourier transform(FFT) by Radix-3 algorithm

Author

Bashar, Syed Khairul

Author_Institution

Dept. of EEE, Bangladesh Univ. of Eng. & Technol., Dhaka, Bangladesh

fYear

2013

fDate

17-18 May 2013

Firstpage

1

Lastpage

5

Abstract

In this paper an efficient approach to compute Discrete Fourier Transform (DFT) using Radix-3 algorithm, which is a Fast Fourier Transform (FFT), has been presented. It takes less multiplication than the usual one. The key idea is that matrix formed by different powers of twiddle factor (phase factor) is decomposed into two matrices and it has been shown that it takes less complex multiplications to compute the result than original Cooley-Tukey method. Later, Matlab simulations verifying the calculations have been added to demonstrate the outcome.

Keywords

discrete Fourier transforms; fast Fourier transforms; matrix decomposition; DFT; Matlab simulations; complex multiplication; discrete Fourier transform; fast Fourier transform; matrix decomposition; phase factor power; radix-3 algorithm; twiddle factor power; Algorithm design and analysis; Discrete Fourier transforms; Equations; Mathematical model; Matrix decomposition; Signal processing; Signal processing algorithms; DFT; QR decomposition; Radix-3; phase factor or twiddle factor;

fLanguage

English

Publisher

ieee

Conference_Titel

Informatics, Electronics & Vision (ICIEV), 2013 International Conference on

Conference_Location

Dhaka

Print_ISBN

978-1-4799-0397-9

Type

conf

DOI

10.1109/ICIEV.2013.6572680

Filename

6572680