Namrata Pagare
Assistant Professor
KKWIEER, Nashik
Objectives
To develop skills for design and implementation of
combinational logic circuits
Outcomes
To Design and implement combinational circuits
Representations of signed numbers
Standard representations of logic functions
Logic Minimization techniques
❖ Digital Circuit are Classified as:
1. Combinational Circuits
• The output at any instant of time depend upon the inputs
present at that instant of time
• No memory in these circuits
2. Sequential Circuits
• The output at any instant of time depend upon the present
inputs as well as past inputs/outputs
• Elements to store information known as memory
▪ The output of combinational circuit at any instant of
time, depends only on the levels present at input
terminals
▪ The combinational circuit do not use any memory. The
previous state of input does not have any effect on the
present state of the circuit.
▪ A combinational circuit can have an n number of inputs
and m number of outputs
▪ Combinational logic circuits are generally designed by
connecting together or combining the logic gates
▪ The function of combinational logic circuits can be
specified in three main ways such as:
1. Truth Table
2. Boolean Expressions
3. Logic Diagram
▪ Examples of Combinational Circuits:
1. Code Converters
2. Adders,subtractors
3. Multiplexer,demultiplexer
4. Comparator
5. Encoders, Decoders
Computer and digital circuits process data in the binary
format
Digital data is represented, stored and transmitted as a
group of binary bits. Group of such bits is called as
binary code
Various binary codes are used to represent data which
may be numeric ,alphabets or special characters
Classification of binary codes:
1. Weighted Codes and Non-Weighted Codes
2. Binary Coded Decimal Code
3. Alphanumeric Codes
4. Error Detecting Codes and Error Correcting Codes
1. Binary Code
Weighted Codes (8-4-2-1)
2. BCD code
3. Excess-3 Code
Non-Weighted Codes
4. Gray Code
Binary Code Binary Code
Decimal no 8 4 2 1 Decimal no 8 4 2 1
0 0 0 0 0 8 1 0 0 0
1 0 0 0 1 9 1 0 0 1
2 0 0 1 0 10 1 0 1 0
3 0 0 1 1 11 1 0 1 1
4 0 1 0 0 12 1 1 0 0
5 0 1 0 1 13 1 1 0 1
6 0 1 1 0 14 1 1 1 0
7 0 1 1 1 15 1 1 1 1
◦ Each decimal digit is represented by a 4-bit binary
number
◦ BCD is a way to express each of the decimal digits with a
binary code(Only 1st ten of these are used i.e. 0000-1001)
Decimal No Binary BCD
10 1010 0001 0000
11 1011 0001 0001
12 1100 0001 0010
13 1101 0001 0011
14 1110 0001 0100
15 1111 0001 0101
Add
Decimal Number 8421 BCD Excess-3 Code
0011
Decimal No BCD Excess-3
8421
0 0000 0011
1 0001 0100
2 0010 0101
3 0011 0110
4 0100 +0011 0111
5 0101 1000
(3)10
6 0110 1001
7 0111 1010
8 1000 1011
9 1001 1100
• Gray Code is nonweighted and Cyclic code
• Follows reflective property
Steps for Code Conversion:
1. Write truth table
2. For Each Output write a K-map
3. From K-map obtain simplified expression
4. Realize code converter using basic gates
Decimal No BCD Code Excess-3 Code
B3 B2 B1 B0 E3 E2 E1 E0
0 0 0 0 0 0 0 1 1
1 0 0 0 1 0 1 0 0
2 0 0 1 0 0 1 0 1
3 0 0 1 1 0 1 1 0
4 0 1 0 0 0 1 1 1
5 0 1 0 1 1 0 0 0
6 0 1 1 0 1 0 0 1
7 0 1 1 1 1 0 1 0
8 1 0 0 0 1 0 1 1
9 1 0 0 1 1 1 0 0
E1=𝐁𝟏 𝐁𝟎+B1B0
E0=𝐁𝟎
E2=𝐁𝟐 𝐁𝟏 + 𝐁𝟐B0+B2 𝐁𝟏𝐁𝟎
= 𝐁𝟐 (𝐁𝟏 + B0)+B2 𝐁𝟏𝐁𝟎 E3=B3+B2B0+B2B1
=B3+B2(B0+B1)
Binary Code Gray Code
B3 B2 B1 B0 G3 G2 G1 G0
0 0 0 0 0 0 0 0
0 0 0 1 0 0 0 1
0 0 1 0 0 0 1 1
0 0 1 1 0 0 1 0
0 1 0 0 0 1 1 0
0 1 0 1 0 1 1 1
0 1 1 0 0 1 0 1
0 1 1 1 0 1 0 0
1 0 0 0 1 1 0 0
1 0 0 1 1 1 0 1
1 0 1 0 1 1 1 1
1 0 1 1 1 1 1 0
1 1 0 0 1 0 1 0
1 1 0 1 1 0 1 1
1 1 1 0 1 0 0 1
1 1 1 1 1 0 0 0
G3 = B3 G2 = B3 B2 + B2 B3 = B3 ⊕ B2
G1= B2 B1 + B1 B2 = B2 ⊕ B1 G0= B1 B0 + B0 B1 = B1 ⊕ B0
THANK YOU
