Exact calculation of synchronization sequences based on binary decision diagrams

A synchronization sequence for a synchronous design D is a sequence of primary input vectors which when applied to any initial state of D will drive D to a single state, called a reset state. The authors present efficient methods based upon the universal alignment theorem and binary decision diagram...

Full description

Saved in:
Bibliographic Details
Published in[1992] Proceedings 29th ACM/IEEE Design Automation Conference pp. 620 - 623
Main Authors Pixley, C., Jeong, S.-W., Hachtel, G.D.
Format Conference Proceeding
LanguageEnglish
Published IEEE Comput. Soc. Press 1992
Subjects
Boolean functions
Clocks
Combinational circuits
Data structures
Drives
Electrostatic precipitators
Flip-flops
Logic design
Optimization methods
Synchronization
Online AccessGet full text
ISBN9780818628221
0818628227
ISSN0738-100X
DOI10.1109/DAC.1992.227811

Cover

More Information
Summary:A synchronization sequence for a synchronous design D is a sequence of primary input vectors which when applied to any initial state of D will drive D to a single state, called a reset state. The authors present efficient methods based upon the universal alignment theorem and binary decision diagrams to compute a synchronization sequence, to compute a tight lower bound for the length of such a sequence, and to check that an initial state given in the specification is a reset state. It was shown in the experiments that the proposed method can handle fairly large circuits and the length of the actual synchronization sequence computed is quite close to the lower bound.< >
ISBN:9780818628221
0818628227
ISSN:0738-100X
DOI:10.1109/DAC.1992.227811