Fixed-Polarity OF-AND-EXOR Expressions and Their Minimization

摘要

We propose fixed-polarity OR-AND-EXOR expressions (FOAEs) and their minimization algorithm with O(4~n) time complexity, where n is the number of input variables. FOAEs can be used for the easily testable realization for the deterministic and/or random testing. We present experimental results of the number of terms of FOAEs and random testing for the FOAE circuits on the MCNC benchmark. The results show that the FOAE circuits have high Potential testability for random testing.