ScholarLens Back to search
2013•Unpublished venueRequires access

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

Syed Khairul Bashar

Open publisher page 5 citations

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.

About this research paper

What this paper is about

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.

Why it matters

OpenAlex reports 5 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available 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.

Key concepts: Twiddle factor, Split-radix FFT algorithm, Fast Fourier transform, Prime-factor FFT algorithm, Discrete Fourier transform (general), Algorithm, Cooley–Tukey FFT algorithm, Multiplication (music)

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
An efficient approach to the computation of fast fourier transform(FFT) by Radix-3 algorithm — Research Paper | ScholarLens