Method of flow graph simplification for the 16-point discrete Fourier transform

Authors:
A.M. Grigoryan;V.S. Bhamidipati
Affiliations:
Dept. of Electr. Eng., Univ. of Texas, San Antonio, TX, USA;-
Venue:
IEEE Transactions on Signal Processing
Year:
2005

Citing 0
Cited 4

Representation of the Fourier Transform by Fourier Series

Journal of Mathematical Imaging and Vision
Elliptic discrete Fourier transforms of type II

SMC'09 Proceedings of the 2009 IEEE international conference on Systems, Man and Cybernetics
16-point reversible integer discrete Fourier transform with 12 control bits

IEEE Transactions on Signal Processing
Two Classes of Elliptic Discrete Fourier Transforms: Properties and Examples

Journal of Mathematical Imaging and Vision

Quantified Score

Hi-index	35.69

Visualization

Abstract

An efficient method for the realization of the paired algorithm for calculation of the one-dimensional (1-D) discrete Fourier transform (DFT), by simplifying the signal-flow graph of the transform, is described. The signal-flow graph is modified by separating the calculation for real and imaginary parts of all inputs and outputs in the signal-flow graph and using properties of the transform. The examples for calculation of the eight- and 16-point DFTs are considered in detail. The calculation of the 16-point DFT of real data requires 12 real multiplications and 58 additions. Two multiplications and 20 additions are used for the eight-point DFT.