Recently introduced, three-level logic Sum of 2-Pseudoproducts (2-SPP) forms allow the representation of Boolean functions with much shorter expressions than standard two-level Sum of Products (SOP) forms, or other three-level logic forms.
First we describe an exact minimization algorithm for the synthesis of 2-SPP networks. We then analyze the testability of 2-SPP networks under the Stuck-at-fault Model. Finally, we describe a method for transforming non-testable networks into testable ones.
