4combinational Circuits

Combinational Circuits
ØThe combinational circuit may be defined as a logic circuit, the output

of which depends only upon the combination of the input
ØThe output of this type of logic is dependent solely on its current
inputs
Ø When certain input values are set, a combinatorial circuit generates
output values corresponding to those input values. When the input of
the combinatorial logic are changed, the outputs are changing to
reflect the changes in the new input values.
Design Procedure of a combinational circuit
Ø we will be given a problem
ØThen, we determine the number of inputs and outputs, assign letter
symbol to input and output variables
Ø After that we write a truth table relating the inputs and outputs
Ø Then, we write K-map for each output and obtain the simplified
Boolean Expression for each output
Ø Lastly, we draw the logic diagram (combinational circuit)
Types of combinational circuits
1 Adder 2 Subtractor 3 Encoder
4 Decoder 5 Multiplexer(MUX)
6 Demultiplexer (DEMUX)
Adder
1 Half Adder
2 Full Adder
Half Adder
ØLogic gate that perform arithmetic addition for 1-bit
ØTwo inputs A, B to half-adder. Resultants are Sum(S) and Carry(Cout)
Ø A wider than 1 bit adder can’t use this circuit, because there is no
way to input carry information from the previous bits
Full Adder
ØA full adder is a circuit that computes the sum of three bits and gives
a two-bit answer.
Ø The full adder for a given column adds two bits from the input
numbers together with a one-bit carry from the previous column to
the right. The adder produces a two-bit answer; one of these bits is
used as a carry into the next column.
ØA full adder has 3 inputs and 2 outputs

ØThe truth table of the full-adder can be drawn
with inputs A,B and Cin with outputs S and Cout.
ØFrom the truth table we can write the Boolean equation for the Sum
and Cout
Simplify using Boolean Algebra and K-map, we get

ØFrom the truth table we can write the Boolean equation for the Sum
and Cout
Simplify using Boolean Algebra and K-map, we get

Half Subtractor
ØLogic gate that perform arithmetic subtraction for 1-bit
Ø Two inputs A, B to half-subtractor. Resultants are Difference(D) and
Borrow(Bout)
Full Subtractor
ØA full subtractor is a circuit that computes the difference of three bits
and gives a two-bit answer.
ØA full subtractor has 3 inputs and 2 outputs
Ø The truth table of the full- subtractor can be drawn with inputs A,B
and C with outputs D and Bout.
From the truth table we can write the Boolean

equation for the D and Bout
Ø Simplify using Boolean Algebra and K-map, we get
Binary Adder/ Parallel Binary Adder
0 1 1 1 1
0 1 0
1 1 1 0
A is Augend 1011
B is Addend 0011
C1 = 0
Binary Adder-Subtractor
When k =0 à B = B ⊕ 0 = ? à B à B0’ +B’0

When k =1 à B = B ⊕ 1 = ? à B’ and Cin = 1
output will be A + (B’ +1) à A + 2’s complement of B which is equal to A-B
Encoder
ØAn Encoder is a combinational circuit which has maximum of 2n input
lines and ‘n’ output lines, hence it encodes the information from 2n inputs into an
n-bit code.
ØIt will produce a binary code equivalent to the input.
ØTherefore, the encoder encodes 2n input lines with ‘n’ bits.
ØEncoder performs the reverse operation of Decoder.
ØLimitations : Only one input can be high at a time. If two inputs are enabled at
the same time then output is not correct.
4 to 2 Encoder
Ø Let 4 to 2 Encoder has four inputs Y3, Y2, Y1 & Y0 and two outputs A1 & A0.
Ø The block diagram of 4 to 2 Encoder is shown in the following figure.
Ø At any time, only one of these 4 inputs can be ‘1’ in order to get the respective
binary code at the output.
The Truth table of 4 to 2 encoder is shown below.

From Truth table, we can write the Boolean functions for each output as
ØWe can implement the above two Boolean functions by using two
input OR gates.
ØThe circuit diagram of 4 to 2 encoder is shown in the following
figure
8 to 3 Encoder (Octal to Binary)
ØOctal to binary Encoder has eight inputs, Y7 to Y0 and three outputs
A2, A1 & A0.
ØOctal to binary encoder is nothing but 8 to 3 encoder.
ØThe block diagram of octal to binary Encoder is shown in the
following figure.
ØAt any time, only one of these eight inputs can be ‘1’ in order to get
the respective binary code.
ØThe Truth table of octal to binary encoder is shown below.
ØFrom Truth table, we can write the Boolean functions for each
output as
• We can implement the above Boolean functions by using four input
OR gates.
• The circuit diagram of octal to binary encoder is shown in the
following figure.
Decoder
ØThe name “Decoder” means to translate or decode coded information from
one format into another, so a digital decoder transforms a set of digital input
signals into an equivalent decimal code at its output.
ØA decoder is a combinational circuit that converts binary information from n
input lines to a maximum of 2n unique output lines.
ØOne of these outputs will be active High based on the combination of inputs
present, when the decoder is enabled.
2 to 4 Decoder
Ø Let 2 to 4 Decoder has two inputs A & B and four outputs D0, D1, D2 & D3 .
Ø The block diagram of 4 to 2 Encoder is shown in the following figure.
The Truth table of 2 to 4 Decoder is shown below.
Ø From Truth table, we can write the Boolean functions for each output as
D0 = 𝐴̅𝐵# D2 = A𝐵#
̅
D1 = 𝐴B D3 = AB
Ø We can implement the above two Boolean functions by using two input AND gates.
The circuit diagram of 2to 4 Decoder is shown in the following figure

3 to 8 Decoder (Binary to octal Decoder)
ØThe 3 to 8 line decoder is also known as Binary to Octal Decoder
ØIn 3 to 8 Decoder has three inputs, X, Y & Z and eight outputs F7 to
F0.
ØThe block diagram of Binary to Octal Decoder is shown in the
following figure.
The Truth table of Binary to Octal Decoder is shown below
Multiplexer (MUX)
ØA multiplexer (MUX) is a device that allows digital information from
several sources to be routed onto a single line for transmission over
that line to a common destination.
ØThe basic multiplexer has several data-input lines and a single
output line.
ØIt also has data-select inputs, which permit digital data on any one
of the inputs to be switched to the output line.
ØMultiplexers are also known as data selectors.
ØMultiplexer is a combinational circuit that has maximum of 2n data
inputs, ‘n’ selection lines and single output line.
ØOne of these data inputs will be connected to the output based on
the values of selection lines.
ØMultiplexer is also called as Mux.
Block Diagram of Multiplexer How Select Line works
4x1 Multiplexer
Ø4x1 Multiplexer has four data inputs I3, I2, I1 & I0, two selection lines
s1 & s0and one output Y.
ØThe block diagram of 4x1 Multiplexer is shown in the following
figure.
TV remote
Ø One of these 4 inputs will be connected to the output based

on the combination of inputs present at these two selection
lines.
Ø Truth table of 4x1 Multiplexer is shown below.
The circuit diagram of 4x1 multiplexer is shown in the following figure.
Demultiplexer
ØA demultiplexer (DEMUX) basically reverses the multiplexing function.
ØIt takes digital information from one line and distributes it to a given number of
output lines.
ØFor this reason, the demultiplexer is also known as a data distributor
ØIt has single input, ‘n’ selection lines and maximum of 2n outputs.
ØThe input will be connected to one of these outputs based on the values of
selection lines.
Block Diagram of Demultiplexer

1x4 De-Multiplexer
Ø1x4 De-Multiplexer has one input I, two selection lines, s1 & s0 and
four outputs Y3, Y2, Y1 &Y0.
ØThe block diagram of 1x4 De-Multiplexer is shown in the following
figure.
Telephone switching system
Ø The single input ‘I’ will be connected to one of the four outputs,
Y3 to Y0 based on the values of selection lines s1 & s0.
Ø The Truth table of 1x4 De-Multiplexer is shown below.
The circuit diagram of 1x4 multiplexer is shown in the following figure.
Assignment
ØImplement 8x1 Multiplexer and 16x1 multiplexer by following the
same procedure.
ØImplement 1x8 De-Multiplexer and 1x16 De-Multiplexer by following

the same procedure.

4combinational Circuits

Uploaded by

Copyright:

Available Formats

4combinational Circuits

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

4combinational Circuits

Uploaded by

Copyright:

Available Formats

Combinational Circuits

ØThe combinational circuit may be defined as a logic circuit, the output

ØA full adder has 3 inputs and 2 outputs

Simplify using Boolean Algebra and K-map, we get

Simplify using Boolean Algebra and K-map, we get

From the truth table we can write the Boolean

When k =0 à B = B ⊕ 0 = ? à B à B0’ +B’0

The Truth table of 4 to 2 encoder is shown below.

The Truth table of 2 to 4 Decoder is shown below.

The circuit diagram of 2to 4 Decoder is shown in the following figure

Ø One of these 4 inputs will be connected to the output based

Block Diagram of Demultiplexer

Telephone switching system

ØImplement 1x8 De-Multiplexer and 1x16 De-Multiplexer by following

You might also like