circuits combinational and design of …€¦ ·  · 2007-01-15ch09l1-"digital principles and...

30
Chapter 9 PROBLEM FORMULATION AND DESIGN OF COMBINATIONAL CIRCUITS

Upload: hatu

Post on 19-Apr-2018

221 views

Category:

Documents


5 download

TRANSCRIPT

Chapter 9

PROBLEM FORMULATION AND DESIGN OF

COMBINATIONAL CIRCUITS

Ch09L1-"Digital Principles and Design", Raj Kamal, Pearson Education, 2006 2

Lesson 1

Combinational Circuit

Ch09L1-"Digital Principles and Design", Raj Kamal, Pearson Education, 2006 3

Outline

• Definition• Representation• Seven Building Blocks• Problem Formulation• Specifications of each output

Ch09L1-"Digital Principles and Design", Raj Kamal, Pearson Education, 2006 4

Definition

• A combinational circuit is a circuit made up by combining logic gates such that the required logic at the output(s) depends only on the input logic present condition, both completely specified by either a truth table or by a Boolean expression

Ch09L1-"Digital Principles and Design", Raj Kamal, Pearson Education, 2006 5

Characteristics

• (i) An output(s) remains constant, as long input conditions do not require change in output(s),

• (ii) An output depends solely on the current input condition and not on any past input condition or past output condition,

Ch09L1-"Digital Principles and Design", Raj Kamal, Pearson Education, 2006 6

Characteristics

• (iii) A combinational circuit has no feedback of the output from a stage to the input of either that stage or any previous stage, and

• (iv) An output(s) at each stage appears after a delay in few tens or hundred ns depending upon the type or family of the gate used to implement the circuit

Ch09L1-"Digital Principles and Design", Raj Kamal, Pearson Education, 2006 7

Outline

• Definition• Representation• Seven Building Blocks• Problem Formulation• Specifications of each output

Ch09L1-"Digital Principles and Design", Raj Kamal, Pearson Education, 2006 8

Combinational circuit representation

•A block diagram for n inputs and m outputs,

• A truth table of 2n rows,

Ch09L1-"Digital Principles and Design", Raj Kamal, Pearson Education, 2006 9

Combinational circuit representation n Combinational circuit representation n inputs, m outputsinputs, m outputs

Ch09L1-"Digital Principles and Design", Raj Kamal, Pearson Education, 2006 10

Example- Truth Table Four Rows for 2 inputs and 1 output

0 0 1

Inputs Output A1 A2 F

0 1 01 0 01 1 0

Ch09L1-"Digital Principles and Design", Raj Kamal, Pearson Education, 2006 11

Combinational circuit representation

•SOP terms (2n miniterms) for each output

•POS terms (2n maxterms) for each output

•Karnaugh map of n variables and 2n

cells

Ch09L1-"Digital Principles and Design", Raj Kamal, Pearson Education, 2006 12

Outline

• Definition• Representation• Seven Building Blocks• Problem Formulation• Specifications of each output

Ch09L1-"Digital Principles and Design", Raj Kamal, Pearson Education, 2006 13

3 Building Blocks

• NAND

• NOR

• AND-OR

Ch09L1-"Digital Principles and Design", Raj Kamal, Pearson Education, 2006 14

4 Building Blocks• AND-OR-NOT

• XOR

• XNOR

• OR-AND

Ch09L1-"Digital Principles and Design", Raj Kamal, Pearson Education, 2006 15

Other Building Blocks

• Decoder• Multiplexer• EPLD• ROM• FPGA

Ch09L1-"Digital Principles and Design", Raj Kamal, Pearson Education, 2006 16

Outline

• Definition• Representation• Seven Building Blocks• Problem Formulation• Specifications of each output

Ch09L1-"Digital Principles and Design", Raj Kamal, Pearson Education, 2006 17

FORMULATION OF A PROBLEM IN A COMBINATIONAL CIRCUIT

• First step is to select the combinational circuit(s) in a logic network for which the problem of designing as per specifications is to be solved.

• Criteria for whether a problem or its part is solvable by a combination circuit or not, is as follows:

Ch09L1-"Digital Principles and Design", Raj Kamal, Pearson Education, 2006 18

Criteria for whether a problem or its part is solvable

• (i) Check whether the required logic at the output(s) depends only on the input logic conditions, both completely specified by either a truth table or by a Boolean expression,

Ch09L1-"Digital Principles and Design", Raj Kamal, Pearson Education, 2006 19

Criteria for whether a problem or its part is solvable

• (ii) Check whether an output(s) remains same, as long present input condition does not require the change in the output(s), and

• (iii) Check whether an output depends solely on the current input condition and not on any past input condition or past output condition.

Ch09L1-"Digital Principles and Design", Raj Kamal, Pearson Education, 2006 20

Outline

• Definition• Representation by truth table,

miniterm, maxterms • Seven Building Blocks• Problem Formulation• Specifications of each output

Ch09L1-"Digital Principles and Design", Raj Kamal, Pearson Education, 2006 21

Specification of each output as a function of input conditions

• 1. Specify the number of inputs, n. The n is also the number of literals in a Boolean expression for an output.

• 2. Specify the number of outputs, m.• 3. Specify the delays permitted at the

outputs

Ch09L1-"Digital Principles and Design", Raj Kamal, Pearson Education, 2006 22

Specification of each output as a function of input conditions

4. Specify the fan-ins permitted at the inputs.

5. Specify fan-outs permitted from the targets gates and building blocks.

6. Design a ‘truth table’ for n inputs and m outputs. Each output corresponds to each possible combination of input conditions.

Ch09L1-"Digital Principles and Design", Raj Kamal, Pearson Education, 2006 23

Specification of each output as a function of input conditions

7.Write a Boolean expression for the logic circuit for each output: The n is also the number of literals in a Boolean expression for output.

8. Specify as SOP or POS standard Format

Ch09L1-"Digital Principles and Design", Raj Kamal, Pearson Education, 2006 24

Specification of gate characteristics

9. Propagation delays 10. Fan-ins permitted are specified in the

problem

Ch09L1-"Digital Principles and Design", Raj Kamal, Pearson Education, 2006 25

Specification of gate characteristics

11. If a possible combination of the input condition is unspecified or is don’t care, specify it by ‘x’. [The Boolean expression for the output is an incomplete Boolean function.]

12. If a possible condition is high impedance output ‘tristate’, specify it by ‘*’

Ch09L1-"Digital Principles and Design", Raj Kamal, Pearson Education, 2006 26

Summary

Ch09L1-"Digital Principles and Design", Raj Kamal, Pearson Education, 2006 27

• A combinational circuit — made up by combining logic gates such that:

Required logic at the output(s) depends only on the input logic present condition,

Both (inputs and output) completely specified by a truth table or Boolean expression

Ch09L1-"Digital Principles and Design", Raj Kamal, Pearson Education, 2006 28

A combinational circuit — Problem Formulation means

• Building block selection• Defining Specifications

Ch09L1-"Digital Principles and Design", Raj Kamal, Pearson Education, 2006 29

End of Lesson 1

Combinational Circuit

Ch09L1-"Digital Principles and Design", Raj Kamal, Pearson Education, 2006 30

THANK YOU