Testability of Quasi Prime Implicant Networks.

Abstract

A multilevel quasi prime implicant network is defined for switching functions. This realization requires a reduced number of detection tests for stuck-at-faults and a reduced hardware cost, as compared with a two-level AND-OR realization. The locatability of stuck-at-faults is improved in a quasi prime implicant network realization. (Author)

Document Details

Document Type
Technical Report
Publication Date
Mar 01, 1972
Accession Number
AD0740088

Entities

People

  • Benjamin M. Lin
  • John P. Robinson

Organizations

  • University of Iowa

Tags

DTIC Thesaurus Topics

  • Automata
  • Detection
  • Switching

Readers

  • Computer Programming and Software Development.
  • Integrated Circuit Design and Technology.
  • Theoretical Analysis.