Files in this item



application/pdf9026123.pdf (4MB)Restricted to U of Illinois
(no description provided)PDF


Title:A design theory for totally self-checking and concurrent error detecting arithmetic circuits
Author(s):Angelotti, Frank William
Doctoral Committee Chair(s):Robertson, James E.
Department / Program:Engineering, Electronics and Electrical
Computer Science
Discipline:Engineering, Electronics and Electrical
Computer Science
Degree Granting Institution:University of Illinois at Urbana-Champaign
Subject(s):Engineering, Electronics and Electrical
Computer Science
Abstract:This thesis presents the results of an investigation into the applicability of Arithmetic Decomposition Theory (a theory for the design and analysis of arithmetic structures) to the design of concurrent error detecting arithmetic structures. Arithmetic Decomposition Theory shows how large, complex arithmetic circuits can be constructed by interconnecting a number of devices from a small library of elementary modules. The majority of effort in this investigation has gone into extending Arithmetic Decomposition Theory to encompass the design of Totally Self-Checking arithmetic circuits. Totally Self-Checking circuits always either produce a correct output, or give an error indication when a fault in the circuit causes an erroneous output. The extended theory has been demonstrated by its application to the design of a general purpose ALU. A simulator, which is useful in the analysis of Totally Self-Checking arithmetic circuits has been implemented. Finally, an alternative approach to concurrent error detection which involves a generalization of the classic approach of parity prediction to the two dimensional structures of Arithmetic Decomposition Theory has been developed.
Issue Date:1990
Rights Information:Copyright 1990 Angelotti, Frank William
Date Available in IDEALS:2011-05-07
Identifier in Online Catalog:AAI9026123
OCLC Identifier:(UMI)AAI9026123

This item appears in the following Collection(s)

Item Statistics