Proceedings Article10.1109/ICCD.1993.393341
Logic optimization with multi-output gates
Y. Watanabe,L. Guerra,Robert K. Brayton +2 more
- 03 Oct 1993
- pp 416-420
11
TL;DR: This paper provides a procedure for computing a maximally-compatible set of permissible relations for multiple-output gates and proposes a heuristic for clustering single- Output gates into multi- output gates, so that increased concurrent optimization can be obtained.
read more
Abstract: This paper is concerned with logic optimization of multi-output gates in multi-level combinational logic circuits. We address how a concurrent minimization over multiple gates can lead to further optimization as compared to conventional single-gate minimization techniques. In particular, we provide a procedure for computing a maximally-compatible set of permissible relations for multiple-output gates. We also propose a heuristic for clustering single-output gates into multi-output gates, so that increased concurrent optimization can be obtained. >
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Using simulation and satisfiability to compute flexibilities in Boolean networks
Alan Mishchenko,Jin S. Zhang,Subarna Sinha,Jerry R. Burch,Robert K. Brayton,Malgorzata Chrzanowska-Jeske +5 more
TL;DR: This paper shows how simulation and satisfiability (S&S) can be tightly integrated to efficiently compute flexibilities in a multilevel Boolean network, including the following: 1) complete "don't cares" (CDCs); 2) sets of pairs of functions to be distinguished (SPFDs); and 3) setsof candidate nodes for resubstitution.
Comprehensive frequency-dependent substrate noise analysis using boundary element methods
Hongmei Li,Jorge Carballido,Harry H. Yu,Vladimir Okhmatovski,Elyse Rosenbaum,Andreas C. Cangellaris +5 more
- 10 Nov 2002
TL;DR: In this article, a new and efficient method is introduced for the calculation of the Green's function that can accommodate arbitrary substrate doping profiles and thus facilitate substrate noise analysis using boundary element methods.
Compatible observability don't cares revisited
Robert K. Brayton
- 04 Nov 2001
TL;DR: This work discusses Savoj's CODC computation for propagating CODCs from a node's output to its fanins, and shows by example, that the results can depend on the current implementation of the node.
18
Optimizing designs containing black boxes
Tai-Hung Liu,Khurram Sajid,Adnam Aziz,Vigyan Singhal +3 more
- 13 Jun 1997
TL;DR: A sound and complete methodology for optimizing designs containing black boxes i.e., components whose functionality is not known and which arise naturally in the course of hierarchical design.
A Theory of Non-Deterministic Networks
Alan Mishchenko,Robert K. Brayton +1 more
- 09 Nov 2003
TL;DR: A theory for representing and manipulating non-deterministic multi-level networks is developed and it is shown that an ND network's behavior can be interpreted in three ways, all of which coincide when the network is deterministic.
References
Graph-Based Algorithms for Boolean Function Manipulation
TL;DR: In this paper, the authors present a data structure for representing Boolean functions and an associated set of manipulation algorithms, which have time complexity proportional to the sizes of the graphs being operated on, and hence are quite efficient as long as the graphs do not grow too large.
The Problem of Simplifying Truth Functions
TL;DR: The Problem of Simplifying Truth Functions is concerned with the problem of reducing the number of operations on a graph to a simple number.
963
Multiple-Valued Minimization for PLA Optimization
TL;DR: Results show that the heuristic algorithm Espresso-MV comes very close to producing optimum solutions for most of the examples, and shows how important multiple-valued minimization can be for PLA optimization.
463
•Book
Logic Design Principles: With Emphasis on Testable Semicustom Circuits
Edward J. McCluskey
- 01 Jan 1986
TL;DR: Logic design principles: with emphasis on testable semicustom circuits, Logic design principles with focus on testability semicustomcircuits, and more.
370
ESPRESSO-SIGNATURE: A New Exact Minimizer for Logic Functions
Patrick C. McGeer,Jagesh V. Sanghavi,Robert K. Brayton,Alberto Sangiovanni Vincentelli +3 more
- 01 Jul 1993
TL;DR: A new algorithm for exact two-level logic optimization which radically improves the Quine-McCluskey (QM) procedure and improves on the runtime and memory usage of ESPRESSO-EXACT by average factors of 1.78 and 1.19.
163