On completely robust path delay fault testable realization of logic functions

A large class of Boolean functions, as well as almost all symmetric Boolean functions, are shown to have no two-level completely robust path-delay-fault testable (RPDFT) realization by combinational circuits. Exact and asymptotic formulae are derived for the number of symmetric Boolean functions whi...

Ausführliche Beschreibung

Bibliographische Detailangaben

1. Verfasser:	Vardanian, V.A.
Format:	Tagungsbericht
Sprache:	eng
Schlagworte:	Algorithm design and analysis Boolean functions Circuit faults Circuit testing Combinational circuits Delay Input variables Logic functions Logic testing Robustness
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!