Letter/Communication
Easily Testable Cellular Realizations for the (Exactly P)-out-of n and (p or More)-out-of n Logic Functions
IEEE transactions on computers, Vol.C-23(1), pp.98-100
01/1974
DOI: 10.1109/T-C.1974.223787
Abstract
Networks to realize all n-variable symmetric threshold functions and elementary symmetric functions are given. It is also shown that only 2n test inputs are necessary and sufficient to test any number of faults in these networks.
Details
- Title: Subtitle
- Easily Testable Cellular Realizations for the (Exactly P)-out-of n and (p or More)-out-of n Logic Functions
- Creators
- Sudhakar M Reddy - University of IowaJames R Wilson
- Resource Type
- Letter/Communication
- Publication Details
- IEEE transactions on computers, Vol.C-23(1), pp.98-100
- Publisher
- IEEE
- DOI
- 10.1109/T-C.1974.223787
- ISSN
- 0018-9340
- eISSN
- 1557-9956
- Language
- English
- Date published
- 01/1974
- Academic Unit
- Electrical and Computer Engineering
- Record Identifier
- 9984197181002771
Metrics
47 Record Views