









Study with the several resources on Docsity
Earn points by helping other students or get them with a premium plan
Prepare for your exams
Study with the several resources on Docsity
Earn points to download
Earn points by helping other students or get them with a premium plan
An introduction to digital logic, focusing on boolean algebra and its application to logic gates. Topics include logic circuits built from components called logic gates, which correspond to boolean operations +, *, and not. And, or, not, nand, nor, xor, and xnor gates, their properties, and their use as universal logic gates. The document also includes examples and exercises.
Typology: Slides
1 / 15
This page cannot be seen from the preview
Don't miss anything!










Boolean Algebra to Logic Gates
Logic Gate:
Parallel Circuit:
A+B Truth Table:
OR
A’ or A
Logic Gate: (also called an inverter)
Single-throw Double-pole Switch:
a A 0 1 1 0
Truth Table:
A’ or A
n -bit Inputs
Logic Circuits ≡ Boolean Expressions
A
B abc
aBc
Ab y=abc+aBc+Ab
y
y=aB+Bc
A B AB 0 0 0 0 1 1 1 0 1 1 1 0 A B A B 0 0 1 0 1 0 1 0 0 1 1 1
x1=X x0=X x 0=1 x 1= x x=X x x=X x y=X+Y x y=XY X Y=x+y X Y=xy not (x y)=xy not (x y)=x+y
It should be clear by looking at these properties that NAND and NOR are duals.
equivalents:
can be used to reduce the number of required gates in a circuit.
x y f(x,y) 0 0 0 0 1 1 1 0 1 1 1 0
(What kind of gate has this truth table?