Open AccessBook
Computational Aspects of Vlsi
Reads0
Chats0
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.read more
Citations
More filters
Journal ArticleDOI
The Well-Connected Processor Array
TL;DR: The concept of a burden placed on a PE by the lines connected to or passing through it is introduced and a lower bound of k=Ω(d3/2/e) is derived on the connectivity required by a WECPAR to embed any graph of degree ≥ d with expansion e; for e = 1, this result is sharp.
Journal ArticleDOI
An improved upper bound on the number of intersections between two rectangular paths
Kim-Heng Teo,Tai-Ching Tuan +1 more
TL;DR: The directed path connecting MO to M, through a horizontal line segment and then a vertical line segment, denoted by &,,,,M, is called a horizontal (respectively, vertica?i Mhanhattan path).
Journal ArticleDOI
Routing and broadcasting on incomplete and gray code incomplete hypercubes
TL;DR: A new model of computation, Gray code incomplete hypercube (GCIH), which is an interval of nodes of hypercube in Gray code order, is introduced, and similar results are obtained for the new model.
Proceedings ArticleDOI
A parallel algorithm for finding a maximum flow in 0-1 networks
Liwu Li,Tony Marsland +1 more
TL;DR: This design is for a mesh-connected processor array and is based on the observation that an augmenting path in a 0-1-network can be found in time proportional to the number of vertices in the given network, rather than to thenumber of edges.
Journal ArticleDOI
A VLSI system for string matching
TL;DR: A VLSI system for solving the string matching problem in O(log n + log | Σ |) time with O( m n log m log n ) area and Pipelining allows us to consecutively solve several different string matching instances with an O( log|Σ|) time period between two successive instances.