A time optimal robust path-delay-fault self-testable adder

A log(n)-time robust path-delay-fault (PDF) testable adder is presented. The adder is a modified version of a conditional carry adder (CCA). An optimal test set of size Theta (n/sup 2/*log(n)) is constructed. The realization of a selftest for the adder is discussed; an algorithm of complexity O(n/sup 3/) for the generation of a complete test set is used. A short hardware analysis of the CCA and its robust PDF-modification are presented.<
>