Digital Circuit Synthesis Questions

Odd numbered questions have numerical solutions shown in [square brackets]

1. Circuit simplification using Boolean algebra

1.1. Extract the canonical sum-of-products equation for T from the following truth table.

A B C T
0 0 0 0
0 0 1 0
0 1 0 0
0 1 1 1
1 0 0 0
1 0 1 0
1 1 0 1
1 1 1 1
Estimate the complexity and delay of the circuit that would result from implementing this equation.
Use the rules of Boolean algebra to simplify the equation and estimate the complexity and delay of your
resulting simplified circuit.

[Original equation: T = A. B. C + A. B. C + A. B. C, Hardware complexity = 14 units, Delay=3 units]

[Simplified equation: T = B. C + A. B, Hardware complexity = 6 units, Delay = 2 units]

1.2. Extract the canonical sum-of-products equation for T from the following truth table.

A B C T
0 0 0 1
0 0 1 0
0 1 0 0
0 1 1 1
1 0 0 0
1 0 1 0
1 1 0 0
1 1 1 1
Estimate the complexity and delay of the circuit that would result from implementing this equation.
Use the rules of Boolean algebra to simplify the equation and estimate the complexity and delay of your
resulting simplified circuit.

1
1.3. Extract the canonical sum-of-products equation for T from the following truth table.

A B C T
0 0 0 1
0 0 1 0
0 1 0 0
0 1 1 0
1 0 0 1
1 0 1 0
1 1 0 0
1 1 1 0
Estimate the complexity and delay of the circuit that would result from implementing this equation.
Use the rules of Boolean algebra to simplify the equation and estimate the complexity and delay of your
resulting simplified circuit.

[Original equation: T = A. B. C + A. B. C; Hardware complexity = 13 units; Delay = 3 units]

[Simplified equation: T = B. C; Hardware complexity = 4 units; Delay = 2 units]

2 Circuit simplification using Karnaugh Maps

2.1. Use a Karnaugh map to find the simplest sum of products circuit that will implement the truth
table

[𝑇 = 𝐴̅. 𝐵 + 𝐵. 𝐶]

Truth table:
A B C T AB
C 00 01 11 10
0 0 0 1
0 0 1 1 0
0 1 0 0
0 1 1 1 1
1 0 0 0
1 0 1 0
1 1 0 0
1 1 1 1

2
2.2. Use a Karnaugh map to find the simplest sum of products circuit that will implement the truth
table

Truth table:
A B C T AB
C 00 01 11 10
0 0 0 0
0 0 1 1 0
0 1 0 0
0 1 1 1 1
1 0 0 0
1 0 1 1
1 1 0 0
1 1 1 1

2.3. Use a Karnaugh map to find the simplest sum of products circuit that will implement the truth
table

[𝑇 = 𝐴. 𝐶̅ + 𝐵. 𝐷]

Truth table:
A B C D T AB
0 0 0 0 0 CD 00 01 11 10

0 0 0 1 0 00
0 0 1 0 0
0 0 1 1 0 01
0 1 0 0 0
0 1 0 1 1 11
0 1 1 0 0
0 1 1 1 1 10
1 0 0 0 1
1 0 0 1 1
1 0 1 0 0
1 0 1 1 0
1 1 0 0 1
1 1 0 1 1
1 1 1 0 0
1 1 1 1 1

3
3 De-Morgan’s Theorem

3.1. Simplify the Boolean logic expression 𝑇 = (𝐴 + 𝐵). (𝐶 + 𝐷)

[𝑇 = 𝐴̅. 𝐵 + 𝐶̅ . 𝐷]

3.2. Simplify the Boolean logic expression 𝑇 = (𝐴 + 𝐵) + (𝐶 + 𝐷)

3.3. Simplify the Boolean logic expression 𝑇 = 𝐴 + 𝐵 + 𝐶 + 𝐷

[𝑇 = 𝐴 + 𝐵. 𝐶 + 𝐵. 𝐷]

3.4. Simplify the Boolean logic expression 𝑇 = 𝐴. 𝐵. 𝐶. 𝐷

3.5. Write down the Boolean logic expression for the following circuit, then simplify to minimal sum-
of-products form

A
B X
C

[Original 𝑋 = 𝐴̅. 𝐵. 𝐶 ; Simplified sum-of-products 𝑋 = 𝐴 + 𝐵 + 𝐶̅ ]