Digital Logic Design

Chapter 4
1

Combinational Logic

Outline

Combinational Circuits

Analysis
Design

Binary Adder / Subtractor

Multiplier
Comparator
Encoder / Decoder
Multiplexers / Demultiplexers

Combinational Circuits

Recall

Many realistic problems use multiple outputs

Single/multiple inputs Single output

Named as combinational circuits

Combinational circuit

Output depends only on input(s)

Combinational Circuits

What happens if we add memory to the circuit?

Becomes a feedback system

Sequential Circuits
4

Combinational Circuit
Analysis

Determine the function of circuit

Circuit analysis

Instead of developing the circuit based on the function

Determine the output functions as algebraic expressions
Determine the truth table of the outputs

What is the output function of this circuit?

Combinational Circuit
Analysis
Analysis steps

1.
2.
3.

Label all gate outputs with symbols

Determine Boolean function at the output of each gate
Express functions in terms of input variables + simplify

Combinational Circuit
Analysis
Analysis steps

1.
2.
3.

Label all gate outputs with symbols

Determine Boolean function at the output of each gate
Express functions in terms of input variables + simplify

Combinational Circuit
Analysis

Substitution

T1 ( xy )
T2 ( xT1 )
T3 ( yT1 )
F (T2T3 ) (( xT1 )( yT1 ))
xT1 yT1 x( xy ) y ( xy )
x( x y) y ( x y)
xx xy xy yy
xy xy x y
8

Combinational Circuit Analysis:

Example

What are the outputs F1 and F2 of the following circuit?

Here

T2 = ABC

T1 = A+B+C

F2 = AB + AC + BC

T3 = F2 T1

F 1 = T 3 + T2

Combinational Circuit Analysis:

Example

Analysis by truth table

10

Combinational Circuit Design

Design procedure

1.
2.
3.
4.
5.

Determine the number of inputs and outputs

Assign symbols
Derive the truth table
Obtain simplified functions for each output
Draw the logic diagram

Truth tables: input and output columns

Multiple methods to solve

Boolean algebra, map methods, computer aided solution

Issues to consider

Number of gates
Gate inputs
Propagation delay
Number of interconnections
11

Combinational Circuit Design:

Example

Design a circuit that converts a BCD digit to Excess-3

code

12

Combinational Circuit Design:

Example

Design a circuit that converts a BCD digit to Excess-3

code

Step 1: Inputs and Outputs

Input: BCD digit

Output: Excess-3 digit

4 inputs: A, B, C, D
4 outputs: w, x, y, z

Step 2: Truth table

13

Combinational Circuit Design:

Example

Step 3: Minimize output functions

14

Combinational Circuit Design:

Example

Step 3: Minimize output functions

15

Combinational Circuit Design:

Example

Step 4: Simplification

z = D
y = CD+CD
= CD+(C+D)
x = BC+BD+BCD
= B(C+D)+BCD
= B(C+D)+B(C+D)
w = A+BC+BD
= A+B(C+D)

Step 5: Circuit Diagram

16

Combinational Circuit Design:

Example
Step 5: Circuit Diagram

17

Binary Adders

Addition is important function in computer system

What does an adder do?

Binary adders operate bit-wise

Add binary digits

Generate carry if necessary
Consider carry from previous computation

A 16-bit adder uses 16 one-bit adders

Binary adders come in two flavors

Half adder adds two bits and generates result and carry
Full adder considers carry input in addition to half adder
Two half adders make one full adder

18

Binary Half Adder

Specification

Design a circuit that adds two bits and generates the sum and a carry

Input / Output

19

Binary Half Adder

Specification

Input/Output

Design a circuit that adds two bits and generates the sum and a carry

Two inputs: x, y
Two output: S (sum), C (carry)

Functionality

20

Binary Half Adder

Specification

Input/Output

Design a circuit that adds two bits and generates the sum and a carry

Two inputs: x, y
Two output: S (sum), C (carry)

Functionality

21

Binary Half Adder

22

Binary Half Adder

23

Full Adder

Half adder works only for a single bit

Specifications

When multiple bits are involved, carry bits should be considered

Solution Full adder

A circuit that adds three bits and

generates sum and carry

Input/output

Three inputs: x, y, Cin

Two outputs: S (Sum), Cout (Carry)

Truth table
24

Full Adder

Half adder works only for a single bit

Specifications

When multiple bits are involved, carry bits should be considered

Solution Full adder

A circuit that adds three bits and

generates sum and carry

Input/output

Three inputs: x, y, Cin

Two outputs: S (Sum), Cout (Carry)

Truth table
25

Full Adder

Derive and minimize Boolean expressions

26

Full Adder

Derive and minimize Boolean expressions

S xyCin xyCin xyCin xyCin x y Cin

Cout xy xCin yCin ( x y )Cin xy

27

Full Adder

Circuit

28

Full Adder from Half Adders

How can two half adders make a full adder?

Observations

Three inputs x, y, z can be added in two steps

What about the carry?

x+y+z = (x+y) + z
Carry can occur when adding x+y and when adding z

Full adder: S = x y z , C = xy + (x y)z

29

Full Adder from Half Adders

30

Binary n-bit Adder

How can we build an n-bit adder from full adders?

One adder for each bit (n total)

Connect carry to next adders input
Output: sequence of sums and a final carry

4-bit adder circuit (Ripple Carry Adder)

31

Ripple Carry Adder

How long does it take to complete an addition?

Speed of addition is critical

Carry needs to propagate through circuit a problem

Fundamental arithmetic operation

How can we speed up addition?

Determine carries ahead of time (carry look-ahead)

32

Carry-Lookahead Adder

Recall

For the design of the parallel adder to work, the signal must propagate
through the gates before the correct output sum is available
Total propagation time = propagation delay of a
typical gate x the number of gates

Lets look at S3

Inputs A3 and B3 are available immediately.

However, C3 is available only after C2 is available.
C2 has to wait for C1, etc.

33

Carry-Lookahead Adder

Full adder: Si = AiBiCi , Ci+1 = Ai.Bi + (AiBi).Ci

Create new signals

Gi = Ai.Bi carry generate for stage i

Pi = Ai Bi carry propagate for stage i

Full adder equations expressed in terms of Gi and Pi

S i = P i Ci

Ci+1 = Gi + Pi Ci

34

Carry-Lookahead Adder

Full adder functionality can be expressed

recursively

Si = P i Ci

Ci+1 = Gi + Pi Ci

Carry of each stage

C0 = input carry

C 1 = G 0 + P0C 0

C2 = G1 + P1C1 = G1 + P1 (G0 + P0C0) = G1 + P1G0 + P1P0C0

C 3 = G 2 + P 2 C 2 = = G 2 + P 2G 1 + P 2 P 1 G 0 + P 2P 1P 0C 0

C4 = G3 + P3G2 + P3P2G1 + P3P2P1G0 + P3P2P1P0C0

35

Carry-Lookahead Adder

Circuit

SOP form
Only 2 stages

36

4-bit Adder with Carry

Lookahead

Complete adder

Same number of stages

for each bit

Drawback?

Increasing complexity of
lookahead logic for more
bits

37

Subtraction

How can we perform subtraction?

Subtract one number from another

Do we need subtractors?

Actually not
Subtraction can be done using adders

N M = N + (2s complement of M)

How do we determine 2s complement?

1s complement and adds 1

38

Subtraction

How to take 1s complement then?

Invertors (NOT) gate

How can we add 1?

Input carry

Same circuit for Adder and subtractor

Can we do something ?
Yes

39

Subtraction

Same circuit for Adder and subtractor

Can we do something ?
Yes

XOR gate
x 0 = x (use for Addition)
x 1 = x (use for Subtraction)

40

Binary Subtractor

Adder/Subtractor circuit

41

Overflow

n-bit addition can generate (n+1)-bit number

How can we detect overflow in addition?

End carry

Also necessary for signed numbers or subtraction

Called overflow
Needs to be detected by computer system

Most significant bit indicates sign

If carry into sign position and out of sign position differ, then overflow

Result would be correct with extra position

Can be detected by XOR gate
Can be used as input carry for next adder circuit`

42

Overflow Conditions

Overflow conditions

There is no overflow if signs are different (pos + neg, or neg + pos)

Overflow can happen only when both numbers have same sign, and
If carry into sign position and out of sign position differ

Example: 2s complement signed numbers with n = 4 bits

Result would be correct with extra position

Detected by XOR gate ( output =1 when inputs differ)
Can be used as input carry for next adder circuit

43

44

BCD Adder

Add two decimal numbers

How to begin?

(09)+(09)+(1) = 019 dont forget carry

Truth table
Can we use existing circuit?

Binary adder

Almost works for

decimal addition

45

BCD Adder (Truth Table)

46

BCD Adder (Truth Table)

47

BCD Adder

If C=1, need to add 6 to the binary sum

How to implement?

Need another adder

48

BCD Adder

49

BCD Adder

50

Multiplier

Product is 1 when both inputs are 1

AND gate

2-bit multiplier

51

Multiplier

Circuit diagram

52

Multiplier

4-bit x 3-bit multiplier

How many AND gates

J x K gates

How many adders

J=3, K=4

(J-1) K-bit adders

How many output bits

J + K bits
53

Magnitude Comparator

Need to compare two numbers: A and B

A>B, A<B, A=B

How can we determine that two numbers are equal?

Equal if every digit is equal

Which gate?

A3A2A1A0 = B3B2B1B0 if and only if

A3 = B3 and A2 = B2 and A1 = B1 and A0=B0

XNOR (Equivalence)

What about A < B and A > B?

54

Magnitude Comparator

Case 1: A > B

Look at most significant bit where A and B differ

If A = 1 and B = 0, then A > B

If not, then A B

Functionality (4-bits)

If difference in first digit: A3B3

If difference in second digit: x3A2B2

Conditional that A3 = B3 (x3 =1 if : A3=B3 )

Similar for all other digits

For A > B

(A > B) = A3B3+ x3A2B2 + x3x2A1B1 + x3x2x1A0B0

55

Magnitude Comparator

Case 2: A < B

swap A and B for A > B

Functionality

(A = B) = x3x2x1x0

(A > B) = A3B3+ x3A2B2 +

x 3x 2A 1 B 1 + x 3x 2x 1A 0B 0

(A < B) = A3B3+ x3A2B2 +

x3x2A1B1 + x3x2x1A0B0

Can be extended to arbitrary

number of bits
56

Other Arithmetic Blocks

Encoders (Enc)

Decoders (Dec)

Multiplexers (Mux)

De-multiplexers (DeMux)

Tri-state logic

57

Motivation ALU Design

ALU Arithmetic and Logic Unit

Add, Subtract, AND, OR

58

Motivation CPU Design

Instruction Management

59

Decoder

Selects one output based on a binary input

Converts n-bit code into 2n outputs, only one being active
for any combination of inputs
Selects output x if input is binary representation of x

Applications

Binary-to-octal decoder
Memory address selection
Selection of any kind

60

Decoder

Example: 3-to-8-line decoder

61

Decoder: Circuit

When is output 0 chosen?

When is output 1 chosen?

If x y z

If x y z

Circuit for line decoder

Sequence of minterms
Combine variables to
minterms

62

Advanced Decoder

Sometimes, you need to activate circuits

Decoder with enable

Reason: Take output only when required

Solution: Use enable pins
Generates output only when active-low enable is high

Example:

2-to-4-line decoder with enable

NAND implementation

63

Advanced Decoder

Enable bit allows construction of large decoders using

smaller ones
Example: Construct a 4-to-16 decoder only using 3-to-8
decoders

Active-high enable

Can we use this circuit

to construct a 5-to-32
decoder?

NO
Absence of enable
64

Decoders: Example

Design a full adder using a 3-to-8-line decoder

Truth table

65

Encoders

Translates 2n input lines into n output lines

Input: 2n lines
Output: n bits
Output is binary coding of input that is 1

Truth table (n=3) (positive polarity)

Note: only one input is allowed to be active

66

Encoders

x = D4 + D5 + D6 + D 7
y = D2 + D3 + D6 + D 7
z = D1 + D3 + D 5 + D 7

How many OR gates are required?

Can you see any problem here?

67

Encoders: Problems

Only one input can be active at a time

When all inputs are zero

Equal to the case when D0 is 1

Example

Simultaneous active inputs result in undefined output

If D3 and D6 are active simultaneously, what is the

output?
111

How can we solve this problem?

x = D4
+ D5 +
D6 + D7
y = D2
+ D3 +
D6 + D7
z = D1
+ D3 +
D5 + D7

What should the output be if multiple lines are active?

Different solutions:

Any one (random)

Give priority to lower or higher lines
Indicate invalid input (requires extra bit, valid bit V)

68

Priority Encoder

Simple encoder, with additional functionality

If multiple inputs are 1, give priority to one of them

Example: 4-to-1 priority encoder with priority given to one bit

Which bit has the highest priority?

D3
69

Priority Encoder

Valid bit V = D0 + D1 + D2 + D3
70

Priority Encoder

Circuit diagram

x = D 2 + D3
y = D 3 + D 1D2
V = D0 + D1 + D2 + D 3
71

Multiplexer (MUX)

Selects from 1 of many inputs and directs it to the output

Input

Output

2n lines

1 line

Selection may be controlled by select lines

72

Multiplexer (MUX)

Example

2-to-1 MUX

How to design?

4-to-1 MUX
Selection code directs input

73

4-to-1 MUX
What are the values of Y?

74

Multiplexer (MUX)

A MUX only selects one bit

(output)

How to select multiple bits

(outputs)?
Example: What if you want to
choose one of two 4-bit
numbers?

Solution: Use multiple MUX

Quadruple 2-to-1 line MUX

Enable bit sets output to 0 if 1

75

Use MUXes for Boolean

Functions

MUXes can also be used to implement the Boolean

function
Use MUX to implement the following function
F = xyz + xyz + xyz + xyz

Concept

MUX is a decoder + OR gate

Use the selector to direct correct value to output

76

Use MUXes for Boolean

Functions

Example

F(x,y,z) = (1,2,6,7)

Truth table

77

Use MUXes for Boolean

Functions

78

Use MUXes for Boolean

Functions

Example

F(x,y,z) = (1,3,4,11,12,13,14,15)

79

Use MUXes for Boolean

Functions

80

Use MUXes for Boolean

Functions

Example:

Design a full adder using MUXes

Expressions

S(x,y,z) = (1,2,4,7); C(x,y,z) = (3,5,6,7)

81

Use MUXes for Boolean

Functions

82

Demultiplexer (DeMUX)

Receives information from 1 input and directs it to one of

2n possible outputs

Input

Output

Data bit
n selection lines

2n lines

Can be achieved by decoder circuit with enable D active

low

Enable D acts as data bit ( disable)

n code lines act as selection
83

Three-State (Tri-state) Gates

What is the truth table for F ?

The two gates will try to drive F at the same time

Not a good idea to wire their outputs

Sometimes it is necessary to disconnect a gate

Three state:

0 or 1 Boolean value
High impedance, Z state

High impedance acts as if gate were disconnected

84

Multiplexer with Tri-state

Gates

2-to-1 MUX

4-to-1 MUX with Enable

85

Problems

86

Problems

87

Problems

88

Problems

89

Problems

90

Problems

91