Design and Synthesis of Self-Checking VLSI Circuits

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

Volumn 12, Issue 6, 1993, Pages 878-887

  Jha, Niraj K ^a   Wang, Sying Jyan ^a  

^a PRINCETON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL CIRCUITS; COMPUTATIONAL COMPLEXITY; ELECTRIC FAULT LOCATION; ELECTRIC NETWORK SYNTHESIS; ERROR ANALYSIS; ERROR DETECTION; INTEGRATED CIRCUIT LAYOUT; SEQUENTIAL CIRCUITS; VECTORS;

PERMANENT FAULTS; SELF CHECKING VLSI CIRCUITS; TRANSIENT FAULTS;

VLSI CIRCUITS;

EID: 0027610679     PISSN: 02780070     EISSN: 19374151     Source Type: Journal    
DOI: 10.1109/43.229762     Document Type: Article

References (40)

1. X. Castillo, S. R. McConnel, and D. P. Siewiorek, “Derivation and calibration of a transient error reliability model,” IEEE Trans. Com put., vol. C-31, pp. 658–671, July 1982.
2. Y. Savaria, N. C. Rumin, J. F. Hayes, and V. K. Agarwal, “Soft-error filtering: A solution to the reliability problem of future VLSI digital circuits,” IEEE Proc., vol. 74, no. 5, pp. 669–683, May 1986.
3. M. M. Yen, W. K. Fuchs, and J. A. Abraham, “Designing for concurrent error detection in VLSI: Application to a microprogram control unit,” IEEE J. Solid-State Circuits, vol. SC-22, pp. 595–605, Aug. 1987.
4. W. C. Carter and P. R. Schneider, “Design of dynamically checked computers.” in Proc. IFIP ’68, vol. 2, Edinburgh, Scotland, Aug. 1968, pp. 878–883.
5. D. A. Anderson and G. Metze, “Design of totally self-checking circuits for m-out-of-n codes,” IEEE Trans. Comput., vol. C-22, pp. 263–269, Mar. 1973.
6. J. E. Smith and G. Metze, “Strongly fault secure logic networks,” IEEE Trans. Comput., vol. C-27, pp. 491–499, June 1978.
7. R. W. Cook, W. H. Sisson, T. F. Storey, and W. N. Toy, “Design of a self-checking microprogram control,” IEEE Trans. Comput., vol. C-22, pp. 255–262, Mar. 1973.
8. D. K. Pradhan and J. J. Stiffler, “Error correcting codes and self-checking circuits in fault-tolerant computers,” IEEE Computer, vol. 13, pp. 27–37, Mar. 1980.
9. G. P. Mak, J. A. Abraham, and E. S. Davidson, “The design of PLAs with concurrent error detection,” in Proc. Int. Symp. Fault-Tolerant Comput., Santa Monica, CA, June 1982, pp. 303–310.
10. D. K. Pradhan, “A new class of error correcting/detecting codes for fault tolerant applications,” IEEE Trans. Comput., vol. C-29, pp. 471-481, June 1980.
11. H. Dong, “Modified Berger codes for detection of unidirectional errors,” in Proc. Int. Symp. Fault-Tolerant Comput., Santa Monica, June 317–320.
12. B. Bose and D. J. Lin, “Systematic unidirectional error-detecting codes,” IEEE Trans. Comput., vol. C-34, pp. 1026–1032. Nov. 1985.
13. N. K. Jha and M. B. Vora, “A systematic code for detecting t-uni directional errors,” in Proc. Int. Symp. Fault-Tolerant Comput., Pittsburgh, PA, June 1987, pp. 96–101.
14. B. Bose, “Burst unidirectional error detecting codes,” IEEE Trans. Comput., vol. C-35, pp. 350–353, Apr. 1986.
15. M. Blaum, “On systematic burst unidirectional error detecting codes,” IEEE Trans. Comput., vol. C-37, pp. 453–457, Apr. 1988.
16. N. K. Jha, “Separable codes for detecting unidirectional errors,” IEEE Trans. Computer-Aided Design, vol. CAD-8, pp. 571–574, May 1989.
17. J. E. Smith and G. Metze, “The design of totally self-checking combinational circuits,” in Proc. Int. Symp. Fault-Tolerant Comput., Los Angeles, CA, June 1977, pp. 130–134.
18. M. Diaz, “Design of totally self-checking and fail safe sequential machines,” in Proc. Int. Symp. Fault-Tolerant Comput., Urbana, IL, June 1974, pp. 3–9-3–24.
19. F. Ozguner, “Design of totally self-checking asynchronous sequential machines,” in Proc. Int. Symp. Fault-Tolerant Comput., June 1977, pp. 124–129.
20. J. Viaud and R. David, “Sequentially self-checking circuits,” in Proc. Int. Symp. Fault-Tolerant Comput., June 1980, pp. 263–268.
21. J. E. Smith and P. Lam, “A theory of totally self-checking system design,” IEEE Trans. Comput., vol. C-32, pp. 831–844, Sept. 1983.
22. J. M. Berger, “A note on error detecting codes for asymmetric channels,” Information & Control, vol. 4, pp. 68–73, Mar. 1961.
23. M. Ashjaee and J. M. Reddy, “On totally self-checking checkers for separable codes,” IEEE Trans. Comput., vol. C-26. pp. 737–744, Aug. 1977.
24. M. A. Marouf and A. D. Friedman, “Design of self-checking checkers for Berger codes,” in Proc. Int. Symp. Fault-Tolerant Comput., June 1978, pp. 179–184.
25. J.C. Lo and S. Thanawastien, “The design of fast totally self-checking Berger code checkers based on Berger code partitioning,” in Proc. Int. Symp. Fault-Tolerant Comput., Tokyo, Japan, June 1988, pp. 226–231.
26. J. E. Smith, “On separable unordered codes,” IEEE Trans. Comput., vol. C-33, pp. 741–743, Aug. 1984.
27. C. V. Frieman, “Optimal error detecting codes for completely asymmetric binary channels,” Information & Control, vol. 5, pp. 64–71. Mar. 1962.
28. S. M. Reddy, “A note on self-checking checkers,” IEEE Trans. Comput., vol. C-23, pp. 1100–1102, Oct. 1974.
29. M. A. Marouf and A. D. Friedman, “Efficient design of self-checking checker for m-out-of-n code,” IEEE Trans. Comput., vol. C-27, pp. 482–490, June 1978.
30. N. Gaitanis and C. Halatsis, “ A new design method for w-out-of-n TSC checkers,” IEEE Trans. Comput., vol. C-32, pp. 273–283, Mar. 1983.
31. T. Nanya and Y. Tohma, “A 3-level realization of totally self-checking checkers for w-out-of-n codes,” in Proc. Int. Symp. Fault-Tolerant Comput., Milan, Italy, June 1983, pp. 173–176.
32. Y. Tamir and C. H. Sequin, “Design and application of self-testing comparators implemented with MOS PLA’s,” IEEE Trans. Comput., vol. C-33, pp. 493–506, June 1984.
33. G. Mago, “Monotone functions in sequential circuits,” IEEE Trans. Comput., vol. C-22, pp. 928–933, Oct. 1973.
34. R. K. Brayton, R. Rudell. A. Sangiovanni-Vincentelli, and A. R. Wang, “MIS: A multiple-level logic optimization program,” IEEE Trans. Computer-Aided Design, vol. CAD-6, pp. 1062–1081, Nov. 1987.
35. G. De Micheli, R. K. Brayton, and A. Sangiovanni-Vincentelli, “Optimal state assignment for finite state machines,” IEEE Trans. Computer-Aided Design, vol. CAD-4, pp. 269–284, July 1985.
36. S. Devadas, H.K.T. Ma, A. R. Newton, and A. Sangiovanni-Vin-centelli, “MUSTANG: State assignment of finite state machines targeting multilevel logic implementations,” IEEE Trans. Computer-Aided Design, vol. 7, pp. 1290–1300, Dec. 1988.
37. H.K. T. Ma, S. Devadas, A. R. Newton, and A. Sangiovanni-Vin-centelli, “Test generation for sequential circuits,” IEEE Trans. Computer-Aided Design, vol. 7, pp. 1081–1093, Oct. 1988.
38. X. Due, G. Hachtel, B. Lin and A. R. Newton, “MUSE: A multilevel symbolic encoding algorithm for state assignment,” IEEE Trans. Computer-Aided Design, vol. 10, pp. 28–38, Jan. 1991.
39. R. K. Brayton, C. McMullen, G. D. Hachtel, and A. Sangiovanni-Vincentelli, Logic Minimization Algorithms for VLSI Synthesis. Kluwer Academic Publishers, 1984.
40. S. J. Piestrak, “Design of fast self-testing checkers for a class of Berger codes,” IEEE Trans. Comput., vol. C-36, pp. 629–634, May 1987.