Area-Time Optimal Fast Implementation of Several Functions in a VLSI Model

Authors:
K. Wada;K. Hagihara;N. Tokura
Affiliations:
Faculty of Engineering Science, Department of Information and Computer Sciences, Osaka University;-;-
Venue:
IEEE Transactions on Computers
Year:
1984

Citing 6
Cited 0

Bounds to Complexities of Networks for Sorting and for Switching

Journal of the ACM (JACM)
Introduction to VLSI Systems

Introduction to VLSI Systems
Lower bounds for VLSI

STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
The chip complexity of binary arithmetic

STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
Tree Realizations of Iterative Circuits

IEEE Transactions on Computers
On relations between input and communication/computation in VLSI

SFCS '81 Proceedings of the 22nd Annual Symposium on Foundations of Computer Science

Quantified Score

Hi-index	15.02

Visualization

Abstract

Area and computation time are considered to be important measures with which VLSI circuits are evaluated. In this paper, the area-time complexity for nontrivial n-input m-output Boolean functions, such as a decoder and an encoder, is studied with a model similar to Brent-Kung's model. A lower bound on area-time-product (ATaaa.=1) for these functions is shown: for example, ATa= ?(2n