please full answer with clear explanition for each step. Please do the following problems:Draw the circuit and determine(a) Cin(b) Parasitic delay (P)(c) Logical effort (g)for the following gates.14-input NAND2 n-input NAND3 4-input NOR4 n-input NOR5 2-input XORSee Table 4.2 on p. 156 for some final answers. 156Chapter 4Delay4.4.1 Logical EffortLogical effort of a gate is defined as the ratio of the input capacitance of the gate to the inputcapacitance of an inverter that can deliver the same output current. Equivalently, logical effortindicates how much worse a gate is at producing output current as compared to aninverter, given that each input of the gate may only present as much input capacitance asthe inverter.ACin = 3g = 3/3(a)Logical effort can be measured in simulation from delay vs. fanout plots as the ratio ofthe slope of the delay of the gate to the slope of the delay of an inverter, as will be dis-cussed in Section 8.5.3. Alternatively, it can be estimated by sketching gates. Figure 4.22shows inverter, 3-input NAND, and 3-input NOR gates with transistor widths chosen toachieve unit resistance, assuming PMOS transistors have twice the resistance of nMOStransistors. The inverter presents three units of input capacitance. The NAND presentsfive units of capacitance on each input, so the logical effort is 5/3. Similarly, the NOR pre-sents seven units of capacitance, so the logical effort is 7/3. This matches our expectationthat NANDS are better than NORS because NORS have slow pMOS transistors in series.Table 4.2 lists the logical effort of common gates. The effort tends to increase withthe number of inputs. NAND gates are better than NOR gates because the series transis-tors are nMOS rather than pMOS. Exclusive-OR gates are particularly costly and havedifferent logical efforts for different inputs. An interesting case is that multiplexers builtfrom ganged tristates, as shown in Figure 1.29(b), have a logical effort of 2 independent ofthe number of inputs. This might at first seem to imply that very large multiplexers are justas fast as small ones. However, the parasitic delay does increase with multiplexer size;hence, it is generally fastest to construct large multiplexers out of trees of 4-input multi-plexers [Sutherland99].ACCin = 5g = 5/3(b)YCin = 7g = 7/3(c)FIGURE 4.22 Logic gatessized for unit resistanceTABLE 4.2 Logical effort of common gatesGate TypeNumber of Inputs4ninverter1NAND4/35/36/3(n + 2)/3NOR5/37/39/3(2n + 1)/3tristate, multiplexer2XOR, XNOR4, 46, 12, 68, 16, 16, 84.4.2 Parasitic DelayThe parasitic delay of a gate is the delay of the gate when it drives zero load. It can be esti-mated with RC delay models. A crude method good for hand calculations is to count onlydiffusion capacitance on the output node. For example, consider the gates in Figure 4.22,assuming each transistor on the output node has its own drain diffusion contact. Transis-tor widths were chosen to give a resistance of R in each gate. The inverter has three unitsof diffusion capacitance on the output, so the parasitic delay is 3RC = t. In other words,SThis assumption is made throughout the book. Exercises 4.19-4.20 explore the effects of different relativeresistances (see also [Sutherland99]). The overall conclusions do not change very much, so the simplemodel is good enough for most hand estimates. A simulator or static timing analyzer should be used whenmore accurate results are required.ABC

The design of semiconductors is a complex array of choices between what is the best circuit topology…

Answered: Draw the circuit and det (а) Cin (b)…

Draw the circuit and det (а) Cin (b) Parasitic delay ( (c) Logical effort (g for the following gates. 14-input NAND 2 n-input NAND 3 4-input NOR 4 n-input NOR

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

The following list contains six descriptions of information.
Would you please provide more information, in particular, on the "principle of non-repudiation"?
When do you use the direct approach of deadlock avoidance? Please, no handwritten responses, no single-worded, single-phrased, or single-sentence responses. Please assist me in comprehending it.
When you refer to the "Principle of Non-Repudiation," what do you actually mean?
May I have some references to back up this discussion please
What are the various methods for resolving a stalemate once it has been identified?
Could you perhaps provide more information, specifically on the "principle of non-repudiation"?
In your paper, you need to explain at least two positives and at least two negatives associated with bypassing the skip list.
write 4 questions by your own in which maximum 4 to 5 rules of inference must be used.
Establish a separation between verification and validation. Give specific cases.
Please provide an answer for attached question.
Think about the foreign-key constraint on the instructor's department name property. Please provide examples of additions and deletions that could go against the foreign-key restriction.