ScholarLens Back to search
2006•Computer Engineering and Applications JournalRequires access

A Kind of Improved Fast Fourier Transform (FFT) on DSP

Suoping Wang

Open publisher page 0 citations

Abstract

Fast Fourier Transform(FFT) is one of the most important digital signal processing algorithms.How to minimize memory reference and reduce power consumption is an essential problem on hardware implementation.In this paper,we present a new method to minimize memory reference due to twiddle factors based on radix-2 decimation-in-time(DIT)FFT on TMSVC5402 DSP.Finally,experimental results show that the new method is effective.

About this research paper

What this paper is about

Fast Fourier Transform(FFT) is one of the most important digital signal processing algorithms.How to minimize memory reference and reduce power consumption is an essential problem on hardware implementation.In this paper,we present a new method to minimize memory reference due to twiddle factors based on radix-2 decimation-in-time(DIT)FFT on TMSVC5402 DSP.Finally,experimental results show that the new method is effective.

Why it matters

A significance statement is not available in the OpenAlex record.

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

Fast Fourier Transform(FFT) is one of the most important digital signal processing algorithms.How to minimize memory reference and reduce power consumption is an essential problem on hardware implementation.In this paper,we present a new method to minimize memory reference due to twiddle factors based on radix-2 decimation-in-time(DIT)FFT on TMSVC5402 DSP.Finally,experimental results show that the new method is effective.

Key concepts: Twiddle factor, Fast Fourier transform, Digital signal processing, Computer science, Decimation, Split-radix FFT algorithm, Prime-factor FFT algorithm, Cooley–Tukey FFT algorithm

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
A Kind of Improved Fast Fourier Transform (FFT) on DSP — Research Paper | ScholarLens