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
Proceedings ArticleDOI
Optimal Partitioning And Redundancy Removal In Computing Partial Sums
TL;DR: In this paper, two algorithms for concurrent computation of a large number of partial sums are introduced, their performance assessed, and architectures for their implementation suggested, and their performance is based on a new concept of optimal partitioning and redundancy removal in arithmetic intensive, high throughput computing.
Book ChapterDOI
Knowledge Discovery in Graphs Through Vertex Separation
TL;DR: This paper presents the ongoing work on the Vertex Separator Problem (VSP), and its application to knowledge discovery in graphs representing real data, and proposes several variants to adapt this model to graphs with various properties.
Proceedings ArticleDOI
Efficient VLSI Layout of Edge Product Networks
TL;DR: This paper represents efficient upper bounds on the layout area and maximum wire length by constructing layouts based on separators and bifurcators by using the obtained upper bound on maximal congestion.
Proceedings ArticleDOI
Time- and cost-optimal parallel algorithms for the dominance and visibility graphs /spl lsqb/IC design/spl rsqb/
TL;DR: This paper shows that with a collection of n non-overlapping rectangles as input, both the dominance graph and the visibility graph can be constructed in /spl Theta/(log n) time using n processors in the CREW model.
Journal ArticleDOI
Evaluation of complexity for different layouts of butterfly networks
TL;DR: Criteria for layout construction are derived from the ones proposed for flow graph-based circuits, and evaluation of complexity is given in terms of recurrence equations expressing the area required by the different layouts.