A Complete Test Set for Quasi Prime Implicant Networks.

Abstract

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)

Document Details

Document Type
Technical Report
Publication Date
Aug 01, 1971
Accession Number
AD0730780

Entities

People

  • Benjamin M. Lin
  • John P. Robinson

Organizations

  • University of Iowa

Tags

DTIC Thesaurus Topics

  • Automata
  • Test Sets

Readers

  • Applied Combinatorial Optimization and Logic Circuit Design.
  • Graph Algorithms and Convex Optimization.