Logical Effort of Multistage Logic Networks Electrical Engineering (EE) Notes | EduRev

Electrical Engineering (EE) : Logical Effort of Multistage Logic Networks Electrical Engineering (EE) Notes | EduRev

The document Logical Effort of Multistage Logic Networks Electrical Engineering (EE) Notes | EduRev is a part of Electrical Engineering (EE) category.
All you need of Electrical Engineering (EE) at this link: Electrical Engineering (EE)

Objectives

 In this lecture you will learn the following

  • Logical Effort of Multistage Logic Networks
  • Minimizing Delay along a Path
  • Few Examples

23.1 Logical Effort of Multistage Logic Networks

The logical effort along a path compounds by multiplying the logical effort of all the logic gates along the path.We denote it by the letter 'G'. Hence,

Logical Effort of Multistage Logic Networks Electrical Engineering (EE) Notes | EduRev

The electrical effort along a path through the network is simply the ratio of the capacitance that loads the logic gate in the path to input capacitance of the first gate in the path.We denote it by the letter 'H' .

Logical Effort of Multistage Logic Networks Electrical Engineering (EE) Notes | EduRev

When fanout occurs within a logic network, some of the available drive current is directed along the path we are analyzing, and some are directed off that path. Branching effort (b) at the output of a logic gate is defined as-

Logical Effort of Multistage Logic Networks Electrical Engineering (EE) Notes | EduRev

where Logical Effort of Multistage Logic Networks Electrical Engineering (EE) Notes | EduRev is the load capacitance along the path and Logical Effort of Multistage Logic Networks Electrical Engineering (EE) Notes | EduRev is the capacitance of connections that lead off the path.If there is no branching in the path the branching effort is unity.

Branching effort along the entire path 'B' is the product of branching effort at each of the stages along the path.- Logical Effort of Multistage Logic Networks Electrical Engineering (EE) Notes | EduRev

Path effort(F) is defined as -   Logical Effort of Multistage Logic Networks Electrical Engineering (EE) Notes | EduRev

The path branching and electrical effort are related to the electrical effort of each stage as-

Logical Effort of Multistage Logic Networks Electrical Engineering (EE) Notes | EduRev

The path delay D is the sum of the delays of each of the stages of logic in the path.

Logical Effort of Multistage Logic Networks Electrical Engineering (EE) Notes | EduRev

where DF is path effort delay and P is path parasitic delay which are given as -

Logical Effort of Multistage Logic Networks Electrical Engineering (EE) Notes | EduRev

 

23.2 Minimizing Delay along a Path

Consider two path stages as in figure 23.21.

Logical Effort of Multistage Logic Networks Electrical Engineering (EE) Notes | EduRev

Fig 23.21: An Example Circuit

The total delay of the above circuit is given by-

Logical Effort of Multistage Logic Networks Electrical Engineering (EE) Notes | EduRev

Logical Effort of Multistage Logic Networks Electrical Engineering (EE) Notes | EduRev

To minimise D , we take the partial derivative of D with respect to equating it to zero we get,

Logical Effort of Multistage Logic Networks Electrical Engineering (EE) Notes | EduRev

i.e. the product of logical effort and electrical effort of each stage should be equal to get minimum delay.This is independent of scale of circuit and of the parasitic delay.The delay in the two stages will differ only if the parasitic delays are different.

We can generalise this result for N stages as-

Logical Effort of Multistage Logic Networks Electrical Engineering (EE) Notes | EduRev

Logical Effort of Multistage Logic Networks Electrical Engineering (EE) Notes | EduRev

In next page, we will this by an example.

 

Example of Minimizing delay: Consider the path from A to B involving three two input NAND gates as in fig 23.22. The input capacitance of first gate is C and the load capacitance is also C . Find the least delay in this path and how should the transistors be sized to achieve least delay?

Logical Effort of Multistage Logic Networks Electrical Engineering (EE) Notes | EduRev

Fig 23.22: Example Circuit

Solution:

Logical effort of a two input NAND gate is g = 4/3
so G = (4/3)*3 = 64/27 = 2.37 .

B = 1 (as there is no branching) , H = Cout / Cin = 1

Path Effort F = 64/27*1*1 = 64/27

if each stage has same parasitic delay then P = p1+ p2+p3 =6 pinv ( as all are two input), then

Logical Effort of Multistage Logic Networks Electrical Engineering (EE) Notes | EduRev

Logical Effort of Multistage Logic Networks Electrical Engineering (EE) Notes | EduRev

 

23.3 Reduction of Delay

For the minimum delay of the circuit we optimizes the number of stages. Let total number of stages be N = n1 + n2

Logical Effort of Multistage Logic Networks Electrical Engineering (EE) Notes | EduRev

Fig 23.31: Example Circuit

 

Logical Effort of Multistage Logic Networks Electrical Engineering (EE) Notes | EduRev

But the number of stages for minimum delay may not be the integer ,so it is not feasible to implement it . So we realise the circuit by either taking the number of stages greatest integer of the obtained value or the one more then the greatest integer whatever gives us the minimun delay .

Logical Effort of Multistage Logic Networks Electrical Engineering (EE) Notes | EduRev

Offer running on EduRev: Apply code STAYHOME200 to get INR 200 off on our premium plan EduRev Infinity!

Related Searches

pdf

,

Objective type Questions

,

mock tests for examination

,

Semester Notes

,

Logical Effort of Multistage Logic Networks Electrical Engineering (EE) Notes | EduRev

,

Exam

,

Viva Questions

,

study material

,

Previous Year Questions with Solutions

,

MCQs

,

past year papers

,

Summary

,

practice quizzes

,

Logical Effort of Multistage Logic Networks Electrical Engineering (EE) Notes | EduRev

,

video lectures

,

Extra Questions

,

Logical Effort of Multistage Logic Networks Electrical Engineering (EE) Notes | EduRev

,

Important questions

,

Sample Paper

,

shortcuts and tricks

,

ppt

,

Free

;