Karnaugh Maps
K-Maps
Karnaugh maps (K-Maps) are really just a different way to
represent a Standard Sum of Products Expression.
K-Maps provide an easy and visual technique for finding the
minimum SOP form for a Boolean expression
A K-Map is a 2 dimensi

Boolean Algebra
Boolean Algebra
Similar to the algebra that you learned in grade school.
Different because we only use binary numbers: 0 and 1
Do not be concerned with having to memorize the names of
each property. It is better to understand how to use

Forms of Expressions
Forms of Expressions
Most of the circuits you will implement will be written in
Boolean Algebraic form
The form used most commonly is the Sum of Products form
A sum of products expression will look like this:
AB + BC + ABC
The te

Combinational Logic
Comparators, Decoders, Encoders and Multiplexers
Comparators
A comparator is a circuit that is designed to compare one value to another
Can be implemented with an Exclusive XNOR gate
Comparators
If all of the bits in both numbers ar

Timing Diagrams
Timing Diagrams
Timing diagrams allow us to show behavior of a circuit over
time.
Provided with the input over time and the expression you are
implementing for your circuit, you can show the expected
behavior.
X = AB, expression x will