Coding approaches to fault tolerance in linear dynamic systems

IEEE Transactions on Information Theory

Volumn 51, Issue 1, 2005, Pages 210-228

  Hadjicostis, Christoforos N ^a   Verghese, George C ^b  

^a UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Fault tolerance; Linear dynamic systems; Linear finite state machines (LFSMs); Transient faults; Unreliable error correction

Indexed keywords

CODING ERRORS; DISCRETE TIME CONTROL SYSTEMS; ERROR CORRECTION; ERROR DETECTION; LINEAR CONTROL SYSTEMS; PROBABILITY; REDUNDANCY; SYSTEMS ANALYSIS; THEOREM PROVING;

LINEAR DYNAMIC SYSTEMS; LINEAR FINITE STATE MACHINES (LFSMS); TRANSIENT FAULTS; UNRELIABLE ERROR CORRECTION;

FAULT TOLERANT COMPUTER SYSTEMS;

EID: 12444282770     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2004.839491     Document Type: Article

References (84)

1. B. Johnson, Design and Analysis of Fault-Tolerant Digital Systems. Reading, MA: Addison-Wesley, 1989.
2. D. K. Pradhan, Fault-Tolerant Computer System Design. Englewood Cliffs, NJ: Prentice-Hall, 1996.
3. D. Siewiorek and R. Swarz, Reliable Computer Systems: Design and Evaluation. Natick, MA: A.K. Peters, 1998.
4. P. Larsson and C. Svensson, "Noise in digital dynamic CMOS circuits," IEEE J. Solid-State Circuits, vol. 29, no. 6, pp. 655-662, Jun. 1994.
5. K. L. Shepard and V. Narayanan, "Noise in deep submicron digital design," in Proc. Int. Conf. Computer-Aided Design (ICCAD 1996 , 1996, pp. 524-531.
6. I. Amlani, A. O. Orlov, G. Toth, G. H. Bernstein, C. S. Lent, and G. L. Snider, "Digital logic gate using quantum-dot cellular automata," Science, vol. 284, Apr. 1999.
7. C. N. Hadjicostis, "Non-concurrent error detection and correction in discrete-time LTI dynamic systems," IEEE Trans. Circuits Syst. I, Reg. Papers, vol. 50, no. 1, pp. 45-55, Jan. 2003.
8. C. N. Hadjicotis, "Non-concurrent error detection and correction in fault-tolerant linear finite state machines," IEEE Trans. Autom. Control, vol. 48, no. 12, pp. 2133-2140, Dec. 2003.
9. C. N. Hadjicostis, "Periodic and nonconcurrent error detection and identification in one-hot encoded fsms," Automatica, to be published.
10. J. von Neumann, Probabilistic Logics and the Synthesis of Reliable Organisms from Unreliable Components. Princeton, NJ: Princeton Univ. Press, 1956.
11. T. R. N. Rao, Error Coding for Arithmetic Processors. New York: Academic, 1974.
12. T. R. N. Rao and E. Fujiwara, Error-Control Coding for Computer Systems. Englewood Cliffs, NJ: Prentice-Hall, 1989.
13. K.-H. Huang and J. A. Abraham, "Algorithm-based fault tolerance for matrix operations," IEEE Trans. Comput., vol. C-33, no. 6, pp. 518-528, Jun. 1984.
14. J.-Y. Jou and J. A. Abraham, "Fault-tolerant matrix arithmetic and signal processing on highly concurrent parallel structures," Proc. IEEE, vol. 74. no. 5, pp. 732-741, May 1986.
15. J.-Y. Jou, and J. A. Abraham, "Fault-tolerant FFT networks," IEEE Trans. Comput., vol. 37, no. 5, pp. 548-561, May 1988.
16. V. S. S. Nair and J. A. Abraham, "Real-number codes for fault-tolerant matrix operations on processor arrays," IEEE Trans. Comput., vol. 39, no. 4, pp. 426-435, Apr. 1990.
17. P. E. Beckmann and B. R. Musicus, "Fault-tolerant round-robin A/D converter system," IEEE Trans. Circuits Syst., vol. 38, no. 12, pp. 1420-1429, Dec. 1991.
18. P. E. Beckmann, and B. R. Musicus, "Fast fault-tolerant digital convolution using a polynomial residue number system," IEEE Trans. Signal Process., vol. 41, no. 7, pp. 2300-2313, Jul. 1993.
19. B. Vinnakota and N. K. Jha, "Synthesis of algorithm-based fault-tolerant systems from dependence graphs," IEEE Trans. Parallel Distrib. Syst., vol. 4, no. 8, pp. 864-874, Aug. 1993.
20. A. Roy-Chowdhury and P. Banerjee, "Algorithm-based fault location and recovery for matrix computations on multiprocessor systems," IEEE Trans. Comput., vol. 45, no. 11, pp. 1239-1247, Nov. 1996.
21. J.-L. Sung and G. R. Redinbo, "Algorithm-based fault tolerant synthesis for linear operations," IEEE Trans. Comput., vol. 45, no. 4, pp. 425-437, Apr. 1996.
22. P. E. Beckmann, "Fault-tolerant computation using algebraic homomorphisms," Ph.D. dissertation, Elec. Eng. Comput Sci. Dept., MIT, Cambridge, MA, 1992.
23. P. E. Beckmann and B. R. Musicus, "A group-theoretic framework for fault-tolerant computation," in Proc. IEEE Int. Conf. Acoustics, Speech, and Signal Processing (ICASSP 1992), vol. 5, 1992, pp. 557-560.
24. C. N. Hadjicostis, "Fault-tolerant computation in semigroups and semirings," M. Eng. thesis, Elec. Eng. Comput. Sci. Dept., MIT, Cambridge, MA, 1995.
25. C. N. Hadjicostis and G. C. Verghese, "Fault-tolerant computation in semigroups and semirings," in Proc. Int. Conf. Digital Signal Processing, Limassol, Cypuss, Jun. 1995, pp. 779-784.
26. P. Elias, "Computation in the presence of noise," IBM J. Res. Devel., vol. 2, no. 10, pp. 346-353, Oct. 1958.
27. S. Winograd and J. D. Cowan, Reliable Computation in the Presence of Noise. Cambridge, MA: MIT Press, 1963.
28. N. Pippenger, "Reliable computation by formulas in the presence of noise," IEEE Trans. Inf. Theory, vol. 34, no. 2, pp. 194-197, Mar. 1988.
29. T. Feder, "Reliable computation by networks in the presence of noise," IEEE Trans. Inf. Theory, vol. 35, no. 3, pp. 569-571, May 1989.
30. B. Hajek and T. Weller, "On the maximum tolerable noise for reliable computation by formulas," IEEE Trans. Inf. Theory, vol. 37, no. 2, pp. 388-391, Mar. 1991.
31. P. Gács and A. Gál, "Lower bounds on the complexity of reliable Boolean circuits with noisy gates," IEEE Trans. Inf. Theory, vol. 40, no. 2, pp. 579-583, Mar. 1994.
32. W. Evans and N. Pippenger, "On the maximum tolerable noise for reliable computation by formulas," IEEE Trans. Inf. Theory, vol. 44, no. 3, pp. 1299-1305, May 1998.
33. W. Evans and L. J. Schulman, "Signal propagation and noisy circuits," IEEE Trans. Inf. Theory, vol. 45, no. 7, pp. 2367-2373, Nov. 1999.
34. N. Pippenger, "Developments in the synthesis of reliable organisms from unreliable components," in Proc. Symp. Pure Mathematics, vol. 50, 1990, pp. 311-324.
35. M. G. Taylor, "Reliable information storage in memories designed from unreliable components," Bell Syst. Tech. J., vol. 47, no. 10, pp. 2299-2337, Dec. 1968.
36. M. G. Taylor, "Reliable computation in computing systems designed from unreliable components," Bell Syst. Tech. J., vol. 47, no. 10, pp. 2239-2366, Dec. 1968.
37. I. S. Reed and A. C. L. Chiang, "Coding techniques for failure-tolerant counters," IEEE Trans. Comput., vol. C-19, pp. 1035-1038, Nov. 1970.
38. R. W. Larsen and I. S. Reed, "Redundancy by coding versus redundancy by replication for failure-tolerant sequential circuits," IEEE Trans. Comput., vol. C-21, no. 2, pp. 130-137, Feb. 1972.
39. G. X. Wang and G. R. Redinbo, "Probability of state transition errors in a finite state machine containing soft failures," IEEE Trans. Comput., vol. C-33, no. 3, pp. 269-277, Mar. 1984.
40. P. Gács, "Reliable computation with cellular automata," J. Comput. Syst. Sci., vol. 32, no. 2, pp. 15-78, Feb. 1986.
41. D. A. Spielman, "Highly fault-tolerant parallel computation," in Proc. Annu. Symp. Foundations of Computer Science, vol. 37, 1996, pp. 154-160.
42. A. Avizienis, "Fault-tolerance by means of external monitoring of computer systems," in Proc. 1981 Nat. Computational Conf., 1981, pp. 27-40.
43. R. Leveugle, Z. Koren, I. Koren, G. Saucier, and N. Wehn, "The Hyeti defect tolerant microprocessor: A practical experiment and its cost-effectiveness analysis," IEEE Trans. Comput., vol. 43, no. 12, pp. 1398-1406, Dec. 1994.
44. Y. Tohma and S. Aoyagi, "Failure-tolerant sequential machines with past information," IEEE Trans. Comput., vol. C-20, no. 4, pp. 392-396, Apr. 1971.
45. T. Krol, "(N, K) concept fault tolerance," IEEE Trans. Comput., vol. C-35, no. 4, pp. 339-349, Apr. 1986.
46. V. S. Iyengar and L. L. Kinney, "Concurrent fault detection in microprogrammed control units," IEEE Trans. Comput., vol. C-34, no. 9, pp. 810-821, Sept. 1985.
47. R. Leveugle and G. Saucier, "Optimized synthesis of concurrently checked controllers," IEEE Trans. Comput., vol. 39, no. 4, pp. 419-425, Apr. 1990.
48. R. A. Parekhji, G. Venkatesh, and S. D. Sherlekar, "A methodology for designing optimal self-checking sequential circuits," in Proc. Int. Conf. VLSI Design, Piscataway, NJ, 1991, pp. 283-291.
49. S. H. Robinson and J. P. Shen, "Direct methods for synthesis of self-monitoring state machines," in Proc. 22nd Int. Symp. Fault-Tolerant Computing, Dig. Papers, 1992, pp. 306-315.
50. R. A. Parekhji, G. Venkatesh, and S. D. Sherlekar, "Concurrent error detection using monitoring machines," IEEE Des. Test Comput., vol. 12, no. 3, pp. 24-32, 1995.
51. L. P. Holmquist and L. L. Kinney, "Concurrent error detection in sequential circuits using convolutional codes," in Proc. 9th Int. Symp. Applied Algebra, Algebraic Algorithms and Error-Correcting Codes 1991, pp. 183-194.
52. L. P. Holmquist, and L. L. Kinney, "Concurrent error detection for restricted fault sets in sequential circuits and microprogrammed control units using convolutional codes," in Proc. Int. Test Conf., 1991, pp. 926-935.
53. C. N. Hadjicostis, "Finite-state machine embeddings for nonconcurrent error detection and identification," in Proc. 42nd IEEE Conf. Decision and Control (CDC 2003), vol. 4, Mani, HI, Dec. 2003, pp. 3215-3220.
54. J. Wakerly, Error Detecting Codes, Self-Checking Circuits and Applications. Amsterdam, The Netherlands: Elsevier Science, 1978.
55. C. N. Hadjicostis, Coding Approaches to Fault Tolerant in Combinational and Dynamic Systems. Boston, MA: Kluwer Academic, 2002.
56. C. N. Hadjicostis, "Coding approaches to fault tolerance in dynamic systems," Ph.D. dissertation, Elec. Eng. Comput. Sci. Dept., MIT, Cambridge, MA, 1999.
57. C. N. Hadjicostis and G. C. Verghese, "Fault-tolerant computation in groups and semigroups," J. Franklin Inst., vol. 339, no. 4-5, pp. 387-430, Jul.-Aug. 2002.
58. C. N. Hadjicostis, and G. C. Verghese, "Structured redundancy for fault tolerance in LTI state-space models and Petri nets," Kybernetika, vol. 35, no. 1, pp. 39-55, Jan. 1999.
59. C. N. Hadjicostis, "Non-concurrent error detection and Correction in discrete-time LTI dynamic systems," in Proc. 40th IEEE Conf. Decision and Control (CDC 2001), vol. 2, Orlando, FL, Dec. 4-7, 2001, pp. 1899-1904.
60. C. N. Hadjicostis and G. C. Verghese, "Encoded dynamics for fault tolerance in linear finite-state machines," IEEE Trans. Autom. Control, vol. i 47, no. 1, pp. 189-192, Jan. 2002.
61. H. Chernoff, ,A measure of asymptotic efficiency for tests of hypothesis based on the sum of observations," Ann. Math. Statist., vol. 23, no. 4, pp. 493-507, Dec. 1952.
62. G. A. Margulis, "Explicit construction of concentrators," Probl. Inf. Transm., vol. 9, no. 5, pp. 71-80, Oct.-Dec. 1974.
63. N. Pippenger, "On networks of noisy gates," in Proc. 26th Annu. Symp. Foundations of Computer Science (FOCS 1985), 1985, pp. 30-38.
64. R. G. Gallager, Low-Density Parity Check Codes. Cambridge, MA: MIT Press, 1963.
65. M. Sipser and D. A. Spielman, "Expander codes," IEEE Trans. Inf. Theory, vol. 42, no. 6, pp. 1710-1722, Nov. 1996.
66. D. A. Spielman, "Linear-time encodable and decodable error-correcting codes," IEEE Trans. Inf. Theory, vol. 42, no. 6, pp. 1723-1731, Nov. 1996.
67. T. L. Booth, Sequential Machines and Automata Theory. New York: Wiley, 1968.
68. M. A. Harrison, Lectures on Linear Sequential Machines. New York: Academic, 1969.
69. S. W. Golomb, Shift Register Sequences. San Francisco, CA: Holden-Day, 1967.
70. R. L. Martin, Studies in Feedback-Shift-Register Synthesis of Sequential Machines. Cambridge, MA: MIT Press, 1969.
71. W. Daehn, T. W. Williams, and K. D. Wagner, "Aliasing errors in linear automata used as multiple-input signature analyzers," IBM J. Res. Devel., vol. 34, no. 2-3, pp. 363-380, Mar.-May 1990.
72. M. Damiani, P. Olivo, and B. Ricco, "Analysis and design of linear finite state machines for signature analysis testing," IEEE Trans. Comput., vol. 40, no. 9, pp. 1034-1045, Sep. 1991.
73. R. E. Blahut, Algebraic Codes for Data Transmission. Cambridge, U.K.: Cambridge Univ. Press, 2002.
74. S. B. Wicker, Error Control Systems. Englewood Cliffs, NJ: Prentice-Hall, 1995.
75. W. W. Peterson and E. J. Weldon Jr., Error-Correcting Codes. Cambridge, MA: MIT Press, 1972.
76. K. Cattell and J. C. Muzio, "Analysis of one-dimensional linear hybrid cellular automata over GF(q)," IEEE Trans. Comput., vol. 45, no. 7, pp. 782-792, Jul. 1996.
77. S. Chakraborty, D. R. Chowdhury, and P. P. Chaudhuri, "Theory and application of nongroup cellular automata for synthesis of easily testable finite state machines," IEEE Trans. Comput., vol. 45, no. 7, pp. 769-781, Jul. 1996.
78. B. P. Zeigler, "Every discrete input machine is linearly simulatable," J. Comput. Syst. Sci., vol. 7, no. 4, pp. 161-167, Apr. 1973.
79. C. Su, K. Y. Chen, and S.-J. Jou, "Structure approach for performance driven ECC circuit synthesis," in Proc. Asia and South Pacific Design Automation Conf. (ASP-DAC 1997), 1997, pp. 89-94.
80. R. A. Roberts and C. T. Mullis, Digital Signal Processing. Reading, MA: Addison-Wesley, 1987.
81. V. V. Zyablov and M. S. Pinsker, "Estimation of the error-correction complexity for Gallager low-density codes," Probl. Inf. Transm., vol. 11, no. 1, pp. 18-28, Jan.-Mar. 1975.
82. A. V. Kuznetsov, "Information storage in a memory assembled from unreliable components," Probl. Inf. Transm., vol. 9, no. 4, pp. 254-264, Jul.-Sep. 1973.
83. R. L. Dobrushin and S. I. Ortyukov, "Upper bound on the redundancy of self-correcting arrangements of unreliable functional elements," Probl. Inf. Transm., vol. 13, no. 3, pp. 56-76, Jul.-Sep. 1977.
84. T. Richardson and R. Urbanke, "Efficient encoding of low-density parity-check codes," IEEE Trans. Inf. Theory, vol. 47, no. 2, pp. 638-656, Feb. 2001.