Answer the following for the given Boolean function.
Draw the logic gate diagram for the reduced expression using only NOR gates. Assume that the…
Computer Science20191 markDrawing
Draw the logic gate diagram for the reduced expression using only NOR gates. Assume that the variables and their complements are available as inputs.
Draw: Logic gate diagram of the reduced expression using only NOR gates
Show the case
Given the Boolean function: $F(P, Q, R, S) = \pi ( 0, 1, 2, 8, 9, 11, 13, 15 )$.
Answer
Answer
AI
NOR-only (NOR-NOR) implementation of $F = (P'+S') \cdot (P+Q+S) \cdot (Q+R)$: one NOR gate for each sum term, and a 3-input NOR gate combining them. By De Morgan's law, $[(P'+S')' + (P+Q+S)' + (Q+R)']' = (P'+S') \cdot (P+Q+S) \cdot (Q+R)$.
