Efficient Totally Self-Checking Shifter Design

1. W.C. Carter and P.R. Schneider, “Design of Dynamically Checkers Computers,” Proc. 4th Congress IFIP, Edinburgh, Scotland, Aug. 1968, Vol. 2, pp. 878–883.

2. B. Hamdi, H. Bederr, and M. Nicolaidis, “A Tool for Automatic Generation of Self-Checking Data Paths,” 13th IEEE VLSI Test Symposium, Princeton, N.J., April–May 1995.

3. M. Nicolaidis, “Efficient Implementation of Self-Checking Adders and ALUs,” Proc. 23rd Fault Tolerant Computing Symposium, Toulouse France, June 1993.

4. M. Nicolaidis, S. Manich, and J. Figueras, “Achieving Fault Secureness in Parity Prediction Arithmetic Operators: General Conditions and Implementations,” 1996—European Design and Test Conference ED&TC, Paris, March 1996.

5. K. Hwang, Computer Arithmetic, Principles, Architecture and Design, John Wiley & Sons, New York, 1979.

   Google Scholar 

6. D.A. Anderson, “Design of Self-Checking Digital Networks Using Coding Techniques,” Coordinates, Science Laboratory, Report R/527, University of Illinois, Urbana, Sept. 1971.

   Google Scholar 

7. J.E. Smith and G. Metze, “Strongly Fault Secure Logic Networks,” IEEE Transactions on Computers, June 1978.

8. J.P. Khahbaz and E.J. McCluskey, “Self-Testing Embedded Parity Checkers Exhaustive Xor GateTesting,” Stanford UniversityCRC Rep. 82–10, CSL TN 207, 1983.

9. N.H.E. Weste and K. Eshraghian, Principles of CMOS VLSI Design—A Systems Perspective, second edition, Addison-Wesley Publishing Co., 1994.

10. O. Kebichi, M. Nicolaidis, and V.N. Yarmolik, “Exact Aliasing Computation for RAM BIST,” International Test Conference, Washington, D.C., Oct. 1996.

Download references