DIGITAL ELECTRONICS

PROJECT
(4 BIT BCD ADDER)

SUBMITTED BY :-
JAGNUR SINGH SANDHU (2k17/CO/142)
JALAJ GABA (2k17/CO/143)
JASPREET SINGH (2k17/CO/144)
JATIN HOODA (2k17/CO/145)
AIM: To implement 4-bit BCD adder circuit using required IC’s and logic gates

APPARATUS REQUIRED :

 4-bit Binary adder IC 74283

 AND gate IC 7408
 OR gate IC 7432
 LED Bulbs
 9 volt battery
 connecting wires

CIRCUIT DIAGRAM :
THEORY :

BINARY CODED DECIMAL NUMBER SYTEM

Binary coded decimal (BCD) is a system of writing numerals that assigns a four-
digit binary code to each digit 0 through 9 in a decimal (base-10) numeral. The
four-bit BCD code for any particular single base-10 digit is its representation in
binary notation, as follows:

0 = 0000
1 = 0001
2 = 0010
3 = 0011
4 = 0100
5 = 0101
6 = 0110
7 = 0111
8 = 1000
9 = 1001
Numbers larger than 9, having two or more digits in the decimal system, are
expressed digit by digit. For example, the BCD rendition of the base-10 number
1895 is

0001 1000 1001 0101

The binary equivalents of 1, 8, 9, and 5, always in a four-digit format, go from

left to right.
The BCD representation of a number is not the same, in general, as its simple
binary representation. In binary form, for example, the decimal quantity 1895
appears as

11101100111

Other bit patterns are sometimes used in BCD format to represent special
characters relevant to a particular system, such as sign (positive or negative),
error condition, or overflow condition.
The BCD system offers relative ease of conversion between machine-
readable and human-readable numerals. As compared to the simple binary
system, however, BCD increases the circuit complexity. The BCD system is not
as widely used today as it was a few decades ago, although some systems still
employ BCD in financial applications.
DECIMAL ADDER

computers or calculators that perform arithmetic operations directly in the

decimal number system represent decimal numbers in binary coded form. An
adder for such a computer must employ arithmetic circuits that accept coded
decimal numbers and present results in the same code. For binary addition, it
is sufficient to consider a pair of significant bits together with a previous carry.
A decimal adder requires a minimum of nine inputs and five outputs, since four
bits are required to code each decimal digit and the circuit must have an input
and output carry. There is a wide variety of possible decimal adder circuits,
depending upon the code used to represent the decimal digits. Here we
examine a decimal adder for the BCD code. (See Section 1.7.)

BCD Adder

Consider the arithmetic addition of two decimal digits in BCD, together with an
input carry from a previous stage. Since each input digit does not exceed 9, the
output sum cannot be greater than 9 + 9 + 1 = 19, the 1 in the sum being an
input carry. Suppose we apply two BCD digits to a four-bit binary adder. The
adder will form the sum in binary and produce a result that ranges from 0
through 19. These binary numbers are listed in table and are labelled by
symbols K, Z8, Z4, Z2 and Z1. K is the carry, and the subscripts under the letter
Z represent the weights 8, 4, 2, and 1 that can be assigned to the four bits in
the BCD code. The columns under the binary sum list the binary value that
appears in the outputs of the four-bit binary adder. The output sum of two
decimal digits must be represented in BCD and should appear in the form
listed in the columns under “BCD Sum.” The problem is to find a rule by which
the binary sum is converted to the correct BCD digit representation of the
number in the BCD sum. I n examining the contents of the table, it becomes
apparent that when the binary sum is equal to or less than 1001, the
corresponding BCD number is identical, and therefore no conversion is
needed. When the binary sum is greater than 1001, we obtain an invalid BCD
representation. The addition of binary 6 (0110) to the binary sum converts it to
the correct BCD representation and also produces an output carry as required.

The logic circuit that detects the necessary correction can be derived from the
entries in the table. It is obvious that a correction is needed when the binary
sum has an output carry K = 1. The other six combinations from 1010
through 1111 that need a correction have a 1 in position Z8. To distinguish
them from binary 1000 and 1001, which also have a 1 in position Z8, we
specify further that either Z4 or Z2 must have a 1. The condition for a
correction and an output carry can be expressed by the Boolean function C =
K + Z8Z4 + Z8Z2
When C = 1, it is necessary to add 0110 to the binary sum and provide an
output carry for the next stage. A BCD adder that adds two BCD digits and
produces a sum digit in BCD is shown . The two decimal digits, together with
the input carry, are first added in the top four-bit adder to produce the binary
sum. When the output carry is equal to 0, nothing is added to the binary sum.
When it is equal to 1, binary 0110 is added to the binary sum through the
bottom four-bit adder. The output carry generated from the bottom adder can
be ignored, since it supplies information already available at the output carry
terminal. A decimal parallel adder that adds n decimal digits needs n BCD
adder stages. The output carry from one stage must be connected to the input
carry of the next higher order stage.
IC-74283 ( 4 Bit binary adder)

A basic Binary Adder circuit can be made from standard AND and Ex-OR gates
allowing us to “add” together two single bit binary numbers, A and B.
The addition of these two digits produces an output called the SUM of the
addition and a second output called the CARRY or Carry-out, ( COUT ) bit
according to the rules for binary addition. One of the main uses for the Binary
Adder is in arithmetic and counting circuits.

IC-7432( OR Gate)

The OR gate is a digital logic gate that implements logical disjunction – it

behaves according to the truth table to the right. A HIGH output (1) results if
one or both the inputs to the gate are HIGH (1). If neither input is high, a LOW
output (0) results. In another sense, the function of OR effectively finds the
maximum between two binary digits, just as the complementary AND function
finds the minimum.
IC-7408( AND Gate)

The AND gate is a basic digital logic gate that implements logical conjunction -
it behaves according to the truth table to the right. A HIGH output (1) results
only if all the inputs to the AND gate are HIGH (1). If none or not all inputs to
the AND gate are HIGH, a LOW output results. The function can be extended to
any number of inputs. The AND gate with inputs A and B and output C
implements the logical expression C= A.B

PROCEDURE:
Step1 : Make connections as per the circuit diagram.

Step 2: The circuit can be verified using various values of inputs and then
testing the values of outputs as per table.

RESULT: The circuits was successfully implemented and verified .