Combinational Logic Circuits-Main Ref - Document
Combinational Logic Circuits-Main Ref - Document
Introduction:
In this module, we try to understand “Combinational logic circuit” and logic circuit
simplification with the help of Exercise titled “Random sequence generation using Logic
gates”
But before going into that aspect, let us have a brief idea on fundamentals required to do
this exercise.
1. Basic Gates
2. Boolean Algebra fundamentals
3. Sum of products, Products of sum expression
4. Simplification of logic circuits (Algebraic, K- Map method)
BASIC GATES:
NAND and NOR gates are called Universal gates, because with that gates we can able to
produce all other gates.
BOOLEAN ALGEBRA:
Boolean Algebra is used to analyze and simplify digital circuits. It uses only binary
numbers that is 0 and 1 .
The method of circuit simplification and design that we will be using are based on Sum of
products form.
Advantages of simplification:
1. Algebraic method.
2. Karnaugh Map method.
Algebraic methods:
In Algebraic methods, we will use Boolean Algebra laws, let us see this example
Step -2 : Write the AND term for each case where the output is 1.
Since the expression is in SOP form, the circuit consists of a group of AND gates, working
into a single OR gate
Karnaugh Maps:
Karnaugh Map (K- Map) is a graphical tool used to simplify a logic equation or to convert
a truth table to its corresponding logic circuit in a simple orderly process. This map can
find practical applications up to four variables.
The K map is almost like a truth table, is a means of showing relationship between logic
inputs and desired output. The truth table gives the output X for each combination of
input values, the K- map gives the same information in a different format. The truth table,
K-Map for two variable, three variable, four variables are as shown below.
Looping :
The expression for out put X can be simplified by properly combining those squares in the
K map that contain 1 . The process of combining these 1 is called Looping.
Looping a quad of adjacent 1 eliminates the two variables that appear in both
complimented and uncomplimented form
Looping of an octet of adjacent 1 eliminates the three variables that appear in both
complimented and uncomplimented form.
When we generalized,
When a variable appears both in complemented and uncomplemented form with in a loop
, that variable is eliminated from the expression. Variables that are the same for all squares
of the loop must appear in the final expression.
Examples :
Some logic circuits can be designed so that they are certain input conditions, for which
there is no specified output level, because these input conditions will never occur. In other
words there will be certain combinations of input levels where we “don’t care” weather the
output is 1 or 0.
A circuit designer is free to make the output of any don’t care condition either 0 or 1 to
produce simplest output expression. Decision is always a not easy one.
Step 2 : Construct Four K maps and minimize Boolean expressions with respect to
NAND gates
Step 5 : Take provided kit and realize the Random number sequence by giving proper
connections.
IC Diagram:
Multiplexers:
Now we will move towards Exercise. (Random number sequence generation)
Step 2 : Realize the output with 4x1 MUX (Based on selection lines
Step 4 : Try with different combination of selection lines select the optimized. By seeing
Data sheet of IC , draw pin diagram clearly
Step 5 : Take provided kit and realize the Random number sequence by giving proper
connections.
Exercise-1:
Selection lines
Multiplexer Inputs