New Self-Checking Booth Multipliers

Al-Twaijry H. A. and Flynn M. J. (1995). Performance/area tradeoffs in Booth multipliers, Technical Report CSL-TR-95-684, Stanford University.Search in Google Scholar

Booth A. D. (1951). A signed binary multiplication technique, The Quarterly Journal of Mechanics and Applied Mathematics4(2): 236-240.10.1093/qjmam/4.2.236Search in Google Scholar

Goessel M. and Graf F. (1993). Error Detection Circuits, McGraw-Hill, London.Search in Google Scholar

Gorshe S. S. and Bose B. (1996). A self-checking ALU design with efficient codes, Proceedings of the 14th IEEE VLSI Test Symposium (VTS '96), IEEE Computer Society, Washington, DC, USA, p. 157.Search in Google Scholar

Hsiao M. and Sellers F. (1963). The carry dependent sum adder, IEEE Transactions on Electronic Computers, EC-12: 265-268.10.1109/PGEC.1963.263538Search in Google Scholar

Hunger M. (2006). Self-checking Booth-3 multiplier, Proceedings of the 1st International Conference for Young Researchers in Computer Science, Control, Electrical Engineering and Telecommunications, Zielona Góra, Poland.Search in Google Scholar

Lala P. (Ed.) (2001). Self-Checking and Fault-Tolerant Tigital Tesign, Morgan Kaufmann Publishers Inc., San Francisco, CA.Search in Google Scholar

Lo J. C., Thanawastien S. and Rao T. R. N. (1993). Berger check prediction for array multipliers and array dividers, IEEE Transactions on Computers42(7): 892-896.10.1109/12.237731Search in Google Scholar

Marienfeld D., Sogomonyan E. S., Ocheretnij V. and Gossel M. (2004). A new self-checking multiplier by use of a code-disjoint sum-bit duplicated adder, Proceedings of the 9th IEEE European Test Symposium (ETS'04), IEEE Computer Society, Washington, DC, USA, pp. 30-35.Search in Google Scholar

Marienfeld D., Sogomonyan E. S., Ocheretnij V. and Gossel M. (2005). New self-checking output-duplicated booth multiplier with high fault coverage for soft errors, ATS '05: Proceedings of the 14th Asian Test Symposium, IEEE Computer Society, Los Alamitos, CA, USA, pp. 76-81.Search in Google Scholar

Nicolaidis M. and Duarte R. O. (1998). Design of fault-secure parity-prediction booth multipliers, Proceedings of the Conference on Design, Automation and Test in Europe (DATE '98), IEEE Computer Society, Washington, DC, USA, pp. 7-14.Search in Google Scholar

Nicolaidis M., Duarte R. O., Manich S. and Figueras J. (1997). Fault-secure parity prediction arithmetic operators, IEEE Design and Test14(2): 60-71.10.1109/54.587743Search in Google Scholar

Ocheretnij V., Sogomonya E. S. and Goessel M. (2001). A new code-disjoint sum-bit duplicated carry look-ahead adder for parity codes, Proceedings of the 10th Asian Test Symposium (ATS '01), IEEE Computer Society, Los Alamitos, CA, USA, pp. 365.Search in Google Scholar

Parhami B. (2001). Instructor's manual for "Computer Arithmetic: Algorithms and Hardware Designs", Vol. 2: Presentation Material, Oxford University Press, Oxford.Search in Google Scholar

Shivakumar P., Keckler S. W., Kistler M., Burger D. and Alvisi L. (2002). Modeling the effect of technology trends on the soft error rate of combinatorial logic, Proceedings of the International Conference on Dependable Systems and Networks, pp. 389-398.Search in Google Scholar

Sparmann U. and Reddy S. M. (1994). On the effectiveness of residue code checking for parallel two's complement multipliers, Proceedings of the 24th International Symposium on Fault Tolerant Computing FTCS-24, IEEE Computer Society Press, Austin, TX, USA, pp. 219-229.Search in Google Scholar

Sulistyo J. B. and Ha D. S. (2002). A new characterization method for delay and power dissipation of standard cells, VLSI Design15(3): 667-678.10.1080/1065514021000012273Search in Google Scholar