Tuyển tập báo cáo các nghiên cứu khoa học quốc tế ngành hóa học dành cho các bạn yêu hóa học tham khảo đề tài: Research Article Fast Discrete Fourier Transform Computations Using the Reduced Adder Graph Technique | Hindawi Publishing Corporation EURASIP Journal on Advances in Signal Processing Volume 2007 Article ID 67360 8 pages doi 2007 67360 Research Article Fast Discrete Fourier Transform Computations Using the Reduced Adder Graph Technique Uwe Meyer-Base 1 Hariharan Natarajan 1 and Andrew G. Dempster2 1 Department of Electrical and Computer Engineering Florida State University 2525 Pottsdamer Street Tallahassee FL 32310-6046 USA 2 School of Surveying and Spatial Information Systems University of New South Wales Sydney 2052 Australia Received 28 February 2006 Revised 23 November 2006 Accepted 17 December 2006 Recommended by Irene Y. H. Gu It has recently been shown that the -dimensional reduced adder graph RAG-tt technique is beneficial for many DSP applications such as for FIR and IIR filters where multipliers can be grouped in multiplier blocks. This paper highlights the importance of DFT and FFT as DSP objects and also explores how the RAG-tt technique can be applied to these algorithms. This RAG-tt DFT will be shown to be of low complexity and possess an attractively regular VLSI data flow when implemented with the Rader DFT algorithm or the Bluestein chirp-z algorithm. ASIC synthesis data are provided and demonstrate the low complexity and high speed of the design when compared to other alternatives. Copyright 2007 Hindawi Publishing Corporation. All rights reserved. 1. INTRODUCTION The discrete Fourier transform DFT and its fast implementation the fast Fourier transform FFT have both played a central role in digital signal processing. DFT and FFT algorithms have been invented and reinvented in many variations. As Heideman et al. 1 have pointed out we know that Gauss used an FFT-type algorithm we now call the Cooley-Tukey FFT. We will follow the terminology introduced by Burrus 2 who classified FFT algorithms according to the multidimensional index maps of their input and output sequences. We will therefore call all algorithms which do not use a .
