Two Papers on a Symbolic Analyzer for MOS (Metal-Oxide Semiconductors) Circuits.

Abstract

A network of switches controlled by Boolean variables can be represented as a system of Boolean equations. The solution of this system gives a symbolic description of the conducting paths in the network. Gaussian elimination provides an efficient technique for solving sparse systems of Boolean equations. For the class of networks that arise when analyzing digital metal-oxide semiconductor (MOS) circuits, a simple pivot selection rule guarantees that most a switch networks encountered in practice can be solved with O(s) operations. When represented by a directed acyclic graph, the set of Boolean formulas generated by the analysis has total size bounded by the number of operations required by the Gaussian elimination. This paper presents the mathematical basis for systems of Boolean equations, their solution by Gaussian elimination, data structures and algorithms for representing and manipulating Boolean formulas.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Dec 01, 1987
Accession Number
ADA188617

Entities

People

  • R. E. Bryant

Organizations

  • Carnegie Mellon University

Tags

Communities of Interest

  • Advanced Electronics

DTIC Thesaurus Topics

  • Abstracts
  • Boolean Algebra
  • Circuit Analysis
  • Complementary Metal-Oxide Semiconductors
  • Computer Programs
  • Computer Science
  • Computers
  • Digital Circuits
  • Information Processing
  • Linear Systems
  • Logic
  • Logic Gates
  • Metal Oxide Semiconductors
  • Notation
  • Semiconductors
  • Simulations
  • Simulators

Fields of Study

  • Computer science

Readers

  • Calculus or Mathematical Analysis
  • Graph Algorithms and Convex Optimization.
  • Integrated Circuit Design and Technology.

Technology Areas

  • Microelectronics