Converting a Boolean Expression

into a Circuit Diagram

 Remember:
A This represents the logical expression AND.
C
B Here C = A AND B
So C= A.B

A This represents the logical expression OR.

C Here C = A OR B
So C= A + B
B

This represents the logical expression NOT.

A C Here C = NOT A
So C= A
 Example 1

Convert the following expression into a Circuit

Diagram :
A = (B.C + B.D).F
 Example 1
If we start with the initial part:
A = (B.C + B.D).F

This is:
B
 Example 1
Now the output of this is ANDED with C
A = (B.C + B.D).F

This is:
B

C
 Example 1
Now separate from this we are ANDING B and D
A = (B.C + B.D).F

This is:
B

D
 Example 1
Now we can combine the 2, with an OR
A = (B.C + B.D).F
This is:
B

D
 Example 1
Now lastly, this is all ANDED with F
A = (B.C + B.D).F
This is:
B

A
D

F
 Example 2

Convert the following expression into a Circuit

Diagram :
G = (X.Y + Y.Z).Z
 Example 2
If we start with the initial part:
G = (X.Y + Y.Z).Z
This is:
X
Y
 Example 2
Moving on to the next section.
G = (X.Y + Y.Z).Z
This is:
X
Y

Z
 Example 2
Moving on to the next section.
G = (X.Y + Y.Z).Z
This is:
X
Y

Z
 Example 2
And then the last section.
G = (X.Y + Y.Z).Z
This is:
X
Y

Z
J = A.(B.Z + B.A)