This preview shows page 1. Sign up to view the full content.
Unformatted text preview: the 5valued algebra as well. The simplest way to perform Boolean operations is to represent each composite value into the v/v f form and operate on the faultfree value first, followed by the faulty value. For example, 1 AND D is 1/1 AND 1/0. ANDing the faultfree values yields 1 AND 1 = 1, and ANDing the faulty values yields 1 AND 0 = 0. So the result of the AND operation is 1 / = D . As another example, D OR D = 1 / 0 OR 0 / 1 = 1 / 1 = 1 Tables 4.1, 4.2, and 4.3 show the AND, OR, and NOT operations for the 5valued algebra, respectively. Operations on other Boolean conjunctives can be constructed in a similar manner. 4.4.1 A Naive ATPG Algorithm A very simple and naive ATPG algorithm is shown in Algorithm 1, where combinational circuits with fanout structures can be handled. TABLE 4.1 ± AND Operation AND 1 D D X 1 1 D D X D D D X D D D X X X X X X...
View
Full
Document
This note was uploaded on 05/16/2011 for the course ENGINEERIN mp108 taught by Professor Elbarki during the Spring '08 term at Alexandria University.
 Spring '08
 elbarki
 Algorithms, Gate

Click to edit the document details