• DocumentCode
    1308475
  • Title

    REMOD: a new methodology for designing fault-tolerant arithmetic circuits

  • Author

    Dutt, Shantanu ; Hanchek, Fran

  • Author_Institution
    Dept. of Electr. Eng., Minnesota Univ., Minneapolis, MN, USA
  • Volume
    5
  • Issue
    1
  • fYear
    1997
  • fDate
    3/1/1997 12:00:00 AM
  • Firstpage
    34
  • Lastpage
    56
  • Abstract
    REMOD (REprocessing with MicrO Delays) is a new method for fault-tolerant design of logic circuits composed of arrays of identical functional cells. The fault detection scheme is based on the principle of node covering, in which the computation of each cell is checked by a "covering" cell. After a faulty cell is detected, the node covering principle also allows the circuit to easily be reconfigured to perform correctly for subsequent inputs. Furthermore, the design method is extendable to multiple fault tolerance with only small increments of hardware and time. We have laid out and simulated REMOD-based circuits for adders and multipliers and show that the time overheads are a small factor of the original computation time-0 or /spl Theta/(1/n) to /spl Theta/(1/(log n)), for an n-cell circuit. For moderately complex cells, it is seen that area overhead is very reasonable as well.
  • Keywords
    adders; computational complexity; digital arithmetic; fault tolerant computing; multiplying circuits; REMOD; adders; area overhead; computation time; fault detection scheme; fault-tolerant arithmetic circuits; identical functional cells; logic circuits; multiple fault tolerance; multipliers; node covering; time overheads; Arithmetic; Circuit faults; Delay; Design methodology; Electrical fault detection; Fault detection; Fault tolerance; Hardware; Logic arrays; Logic circuits;
  • fLanguage
    English
  • Journal_Title
    Very Large Scale Integration (VLSI) Systems, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    1063-8210
  • Type

    jour

  • DOI
    10.1109/92.555985
  • Filename
    555985