A Novel Scheme for Fault Tolerant Computing

Pramode Ranjan Bhattacharjee

Retired Principal, Kabi Nazrul Mahavidyalaya, Sonamura, Tripura 799131, India  

A novel scheme for ensuring reliability in the operation of a combinational digital network has been offered in this paper. This has been achieved by making use of three copies of the same digital network along with two additional sub-networks, one of which consists of three additional control inputs, which can also be used as additional observable outputs. If both the said two sub-networks are fault free, then the primary output of the network in the present scheme will always give fault-free responses even if a fault (single or multiple) occurs in one of the three copies of the digital network under consideration. Unlike the Triple Modular Redundancy (TMR) scheme, the present scheme does not require any majority voter circuit. Furthermore, unlike the TMR scheme, the additional sub-networks in the present scheme can be tested off-line by predefined test input patterns.

Combinational digital network, Stuck-at- fault, S-a-0 and S-a-1 faults, Reliability of a digital network, Fault masking

Pramode Ranjan Bhattacharjee (2021). A Novel Scheme for Fault Tolerant Computing. Journal of the Institute of Electronics and Computer, 3, 17-23. https://doi.org/10.33969/JIEC.2021.31002.

[1] Yau, S. S. and Tang, Y.S. (1971) An efficient algorithm for generating complete test sets for combinational logic circuits. IEEE Trans. Comput., C-10, 1245-1251. 

[2] Ku, C. T and Masson, G. M. (1975) The Boolean difference and Multiple fault Analysis. IEEE Trans. Comput., C-24, 62-71.

[3] Wang, D. T. (1975) An algorithm for the generation of test sets for combinational logic networks, IEEE Trans. Comput., C-24, 742-746.

[4] Papaioannou, S. G. (1977) Optimal test generation in combinational networks by pseudo-Boolean programming. IEEE Trans. Comput., C-26, 553-560.

[5] Ahmed, Z. (2012) A method for test pattern generation of combinational circuits using ordinary algebra. International Journal of Computer and Information Technology. 1, 1-8. 

[6] Roth, J. P. (1966) Diagnosis of automata failure: A calculus and a Method. IBM J. Res. Develop., 10, 278-291.

[7] Fujiwara, H. and Shimono, T. (1983) On the Acceleration of Test Generation Algorithms. IEEE Trans. Comput., C-32, 1137-1144.

[8] Von Neumann, J. (1956) Probabilistic Logics and Synthesis of Reliable Organisms from Unreliable Components. In: Shannon, C.E. and McCarthy, J., Eds., Automata Studies, in Annals of Mathematical Studies, No. 34, Princeton University Press, Princeton, 43-98.

[9] Isermann, R. (2006) Fault-Diagnosis Systems: An Introduction from Fault Detection to Fault Tolerance; Springer Science & Business Media: Berlin/Heidelberg, Germany

[10] Kshirsagar, R. V. and Patrikar, R. M. (2009) Design of a novel fault-tolerant voter circuit for TMR implementation to improve reliability in digital circuits. Microelectron. Reliab., 49, 1573–1577.

[11] Kohavi, Z. (1978) Switching and Finite Automata failure, 2nd edition, Tata McGraw-Hill Publishing Company Limited, New Delhi, India.