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
28 Aug 1991
TL;DR: A signal value representation including both unknown state and a degree of strength indeterminacy has been shown to provide greater modeling accuracy to the lattice theoretic approach.
Abstract: A signal value representation including both unknown state and a degree of strength indeterminacy has been shown to provide greater modeling accuracy to the lattice theoretic approach. The lattice approach facilitates the development of higher-order logic functions that can be used to reason about VLSI circuits. Such signal value functions are required for the integration of verification environments, such as HOL, with modern CAD VLSI design tools.
3Â citations
Cites methods from "Computational Aspects of Vlsi"
...The signal values represented in the NOVA simulation engiine are an extension of Bryant's lattice theoretic approach [8] [12]....
[...]
01 Apr 1988
TL;DR: This paper surveys and illustrates the characteristics-based approach, language-basedapproaches, linear algebra- based approach, Linear algebra-Based approach and graph-based approaches in current research on the mapping problem.
Abstract: The mapping problem is the process of implementing a computational task on a target architecture in order to maximize some performance metric. This problem is fundamental to parallel computation and researchers have taken a number of different approaches to solve it. This paper surveys and illustrates the characteristics-based approach, language-based approach, linear algebra-based approach and graph-based approach in current research on the mapping problem. Some general themes of these approaches are discussed and contrasted in the last section.
3Â citations
16 Aug 1993
TL;DR: It is shown that a BBT can simulate a tree machine optimally and can be used as a building block to construct new powerful parallel computing structures.
Abstract: We propose a class of new multiprocessor structures called bus based trees (BBTs) that are based on multiple buses. We show that a BBT can simulate a tree machine optimally. We also discuss optimal VLSI layouts for the BBT and show that the BBT can be used as a building block to construct new powerful parallel computing structures.
3Â citations
10 May 1992
TL;DR: The authors have implemented the normalization using a method that integrates it with the CORDIC iterations, resulting in an elegant solution to the problem of unnormalized input values.
Abstract: An analysis of fixed-point CORDIC (COordinate Rotation DIgital Computer) in the Y-reduction mode, which allows computation of the inverse tangent function, has shown that unnormalized input values can result in large numerical errors. The complexity of a floating-point implementation of the entire system can be avoided by locally normalizing the values before using CORDIC. The authors have implemented the normalization using a method that integrates it with the CORDIC iterations, resulting in an elegant solution to the problem. The method requires only O(n/sup 1.5/) extra hardware and does not affect the latency. It is believed that this scheme can be extended to the other modes of CORDIC. >
3Â citations