Abstract/Details

Bounding of switching activity in logic circuits

Zejda, Jindrich.   Universite de Montreal (Canada) ProQuest Dissertations Publishing,  1999. NQ43744.

Abstract (summary)

The thesis presents algorithms, implementation, and results of a new method based on constraint resolution for finding an upper bound on switching activity in the combinational part of a synchronous sequential circuit. The obtained switching activity is the major component for computing circuit power consumption (peak power) and several reliability parameters (e.g., voltage drops in power busses, electromigration). It is a static (input-pattern independent) method. The constraint system representing the circuit is built of constraints defined by gates and the operating environment of the circuit. The variables of the constraint system are all possible waveforms abstracted into four classes and expressed as sets of transitions for each unit of discrete time. The constraints of the constraint system are derived from the gates. Each gate is translated into a projection function which constrains each of its terminals based on the values on all other terminals independently of the netlist distinction between gate inputs and outputs. The method rapidly computes an upper bound on the switching activity. The bound is further tightened by case analysis.

Two major techniques were used to capture a global picture of the circuit and use this acquired information to speed up or improve the analysis. They are reconvergent region analysis and global learning.

The method has two major applications: estimation of peak power and estimation of peak current. Both application were tested with our C++ implementation on ISCAS'85 benchmark circuits and the quality of the results for different heuristics was compared. The results show that each heuristic is more suitable for a different type of circuit. The method was also compared with exhaustive simulation on a set of MCNC circuits.

The current implementation supports the fixed gate delay model and shares most of the code with a timing verification method based on constraint resolution. The performance is further improved by a parallel implementation of the case analysis on a network of inexpensive workstations. Our C++ implementation shows speedup of 8 on a homogeneous network of 10 workstations, and 47 on a heterogeneous network of 87 workstations. (Abstract shortened by UMI.)

Indexing (details)


Subject
Computer science;
Electrical engineering
Classification
0984: Computer science
0544: Electrical engineering
Identifier / keyword
Applied sciences; Bounding; Constraints; Logic circuits; Switching
Title
Bounding of switching activity in logic circuits
Author
Zejda, Jindrich
Number of pages
267
Degree date
1999
School code
0992
Source
DAI-B 61/01, Dissertation Abstracts International
Place of publication
Ann Arbor
Country of publication
United States
ISBN
978-0-612-43744-9
Advisor
Cerny, Eduard
University/institution
Universite de Montreal (Canada)
University location
Canada -- Quebec, CA
Degree
Ph.D.
Source type
Dissertation or Thesis
Language
English
Document type
Dissertation/Thesis
Dissertation/thesis number
NQ43744
ProQuest document ID
304567812
Copyright
Database copyright ProQuest LLC; ProQuest does not claim copyright in the individual underlying works.
Document URL
https://www.proquest.com/docview/304567812