Berger code-based concurrent error detection in asynchronous burst-mode machines

ABSTRACT

We discuss the use of the Berger code for Concurrent Error Detection (CED) in Asynchronous Burst-Mode Machines (ABMMs). We present a state encoding method which guarantees the existence of the two key components for Berger-encoding an ABMM, namely an inverter-free ABMM implementation of the circuit and an ABMM implementation of the corresponding Berger code generator. We also propose improved solutions to two inherent problems of CED in ABMMs, namely checking synchronization and detection of error-induced hazards. Experimental results demonstrate that Berger code-based CED reduces significantly the cost of previous CED methods for ABMMs.

REFERENCES

• 1: N. K. Jha and S.-J. Wang, "Design and synthesis of self-checking VLSI circuits," IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, vol. 12, no. 6, pp. 878--887, 1993.
• 2: Robert M. Fuhrer , Steven Nowick, Sequential Optimization of Asynchronous and Synchronous Finite-State Machines: Algorithms and Tools, Kluwer Academic Publishers, Norwell, MA, 2001
• 3: G. De Micheli, R. K. Brayton, and A. Sangiovanni-Vincentelli, "Optimal state assignment for finite state machine," IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, vol. 4, no. 3, pp. 269--285, 1985.
• 4: Sobeeh Almukhaizim , Yiorgos Makris, Concurrent Error Detection in Asynchronous Burst-Mode Controllers, Proceedings of the conference on Design, Automation and Test in Europe, p.1272-1277, March 07-11, 2005 [doi>10.1109/DATE.2005.101]
• 5: X. Kavousianos , D. Nikolos, 16.1 Novel Single and Double Output TSC Berger Code Checkers, Proceedings of the 16th IEEE VLSI Test Symposium, p.348, April 26-30, 1998