UNIT-2 - COMBINATIONAL
CIRCUITS
1
SYLLABUS
• Combinational logic circuits: Half adder – Full Adder – Half subtractor -
Full subtractor – Parallel binary adder - 2’s complement subtraction
using parallel adders - Multiplexer/Demultiplexer – decoder - encoder -
code converters - Magnitude Comparator
2
WHAT IS COMBINATIONAL CIRCUIT ?
• Combinational circuits are very well known components in digital
electronics which can provide output instantly based on the current input.
• Unlike sequential circuits, a combinational circuit listens for input signal and
and generates output no matter what is the past input or state as it has no
feedback or memory component. It only cares about present input and
state.
• They are specially designed using multiple interconnected logic gates such
that the output will be generated by computing the logical combinations of
the present input only. No clock pulse is present here. Moreover, no
previously stored value or state is taken into consideration here. The output
is independent of previous states.
3
FEAT UR ES OF C OM BINA TIONAL C IRCU IT
• In this output depends only upon present input.
• It's Speed is fast.
• Easy designed.
• There is no feedback between input and output.
• It is time independent.
• Combinational circuits don’t have the capability to store any state.
4
EXAM PLES OF COM BINA TIONAL
CIR CU ITS
• Adders and Subtractors: Combinational circuits are used to perform mathematical
operations of binary numbers. Adders and Subtractor uses combinational circuit
logic where in takes two or more binary numbers as input and performs
addition/subtraction to generate output.
• Multiplexers and Demultiplexers: Multiplexer is a special kind of combinational
circuit where several number of inputs are present. From that one input can be
selected and that will be transmitted as an output based on selection signal. In the
other hand, Demultiplexers also select one input signal but transmits it to one of the
several outputs.
• Encoders and Decoders: Encoders also uses combinational circuits to convert a
multiple set of input signal to smaller set of output signal but the resultant value is
unchanged. Inversely, Decoders converts a small set of input signal to a large set of
output signal without changing the resultant value. Basically input of Encoder =
output of Decoder and vice versa.
5
A PPL ICAT IONS OF C OMBINATIONAL
CIR CU IT
• Arithmetic and Logic Units (ALUs): As combinational circuits are capable of
performing various mathematical tasks like arithmetic and logical operations so,
these circuits are used in calculators and processors as a fundamental component
of Arithmetic and Logic Units (ALUs).
• Data Encryption and Decryption: In information protection fields, combinational
circuit are used for Data Encryption and decryption of data for secure communication.
Encryption/decryption algorithms are also a complex mathematical formula which
can be performed by combinational circuits.
• Data Multiplexing and Demultiplexing: It is just a practical implementation of
multiplexer and demultiplexer. By using it we can optimize network bandwidth by
effectively reducing network traffic as combinational circuit allows to transmit
multiple data signals over a single communication channel.
6
ADVANTAGES OF COMBINATIONAL
CIRCUIT
• Simplicity: Combinational circuits are very easy to implement and absence
of memory or feedback element has made it more straightforward which is
reducing complexity in digital systems and providing faster prototype
building mechanism.
• Real-time Operation: Combinational circuits don't face any delay which is
very much essential for quick-response applications like data transmission
and signal processing.
• Deterministic Behavior: Combinational circuits generate output based on
present input only which ensures predictable and repeatable results which
is essential for applications in which consistency and reliability is required.
•
7
DISADV AN TA GES OF COMBINAT IONA L
CIR CU IT
• Limited Functionality: As it provides output only based on present
input and there is no way to store previous data so we can't use this
circuit to any memory-based applications or where previous data is
recalled for doing operations.
• Lack of Flexibility: Once the design of logic gates is done then for
changing a small design required the entire redesigning of the circuits
which is monotonous and time-consuming.
• Increased Complexity for Large Designs: For large designs the
number of logic gates will increase gradually which means the
management of input and output ports will become very complex. This
may lead to higher production costs and increased design errors.
8
HALF ADDER IN DIGITAL LOGIC
• A half adder is a combinational logic circuit that performs binary addition of
two single-bit inputs, A and B, producing two outputs: SUM and CARRY.
The SUM output which is the least significant bit (LSB) is obtained using an
XOR gate while the CARRY output which is the most significant bit (MSB)
is generated using an AND gate.
• The half adder is a fundamental building block for more complex adder
circuits, such as full adders and multi-bit adders. It allows the addition of
two binary digits but does not account for carry-in from a previous stage.
The circuit requires one XOR gate and one AND gate for implementation.
9
Truth Table of Half Adder Logical Expression of Half Adder
Sum,S=A⊕B=AB′+A′B
10
APPLICATIONS OF HALF ADDER
• Half adder is used in ALU (Arithmetic Logic Unit) of computer
processors to add binary bits.
• Half adder is used to realize full adder circuit.
• Half adder is used in calculators.
• Half adder is used to calculate addresses and tables.
11
WHAT IS A FULL ADDER?
• A combinational circuit which is designed to add three binary
digits and produces two outputs (sum and carry) is known as a
full adder. Thus, a full adder circuit adds three binary digits,
where two are the inputs and one is the carry forwarded from
the previous addition.
12
13
14
15
APPLICATIONS OF FULL ADDER
• Full adders are used in ALUs (arithmetic logic units) of CPUs of
computers.
• Full adders are used in calculators.
• Full adders also help in carrying out multiplication of binary
numbers.
• Full adders are also used to realize critic digital circuits like
multiplexers.
• Full adders are used to generate memory addresses.
• Full adders are also used in generation of program counterpoints.
• Full adders are also used in GPU (Graphical Processing Unit).
16
17
WHAT IS A HALF-SUBTRACTOR?
• A half-subtractor is a combinational logic circuit that have
two inputs and two outputs (i.e. difference and borrow). The
half subtractor produces the difference between the two binary
bits at the input and also produces a borrow output (if any). In
the subtraction (A-B), A is called as Minuend bit and B is
called as Subtrahend bit.
18
19
20
21
APPLICATIONS OF HALF SUBTRACTOR
• Half subtractor is used in ALU (Arithmetic Logic Unit) of
processors.
• Half subtractor can also be used in amplifiers to compensate
the sound distortion.
• It is also used to decrease the force of radio signals or audio
signals.
• Half subtractor is also used to increase or decrease operators.
22
WHAT IS A FULL-SUBTRACTOR?
• A full-subtractor is a combinational circuit that has three inputs A, B, bin and
two outputs d and b. Where, A is the minuend, B is subtrahend, bin is borrow
produced by the previous stage, d is the difference output and b is the borrow
output.
23
24
25
26
27
APPLICATIONS OF FULL SUBTRACTOR
• Full subtractors are used in ALU (Arithmetic Logic Unit) in computers CPUs.
• Full subtractors are extensively used to perform arithmetical operations like
subtraction in electronic calculators and many other digital devices.
• Full subtractors are used in different microcontrollers for arithmetic
subtraction.
• They are used in timers and program counters (PC).
• Full subtractors are also used in processors to compute addresses, tables,
etc.
• Full subtractors are also used in DSP (Digital Signal Processing) and
networking based systems.
28
29
In the above parallel adder circuit, the bit A represents the augend
bits and B is representing the addend bits. The first input carry bit to
the parallel adder is Cin and the output carry bit of the parallel adder is
C4. The output sum bits are designated by S. We can also construct a
parallel adder in the form of an IC. For example, when the 4-bit
parallel adder is formed in the IC form, then it will have four terminals
for augend bits, 4 terminals for addend bits, 4 terminals for sum bits,
and 2 terminals for input and output carry bits.
30
31
32
33
CARRY LOOK-AHEAD ADDER
The adder produce carry propagation delay while performing other arithmetic operations like multiplication and
divisions as it uses several additions or subtraction steps. This is a major problem for the adder and hence
improving the speed of addition will improve the speed of all other arithmetic operations. Hence reducing the carry
propagation delay of adders is of great importance. There are different logic design approaches that have been
employed to overcome the carry propagation problem. One widely used approach is to employ a carry look-ahead
which solves this problem by calculating the carry signals in advance, based on the input signals. This type of adder
circuit is called a carry look-ahead adder.
Here a carry signal will be generated in two cases:
1. Input bits A and B are 1
2. When one of the two bits is 1 and the carry-in is 1.
34
(From full adder using 2 half adders)
35
36
37
WHAT IS ENCODER?
• An Encoder is a combinational circuit that performs the reverse
operation of a Decoder. It has a maximum of 2^n input lines and ‘n’
output lines, hence it encodes the information from 2^n inputs into an
n-bit code. It will produce a binary code equivalent to the input, which
is active High. Therefore, the encoder encodes 2^n input lines with ‘n’
bits.
38
TYPES OF ENCODERS
There are different types of Encoders which are mentioned below.
• 4 to 2 Encoder
• Octal to Binary Encoder (8 to 3 Encoder)
• Decimal to BCD Encoder
• Priority Encoder
39
40
41
42
43
44
45
46
47
For A For B
A B
48
49
WHAT IS A DECODER?
• A decoder is an electronic device, specifically a combinational logic circuit, that
converts coded input into a desired output format, often transforming a
smaller, encoded binary input into a larger, unique binary output with 2^n
lines from n input lines.
50
51
52
53
54
55
56
57
58
59
60
61
MULTIPLEXER/DEMULTIPLEXER
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
MAGNITUDE COMPARATOR
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
CODE CONVERTERS
120
121
Binary to BCD Converter
122
123
124
Binary to Excess-3 Converter
+3
125
126
127
BCD to Gray Code
128
129
Gray Code to Excess-3 code
130
131
132