General Design Rules for the Construction of m-Out-of-n Totally Self-Checking Checkers.
Abstract
This report presents a set of conditions sufficient to characterize a class of realizations of m-out-of-n code totally self-checking checkers. The same conditions are shown to be necessary for the construction of two-level checkers and a design method for minimal two-level checkers is given. Using a well known theorem from combinatoric, a relationship which must exist between m and n in order for the above mentioned conditions to be satisfied is shown.
Document Details
- Document Type
- Technical Report
- Publication Date
- Oct 01, 1975
- Accession Number
- ADA021675
Entities
People
- Gernot Metze
- James E. Smith
Organizations
- University of Illinois Urbana–Champaign