REDUNDANCY IN THRESHOLD LOGIC NETWORKS.
Abstract
In this paper, methods are presented for designing error correcting capabilities into threshold gate networks so that the logic gates themselves correct errors of the system. A method is first presented which is based on the tree method of Coates and Lewis for the realization of threshold gate networks. In this method, the error correcting network is designed from the Boolean function to be realized. A primary realization is a realization for some function on the tree such that either the separating function or the gaps are assigned without knowledge of any other realizations on the tree. It is shown that a realization obtained by the tree method will correct errors of gates in the system if and only if all primary realizations are selected so that they will correct errors of gates in the primary realization. Relations are than presented for selecting the primary realizations. In the second part of this paper, three methods are presented for adding redundancy to a given realization so that errors of gates are corrected by the level of logic immediately following the occurrence of the error. In the final section, it is shown that correcting errors in the logic gates, themselves, requires fewer levels of logic and, for many relizations, fewer gates than when majority gates are used to correct the errors.
Document Details
- Document Type
- Technical Report
- Publication Date
- Aug 01, 1966
- Accession Number
- AD0488968
Entities
People
- Clarence L. Coates
- James Daniel Bargainer Jr.
Organizations
- University of Texas at Austin