stld-combinational logic design

72
1 Combinational Logic Design Unit-3

Upload: abhinay-potlabathini

Post on 25-May-2015

877 views

Category:

Education


7 download

DESCRIPTION

stld

TRANSCRIPT

Page 1: STLD-Combinational  logic design

1

Combinational Logic Design

Unit-3

Page 2: STLD-Combinational  logic design

List of Topics: Single output and multiple output combinational logic circuit design AND-OR, OR-AND, and NAND/NOR realizations Exclusive-OR and Equivalence functions Binary adders/subtractors Encoder, Decoder Multiplexer, Demultiplexer MUX realization of switching functions Parity bit generator Code-converters Contact Networks Hazards and hazard free realizations.

2

Page 3: STLD-Combinational  logic design

Combinational Logic Design A process with 5 steps

Specification Formulation Optimization Technology mapping Verification

3

Page 4: STLD-Combinational  logic design

Functional Blocks Fundamental circuits that are the base building

blocks of most larger digital circuits They are reusable and are common to many

systems. Examples of functional logic circuits

Decoders Encoders Code converters Multiplexers

4

Page 5: STLD-Combinational  logic design

Where they are used Multiplexers

Selectors for routing data to the processor, memory, I/O

Multiplexers route the data to the correct bus or port.

Decoders are used for selecting things like a bank of memory

and then the address within the bank. This is also the function needed to ‘decode’ the instruction to determine the operation to perform.

Encoders are used in various components such as keyboards.

5

Page 6: STLD-Combinational  logic design

Specifications step Write a specification for the circuits Specification includes

What are the inputs: how many, how many bits in a given output, how are they grouped, are they control, are they active high?

What are the outputs: how many and how many bits in each, active high, active low, tristate output?

The functional operation that takes place in the chip, i.e., for given inputs what will appear on the outputs.

6

Page 7: STLD-Combinational  logic design

Formulation step Convert the specifications into a variety forms

for optimal implementation. Possible forms

Truth Tables Expressions K-maps Binary Decision Diagrams

IF THE SPECIFCATION IS ERRONOUS OR INCOMPLETE (open for various interpretation) then the circuit will perform as specified but will not perform as desired.

7

Page 8: STLD-Combinational  logic design

Digital Circuits: Combinational circuit consists of logic gates whose outputs

at any time are determined directly from the present

combination of inputs without regard to previous inputs.

Sequential Circuit employ memory elements in addition to

logic gates. Their outputs are a function of the inputs and

the state of the memory elements.

8

Page 9: STLD-Combinational  logic design

Combinational Circuit: A Combinational circuit consists of input variables, logic

gates and output variables. The gates accept signals from the inputs and generate signals to the outputs.

Combinational Logic Circuitn input

variablesm output variables

Block Diagram of a Combinational Circuit

Page 10: STLD-Combinational  logic design

Design of Combinational Circuits:The design procedure involves the following steps: The problem is stated. The number of available input variables and required

output variables is determined. The input and output variables are assigned letter symbols. The truth table that defines the required relationships

between inputs and outputs is derived. The simplified Boolean function for each output is

obtained. The logic diagram is drawn.

Page 11: STLD-Combinational  logic design

A Practical design method would have to consider constraints such as:

Minimum no. of gates. Minimum no. of inputs to the gates. Minimum propagation time of the signal through the

circuit. Minimum no. of interconnections and Limitations of the driving capabilities of each gate.

Page 12: STLD-Combinational  logic design

Adders: A combinational circuit that performs addition of two bits is

called a Half Adder.

Half AdderA

B

Sum

CarryOutputsinputs

Page 13: STLD-Combinational  logic design

K map simplification for HA

0 0

0 1

A

B0 1

0

10 1

1 0

A

B0 1

0

1

For carry For sum

Page 14: STLD-Combinational  logic design

Logic diagram for half adder

Page 15: STLD-Combinational  logic design

Adders: A combinational circuit that performs addition of three bits

is called a Full Adder.

Full AdderA

B

Sum

Cin

Cout

Page 16: STLD-Combinational  logic design

Truth table for full adder

A B Cin Sum Carry

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

Page 17: STLD-Combinational  logic design

K map simplification for full adder

0 0 1 0

0 1 1 1

B Cin

00 01 11 10

0

1

0 1 0 1

1 0 1 0

00 01 11 10

0

1

A

B Cin

A

For carry For sum

Page 18: STLD-Combinational  logic design

Logic diagram for full adder

Page 19: STLD-Combinational  logic design

Implementation of full adder with two half

adders and an OR gate

Page 20: STLD-Combinational  logic design

Subtractors: A combinational circuit that subtracts two bits and

produces their difference is called Half Subtractor. It also has an output to specify if a 1 has been borrowed.

Half SubtractorA

B

Difference

Borrow

Outputs

inputs

Page 21: STLD-Combinational  logic design

K map simplification for half subtractor

0 0

1 0

A

B0 1

0

10 1

1 0

A

B0 1

0

1

For Borrow For Difference

Page 22: STLD-Combinational  logic design

Logic diagram for half subtractor

Page 23: STLD-Combinational  logic design

Full Subtractor

Full SubtractorA

B

Difference

Borrowin

Borrowout

Page 24: STLD-Combinational  logic design

Truth table for full subtractor

A B C Difference Borrow

0 0 0 0 0

0 0 1 1 1

0 1 0 1 1

0 1 1 0 1

1 0 0 1 0

1 0 1 0 0

1 1 0 0 0

1 1 1 1 1

Page 25: STLD-Combinational  logic design

K map simplification for full subtractor

0 1 1 1

0 0 1 0

BC

00 01 11 10

0

1

0 1 0 1

1 0 1 0

00 01 11 10

0

1

A

B C

A

For Borrow For Difference

Page 26: STLD-Combinational  logic design

Logic diagram for full subtractor

Page 27: STLD-Combinational  logic design

Implementation of full subtractor using two half

subtractors and an OR gate

Page 28: STLD-Combinational  logic design

Binary / Parallel Adder

B0 A0 B1 A1 B2 A2 Bn An

Cout

Cin

Cin

Cout

FA FA FA FA

Sn S2 S1 S0

Page 29: STLD-Combinational  logic design

Binary subtractor / Parallel subtractor

B0 A0 B1 A1 B2 A2 Bn An

Cout

Cin

FA FA FA FACout

Sn S2 S1 S0

Cin=1

Page 30: STLD-Combinational  logic design

Encoder

• A digital circuit that performs the inverse operation of a decoder is called an encoder. An encoder has 2n input lines and n output lines.

• In encoder the output lines generate binary code corresponding to the input value.

2n inputsn data ouputs

Enable inputs

2n:n

Encoder

Page 31: STLD-Combinational  logic design

Truth table of Octal to Binary EncoderD0 D1 D2 D3 D4 D5 D6 D7 A B C

1 0 0 0 0 0 0 0 0 0 0

0 1 0 0 0 0 0 0 0 0 1

0 0 1 0 0 0 0 0 0 1 0

0 0 0 1 0 0 0 0 0 1 1

0 0 0 0 1 0 0 0 1 0 0

0 0 0 0 0 1 0 0 1 0 1

0 0 0 0 0 0 1 0 1 1 0

0 0 0 0 0 0 0 1 1 1 1

Page 32: STLD-Combinational  logic design

Octal to Binary Encoder

Page 33: STLD-Combinational  logic design

Decoders

• A decoder is a multiple-input, multiple-output logic circuit

which converts coded inputs into coded outputs, where the

input and output codes are different.

• The input code generally has fewer bits than the output code,

• Each input code word produces a different output code word.

Page 34: STLD-Combinational  logic design

General structure of a decoder

Possible 2n outputs

n data inputs

Enable inputs

n : 2n

Decoder

Usually, a decoder is provided with enable inputs to activate

decoded output based on data inputs. When any one enable input

is unasserted, all outputs of decoder are disabled.

Page 35: STLD-Combinational  logic design

Binary decoder

• A decoder which has an n-bit binary input code and a one

activated output out of 2n output code is called binary

decoder.

• A binary decoder is used when it is necessary to

activate exactly one of 2n output based on an n-bit input

value.

Page 36: STLD-Combinational  logic design

Truth table for 2 to 4 decoder

En A B Y3 Y2 Y1 Y0

0 X X 0 0 0 0

1 0 0 0 0 0 1

1 0 1 0 0 1 0

1 1 0 0 1 0 0

1 1 1 1 0 0 0

Page 37: STLD-Combinational  logic design

2 to 4 Decoder

Page 38: STLD-Combinational  logic design

Truth table for 3 to 8 decoder

EN A B C Y7 Y6 Y5 Y4 Y3 Y2 Y1 Y0

0 X X X 0 0 0 0 0 0 0 0

1 0 0 0 0 0 0 0 0 0 0 1

1 0 0 1 0 0 0 0 0 0 1 0

1 0 1 0 0 0 0 0 0 1 0 0

1 0 1 1 0 0 0 0 1 0 0 0

1 1 0 0 0 0 0 1 0 0 0 0

1 1 0 1 0 0 1 0 0 0 0 0

1 1 1 0 0 1 0 0 0 0 0 0

1 1 1 1 1 0 0 0 0 0 0 0

Page 39: STLD-Combinational  logic design

Logic diagram for 3 to 8 decoder

Page 40: STLD-Combinational  logic design

BCD to decimal decoder

• BCD decoders have four inputs and 10 outputs.

• The four bit BCD input is decoded to activate one of the ten

outputs.

• It accepts four active high BCD inputs and provides 10

independent active low outputs

Page 41: STLD-Combinational  logic design

Multiplexer

• Multiplexer is a digital switch. It allows digital information

from several sources to be routed onto a single output line.

• The selection of a particular input line is controlled by a set of

selection lines.

• Normally, there are 2n input lines and n selection lines whose

bit combinations determine which input is selected.

Page 42: STLD-Combinational  logic design

4 to 1 line multiplexer

Page 43: STLD-Combinational  logic design

Quadruple 2 to 1 line multiplexer

Page 44: STLD-Combinational  logic design

Expanding multiplexers

Expansion of multiplexer

Page 45: STLD-Combinational  logic design

Implementation of combinational logic using Mux• A multiplexer consists of a set of AND gates whose outputs are connected to

single OR gate. Because of this construction any boolean function in a SOP

form can be easily realized using multiplexer.

• Each AND gate in a multiplexer represents a min term.

• In 8 to 1 mux, there are 3 select inputs and 23 minterms.

• By connecting the function variables directly to the select inputs, a multiplexer

can be made to select the AND gate that corresponds to the minterm of the

function.

• If a minterm exists in a function, we have to connect the AND gate data input to

logic 1; otherwise we have to connect it to logic 0.

Page 46: STLD-Combinational  logic design

Demultiplexers

• A demultiplexer is a circuit that receives information on a single

line and transmits this information on one of 2n possible outputs.

• The selection of specific output line is controlled by the values

of n selection lines.

Page 47: STLD-Combinational  logic design

1 : 4 demultiplexer

Page 48: STLD-Combinational  logic design

Logic symbol of demultiplexer

1: 4 demuxDin

Y0

Y1

Y2

Y3

S1 So

Page 49: STLD-Combinational  logic design

Cascading Demultiplexers

Cascading demultiplexers is same as that of the

cascading decoders.

Page 50: STLD-Combinational  logic design

Implementing boolean function using

demultiplexer

Demultiplexer gives min terms at the output so by

logically Oring required minterms we can implement

boolean functions.

Page 51: STLD-Combinational  logic design

Parity generator truth table for even and odd

parity

Page 52: STLD-Combinational  logic design

Logic diagram for even parity

Page 53: STLD-Combinational  logic design

Truth table for even parity checker

Page 54: STLD-Combinational  logic design

Logic diagram for even parity checker

Page 55: STLD-Combinational  logic design

Code converters

1. Binary to BCD converter

2. BCD to binary converter

3. BCD to excess 3

4. Excess 3 to BCD

5. Binary to gray code

6. Gray code to binary

7. BCD to gray code

Page 56: STLD-Combinational  logic design

1. Binary to BCD converter

Binary code BCD codeD C B A B4 B3 B2 B1 B0

0 0 0 0 0 0 0 0 0

0 0 0 1 0 0 0 0 1

0 0 1 0 0 0 0 1 0

0 0 1 1 0 0 0 1 1

0 1 0 0 0 0 1 0 0

0 1 0 1 0 0 1 0 1

0 1 1 0 0 0 1 1 0

0 1 1 1 0 0 1 1 1

1 0 0 0 0 1 0 0 0

1 0 0 1 0 1 0 0 1

1 0 1 0 1 0 0 0 0

1 0 1 1 1 0 0 0 1

1 1 0 0 1 0 0 1 0

1 1 0 1 1 0 0 1 1

1 1 1 0 1 0 1 0 0

1 1 1 1 1 0 1 0 1

Page 57: STLD-Combinational  logic design

Logic diagram for binary to BCD converter

Page 58: STLD-Combinational  logic design

2. BCD to Binary converter

BCD to binary table

Page 59: STLD-Combinational  logic design

Logic diagram for BCD to binary code converter

Page 60: STLD-Combinational  logic design

3. BCD to excess 3Decimal B3 B2 B1 B0 E3 E2 E1 E0

0 0 0 0 0 0 0 1 1

1 0 0 0 1 0 1 0 0

2 0 0 1 0 0 1 0 1

3 0 0 1 1 0 1 1 0

4 0 1 0 0 0 1 1 1

5 0 1 0 1 1 0 0 0

6 0 1 1 0 1 0 0 1

7 0 1 1 1 1 0 1 0

8 1 0 0 0 1 0 1 1

9 1 0 0 1 1 1 0 0

Page 61: STLD-Combinational  logic design

Logic diagram for BCD to excess 3

Page 62: STLD-Combinational  logic design

4. Excess 3 to BCD code converter

E3 E2 E1 E0 B3 B2 B1 B0

0 0 1 1 0 0 0 0

0 1 0 0 0 0 0 1

0 1 0 1 0 0 1 0

0 1 1 0 0 0 1 1

0 1 1 1 0 1 0 0

1 0 0 0 0 1 0 1

1 0 0 1 0 1 1 0

1 0 1 0 0 1 1 1

1 0 1 1 1 0 0 0

1 1 0 0 1 0 0 1

Page 63: STLD-Combinational  logic design

Logic diagram for excess 3 to BCD code converter

Page 64: STLD-Combinational  logic design

5. Binary to Gray code converter

Binary to gray code table

Page 65: STLD-Combinational  logic design

Logic diagram for Binary to gray code converter

Page 66: STLD-Combinational  logic design

6. Gray code to binary code converter

Gray code to binary table

Page 67: STLD-Combinational  logic design

Logic diagram for gray code to Binary code converter

Page 68: STLD-Combinational  logic design

7. BCD to gray code converter

BCD code Gray code

B3 B2 B1 B0 G3 G2 G1 G0

0 0 0 0 0 0 0 0

0 0 0 1 0 0 0 1

0 0 1 0 0 0 1 1

0 0 1 1 0 0 1 0

0 1 0 0 0 1 1 0

0 1 0 1 0 1 1 1

0 1 1 0 0 1 0 1

0 1 1 1 0 1 0 0

1 0 0 0 1 1 0 0

1 0 0 1 1 1 0 1

Page 69: STLD-Combinational  logic design

Logic diagram for BCD to gray code converter

Page 70: STLD-Combinational  logic design

Priority encoder

A Priority encoder is an encoder circuit that includes the priority

function. In priority encoder, if two or more inputs are equal to

1 at the same time, the input having the highest priority will take

precedence.

Page 71: STLD-Combinational  logic design

Priority Encoder:

71

Page 72: STLD-Combinational  logic design

End