• DocumentCode
    1154546
  • Title

    Finite Field Fault-Tolerant Digital Filtering Architectures

  • Author

    Redinbo, G. Robert

  • Author_Institution
    Departrnent of Electrical and Computer Engineering/ Computer Science, University of California
  • Issue
    10
  • fYear
    1987
  • Firstpage
    1236
  • Lastpage
    1242
  • Abstract
    Digital filtering architectures that simultaneously offer advantages for VLSI fabrication and contain distributed error control are presented. Such structures require parallelism as well as inherent error- control capabilities because VLSI implementations are susceptible to temporary and intermittent hardware errors. The filtering convolution operation is similar to the formation of cyclicerror-correcting codes so that fault-tolerant systems employing finite field arithmetic may be designed containing such codes imbedded directly in the architecture. The interconnection of such systems produces a fault-tolerant system. In addition, the subsystems possess a common design structure which is easily customized to the particular field required, an attractive feature for yield enhancement. Straightforward realizations depending on parallel algebraic decompositions are studied, introducing the locations for fault tolerance and the role of cyclic codes.
  • Keywords
    Chinese Remainder Theorem; VLSI; cyclic codes; digital filtering; error-correcting codes; fault-tolerant computing; finite fields; residue arithmetic; Convolution; Digital filters; Error correction; Fabrication; Fault tolerance; Fault tolerant systems; Filtering; Galois fields; Hardware; Very large scale integration; Chinese Remainder Theorem; VLSI; cyclic codes; digital filtering; error-correcting codes; fault-tolerant computing; finite fields; residue arithmetic;
  • fLanguage
    English
  • Journal_Title
    Computers, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9340
  • Type

    jour

  • DOI
    10.1109/TC.1987.1676864
  • Filename
    1676864