Scribd
Upload
5 views44 pages

Logic Circuit Design Fundamentals

The document discusses concepts related to Boolean algebra, including minterms, maxterms, and various laws such as the Identity Law, Dominant Law, and Complement Law. It also covers the representation of logical expressions and the design of basic digital circuits like half and full subtractors. Additionally, it provides examples of logical combinations for three variables and the application of different logical gates.

Uploaded by

Nitin K
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
5 views44 pages

Logic Circuit Design Fundamentals

The document discusses concepts related to Boolean algebra, including minterms, maxterms, and various laws such as the Identity Law, Dominant Law, and Complement Law. It also covers the representation of logical expressions and the design of basic digital circuits like half and full subtractors. Additionally, it provides examples of logical combinations for three variables and the application of different logical gates.

Uploaded by

Nitin K
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

Literal C is missing

Literal C is missing
2
1 Incomplete

2
1 Incomplete
Represents MINTERMS
Represents MAXTERMS
For 3 Variables: x1, x2, x3

0 -->

1 -->

2 -->

3 -->

4 -->

5 -->

6 -->

7 -->

2n combinations

Here, n = 3

3
Therefore, #combinations = 2 =8
X1

o X1

X2

X3

X1

X2
X3
X2

X1

X2
X3
LEVEL 2

X1
X2
X3

LEVEL 1
_
Z+Z=1
1+0=1
0+1=1

011 010 110

X+X=X

1+1=1
0+0=0
_
x.x=0
1.0=0
0.1=0
X.X=X
AB

(AB + CD + E)
CD

E LEVEL 2

LEVEL 1
(1)
Y
__
AB = Y1

___
CD = Y2

_
E = Y3

__________
Y1 . Y2 . Y3 (1)
B

AB
A
A B +. A B +. C D
AB

CD

D
A+B

(A+B)(B+C)(A+C)
B+C

A+C
___________
= Y1 + Y2 + Y3
A+B

A+B

C+D
A

1+0=1
0+0=0
A Identity Law
1.1=1
0.1=0

1+1=1
0+1=1
Dominant Law
1.0=0
0.0=0
A A

1+1=1
0+0=0
Idempotent Law 1.1=1
0.0=0

A A

1+0=1
Complement Law 0+1=1

1.0=0
0.1=0
Distributive Law

Absorption Law

Redundant
Literal Rule

Consensus Theorem
FA
FA

1 0 1 0 0

Wt: 16 8 4 2 1
(2 Inputs, 2 Outputs)

(3 Inputs, 2 Outputs)
AND gate
X
XY
Y
_ _
Y
X
XY
xy + xy

X
XY

Y
xy
XY

XY XY. XY

XY XY
XY
Half Subtractor

Full Subtractor
X Y. Y

Borrow: bout = X Y

bout = 0

X Y . Y = (X + Y) . Y = X Y + Y.Y

Bout = X Y
(X - Y - bin)
Thank You!

You might also like