Book•
Computational Aspects of Vlsi
01 Jan 1984-
About: The article was published on 1984-01-01 and is currently open access. It has received 862 citations till now. The article focuses on the topics: Very-large-scale integration.
Citations
More filters
TL;DR: This work shows how to obtain, for any k in the range [1, 1 2 n] , a layout of O(n + k log n) volume, and shows that these bounds are optimal within a constant factor.
15 citations
TL;DR: A constrained reconfigurable mesh model which incorporates practical assumptions about propagation delays on large sized buses is introduced and predicts a continuum in performance between the reconfigured mesh and mesh of processors architectures.
15 citations
Journal Article•
TL;DR: The paper provides lower bounds on the energy consumption and demonstrates an energy-time trade-off in optical computations and characterizes the energy requirements of 3-D VLSI computations.
Abstract: The paper provides lower bounds on the energy consumption and demonstrates an energy-time trade-off in optical computations. All the lower bounds are shown to have the matching upper bounds for a transitive function-shifting. Since the energy consumption in an optical transmission is a nonlinear function of the distance, a new setof techniques was required to derive these lower bounds. It also characterizes the energy requirements of 3-D VLSI computations. >
15 citations
TL;DR: A theory of VLSI transformability reveals the inherent AT2 andA complexity of a large class of related problems.
Abstract: The two basic performance parameters that capture the complexity of any VLSI chip are the area of the chip,A, and the computation time,T. A systematic approach for establishing lower bounds onA is presented. This approach relatesA to the bisection flow, ź. A theory of problem transformation based on ź, which captures bothAT2 andA complexity, is developed. A fundamental problem, namely, element uniqueness, is chosen as a computational prototype. It is shown under general input/output protocol assumptions that any chip that decides ifn elements (each with (1+ź)lognbits) are unique must have ź=ź(nlogn), and thus, AT2=ź(n2log2n), andA= ź(nlogn). A theory of VLSI transformability reveals the inherentAT2 andA complexity of a large class of related problems.
15 citations
TL;DR: A new general optimization paradigm called stochastic probe is proposed to integrate the advantages of both the aggressive searches and the stochastics searches, and all of the three new algorithms produce significantly better solutions than the LPK algorithm.
15 citations