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 organization of permutation architectures with bused interconnections
TL;DR: This paper explores the problem of efficiently permuting data stored in VLSI chips in accordance with a predetermined set of permutations by connecting chips with shared bus interconnections, as opposed to point-to-point interConnections, and shows that the number of pins per chip can often be reduced.
Journal ArticleDOI
Using graph parsing for automatic graph drawing
TL;DR: In this article, a clan-based graph drawing tool (CG) is proposed to automatically draw directed graphs using tree properties with the addition of "routing nodes" to route the edges.
Posted Content
Finding the Maximal Empty Rectangle Containing a Query Point
Haim Kaplan,Micha Sharir +1 more
TL;DR: An algorithm to preprocess a set of points in an axis-parallel rectangle into a data structure of size O(n\alpha(n)\log^3 n)$, such that, given a query point, it can find the largest-area axis-Parallel rectangle that is contained in B, which contains no point of P.
Journal ArticleDOI
Tight chip area lower bounds for discrete Fourier and Walsh-Hadamard transformations☆
TL;DR: Tight linear lower bounds on the area of VLSI circuits for the problems of discrete Fourier and Walsh-Hadamard transformations of n k-bit elements are proved.
Proceedings Article
SOLVING TREE PROBLEMS ON A MESH-CONNECTED PROCESSOR ARRAY (Preliminary Version)
TL;DR: This paper presents techniques that result in O(√n) time algorithms for computing many properties and functions of an n-node forest stored in an √n × √ n mesh of processors.