- By
**kaili** - Follow User

- 380 Views
- Uploaded on

Download Presentation
## PowerPoint Slideshow about ' Combinational Logic' - kaili

**An Image/Link below is provided (as is) to download presentation**

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

Combinational Circuits

- Adders
- 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)

Analysis Procedure

- 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)

Analysis Procedure

- 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

Analysis Procedure

- 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

Design Procedure

- 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

Binary Adder-Subtractor

Half adder

Full adder

Implementation of full adder in sum-of-products

Full adder

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

Carry propagation

Carry lookahead generator

Four-bit adder with carry lookahead

Carry lookahead generator

Four-bit adder with carry lookahead

Binary subtractor

Overflow

- Occurs only when adding two positive numbers or two negative numbers;
- Overflow produces change in result sign

Example: eight-bit adder

Carry bits

Decimal Adder

- Consider adding two decimal digits in BCD
- Output sum cannot exceed 9+9+1=19 (the last 1 is the carry from previous digit)

Binary Multiplier

Exercise:

Multiply

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

Binary Multiplier

Two-bit multiplier

Binary Multiplier

Exercise: With your neighbor classmate discuss its operation.

Magnitude Comparator

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.

Magnitude Comparator

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.

Decoders

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

Decoders

0

Combinational logic implementation

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

Combinational Logic Implementation

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

Priority encoder

Exercise: obtain the function for

Multiplexers

- 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

Multiplexers

Two-to-one-line multiplexer

Multiplexers

Four-to-one-line multiplexer

Multiplexers

Quadruple two-to-one-line multiplexer

Boolean function implementation

- 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

Boolean function implementation

- 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

Boolean function implementation

- Example:

Selected input line

0

1

2

3

Implementation of a three-input Boolean function

Three-state gates

Multiplexers with three-state gates

Homework Assignment

- 4.3
- 4.9
- 4.17
- 4.27
- 4.33
- Using LogicWorks, simulate a 4-bit full adder with and without carry-lookahead.

Download Presentation

Connecting to Server..