Combinational Circuits Analysis

Dr.-Ing. Nusrat Jahan Lisa

[Link]@[Link]
RELATIONSHIPS BETWEEN EXPRESSIONS, CIRCUITS AND TRUTH
TABLES
Boolean
Expression Evaluation
Analysis

Design Derivation

Logic Circuit Truth Table

2
COMBINATIONAL CIRCUITS
• A combinational circuit consists of a set of logic gates that determine the output
values directly from the current input values.
• A combinational circuit is said to perform an information processing operation that
can be specified by a set of Boolean equations.
• Combinational circuits are responsible for logical and arithmetic operations within a
digital system.
• In addition to logical and arithmetic operations (such as addition, subtraction,
complementation, etc.), there are other functions necessary to make connections
between the various operators. These functions include multiplexing and decoding.
The elements that perform these operations are called multiplexers and decoders,
3
respectively, and are also combinational circuits.
ARITHMETIC CIRCUITS
• An arithmetic combinational circuit implements arithmetic operations such as
addition, subtraction, multiplication, and division with binary numbers.

• The simplest arithmetic operation is the addition of two binary bits, which
consists of four possible elementary operations: 0+0 = 0, 0+1 = 1, 1+0 = 1,
and 1+1 = 10.

• The first three operations produce a single bit sum. However, when both
operands are equal to 1, two bits are needed to express their result. In this
case, the carry is added to the next most significant pair of bits.
4
ARITHMETIC CIRCUITS
• A combinational circuit that implements two-bit addition is called a Half
Adder (HA). A circuit that implements three-bit addition (two significant bits
and one carry) is called a Full Adder (FA).

• These names come from the fact that with two half adders a full adder can
be implemented. The full adder is the basic arithmetic circuit from which all
other arithmetic circuits are built.

5
 HALF ADDER
• A half adder takes two input bits and produces two outputs: the sum and the
carry-out bit.
A B Sum (S) Carry out (C)
0 0 0 0
0 1 1 0
1 0 1 0
1 1 0 1

When one of the inputs is zero, the

When both inputs are equal, the result is zero. When the inputs are result is zero.
different, the result is one. Which logic gate does this? Which logic gate does this?

6
HALF ADDER CIRCUIT
module adder (A, B, S, C);

input A, B;
output S, C;

assign S = A ^ B;
assign C = A & B;

endmodule

7
FULL ADDER
• The half adder, as the name suggests, is capable of adding only two bits.

• However, we need a circuit capable of adding three bits (A, B and Cin),
generating the result (S) and the carry out (Cout).

• This circuit is called a full adder.

8
 FULL ADDER Note that when at least two of the
three inputs are 1, Cout will be 1.
• Let's look at the following table:
A B Cin S Cout
0 0 0 0 0
0 0 1 1 0
0 1 0 1 0
0 1 1 0 1
1 0 0 1 0
1 0 1 0 1
1 1 0 0 1
1 1 1 1 1
9
FULL ADDER CIRCUIT

Half Adder

Full Adder
10
ADDER: VERILOG PROGRAMMING

11
ADDER: VERILOG PROGRAMMING
module full_adder_tb;
reg a, b, cin;
wire sum, carry;

fulladd uut(cin, a, b, sum, carry);

initial begin
a = 0; b = 0; cin = 0;
#10
a = 0; b = 0; cin = 1;
#10
a = 0; b = 1; cin = 0;
#10
a = 0; b = 1; cin = 1;
#10
end
12
endmodule
4-BIT PARALLEL ADDER

13
4-BIT PARALLEL ADDER: VERILOG PROGRAMMING

14
CARRY PROPAGATION

15
CARRY LOOKAHEAD ADDER

carry lookahead generator Four-bit adder with carry lookahead 16

FOUR-BIT ADDER–SUBTRACTOR

Final
carry

17
Sign bit
BCD ADDER

18
BINARY MULTIPLIER

19
4×4 MULTIPLIER

20
MAGNITUDE COMPARATOR

If ak = 0 and bk = 1, then A < B.

But if ak = 1 and bk= 0, then A > B.

21