DIGITAL LOGIC

SANGEETH N.
 Topics
● Neural Functions
● Combinational Circuits
● Code Convertors
● Half Adder
● Full Adder
● Half Subtractor
● Full Subtractor
Notes
● The correct form is (POS of F)=(SOP of F’)’
● For any function consisting of n Boolean variables, Number of
minterms possible = Number of maxterms possible = 2n
● A neutral function is a function for which number of minterms
and number of maxterms are same.
● Eg: f( A, B) = A ⊕ B
Notes

Consider any function consisting of 2 Boolean variables A and B, Calculate the total
number of neutral functions that are possible.
Notes
The 6 Boolean Functions are-

● f(A,B)=A
● f ( A , B ) = A’
● f(A,B)=B
● f ( A , B ) = B’
● f(A,B)=A⊙B
● f(A,B)=A⊕B
Code Converter
Binary to Gray Code
Code Converter
Binary to Gray Code
Code Converter
Binary to Gray Code
Code Converter
Binary to Gray Code
Combinational Circuits
● A combinational circuit is an electronic circuit in which the
output depends on the present combination of inputs.

● Combinational circuits are used in digital electronics, such as

computers, to perform operations on data.

● Examples: Adders, Encoders, Multiplexers

Half Adder
● Half Adder is a combinational logic circuit.
● It is used for the purpose of adding two single bit numbers.
● It contains 2 inputs and 2 outputs (sum and carry).
Half Adder
Half Adder
● Half adders have no scope of adding the carry bit resulting from
the addition of previous bits.
● This is a major drawback of half adders.
Full Adder
● Full Adder is a combinational logic circuit.
● It is used for the purpose of adding two single bit numbers with a
carry.
● Thus, full adder has the ability to perform the addition of three
bits.
● Full adder contains 3 inputs and 2 outputs (sum and carry)
Full Adder
Full Adder using Half Adder
Full Adder using Half Adder
Half Subtractor
● Half Subtractor is a combinational logic circuit.
● It is used for the purpose of subtracting two single bit numbers.
● It contains 2 inputs and 2 outputs (difference and borrow)
● Half subtractors do not take into account “Borrow-in” from the
previous circuit.
● This is a major drawback of half subtractors.
Half Subtractor
Full Subtractor
● Full Subtractor is a combinational logic circuit.
● It is used for the purpose of subtracting two single bit numbers.
● It also takes into consideration borrow of the lower significant
stage.
● Thus, full subtractor has the ability to perform the subtraction of
three bits.
● Full subtractor contains 3 inputs and 2 outputs (Difference and
Borrow)
Full Subtractor
Parallel Adder
● Ripple Carry Adder is a combinational logic circuit.
● It is used for the purpose of adding two n-bit binary numbers.
● It requires n full adders in its circuit for adding two n-bit binary numbers.
● It is also known as n-bit parallel adder.
Parallel Adder
● In Ripple Carry Adder, The carry out produced by each full adder
serves as carry-in for its adjacent most significant full adder.
● Each carry bit ripples or waves into the next stage.
● That’s why, it is called as “Ripple Carry Adder”.
● Ripple Carry Adder does not allow to use all the full adders
simultaneously.
Parallel Adder
● Each full adder has to necessarily wait until the carry bit becomes
available from its adjacent full adder.
● This increases the propagation time.
● Due to this reason, ripple carry adder becomes extremely slow.
● This is considered to be the biggest disadvantage of using ripple
carry adder.
Parallel Adder
A 16-bit ripple carry adder is realized using 16 identical full adders. The carry
propagation delay of each full adder is 12 ns and the sum propagation delay of each
full adder is 15 ns. The worst case delay of this 16 bit adder will be ______?

A) 195 ns

B) 220 ns

C) 250 ns

D) 300 ns
Parallel Adder
A half adder is implemented with XOR and AND gates. A full adder is implemented with two half
adders and one OR gate. The propagation delay of an XOR gate is twice that of an AND/OR gate. The
propagation delay of an AND/OR gate is 1.2 microseconds. A 4-bit ripple-carry binary adder is
implemented by using full adders. The total propagation time of this 4-bit binary adder in
microseconds is

a) 19.2 microseconds
b) 16.4 microseconds
c) 21.9 microseconds
d) 17.6 microseconds
THANK YOU