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: Revue des methodes de coupures multiples appliquees a la determination de la complexite des circuits VLSI, basees sur une definition generalisee du «contenu d'information», s'agissent aux problemes autorisant ou non la repetition des entrees.
5 citations
01 Jan 1985
TL;DR: In this paper, the authors present a theoretical foundation for the design of mesh-connected processor arrays for the transitive closure problem, using a simple path-algebraic formulation and observing its similarity to certain well-known smoothing problems that occur in digital signal processing.
Abstract: The main purpose in this paper is to lay a theoretical foundation for the design of mesh-connected processor arrays for the transitive closure problem. Using a simple path-algebraic formulation of the problem and observing its similarity to certain well-known smoothing problems that occur in digital signal processing, we show how to draw upon existing techniques from the signal processing literature to derive regular iterative algorithms for determining the transitive closure of the graph. The regular iterative algorithms that are derived using these considerations, are then analyzed and synthesized on mesh-connected processor arrays. Among the vast number of mesh-connected processor arrays that can be designed using this unified approach, the systolic arrays reported in the literature for this problem are shown to be special cases.
5 citations
TL;DR: The results show how weight and structural restrictions of general BDDs influence the complexity of the hardest function in terms of high accuracy asymptotic bounds.
Abstract: In this paper we study the representation of Boolean functions by general binary decision diagrams (BDDs). We investigate the size L(Σ) (number of inner nodes) of BDD Σ with different constraints on the number M(Σ) of its merged nodes. Furthermore, we introduce a weighted complexity measure W(Σ) = L(Σ) + ωM(Σ), where ω > 0. For the hardest Boolean function on n input variables we define the weight WBDD(n) and the size LBDD(n,t), where t limits the number of merged nodes. By using a new synthesis method and appropriate restrictions for the number t of merged nodes, we are able to prove tight upper and lower asymptotic bounds: WBDD(n) = 2n/n (1 + log n ± O(1)/n), LBDD(n,t) = 2n/log nt (1 ± O(1/n)), which have a relative error of O(1/n). Our results show how weight and structural restrictions of general BDDs influence the complexity of the hardest function in terms of high accuracy asymptotic bounds.
5 citations
25 Feb 1993
TL;DR: Interconnection networks for parallel computers, tools for their efficient use and the parallelization of a problem which is hard to parallelize (chess programming) are described.
Abstract: In this paper we want to demonstrate the large impact of theoretical considerations on the design and efficient use of parallel machines We describe interconnection networks for parallel computers, tools for their efficient use (mapping, load balancing) and the parallelization of a problem which is hard to parallelize (chess programming)
4 citations
Cites background from "Computational Aspects of Vlsi"
...[ 53 ]). First, we want to minimize the dilation of the embedding....
[...]