EASILY TESTABLE REALIZATIONS FOR GENERALIZED REED-MULLER EXPRESSIONS

This paper presents a design method of easily testable AND-EXOR networ ks. It is an improvement of Reddy and Saluja-Reddy's methods, and has the following features. 1) The network uses generalized Reed-Muller ex pressions (GRMs) instead of Positive Polarity Reed-Muller expressions (PPRMs). The average number of products for GRMs is less than half of that for PPRMs, and is less than that of sum-of-products expressions ( SOPs). 2) The network consists of a literal part, an AND part, an EXOR part, and a check part. 3) The EXOR part can be a tree instead of a c ascade. Thus, the network is faster. 4) The test detects multiple stuc k at faults under the assumption that the faults occur at most one par t, either the literal part, the AND part, the EXOR part, or the check part.