Scribd
Upload
33 views24 pages

DLD (AM) Combintional Circuits (Adders, Subtractors)

In digital electronics, adders and subtractors both are the combinational logic circuits (a combinational logic circuit is one whose output depends only on the present inputs, but not on the past outputs) that can add or subtract numbers, more specifically binary numbers.

Uploaded by

Haseeb Farrukh
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
33 views24 pages

DLD (AM) Combintional Circuits (Adders, Subtractors)

In digital electronics, adders and subtractors both are the combinational logic circuits (a combinational logic circuit is one whose output depends only on the present inputs, but not on the past outputs) that can add or subtract numbers, more specifically binary numbers.

Uploaded by

Haseeb Farrukh
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 24

DIGITAL LOGIC

DESIGN (AM)
FALL 20
COURSE INSTRUCTOR: AQEEL TAHIR
DESIGNING OF COMBINATIONAL LOGIC
CIRCUITS
• The basic objective of the slides is to understand the working & designing of the
following combinational logic circuits:
a) Half Adder
b) Half Subtractor
c) Full Adder
d) (m,n) Adders
HALF ADDER
HALF ADDER

• Half adder is the first and the most basic logic circuit we are going to design.
• Half adder is used to add two bits (NOT THE TWO NUMBERS).
• Number Adders will be designed later on.
• Before start designing half adder, first see how the digital bits are added.
• Remember the concept of binary addition COPIED from decimal addition.
DECIMAL ADDITION:

• In decimal addition, we add digits on the


basis of their weightages (units add into
units, tens add into tens and so on…..)
• Means numbers (digits) are added column
wise.
• If the addition of two digits results within
range (0 to 9), there is NO carry out.
• But if the results exceeds the range, carry
out value is ADDED to next column (as
shown on right).
BINARY ADDITION:

• Binary addition FOLLOWS the same rule.


• Means digits are added column wise.
• If the addition of two digits results within range
(0 or 1), there is NO carry out.
• But if the results exceeds the range, carry out
value is ADDED to next column (as shown on
right)
• Since, there are two bits added at a time, means
04 combinations there (as shown on right)
EQUATIONS FOR OUTPUT:

• Since, there are now two bits output, means there A B Cout SUM

will be two output variables. 0 0 0 0


0 1 0 1
• REMEMBER, the # of output bits always
1 0 0 1
correspond to the output variables.
1 1 1 0
• Truth table showed at right
Cout mj SUM mj
• Equations are 0 0
SUM = m1 + m2 = AB + AB = 0 1 m1
0 1 m2
Cout = m3 = AB
1 m3 0
HALF-ADDER CIRCUITS
Exclusive OR

Exclusive OR Logic
Circuit
HALF SUBTRACTOR
HALF SUBTRACTOR

• Like Half adder, Half Subtract is also one of the most basic logic circuit we are going to
design.
• Half subtractor is used to Subtract two bits (NOT THE TWO NUMBERS).
• Before start designing half subtractor, first see how the digital bits are subtracted.
• Remember the concept of binary subtraction is COPIED from decimal subtraction.
DECIMAL SUBTRACTION:

• In decimal subtraction, we subtract digits on the


basis of their weightages (units from units, tens
from tens and so on…..)
• Means numbers (digits) are subtracted column wise.
• If A>B, no need to Borrow in.
• If A<B, borrow in from next preceding column is
required.
• Borrow-in is NOT ADDED, rather its COMBINED.
BINARY SUBTRACTION:

• Binary subtraction FOLLOWS the same rule.


• Means digits are subtracted column wise.
• If A>B, no need to Borrow in.
• If A<B, borrow in from next preceding column is
required.
• Since, there are two bits subtracted at a time,
means 04 combinations there (as shown on right)
BINARY SUBTRACTION

• Subtraction Truth Table


0–0=0
10 – 1 = 1
11 – 1 = 10
• Example:
HALF SUBTRACTOR

• Half Subtractor is used for subtracting one single bit binary number from


another single bit binary number.
FULL ADDER
FULL-ADDER

• Full Adder is used to add 3 bits at a


time.
• Two bits are input A & B.
• Third bit is considered to be Cin
which is actually Cout of the previous
column.
FULL-ADDER FUNCTION (TRUTH) TABLE

A B Cin Cout SUM


0 0 0 0 0
0 0 1 0 1
0 1 0 0 1
0 1 1 1 0
1 0 0 0 1
1 0 1 1 0
1 1 0 1 0
1 1 1 1 1
FULL ADDER EXPRESSION (FOR COUT & SUM)

COUT = AB + AC + BC SUM = A B C
Cout mj SUM mj
0 0
0 1 m1
0 1 m2
1 m3 0
0 1 m4
1 m5 0
1 m6 0
1 m7 1 m7
FULL ADDER CIRCUIT
(M , N) ADDERS
(M, N) ADDERS:

• Now, for onwards, we will consider the following notation:

m = Total No’s.
n = # of bits in each number.
• It means (2, 2) Adder means we are going to design such adders which will now ADD TWO NUMBERS
and each number is of 2 bits.
• i.e. now, we are moving one step ahead and making adders which are going to ADD NUMBERS.
Whereas previously, we make adders to add bits.
• REMEMBER: For designing of a logic circuit, sometimes we have to go for logical functions and
sometimes we have to implement the logic circuit with the help of Logical Operation Map (Algorithm).
(2, 2) ADDER:

• Following is the map of (2,2) Adder.


• We are adding two Numbers (A & B), each of 2 bits
(A0A1 & B0B1) respectively.

• Range of a circuit describes the minimum &


maximum output it can generates.
• Minimum output (0) is generated at minimum input.
• Maximum output is generated when maximum
inputs are applied.
• Range of (2,2) Adders is (0 – 6)
(M, N) ADDERS

• With the same concept/ similar approach (by implementing the logical Maps), we can
design adders with any configurations such as:
• (2, 3) Adders
• (3, 2) Adders
• (3, 3) Adders & so on…..

You might also like