Premium
Relaxation‐based computation of a synchronous sequential circuit stable state
Author(s) -
Diouf Magatte,
Carlin CharlesHenri
Publication year - 1992
Publication title -
international journal of circuit theory and applications
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.364
H-Index - 52
eISSN - 1097-007X
pISSN - 0098-9886
DOI - 10.1002/cta.4490200204
Subject(s) - computation , context (archaeology) , relaxation (psychology) , state (computer science) , waveform , convergence (economics) , computer science , sequential logic , transient (computer programming) , algorithm , electronic circuit , logic gate , mathematics , control theory (sociology) , engineering , electrical engineering , psychology , social psychology , paleontology , radar , telecommunications , control (management) , artificial intelligence , economics , biology , economic growth , operating system
To perform a mixed mode analysis with the electrical and gate levels in the waveform relaxation context, an initial steady state of the analysed circuit must be computed prior to transient analysis. By using Boolean algebra and discrete relaxation, we propose various algorithms to compute a stable state or a stable total state of a logic synchronous sequential system with master‐slave flip‐flops. Furthermore, a dynamic ordering of the logic gates which improves the convergence of the computation of a stable total state is presented. We show that a stable state can be calculated within only two iterations.