Gate-level simulation of digital circuits using multi-valued Boolean algebras

Authors:
Scott Woods;Giorgio Casinovi
Affiliations:
School of Electrical & Computer Engineering, Georgia Institute of Technology, Atlanta, GA;School of Electrical & Computer Engineering, Georgia Institute of Technology, Atlanta, GA
Venue:
ICCAD '95 Proceedings of the 1995 IEEE/ACM international conference on Computer-aided design
Year:
1995

Citing 3
Cited 1

Graph-Based Algorithms for Boolean Function Manipulation

IEEE Transactions on Computers
Fundamentals of computer-aided circuit simulation

Fundamentals of computer-aided circuit simulation
Efficient implementation of a BDD package

DAC '90 Proceedings of the 27th ACM/IEEE Design Automation Conference

Efficient solution of systems of Boolean equations

Proceedings of the 1996 IEEE/ACM international conference on Computer-aided design

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper describes an algorithm for the simulation of gate-level logic. Multiple logic levels are used to describe the state of each node. Each state corresponds to a different voltage level, and the number of levels to be used for a simulation is user-defined. This feature simplifies considerably the interface between a digital and an analog simulator. A DC solver is incorporated to find the initial operating point of a circuit before a transient analysis begins. This solver has the capability of finding the operating point of gates located in feedback loops. For transient analysis, a gate delay model that takes into account the slope of the input waveforms is used. The performance of the algorithm is demonstrated by simulations of a number of benchmark circuits.