Scribd
Upload
146 views5 pages

Digital Systems I Assignment Solutions

1. The document provides 13 problems involving applying logic theorems and transformations to obtain equivalent logic expressions and circuits. 2. The problems cover topics such as combining and covering theorems, distributivity, DeMorgan's laws, duality, consensus theorem, and obtaining truth tables and canonical forms. 3. Step-by-step workings are shown for applying theorems and transformations to derive equivalent logic expressions and circuits.

Uploaded by

Abigail Engle
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
146 views5 pages

Digital Systems I Assignment Solutions

1. The document provides 13 problems involving applying logic theorems and transformations to obtain equivalent logic expressions and circuits. 2. The problems cover topics such as combining and covering theorems, distributivity, DeMorgan's laws, duality, consensus theorem, and obtaining truth tables and canonical forms. 3. Step-by-step workings are shown for applying theorems and transformations to derive equivalent logic expressions and circuits.

Uploaded by

Abigail Engle
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

CE-210 Digital Systems I

Solution of Assignment 3

1. Apply the combining theorem (T10-L) to


Y = A . B’ . F’ + A . B . F’
Let a = A . F’ and b = B, therefore
Y = A . F’

2. Apply the covering theorem (T9-L) to


Y = A’ . G’ . H . E . C + G’ . E
Let a = G’ . E and b = A’ . H . C, therefore
Y = G’ . E

3. Apply the distributivity theorem (T8-L) to Y = A . C’ . D . E . (B’ + F’ + G’) to obtain a SOP expression
for Y.
Y = A . C’ . D . E . B’ + A . C’ . D . E. F’ + A . C’ . D . E . G’

4. Prove the elimination theorem shown below: (Use algebraic techniques)


X + X’ . Y = X + Y
Apply T8-R: X + X’ . Y = (X + X’) . (X + Y)
Apply T5-L: (X + X’) . (X + Y) = 1 . (X + Y)
Apply T1-R: 1 . (X + Y) = X + Y
5. Apply DeMorgan’s theorem(s) to Y as many times as you need to remove all primed parentheses:

Y = ((A + B . C’)’ . ((A . D’)’+ B))’


Let M = (A + B . C’)’ and N = (A . D’)’+ B)
Y = (M . N)’ = M’ + N’
M’ = ((A + B . C’)’)’ = A + B . C’
N’ = ((A . D’)’+ B))’ = ((A . D’)’)’ . B’ = A . D’ . B’
Y = M ‘ + N’ = A + B . C’ + A . D’ . B’
According to T9-L: A + A . D’ . B’ = A
Therefore, Y = A + B . C’

6. Apply DeMorgan’s theorem(s) to the following circuit to absorb all inversion bubbles at the output of
gates, and eventually come up with a circuit with AND and OR gates only. Inverters are only allowed
to complement the input variables, if needed. Do not simplify the circuit. Do not change the circuit
topology either. Show your work.
A Z3 A Z3
Z1 Z1
D D
B Y B Y
C C
Z4 Z2 Z4 Z2
E E
F F

G G
A A

D D
B Y B Y
C C
E E

F F

G G

A
D
B Y
C
E
F

Page 2 of 5
7. Derive an exact logic expression for output Y of the above circuit before any changes are made to the
circuit.
Y = (Z1 + C + Z2)’ Z1 = (B . Z3)’ Z3 = (A + D)’ Z1 = (B . (A + D)’)’ Z2 = G . Z4 Z4 = (E . F)’
Z2 = G . (E . F)’ Substitute for Z1and Z2:
Y = ((B . (A + D)’)’ + C + G . (E . F)’ )’

8. Obtain an exact logic circuit for Y shown below:


y = (((A’ . B)’ . (C’ + D))’ . ((E . F’)’ + G))’

A’
B

C’ Y
D
E
F’

9. Apply the principle of duality to:


X . Y + X’ . Z + Y . Z = X . Y + X’ . Z

(X + Y) . (X’ + Z) . (Y + Z) = (X + Y) . (X’ + Z)

Determine the number of gates that we need to realize each side of the above expression. What is the type
of each gate? How many inputs does each gate need?

X . Y + X’ . Z + Y . Z = X . Y + X’ . Z

Left: Three 2-input AND + Right: Two 2-input AND +


One 3-input OR One 2-input OR

Draw two logic circuits to realize these two logic expressions.

Page 3 of 5
Y
X Y
X
X’
Z X’

Y Z

Which side needs less hardware? Right

10. Use the theorems of switching algebra shown in Table 2 of Chapter 3 to prove the consensus
theorem:
(A + B) . (A’ + C) = (A + B) . (A’ + C) . (B + C) (1)
T10 –R: B + C = (B + C + A) . (B + C + A’)
Sub for (B + C) in (1):
Right side: (A + B) . (A’ + C) . (A + B + C) . (A’ + B + C) =
(A + B) . (A + B + C) . (A’ + C) . (A’ + B + C)
{

= A + B (Covering) = A’ + C (Covering)

= (A + B) . (A’ + C)

11. Obtain the truth table, the off-set maxterm list (shorthand notation) and the canonical POS of Y (A, B,
C) = Σ (0, 4, 6).

Page 4 of 5
Row A B C Y
0 000 1 Y(A, B, C) = ∏ (1, 2, 3, 5, 7)
1 001 0
Y = (A + B + C’) . (A + B’ + C) . (A + B’ + C’) . (A’ + B + C’)
2 010 0 . (A’ + B’ + C’)
3 011 0
4 100 1
5 101 0
6 110 1
7 111 0

12. Obtain the truth table, the canonical SOP and the canonical POS of Z(A, B, C) = A’ . C’ + B’ . C’

Row A B C Z
A’ . C’ = 1 or A’ = 1, C’ = 1 or A = 0, C = 0 rows 0 & 2
0 000 1
1 001 0 B’ . C’ = 1 or B’ = 1, C’ = 1 or B = 0 , C = 0 rows 0 & 4
2 010 1 These rows each receive a 1.
3 011 0
Z = A’ . B’. C’ + A’ . B . C’ + A . B’ . C’
4 100 1
5 101 0 Z = (A + B + C’) . (A + B’ + C’) . (A’ + B + C’) . (A’ + B’ + C) .
(A’ + B’ + C’)
6 110 0
7 111 0

13. Obtain the truth table, the on-set minterm list (shorthand notation) and the canonical SOP of Z(A, B,
C) = ∏ (0, 3, 4, 5, 6).

Row A B C Z
0 000 0
Y(A, B, C) = Σ (1, 2, 7)
1 001 1
2 010 1 Z = A’ . B’. C + A’ . B . C’ + A . B . C

3 011 0
4 100 0
5 101 0
6 110 0
7 111 1

Page 5 of 5

Common questions

Powered by AI

First, simplify each internal expression using identity and distributive laws. For instance, (A’ . B)’ is simplified to A + B', (C’ + D) and ((E . F’)’ + G) further transform into canonical forms by applying Demorgan's laws and distributive transformations to eliminate inversion bubbles, finally combining through nested stages to a sum or product form .

First, identify M = (A + B . C')' and N = (A . D')' + B. By applying DeMorgan’s theorem, M becomes A + B . C' and N becomes A . D' . B'. Therefore, the expression Y is transformed as Y = M' + N' which simplifies to Y = A + B . C' + A . D' . B'. According to T9-L, A + A . D' . B' simplifies to A, resulting in Y = A + B . C' .

By applying the principle of duality, the expression X . Y + X’ . Z + Y . Z = X . Y + X’ . Z is converted to its dual: (X + Y) . (X’ + Z) . (Y + Z) = (X + Y) . (X’ + Z). Analyzing the logic circuits, the left expression requires three 2-input AND gates and one 3-input OR gate, while the right uses two 2-input AND gates and one 2-input OR gate, indicating the right side needs less hardware .

The principle of duality is used to compare X . Y + X’ . Z + Y . Z vs. (X + Y) . (X’ + Z). Calculating the gate count, the first uses two 2-input AND gates for each conjunction part then merges with OR, and the second requires fewer gates due to merging redundancies and collective simplifications, making it more efficient .

The expression for Y is initially given as Y = (Z1 + C + Z2)'. Substituting Z1, where Z1 = (B . (A + D)')', translates to Z1 = (B . Z3)' and Z3 = (A + D)'. For Z2, where Z2 = G . (E . F)', we substitute. Thus, Y transforms to Y = ((B . (A + D)')' + C + G . (E . F)')' through substitution and expansion .

To prove the theorem, apply the expansion first. Consider X + X' . Y to be rewritten as (X + X’) . (X + Y) using T8-R. Then simplify (X + X’) using T5-L to expand it to 1, leading to (1 . (X + Y)), and by applying T1-R, simplify to X + Y, confirming equivalence .

DeMorgan's theorem is used to absorb inversion bubbles by redefining gate outputs using OR and AND gates only. Each inverted bubble is addressed separately by ensuring the inversions apply directly to the inputs only, maintaining circuit topology. This provides a circuit simplified to only uses AND, OR gates, with inputs naturally complemented when needed .

The consensus theorem (A + B) . (A' + C) = (A + B) . (A' + C) . (B + C) can be proven using switching algebra. Applying T10-R, B + C = (B + C + A) . (B + C + A'), substitute B + C in (1) leading to: (A + B) . (A' + C) . (A + B + C) . (A' + B + C) simplifies to (A + B) . (A + B + C) . (A' + C) . (A' + B + C), which reduces back to the original expression through simplification .

To derive the canonical POS, we list the minterms for which Y = 1, corresponding to 0, 4, and 6. The maxterm approach requires finding outputs where Y = 0, resulting in Σ(1, 2, 3, 5, 7). The canonical POS formula is constructed using the complement of these values, creating a product of sums expression capturing these conditions .

By applying the combining theorem (T10-L), the expression Y = A . B' . F' + A . B . F' can be simplified to Y = A . F'. This is done by recognizing that A . F' is common in both terms, allowing the simplification through the theorem to Y = A . F' .

You might also like