scispace - formally typeset
Open AccessBook

Computational Aspects of Vlsi

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

Example of combined algorithm development and architecture design

TL;DR: In many modern signal processing applications, in particular real-time and adaptive signal processing, there is a strong relationship between the algorithms that compute solutions to problems and the architectures onto which the algorithms can be or should be mapped.
Book ChapterDOI

On the sizes of permutation networks and consequences for efficient simulation of hypercube algorithms on bounded-degree networks

TL;DR: The sizes of permutation networks for special sets of permutations are investigated and several asymptotically optimal estimations for distinct subsets of the set of all permutation are established.
Journal ArticleDOI

Geometric transformations for optimum VLSI layout placement

TL;DR: The geometric transformation of each system component is handled by the GEOMETRIA graph description language, which converts the shape of the layout area, occupied by a component, into a new one in order to make it fittable appropriately in the “open holes” at the chip area.
Journal ArticleDOI

A fast VLSI solution for approximate string matching

TL;DR: A simple hardware algorithm is proposed for the approximate string matching problem, where a string is searched in a large, flat text with a bounded number of insertions, deletions and substitutions.
Posted Content

Optimal Component Labeling Algorithms for Mesh-Connected Computers and VLSI

TL;DR: Given an undirected graph G of n weighted edges, stored one edge per processor in a square mesh of n processors, it is shown how to determine the connected components and a minimal spanning forest in p n time.