Unit – II
Combinational Logic Design
Code Converter
• There is a wide variety of binary codes used in digital systems.
• Some of these codes are
• binary-coded-decimal (BCD),
• Excess-3,
• Gray and so on.
• Many times it is required to convert one code to another.
• procedure to design code converters :
• Step 1 : Write the truth table showing the relationship between input
code and output code.
• Step 2 : For each output code bit determine the simplified Boolean
expression using K-map.
• Step 3 : Realize the code converter using logic gates.
BCD Code
• BCD is an abbreviation for Binary Coded
Decimal.
• BCD is a numeric code in which each
digit of a decimal number is represented
by a separate group of 4-bits.
• The most common BCD code is 8-4-2-1
BCD.
• In multi-digit coding, each decimal digit
is individually coded with 8-4-2-1 BCD
code,
• Total 8-bits are required to encode 5810 .
Excess-3 Code
• The excess-3 code can be derived from
the natural BCD code by adding 3 to
each coded number.
• Ex, decimal 12 can be represented in
BCD as 0001 0010.
• Now adding 3 to each digit we get
Excess-3 code as 0100 0101 (12 in
decimal).
• It is a non-weighted code.
• (592)10 =
• 403 10 =
Gray Code
• Gray code is a non-weighted code and
is a special case of unit-distance code.
• In unit-distance code, bit patterns for
two consecutive numbers differ in only
one bit position.
• These codes are also called cyclic
codes.
• Reflective Property : The gray code is
also called reflected code
• In general, the n least
• significant bits for 2n through 2n +1 – 1
are the mirror images of those for 0
through 2n – 1.
Code Converter
• Let us see the procedure to design code converters :
• Step 1 : Write the truth table showing the relationship between input code
and output code.
• Step 2 : For each output code bit determine the simplified Boolean expression
using K-map.
• Step 3 : Realize the code converter using logic gates.
4-bit Binary to BCD converter.
BCD to Excess-3 code.
BCD to Gray code.
Binary to Gray
Gray to BCD
• Home Work
• Design 4-bit binary to gray code converter.
• State the applications of BCD Code, Excess-3 code, Gray Code.
Adder
• The first three operations produce a sum
• Basic athematic operations whose length is one digit,
• Addition
• The last operation is performed sum is two
• Subtraction digits.
• four possible elementary operations • The higher significant bit of this result is
called a carry, and lower significant bit is
called sum.
• The logic circuit which performs this
operation is called a half-adder.
• The circuit which performs addition of
three bits (two significant bits and a
previous carry) is a full-adder.
Half Adder
• two binary inputs :
• augend
• addend
• two binary outputs
• sum
• carry.
• K-map simplification
Full Adder
• Three binary inputs :
• augend
• addend
• Previous carry
• two binary outputs
• sum
• carry.
Full Adder
• K-map simplification
• The Boolean function for sum can be further simplified as follows :
• Full adder using two half adders
