Electronic Resource
Springer
The journal of VLSI signal processing systems for signal, image, and video technology
20 (1998), S. 219-232
ISSN:
1573-109X
Source:
Springer Online Journal Archives 1860-2000
Topics:
Electrical Engineering, Measurement and Control Technology
Notes:
Abstract This paper presents a new fast Discrete Fourier Transform (DFT) algorithm. By rewriting the DFT, a new algorithm is obtained that uses 2n−2(3n−13)+4n−2 real multiplications and 2n−2(7n−29)+6n+2 real additions for a real data N=2n point DFT, comparable to the number of operations in the Split-Radix method, but with slightly fewer multiply and add operations in total. Because of the organization of multiplications as plane rotations in this DFT algorithm, it is possible to apply a pipelined CORDIC algorithm in a hardware implementation of a long-point DFT, e.g., at a 100 MHz input rate, a 1024-point transform can be realized with a 200 MHz clocking of a single CORDIC pipeline.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1023/A:1008078815026
Permalink
|
Location |
Call Number |
Expected |
Availability |