Implementation of Low-Memory Reference FFT on Digital Signal Processor

  title={Implementation of Low-Memory Reference FFT on Digital Signal Processor},
  author={Y. P. Hsu and Shin-Yu Lin},
  journal={Journal of Computer Science},
Problem statement: In order to improve and implement Fast Fourier Transform (FFT), in general, an efficient parallel form in digital signal processor is necessary. The butterfly structure is an important role in FFT, because its symmetry form is suitable for hardware implementation. Although it can perform a symmetric structure, the performance will be reduced under the data-dependent flow characteristic. Even though recent research which calls as Novel Memory Reference Reduction Methods (NMRRM… 

Figures and Tables from this paper

Efficient Methods for FFT calculations Using Memory Reduction Techniques.

The Butterfly structure for the calculation of DFT by FFT algorithms is preferred due to its symmetry which makes it suitable for hardware implementations, but this requires the loading of the twiddle factors for each stage repeatedly, which leads to inefficient use of memory space.

Efficient methods for FFT calculations using prime factor algorithm

Prime Factor Algorithm provides an unified derivation of the Cooley-Tukey FFT and the Winograd Fourier Transform Algorithm (WFTA) FFT, which reduces the computational time and the number of clock cycles needed for the complete implementation of the algorithm.

FPGA Implementation of an ASIP for high throughput DFT/DCT 1D/2D engine

An in place configurable radix 2/3/4 butterfly, makes possible the implementation of two radix N/M is varied in the form of 2x × 3y, therefore the engine can support different communication and signal processing applications.

Implementation of a reconfigurable ASIP for high throughput low power DFT/DCT/FIR engine

Overall the engine allows users to program a very wide range of applications with software-like ease, while delivering performance very close to hardware, which puts the engine in an excellent spot in the current wireless communications environment with its profusion of multi-mode and emerging standards.

A Software Agent for Speech Abiding Systems

The SAS agent along with the required hardware architecture, a Finite State Automata (FSA) machine can be created to develop global oriented domain specific speech user applications easily and will have a major impact on interoperability and disintermediation in the Information Technology Cycle (ITC) for computer program generating.

The Design of Radar Speed-Measuring and Monitoring System Based on DSP

A radar speed measuring and monitoring system based on DSP chip-TMS320F2812 and simulation and experimental data show that it is an effective way to improve the speed-measuring accuracy and reduce accident rates.

The Analysis of Power supply Characteristics of Aircraft Power supply System

With the rapid development of multi-electric aircraft technology, the aircraft electrical power system is becoming more and more complex and significant. This paper analyzes power supply



Novel Memory Reference Reduction Methods for FFT Implementations on DSP Processors

Novel memory reference reduction methods to minimize memory references due to twiddle factors for implementing various different FFT algorithms on DSP using the proposed methods first group the butterflies with identical twiddles from different stages in the FFT diagrams and compute them before computing other butterflies with different twiddle factor lookups.

A low-power, high-performance, 1024-point FFT processor

  • B. Baas
  • Engineering
    IEEE J. Solid State Circuits
  • 1999
This paper presents an energy-efficient, single-chip, 1024-point fast Fourier transform (FFT) processor, which has been fabricated in a standard 0.7 /spl mu/m CMOS process and is fully functional on first-pass silicon.

Specialising for High Performance FFT Algorithms Based on Fixed-Point DSP

  • Ling HeX. Liao
  • Computer Science
    2006 International Conference on Communications, Circuits and Systems
  • 2006
Based on some established FFT spectrum correction algorithms, an improved double-windowing method is presented, and an extended-precision FFT scheme for fixed-point DSP application is put forward.

Novel design of multiplier-less FFT processors

An algorithm for computing the mixed radix fast Fourier transform

This paper presents an algorithm for computing the fast Fourier transform, based on a method proposed by Cooley and Tukey, and includes an efficient method for permuting the results in place.

A prime factor FFT algorithm using high-speed convolution

Two recently developed ideas, the conversion of a discrete Fourier transform (DFT) to convolution and the implementation of short convolutions with a minimum of multiplications, are combined to give

A recursive fast Fourier transformation algorithm

A new composite filter-bank structure is presented for the efficient implementation of the recursive discrete transformation. This structure is based on a proper combination of the concepts of

A radix-eight fast Fourier transform subroutine for real-valued series

Fast Fourier analysis (FFA) and fast Fourier synthesis (FFS) algorithms are developed for computing the discrete Fourier transform of a real series, and for synthesizing a real series from its

Discrete-time signal processing (2nd ed.)