论文信息 - Fault-Secure Parity Prediction Booth Multipliers

Fault-Secure Parity Prediction Booth Multipliers

Parity prediction arithmetic operators are compatible with data paths and memory systems checked by parity codes. The authors extend their theory for achieving fault-secure design of parity prediction multipliers and dividers to Booth multipliers using operand recoding.

Michael Nicolaidis | Ricardo de Oliveira Duarte | M. Nicolaidis | R. O. Duarte

[1] Michael Nicolaidis,et al. Efficient implementations of self-checking adders and ALUs , 1993, FTCS-23 The Twenty-Third International Symposium on Fault-Tolerant Computing.

[2] Michael J. Flynn,et al. Performance/Area Tradeoffs in Booth Multipliers , 1995 .

[3] O. L. Macsorley. High-Speed Arithmetic in Binary Computers , 1961, Proceedings of the IRE.

[4] Israel Koren. Computer arithmetic algorithms , 1993 .

[5] Michael Nicolaidis,et al. Fault-Secure Parity Prediction Arithmetic Operators , 1997, IEEE Des. Test Comput..

[6] Andrew D. Booth,et al. A SIGNED BINARY MULTIPLICATION TECHNIQUE , 1951 .

[7] Kai Hwang,et al. Computer arithmetic: Principles, architecture, and design , 1979 .

[8] Sudhakar M. Reddy,et al. On the effectiveness of residue code checking for parallel two's complement multipliers , 1996, IEEE Trans. Very Large Scale Integr. Syst..

[9] Kamran Eshraghian,et al. Principles of CMOS VLSI Design: A Systems Perspective , 1985 .

[10] Earl E. Swartzlander,et al. Computer Arithmetic , 1980 .

[11] William C. Carter,et al. Design of dynamically checked computers , 1968, IFIP Congress.

[12] Marco Annaratone. Digital CMOS Circuit Design , 1986 .

[13] Michael Nicolaidis,et al. A CAD framework for efficient self-checking data path design , 1997 .