Abstract
Considerable success has been achieved in developing signal processing algorithms that are efficient from the standpoint of number of operations. However, what is needed now is to develop new algorithms which are better adapted to existing hardware, or to devise new architectures that more efficiently exploit existing signal processing algorithms. This latter approach forms the basis of this paper. An FPGA architecture is described that takes advantage of the reduced computational requirements of the polynomial transform method for computing 2-D DFTs. The performance of the architecture is presented and is shown to use 31% less FPGA resources than a row-column DFT processor. A multi-FPGA architecture is described that is capable of processing 24 512 × 512-pixel images per second. The multi-FPGA processor is 38% more area efficient than a row-column DFT implementation.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
H. J. Nussbaumer and P. Quandelle, “Computation of Convolutions and Discrete Fourier Transforms by Polynomial Transforms”, IBM J. Res. Develop., vol. 22 no. 2, pp. 134–144, Mar. 1978.
H. J. Nussbaumer, Fast Fourier Transform and Convolution Algorithms, Springer-Verlag, New York, 1981.
Xilinx Inc., The Programmable Logic Data Book, 1994.
R. W. Canik and E. E. Swartzlander, Jr., “Implementing Array Multipliers in Xilinx FPGAs”, Proceedings of the 28th Asilomar Conference on Signals, Systems and Computers, IEEE Computer Society Press, Pacific Grove, California, pp. 1378–1382, Oct. 31–Nov 1, 1994.
Kai Hwang, Computer Arithmetic Principles Architecture and Design, John Wiley & Sons., New York, 1979.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dick, C.H. (1996). Computing 2-D DFTs using FPGAs. In: Hartenstein, R.W., Glesner, M. (eds) Field-Programmable Logic Smart Applications, New Paradigms and Compilers. FPL 1996. Lecture Notes in Computer Science, vol 1142. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61730-2_10
Download citation
DOI: https://doi.org/10.1007/3-540-61730-2_10
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61730-3
Online ISBN: 978-3-540-70670-0
eBook Packages: Springer Book Archive