Scribd
Upload
21 views31 pages

Week 10

This document provides an overview of digital logic design and combinational circuits. It discusses the basic characteristics of combinational circuits, including that the output depends only on the current input levels and does not use memory. It then describes several important combinational logic circuits - half adders, full adders, half subtractors, and full subtractors. For each circuit, it provides the block diagram, truth table, and circuit diagram. The half adder and full adder are used to add two and three bit numbers. The half subtractor and full subtractor are used to subtract two and three bit numbers and produce a difference and borrow output.

Uploaded by

syed mushtaher
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
21 views31 pages

Week 10

This document provides an overview of digital logic design and combinational circuits. It discusses the basic characteristics of combinational circuits, including that the output depends only on the current input levels and does not use memory. It then describes several important combinational logic circuits - half adders, full adders, half subtractors, and full subtractors. For each circuit, it provides the block diagram, truth table, and circuit diagram. The half adder and full adder are used to add two and three bit numbers. The half subtractor and full subtractor are used to subtract two and three bit numbers and produce a difference and borrow output.

Uploaded by

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

Overview Digital Logic Design

INDUS UNIVERSITY
Digital Logic Design

Combinational
Circuit
WEEK 10
Basic of Combinational Logic
Implementation of Combinational
Logic
Logic Circuits Operations
Half Adder/Full Adder
Half Subtractor/ Full Subtractor
C ombinational C irc uit

• Combinational circuit is a circuit in which we combine the different


gates in the circuit. Some of the characteristics of combinational
circuits are following −
• 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.
Block
Diagram

We're going to elaborate few important combinational circuits as follows.


Half Adder

• Half adder is a combinational logic circuit with two inputs and two
outputs.
• The half adder circuit is designed to add two single bit binary number
A and B.
• It is the basic building block for addition of two single bit numbers.
• This circuit has two outputs carry and sum
• It is used in Calculators, computers, digital measuring devices etc.
Half adder is the simplest of all adder circuits. Half adder is a
combinational arithmetic circuit that adds two numbers and produces
a sum bit (s) and carry bit (c) both as output. The addition of 2 bits is
done using a combination circuit called a Half adder. The input
variables are augend and addend bits and output variables are sum &
carry bits. A and B are the two input bits.
let us consider two input bits A and B, then sum bit (s) is the X-OR of A
and B. it is evident from the function of a half adder that it requires one
X-OR gate and one AND gate for its construction.
let us consider two input bits A and B, then sum bit (s) is the X-OR of A
and B. it is evident from the function of a half adder that it requires one X-
OR gate and one AND gate for its construction.
Half Adder

Block diagram Circuit Diagram

Truth Table
S=A’B+AB’
S=A⊕ B

C=AB
XOR
The XOR Gate is formed by connecting the AND, NOT and OR in particular configuration. XOR Gate is the
two input and single output logic gate.
XNOR

XNOR Gate is also formed by the combination of basic Gates. XNOR Gate is the complement of the XOR
Gate.
Full Adder

Full Adder is the adder that adds three inputs and


produces two outputs. The first two inputs are A and B and
the third input is an input carry as C-IN. The output carry
is designated as C-OUT and the normal output is
designated as S which is SUM. A full adder logic is
designed in such a manner that can take eight inputs
together to create a byte-wide adder and cascade the
carry bit from one adder to another. we use a full adder
because when a carry-in bit is available, another 1-bit
adder must be used since a 1-bit half-adder does not take
a carry-in bit. A 1-bit full adder adds three operands and
generates 2-bit results.
Full Adder
• Full adder is developed to overcome the drawback of Half Adder
circuit.
• It can add two one-bit numbers A and B, and carry c.
• The full adder is a three input and two output combinational circuit.
• It is used in Multiple bit addition, digital processors etc.
Block diagram
Full Adder

Truth Table Circuit Diagram

S=A’B’C+A’BC’+AB’C’+ABC
Rules
S=A’(B’C+BC’)+A(B’C’+BC)
A’B+AB’=A ⊕ B
S=A’(B ⊕ C)+A(B⊙C) C=AB+AC+BC
B=(B ⊕C) AB+A’B’=(A ⊙B)
S=A’B+AB’
S=A ⊕ B B’=(B ⊙C)
S=A ⊕ B ⊕ C
B’C’ B’C BC BC ‘

A’ 1 C=BC+AB+AC

A 1 1 1

B’C’ B’C BC BC ‘
A’ 1 1

A 1 1
Half Subtrac tor
• Half subtractor is a combination circuit with two inputs and two
outputs (difference and borrow).
• It produces the difference between the two binary bits at the input
and also produces an output (Borrow) to indicate if a 1 has been
borrowed.
• In the subtraction (A-B), A is called as Minuend bit and B is called as
Subtrahend bit.
Truth Table Circuit Diagram

D stands for difference


B stands for borrow
D=A’B+BA’ B=A’B
D=A ⊕ B
Full Subtrac tors
• The disadvantage of a half subtractor is overcome by full subtractor.
• The full subtractor is a combinational circuit with three inputs A,B,C
and two output D and C'.
• A is the 'minuend', B is 'subtrahend', C is the 'borrow' produced by
the previous stage, D is the difference output and C' is the borrow
output.
Full Subtrac tors
B’C’ B’C BC BC ‘

A’ 1 1

A 1 1

D=A’B’C+A’BC ’+AB’C ’+ABC


D=A’(B’C+BC’)+A(B’C’+BC) :B’C+BC’=B ⊕C , B’C’+BC=B⊙C
D=A’(B ⊕ C)+A(B ⊙ C) :A’B+AB’= A ⊕ B
D=A ⊕ B ⊕ C
B’C’ B’C BC BC ‘

A’ 1 1 1

A 1

B=A’C+A’B+BC
Full Subtrac tors

B’
RECOMMENDED BOOK:
Digital Fundamentals, Thomas L. Floyd 11th Edition
Thank You
Thank you

You might also like