Article

Free access

A CAD framework for generating self-checking multipliers based on residue codes

Authors:

I. Alzaher Noufal,

M. NicolaidisAuthors Info & Claims

DATE '99: Proceedings of the conference on Design, automation and test in Europe

Pages 29 - es

https://doi.org/10.1145/307418.307471

Published: 01 January 1999 Publication History

PDF eReader

References

[1]

{AND71} D. A. ANDERSON, "Design of self checking digital networks using coding techniques". Urbana, CSL/University of IIIionis, Sept. 1971 (report n. 527).

Google Scholar

[2]

{AVI73} A. Avizienis, "Arithmetic Algorithms for Error-Coded Operands" IEEE Trans. on Comput., Vol. C-22, No. 6, pp. 567- 572, June 1973.

Google Scholar

[3]

{BRE82} R. P. Brent, H. T. Kung, A Regular Layout for Parallel Adders", IEEE Transactions On Computers, Vol. C31, pp. 261- 264, March 1982.

Google Scholar

[4]

{BOE97} E. Boehl, Th. Lindenkreuz, R. Stephan, "The Fail-Stop Controller AE11", ITC pp. 567-577, Nov. 1997.

Digital Library

Google Scholar

[5]

{DUA97} R.O. Duarte, M. Nicolaidis, H. Bederr, Y. Zorian, "Efficient Fault-Secure Shifter Design", European Design & Test Conference, Paris, March 1997.

Digital Library

Google Scholar

[6]

{DUF96} Jen-Louis Dufour, "Safety Computations in Integrated circuits", VTS. pp. 169-172, April 28-May 1, 1996.

Google Scholar

[7]

{GAR68} O.N. Garcia, T.R.N. Rao T, "On the method of checking logical operations", Proc. 2nd Annual Princeton Conf. Inform. Sci. Sys., pp. 89-95 (1968).

Google Scholar

[8]

{HAN87} T. Han, D. A. Carlson, "Fast Area-Efficient VLSI Adders", Proc of 8th Symposium on Computer Arithmetic, pp. 49-56, May 1987.

Google Scholar

[9]

{HWA79} K. Hwang, Computer Arithmetic, Principles, Architecture and Design, John Wiley and Sons, New York, 1979.

Digital Library

Google Scholar

[10]

{KOG73} P. M. Kogge and H. S. Stone, A Parallel Algorithm for the Efficient Solution of a General Class of Recurrence Equations, IEEE Transactions on Computers, Vol. C-22, No. 8, pp. 786-792, August 1973.

Digital Library

Google Scholar

[11]

{KOR93} I. Koren, Computer Arithmetic Algorithms, Prentice Hall, Englewood Cliffs, New Jersey, 1993.

Digital Library

Google Scholar

[12]

{NIC93} M. Nicolaidis, "Efficient Implementation of Self-Checking Adders and ALUs", Proc. 23th Fault Tolerant Computing Symposium, Toulouse France, June 1993.

Google Scholar

[13]

{NIC97a} M. Nicolaidis, R.O. Duarte, S. Manich, and J. Figueras, "Achieving Fault Secureness in Parity Prediction Arithmetic Operators", To appear in IEEE Design & Test of Computers.

Digital Library

Google Scholar

[14]

{NIC97b} Nicolaidis M., "Carry Checking Parity Prediction Adders and ALUs", submited to IEEE Trans. on VLSI Systems.

Digital Library

Google Scholar

[15]

{NIC 98a} M. Nicolaidis, "Scaling Deeper to Submicron: On-Line Testing to the Rescue", In proceedings FTCS-28, pp. 299- 301, June 1998, Munich.

Google Scholar

[16]

{NIC 98b} M. Nicolaidis, "Design for Soft-Error Robustness to Rescue Deep Submicron Scaling", In proceedings ITC 98, October 1998, Washington DC.

Digital Library

Google Scholar

[17]

{NIC 98c} M. Nicolaidis, "On-Line Testing for VLSI: State of the Art and Trends", Integration: the VLSI Journal, Elsevier, Special Issue on "VLSI Testing toward 21 Century", Autumn 1998.

Digital Library

Google Scholar

[18]

{NIK88} D. Nikolos, A. M. Paschalis, and G. Philokyprou, "Efficient Design of Totally Self-Checking Checkers for all Low-Cost Arithmetic Codes", IEEE Trans. On Comput, vol. 37, No. 7, pp. 807-814, July 1988.

Digital Library

Google Scholar

[19]

{PET72} W. W. Peterson, E. J. Weldon, Error-Correcting Codes, second Ed., The MIT press, Cambridge, Massachusetts, 1972.

Google Scholar

[20]

{PIE94} S. J. Piestrak, "Design of Residue Generators and Multioperand Modular Adders Using Carry-Save Adders", IEEE Trans. On Comput, vol. 423, No. 1, pp. 68-77, Jan. 1994.

Digital Library

Google Scholar

[21]

{SEL68} F. F. Sellers, M. Y. Hsiao and L. W. Bearnson, Error Detecting Logic for Digital Computers, New-York : Mc GRAWHILL 1968.

Google Scholar

[22]

{SKl60} J. Sklansky, "Conditional-Sum Addition Logic", in IRE Transactions on Electronic Computers, Vol. EC-9, No. 2, pp. 226-231, June 1960.

Crossref

Google Scholar

[23]

{SPA93} U. Sparmann, "On the Check Base Selection Problem for Fast Adders", Proc. 11th VLSI Test Symp. Atlantic City, NJ, April 1993.

Google Scholar

[24]

{SPA94} U. Sparmann, S. M. Reddy. "On the Effectiveness of Residue Code Checking for Parallel Two's Complement Multipliers" Proc. 24th Fault Tolerant Computing Symposium, Austin Texas, June 1994.

Google Scholar

Cited By

View all

Goldstein BFerreira VSrinivasan SDas DNery AKundu SFranca F(2021)A Lightweight Error-Resiliency Mechanism for Deep Neural Networks2021 22nd International Symposium on Quality Electronic Design (ISQED)10.1109/ISQED51717.2021.9424287(311-316)Online publication date: 7-Apr-2021
https://doi.org/10.1109/ISQED51717.2021.9424287
Sullivan MSwartzlander E(2015)Low-Cost Duplicate MultiplicationProceedings of the 2015 IEEE 22nd Symposium on Computer Arithmetic10.1109/ARITH.2015.29(2-9)Online publication date: 22-Jun-2015
https://dl.acm.org/doi/10.1109/ARITH.2015.29
Jafri SPiestrak SSentieys OPillement S(2014)Design of the coarse-grained reconfigurable architecture DART with on-line error detectionMicroprocessors & Microsystems10.1016/j.micpro.2013.12.00438:2(124-136)Online publication date: 1-Mar-2014
https://dl.acm.org/doi/10.1016/j.micpro.2013.12.004
Show More Cited By

Index Terms

A CAD framework for generating self-checking multipliers based on residue codes
1. Hardware
  1. Integrated circuits
    1. Logic circuits
      1. Arithmetic and datapath circuits

Recommendations

Fault-Secure Parity Prediction Booth Multipliers

Parity-prediction arithmetic operator schemes are compatible with data paths and memory systems checked by parity codes. The drawback of these schemes is that they may not be fault secure for single faults, since they propagate to multiple output errors ...
Logic Networks of Carry-Save Adders

logic networks of carry-save adders such as high-speed multipliers, multioperand adders, and double-rail input parallel adders are designed based on the parallel adders with a minimum number of NOR gates discussed in [1]. After a discussion of the ...
Design of Self-Checking Circuits Using DCVS Logic: A Case Study

A technique for designing self-checking circuits using differential cascode voltage switch (DCVS) logic is presented. This technique is used in a design case study and the results obtained through actual implementation and testing of a self-checking ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

DATE '99: Proceedings of the conference on Design, automation and test in Europe

January 1999

730 pages

ISBN:1581131216

DOI:10.1145/307418

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 January 1999

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Conference

DATE99

Sponsor:

SIGDA

DATE99: Design Automation and Test in Europe Conference and Exhibition 1999

Munich, Germany

Acceptance Rates

Overall Acceptance Rate 518 of 1,794 submissions, 29%

Upcoming Conference

DATE '25

Sponsor:
sigda

Design, Automation and Test in Europe

March 31 - April 2, 2025

Lyon , France

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

9
Total Citations
View Citations
311
Total Downloads

Downloads (Last 12 months)54
Downloads (Last 6 weeks)9

Reflects downloads up to 18 Feb 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Goldstein BFerreira VSrinivasan SDas DNery AKundu SFranca F(2021)A Lightweight Error-Resiliency Mechanism for Deep Neural Networks2021 22nd International Symposium on Quality Electronic Design (ISQED)10.1109/ISQED51717.2021.9424287(311-316)Online publication date: 7-Apr-2021
https://doi.org/10.1109/ISQED51717.2021.9424287
Sullivan MSwartzlander E(2015)Low-Cost Duplicate MultiplicationProceedings of the 2015 IEEE 22nd Symposium on Computer Arithmetic10.1109/ARITH.2015.29(2-9)Online publication date: 22-Jun-2015
https://dl.acm.org/doi/10.1109/ARITH.2015.29
Jafri SPiestrak SSentieys OPillement S(2014)Design of the coarse-grained reconfigurable architecture DART with on-line error detectionMicroprocessors & Microsystems10.1016/j.micpro.2013.12.00438:2(124-136)Online publication date: 1-Mar-2014
https://dl.acm.org/doi/10.1016/j.micpro.2013.12.004
Zeppenfeld JBouajila AHerkersdorf AStechele W(2010)Towards Scalability and Reliability of Autonomic Systems on ChipProceedings of the 2010 13th IEEE International Symposium on Object/Component/Service-Oriented Real-Time Distributed Computing Workshops10.1109/ISORCW.2010.13(73-80)Online publication date: 4-May-2010
https://dl.acm.org/doi/10.1109/ISORCW.2010.13
Liu YWu K(2010)Towards cool and reliable digital systems: RT level CED techniques with runtime adaptability2010 IEEE International Conference on Computer Design10.1109/ICCD.2010.5647625(528-533)Online publication date: Oct-2010
https://doi.org/10.1109/ICCD.2010.5647625
Nicolaidis M(2010)Circuit-Level Soft-Error MitigationSoft Errors in Modern Electronic Systems10.1007/978-1-4419-6993-4_8(203-252)Online publication date: 23-Aug-2010
https://doi.org/10.1007/978-1-4419-6993-4_8
Anghel LNicolaidis M(2008)Cost Reduction and Evaluation of a Temporary Faults-Detecting TechniqueDesign, Automation, and Test in Europe10.1007/978-1-4020-6488-3_31(423-438)Online publication date: 2008
https://doi.org/10.1007/978-1-4020-6488-3_31
Guilley SHoogvorst P(2005)The Proof by 2M-1: A Low-Cost Method to Check Arithmetic ComputationsSecurity and Privacy in the Age of Ubiquitous Computing10.1007/0-387-25660-1_39(589-600)Online publication date: 2005
https://doi.org/10.1007/0-387-25660-1_39
Nicolaidis M(1999)Time Redundancy Based Soft-Error Tolerance to Rescue Nanometer TechnologiesProceedings of the 1999 17TH IEEE VLSI Test Symposium10.5555/832299.836499Online publication date: 26-Apr-1999
https://dl.acm.org/doi/10.5555/832299.836499

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

Fault-Secure Parity Prediction Booth Multipliers

Logic Networks of Carry-Save Adders

Design of Self-Checking Circuits Using DCVS Logic: A Case Study