Abstract
Several authors have investigated the complexity of a VLSI chip that solves a certain problem or class of problems. The results are stated in terms of a function R(A,T) of the chip area (A) and execution time (T) and are generally based on an abstract model of VLSI computation first defined by [T79] and further developed in [BK81] and [V80].
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Brent, R.P. and Kung, H.T.: “The Area-Time Complexity of Binary Multiplication”, JACM, V. 28, N. 3, pp. 521–534, 1981.
Flynn, M.J .: “Very High Speed Computing Systems”, Proc. IEEE, V. 54, pp. 1901–1909, 1966.
Hopcroft, J.E. and Ullman J.D.: “Introduction to Automata Theory, Languages, and Computation”, Addison-Wesley, 1979.
Kedem, Z.M. and Zorat, A.: “On Relations Between Input and Communication/Computation in VLSI”, Proc. 22-nd Annual Svm. on Foundations of Computer Science (to apper), 1981.
Lipton, R.J. and Sedgewick, R.: “Lower Bounds for VLSI”, Proc. 13-th Annual Sym. on Theory of Computing, pp. 300–307, 1981.
Lewis, P.M., Stearns, R.E., and Hartmanis, J.: “Memory Bounds for Recognition of Context-Free and Context-Sensitive Languages”Proc. 7-th Annual Sym. on Switching and Automata Theory, pp. 21–35, 1966.
Thompson, C.n .: Area-Time Complexity for VLSI, Proc 11-th Annual Svm. on Theory of Computing, pp. 81–88, 1979.
Vuillemin, J.: “A Combinatorial Limit to the Computing Power of V. L.S.I. Circuits”, Proc. 21-st Annual Sym. on Foundations of Computer Science, pp. 294–300, 1980.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1981 Carnegie-Mellon University
About this chapter
Cite this chapter
Kedem, Z.M., Zorat, A. (1981). Replication of Inputs May Save Computational Resources in VLSI. In: Kung, H.T., Sproull, B., Steele, G. (eds) VLSI Systems and Computations. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-68402-9_7
Download citation
DOI: https://doi.org/10.1007/978-3-642-68402-9_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-68404-3
Online ISBN: 978-3-642-68402-9
eBook Packages: Springer Book Archive