Unfaithful Glitch Propagation in Existing Binary Circuit Models

We show that no existing continuous-time, binary value-domain model for digital circuits is able to correctly capture glitch propagation. Prominent examples of such models are based on pure delay channels (P), inertial delay channels (I), or the elaborate Delay Degradation Model (DDM) channels proposed by Bellido-Diaz et al. We accomplish our goal by considering the border between solvability and non-solvability of a simple problem called short-pulse filtration (SPF), which is closely related to arbitration and synchronization. On one hand, we prove that SPF is solvable in bounded time in any such model that provides channels with non constant delay, like I and DDM. This is in opposition to the impossibility of solving bounded SPF in real (physical) circuit models. On the other hand, for binary circuit models with constant-delay channels, we prove that SPF cannot be solved even in unbounded time; again in opposition to physical circuit models. Consequently, indeed none of the binary value-domain models proposed so far (and that we are aware of) faithfully captures glitch propagation of real circuits. We finally show that these modeling mismatches do not hold for the weaker eventual SPF problem.

[1]  Cristian Constantinescu,et al.  Trends and Challenges in VLSI Circuit Reliability , 2003, IEEE Micro.

[2]  Stephen H. Unger.  Asynchronous Sequential Switching Circuits with Unrestricted Input Changes , 1971, IEEE Trans. Computers.

[3]  M. S. Maza,et al.  Analysis of clock distribution networks in the presence of crosstalk and groundbounce , 2001, ICECS 2001. 8th IEEE International Conference on Electronics, Circuits and Systems (Cat. No.01EX483).

[4]  Janusz A. Brzozowski,et al.  On the Delay-Sensitivity of Gate Networks , 1992, IEEE Trans. Computers.

[5]  Brian W. Johnson,et al.  Equivalence of the Arbiter, the Synchronizer, the Latch, and the Inertial Delay , 1983, IEEE Transactions on Computers.

[6]  Michael Mendler,et al.  Newtonian arbiters cannot be proven correct , 1993, Formal Methods Syst. Des..

[7]  Shlomi Dolev,et al.  Self Stabilization , 2004, J. Aerosp. Comput. Inf. Commun..

[8]  Andreas Steininger,et al.  On the Threat of Metastability in an Asynchronous Fault-Tolerant Clock Generation Scheme , 2009, 2009 15th IEEE Symposium on Asynchronous Circuits and Systems.

[9]  Johannes Schoissengeier.  The discrepancy of (nα)n≧1 , 1993 .

[10]  Thomas J. Chaney,et al.  Q-Modules: Internally Clocked Delay-Insensitive Modules , 1988, IEEE Trans. Computers.

[11]  M.J. Gadlage,et al.  Digital Device Error Rate Trends in Advanced CMOS Technologies , 2006, IEEE Transactions on Nuclear Science.

[12]  Robert F. Tichy,et al.  Sequences, Discrepancies and Applications , 1997 .

[13]  Manuel J. Bellido,et al.  Logic-Timing Simulation and the Degradation Delay Model , 2005 .

[14]  Antonio J. Acosta,et al.  Logical modelling of delay degradation effect in static CMOS gates , 2000 .

[15]  D. J. Kinniment.  Synchronization and Arbitration in Digital Systems , 2008 .

[16]  Leonard R. Marino,et al.  General theory of metastable operation , 1981, IEEE Transactions on Computers.

[17]  Peter J. Ashenden,et al.  The Designer's Guide to VHDL , 1995 .

[18]  Ivan E. Sutherland,et al.  Micropipelines , 1989, Commun. ACM.

[19]  Leonard R. Marino,et al.  The Effect of Asynchronous Inputs on Sequential Network Reliability , 1977, IEEE Transactions on Computers.

[20]  Matthias Függer,et al.  Reconciling fault-tolerant distributed computing and systems-on-chip , 2011, Distributed Computing.

[21]  E. Haacke.  Sequences , 2005 .

[22]  Michael S. Branicky,et al.  Universal Computation and Other Capabilities of Hybrid and Continuous Dynamical Systems , 1995, Theor. Comput. Sci..

[23]  Matthias Függer,et al.  Fault-Tolerant Algorithms for Tick-Generation in Asynchronous Logic: Robust Pulse Generation - [Extended Abstract] , 2011, SSS.