An Investigation into Redundancy and Testability of Combinational Logic Networks.
Abstract
Some results on redundancy and testability of combinational logic networks are given. It is shown that there exist tree networks that are testable relatively easily for redundancy and faults. It is also shown that the multilevel networks proposed not only require less hardware but also fewer tests to detect faults than the equivalent two level networks. (Author)
Document Details
- Document Type
- Technical Report
- Publication Date
- Sep 01, 1970
- Accession Number
- AD0714157
Entities
People
- John P. Robinson
- Ramaswami Dandapani
- Sudhakar M. Reddy
Organizations
- University of Iowa