Documenti di Didattica
Documenti di Professioni
Documenti di Cultura
Dept. of ECE
KL University, Guntur
Dept. of ECE
5. Writing Boolean expressions for various output variables in terms of input variables.
6. Minimization of Boolean expressions.
7. Implementation of minimized Boolean expressions.
Design and applications of Binary adders:
Half Adder:
A half adder is a combinational logic circuit that performs the arithmetic addition of two bits.
Such a circuit thus has two inputs that represent the two bits to be added and two outputs,
with one producing the SUM output and the other producing the CARRY.
For Sum S:
For Carry C:
The Boolean expressions for the SUM and CARRY outputs are given by the equations
KL University, Guntur
Dept. of ECE
Full Adder:
A full adder circuit is an arithmetic circuit block that can be used to add three bits to produce
a SUM and a CARRY output. Two of the input variables
significant bits to be added and the third input
and
significant position.
X
0
0
0
0
1
1
1
1
Y
0
0
1
1
0
0
1
1
Z
0
1
0
1
0
1
0
1
S
0
1
1
0
1
0
0
1
C
0
0
0
1
0
1
1
1
For Carry C:
KL University, Guntur
Dept. of ECE
KL University, Guntur
Dept. of ECE
Subtractors:
In the method of subtraction, each subtrahend bit of the number is subtracted from its
corresponding minuend bit to form a difference bit. If the minuend bit is smaller than the
subtrahend bit, a 1 is borrowed from the next significant position.
Half-Subtractor:
A Half-Subtractor is a combinational circuit that can be used to subtract one binary digit
from another to produce a DIFFERENCE output and a BORROW output. The BORROW
output here specifies whether a 1 has been borrowed to perform the subtraction.
X
0
0
1
1
Y
0
1
0
1
D
0
1
1
0
B
0
1
0
0
Full-Subtractor:
A full subtractor performs subtraction operation on two bits, a minuend and a subtrahend,
and also takes into consideration whether a 1 has already been borrowed by the previous
adjacent lower minuend bit or not. This circuit has three inputs and two outputs. The three
KL University, Guntur
Dept. of ECE
inputs,
two outputs, D and B represent the difference and output borrow, respectively.
X
0
0
0
0
1
1
1
1
Y
0
0
1
1
0
0
1
1
Z
0
1
0
1
0
1
0
1
D
0
1
1
0
1
0
0
1
B
0
1
1
1
0
0
0
1
For Difference D:
For Borrow B:
KL University, Guntur
Dept. of ECE
FA
FA
FA
FA
Binary Adder/Subtractor:
A Binary Adder/Subtractor is used to perform both addition and subtraction using a single
circuit. Subtraction of two binary numbers can be accomplished by adding 2s complement of
the subtrahend to the minuend and disregarding the final carry, if any. Full adders can be used
to perform subtraction provided we have the necessary additional hardware to generate 2s
complement of the subtrahend and disregard the final carry or overflow. For addition, the
addend bits must be added with augend bits and for subtraction, 2s complement of B is
added with A. Hence Ex-OR gate is used as controlled inverter to achieve this operation.
KL University, Guntur
Dept. of ECE
0
0
1
1
(
0
1
0
1
0
0
1
0
1
0
0
1
KL University, Guntur
0
1
0
0
Dept. of ECE
The two numbers are equal if all pairs of significant digits are equal, i.e., if
and
and
and
, is displayed in
). This binary
otherwise.
(
If the two digits are equal, the next lower significant pair of digits is compared. This
comparison continues until a pair of unequal digits is reached. If the corresponding digit of
is 1 and that of
is 0, we conclude that
is 1, we have that
is 0 and that of
KL University, Guntur
Dept. of ECE
(
The symbols (
or
)
) and (
, respectively.
KL University, Guntur
Dept. of ECE
Decoders:
A decoder is a combinational circuit that converts binary information from
input lines to a
unique output lines. If the -bit decoded information has unused or dont
maximum of
minterms of
input variables.
(or fewer)
Decoder:
In
decoder or -to- line decoder, the three inputs are decoded into eight outputs, each
output representing one of the minterms of the 3 input variables. It is also known as binary to
octal converter. The input variables may represent a binary number, and the outputs will then
represent the eight digits in the octal number system.
KL University, Guntur
Dept. of ECE
0
0
0
0
1
1
1
1
0
0
1
1
0
0
1
1
0
1
0
1
0
1
0
1
1
0
0
0
0
0
0
0
0
1
0
0
0
0
0
0
0
0
1
0
0
0
0
0
0
0
0
1
0
0
0
0
0
0
0
0
1
0
0
0
0
0
0
0
0
1
0
0
0
0
0
0
0
0
1
0
0
0
0
0
0
0
0
1
minterms of
expressed in sum of minterms, one can use a decoder to generate the minterms and an
external OR gate to form the sum. In this way, any combinational circuit with
outputs can be implemented with an -to-
OR gates.
KL University, Guntur
inputs and
Dept. of ECE
1
0
0
0
0
Decoder using
0
0
1
1
0
1
0
1
1
0
1
1
1
1
1
0
1
1
1
1
1
0
1
1
1
1
1
0
decoders:
the top
decoder is enabled and the other is disabled. The bottom decoder outputs are all 0s, and the
KL University, Guntur
Dept. of ECE
enabled and generate minterms 1000 to 1111, while the outputs of the top decoder are all 0s.
Encoders:
An encoder is a digital circuit that performs the inverse operation of a decoder. An encoder
has
1
0
0
0
0
0
0
0
0
1
0
0
0
0
0
0
0
0
1
0
0
0
0
0
0
0
0
1
0
0
0
0
0
0
0
0
1
0
0
0
0
0
0
0
0
1
0
0
0
0
0
0
0
0
1
0
0
0
0
0
0
0
0
1
0
0
0
0
1
1
1
1
0
0
1
1
0
0
1
1
0
1
0
1
0
1
0
1
Priority Encoder:
A priority encoder is a practical form of an encoder. The encoders available in IC form are all
priority encoders. In this type of encoder, a priority is assigned to each input so that, when
more than one input is simultaneously active, the input with the highest priority is encoded.
KL University, Guntur
Dept. of ECE
K-map for :
0
1
0
0
1
0
0
0
1
0
0
1
1
0
1
0
1
K-map for :
KL University, Guntur