Graph-Based Algorithms for Boolean Function Manipulation
IEEE Transactions on ComputersPublished 1 August 1986Open access
Bryant
Citations8,829
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
Experimental results from applying a new data structure for representing Boolean functions and an associated set of manipulation algorithms to problems in logic design verification demonstrate the practicality of this approach.
Abstract
Computer Science Department
Keywords
Computer ScienceEngineering
The Design and Analysis of Computer Algorithms
9,456 Citations1974Alfred V. Aho, John E. Hopcroft
This text introduces the basic data structures and programming techniques often used in efficient algorithms, and covers use of lists, push-down stacks, queues, trees, and graphs.
Kluwer international series in engineering and computer scienceLogic Minimization Algorithms for VLSI Synthesis
1,951 Citations1984Robert K. Brayton, Gary D. Hachtel +2 more
This chapter discusses the implementation and results of the ESPRESSO Minimization Loop and Algorithms, and some of the applications of logic minimization in the real world.
IEEE Transactions on Electronic ComputersA Suggestion for a Fast Multiplier
1,775 Citations1964Christopher S. Wallace
A design is developed for a multiplier which generates the product of two numbers using purely combinational logic, i.e., in one gating step, using straightforward diode-transistor logic.
Transactions of the American Institute of Electrical EngineersA symbolic analysis of relay and switching circuits
1,008 Citations1938Claude E. Shannon
It will be shown that several of the well-known theorems on impedance networks have roughly analogous theorem in relay circuits, including the delta-wye and star-mesh transformations, and the duality theorem.
Bell System Technical JournalRepresentation of Switching Circuits by Binary-Decision Programs
689 Citations1959C. Y. Lee
The paper shows the relationship between switching circuits and binary-decision programs and gives a set of simple rules by which one can transform binary- Decision programs to switching circuits, and shows that binary-Decision programming representation is superior to the usual Boolean representation.
ACM Computing SurveysDecision Trees and Diagrams
331 Citations1982Bernard M. E. Moret
In this tutorial survey a common framework of defimtmns and notation is established, the contributions from the main fields of apphcatmn are reviewed, recent results and extensions are presented, and areas of ongoing and future research are discussed.
Students Quarterly JournalIntroduction to Switching Theory and Logical Design
203 Citations1969
This edition features design with MSI circuits, including PLA's, and register transfer (state machine) approaches to sequential system design.
Journal of the ACMThe Area-Time Complexity of Binary Multiplication
198 Citations1981Richard P. Brent, H. T. Kung
By using a model of computation which is a realistic approx~mauon to current and anucipated LSI or VLSI technology, it is shown that A T 2.0 is shown to be the time required to perform multtphcaUon of n-bit binary numbers on a chip.
IEEE Transactions on Electronic ComputersMajority Gate Networks
86 Citations1964Saul Amarel, G. Cooke +1 more
This paper presents methods for realizing simple threshold functions of n arguments by networks of k-input majority gates, where k≪n.
Lecture notes in computer scienceThe complexity of equivalence and containment for free single variable program schemes
82 Citations1978Steven Fortune, John E. Hopcroft +1 more
Non-containment for free single variable program schemes is shown to be NP-complete and a polynomial time algorithm for deciding equivalence of two free schemes, provided one of them has the predicates appearing in the same order in all executions, is given.
Communications of the ACMInformation transfer and area-time tradeoffs for VLSI multiplication
71 Citations1980Harold Abelson, Peter Andreae
It is shown that communication considerations alone dictate that any VLSI design for computing the 2-bit product of two n-bit integers must satisfy the constraint AT-AT-2/64.
IBM Systems JournalA three-value computer design verification system
57 Citations1969J. S. Jephson, R. P. McQuarrie +1 more
An experimental system for verifying logic designs in the development of a computer before a commitmeat to produce the computer is made by simulating logic activity with both known and unknown values.
Journal of General MicrobiologyReticulation and Other Methods of Reducing the Size of Printed Diagnostic Keys
6 Citations1977R. W. Payne
Long keys are now easily constructed by computer, thus compact representations have become important and reticulation, as described in this communication, gives further savings.