1 / 56

# Combinational Logic - PowerPoint PPT Presentation

Combinational Logic. Chapter 4. Combinational Circuits. Combinational Circuits. Adders Subtractors Comparators Decoders Encoders Multiplexers

I am the owner, or an agent authorized to act on behalf of the owner, of the copyrighted work described.

## PowerPoint Slideshow about ' Combinational Logic' - kaili

Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.

- - - - - - - - - - - - - - - - - - - - - - - - - - E N D - - - - - - - - - - - - - - - - - - - - - - - - - -
Presentation Transcript

### Combinational Logic

Chapter 4

• Subtractors

• Comparators

• Decoders

• Encoders

• Multiplexers

Available as MSI Circuits and as Standard Cells in VLSI (Bonus Assignment: Get one example of each type of combinational circuits in the CMOS family, 5 points for the second exam)

• Given a logical diagram, determine one or more of the following:

• Boolean functions;

• Truth table;

• Explanation of circuit operation

• Make sure the circuit is combinational, not sequential (No feedback loops)

• Label all gate outputs that are a function of input variables. Determine the Boolean function for each gate output

• Label the gates that are a function of input variables and previously labeled gates. Find the Boolean functions for these gates

• Repeat step 2 until output of circuits are obtained

• By repeated substitution of previously defined functions, obtain the output Boolean functions in terms of input variables

Step 1

Step 2

Steps 3 and 4

• Determine the number of input variables in the circuit. For inputs, form the possible input combinations and list the binary numbers from to in a table

• Label the outputs of selected gates with arbitrary symbols

• Obtain the truth table for the outputs of those gates which are a function of the input variables only

• Proceed to obtain the truth table for the outputs of those gates which are a function of previously defined values until the columns for all outputs are determined

• From the specifications of the circuit, determine the required number of inputs and outputs and assign a symbol to each

• Derive the truth table that defines the required relationship between inputs and outputs

• Obtain the simplified Boolean functions for each output as a function of the input variables

• Draw the logical diagram and verify correctness of the design

Implementation of full adder in sum-of-products

Implementation of full adder using two half adders and one or gate

Carry Generate

Binary subtractor

• Occurs only when adding two positive numbers or two negative numbers;

• Overflow produces change in result sign

Carry bits

• Consider adding two decimal digits in BCD

• Output sum cannot exceed 9+9+1=19 (the last 1 is the carry from previous digit)

Carry

Need correction

Condition for correcting result

Exercise:

Multiply

Explain how you carried the multiplication out. How many bits at the output?

Two-bit multiplier

Exercise: With your neighbor classmate discuss its operation.

Exercise: Discuss with your neighbor classmate and write down how you would compare two four-bit binary numbers and , where and . You should have three outputs corresponding to , , and . Explain how you determined each condition.

Does this circuit correspond to what you wrote down in the exercise? Discuss again with your neighbor classmate the comparison of your result with this circuit.

Exercise: Minimize the functions for two of the eight output lines.

Exercise: Compare your function with the circuit.

Three-to-eight-line decoder

decoder constructed with two decoders

Exercise: Explain how this decoder works.

Exercise: For the maps of the full adder shown above, express the sum (left) and the carry bit (right) as a sum of minterms.

Compare in terms of propagation time and number of gates this Full Adder with the previously studied implementation.

Highest priority

Valid output

Exercise: obtain the function for

• Selects binary information from one of many input lines

• Directs input line to output, controlled by a set of selection lines

• input lines and selection lines

Two-to-one-line multiplexer

Four-to-one-line multiplexer

• Multiplexer is essentially a decoder with OR gates

• Thus can implement Boolean functions, similar to decoders

• Minterms generated by circuit associated with selection inputs

• Individual minterms can be selected by data inputs

• Boolean function of variables and data inputs

• More efficient method for implementing a Boolean function of variables with multiplexer of selection inputs

• Remaining variable of function is used for the data inputs

• Example:

Selected input line

0

1

2

3

Implementation of a three-input Boolean function

0

1

2

3

4

5

6

7

Multiplexers with three-state gates

• 4.3

• 4.9

• 4.17

• 4.27

• 4.33

• Using LogicWorks, simulate a 4-bit full adder with and without carry-lookahead.