In this paper we present a class of VLSI networks for computing the Discrete Fourier Transform and the product of two N-bit integers. These networks match, within a constant factor, the known theoretical lower-bound O(N2) to the area × (time)2 measure of complexity. While this paper's contribution is mainly theoretical, it points toward very practical directions: we show how to design multipliers with area A = O(N) and time T=O(√N) on one hand, and A=0((N/log2N)2), T = O(log2N) on the other. Both of these designs should be contrasted with the currently available multipliers, whose performances are A=O(N), T=O(N) or even A=O(N2), T=O(N).
CITATION STYLE
Preparata, F. P., & Vuillemin, J. E. (1981). Area-time optimal VLSI networks for computing integer multiplication and Discrete Dourier Transform. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 115 LNCS, pp. 29–40). Springer Verlag. https://doi.org/10.1007/3-540-10843-2_3
Mendeley helps you to discover research relevant for your work.