Concurrent error detection Public Deposited

http://ir.library.oregonstate.edu/concern/graduate_thesis_or_dissertations/z029p8375

Descriptions

Attribute NameValues
Creator
Abstract or Summary
  • Concurrent error detection (CED) is the detection of errors or faults in a circuit or data path concurrent with normal operation of that circuit. The general approach for CED is to calculate a check symbol for the inputs to the circuit under operation, predict the check symbol that will result for the output of the circuit for those inputs, and compare the predicted check symbol to the one that is actually calculated for the output. If the predicted and actual check symbols are different, an error or fault has been detected. The alternative to this check symbol prediction is to use a second copy of the circuit under operation and compare the results of the two circuits. For some classes of circuits the prediction of the output check symbol can require less circuitry than a second copy of the circuit being tested. Four examples of these types of circuits are examined in this dissertation: Arithmetic Logic Units (ALUs), array multipliers, self-synchronous scrambler-descrambler pairs with their intervening data path, and switch fabrics. Faults in integrated circuits tend to produce unidirectional errors. Unidirectional errors are those in which all of the errors are in the same direction (e.g., 0 to 1 errors) within the block of data covered by a given check symbol. For this reason, codes that are optimized for unidirectional errors are the focus of investigation for most of the applications. In particular, the Bose-Lin codes are examined for those applications where unidirectional errors are expected to be typical. In order to examine the performance of the Bose-Lin codes in one of these applications, it was necessary to determine the theoretical performance for Bose- Lin codes for error rates beyond what had been previously studied. This analysis of Bose-Lin codes with large numbers of "burst" errors also included a further generalization of the codes.
Resource Type
Date Available
Date Copyright
Date Issued
Degree Level
Degree Name
Degree Field
Degree Grantor
Commencement Year
Advisor
Academic Affiliation
Non-Academic Affiliation
Subject
Rights Statement
Peer Reviewed
Language
Digitization Specifications
  • File scanned at 300 ppi (Monochrome) using ScandAll PRO 1.8.1 on a Fi-6770A in PDF format. CVista PdfCompressor 4.0 was used for pdf compression and textual OCR.
Replaces
Additional Information
  • description.provenance : Submitted by Kaylee Patterson (kdpscanner@gmail.com) on 2012-08-13T19:57:18Z No. of bitstreams: 1 GorsheStevenScott2002.pdf: 818065 bytes, checksum: 4959175806f583b6c828606e1e71a836 (MD5)
  • description.provenance : Approved for entry into archive by Patricia Black(patricia.black@oregonstate.edu) on 2012-08-14T17:01:40Z (GMT) No. of bitstreams: 1 GorsheStevenScott2002.pdf: 818065 bytes, checksum: 4959175806f583b6c828606e1e71a836 (MD5)
  • description.provenance : Approved for entry into archive by Patricia Black(patricia.black@oregonstate.edu) on 2012-08-13T21:33:35Z (GMT) No. of bitstreams: 1 GorsheStevenScott2002.pdf: 818065 bytes, checksum: 4959175806f583b6c828606e1e71a836 (MD5)
  • description.provenance : Made available in DSpace on 2012-08-14T17:01:40Z (GMT). No. of bitstreams: 1 GorsheStevenScott2002.pdf: 818065 bytes, checksum: 4959175806f583b6c828606e1e71a836 (MD5) Previous issue date: 2002-04-19

Relationships

In Administrative Set:
Last modified: 08/20/2017

Downloadable Content

Download PDF
Citations:

EndNote | Zotero | Mendeley

Items