A Complete Test Set for Quasi Prime Implicant Networks.
IOWA UNIV IOWA CITY DEPT OF MATHEMATICS
Pagination or Media Count:
A procedure to specify a nearly minimum complete test set for quasi prime implicant networks is given. In this procedure, only the derivation of a 0-test set is needed. The technique via self-dual function imbedding aims at generating easily testable network realizations for logic functions. Author
- Electrical and Electronic Equipment