DOCSLIB.ORG

8. Combinational MOS Logic Circuits

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
8. Combinational MOS Logic Circuits 8. Combinational MOS Logic Circuits Institute of Microelectronic Systems Introduction • Combinational logic circuits, or gates, witch perform Boolean operations on multiple input variables and determine the output as Boolean functions of the inputs, are the basic building blocks of all digital systems. • We will examine the static and dynamic characteristics of various combinational MOS logic circuits. It will be seen that many of the basic principles used in the design and analysis of MOS inverters can be directly applied to the combinational logic circuit as well. • In its most general form, a combinational logic circuit, or gate, performing a Boolean function can be represented as a multiple-input single-output system. General combinational logic circuit (gate) Institute of 8: Combinational MOS Microelectronic 2 Logic Circuits Systems MOS Logic Circuits with Depletion nMOS Loads Two-Input NOR Gate A two-input depletion-load NOR gate, its logic symbol, and the corresponding truth table Calculation of VOH When both input voltages VA and VB are lower than the corresponding driver threshold voltage, the driver transistor are turned off and conduct no drain current. Consequently, the load device, which operates in the linear region, also has zero drain current. In particular, its linear region current equation becomes kn, load 2 ID, load = ⎡2VT , load(VOH )(VDD − VOH ) − (VDD − VOH ) ⎤ = 0 2 ⎣⎢ ⎦⎥ The solution of this equation gives VOH=VDD Institute of 8: Combinational MOS Microelectronic 3 Logic Circuits Systems Calculation of VOL To calculate the output voltage VOL, we must consider three different cases, i.e., three different input voltage combinations, which produce a conduction path from the output node to the ground. These cases are (i) VA=VOH VB=VOL (ii) VA=VOL VB=VOH (iii) VA=VOH VB=VOH For first two cases the NOR circuit reduces to a simple nMOS depletion-load inverter. Assuming that the threshold voltages of the two enhancement-type driver transistors are identical (VT0,A=VT0,B=VT0), the driver-to-load ratio of the corresponding inverter can be found as follows. (i) ⎛W ⎞ k′n, driver ⎜ ⎟ kdriver , A ⎝ L ⎠A kR = = kload ⎛W ⎞ k′n, load ⎜ ⎟ ⎝ L ⎠load Institute of 8: Combinational MOS Microelectronic 4 Logic Circuits Systems (ii) ⎛W ⎞ k′n, driver ⎜ ⎟B kdriver , B ⎝ L ⎠ kR = = kload ⎛W ⎞ k′n, load ⎜ ⎟ ⎝ L ⎠load The output low voltage level VOL in both cases is found as follows: 2 ⎛ kload ⎞ 2 VOL = VOH − VT 0 − (VOH − VT 0 ) − ⎜ ⎟VT , load(VOL ) ⎝ kdriver ⎠ The output low voltage (VOL) values calculated for case (i) and (ii) will be identical. In case (iii), where both driver transistors are turned on, the saturated load current is the sum of the two linear-mode driver currents. ID, load = ID, driverA + ID, driverB kload 2 kdriver , A ⎡ 2 ⎤ VT , load(VOL ) = 2(VA − VT 0 )VOL − V OL 2 2 ⎣⎢ ⎦⎥ kdriver , B 2 + ⎡2(VB − VT 0 )VOL − V OL⎤ 2 ⎣⎢ ⎦⎥ Institute of 8: Combinational MOS Microelectronic 5 Logic Circuits Systems Since the gate voltages of both driver transistors are equal (VA=VB=VOH), we can devise an equivalent driver-to-load ratio for the NOR structure: ⎡⎛W ⎞ ⎛W ⎞ ⎤ k′n, driver ⎢⎜ ⎟ +⎜ ⎟B⎥ kdriver , A + kdriver , B ⎣⎝ L ⎠ ⎝ L ⎠ ⎦ kR = = A kload ⎛W ⎞ k′n, load⎜ ⎟ ⎝ L ⎠load Thus, the NOR gate with both of its inputs tied to a logic-high voltage is replaced with an nMOS depletion-load circuit with the driver-to-load ratio given by the above equation. The output voltage level in this case is: 2 ⎛ kload ⎞ 2 VOL = VOH − VT 0 − (VOH − VT 0 ) − ⎜ ⎟VT , load(VOL ) ⎝ kdriver , A + kdriver , B ⎠ The VOL is lower than the VOL values calculated for case (i) and for case (ii), when only one input is logic-high. This also suggests a simple design strategy for NOR gates. Usually, we have to achieve a certain maximum VOL for the worst case, i.e., when only one input is high. Thus, we assume that one input (either VA or VB) is logic-high and determine the driver-to-load ratio of the resulting inverter. Then set kdriver , A = kdriver , B = kRkload This design choice yields two identical driver transistors, which guarantee the required value of VOL in the worst case. When both inputs are logic-high, the output voltage is even lower than the required maximum VOL, thus the design constraint is satisfied. Institute of 8: Combinational MOS Microelectronic 6 Logic Circuits Systems Generalized NOR Structure with Multiple Inputs Generalized n-input NOR gate The combined pull-down current can than be expressed as follows: ⎧ µnCox ⎛W ⎞ 2 ⎡2(VGS, k − VT 0 )Vout − V out ⎤ linear ⎪ ∑ ⎜ ⎟ ⎢ ⎥ ⎪k( on ) 2 ⎝ L ⎠k ⎣ ⎦ ID = ∑ ID, k =⎨ k( on ) ⎪ µnCox ⎛W ⎞ 2 ∑ ⎜ ⎟ (VGS, k − VT 0 ) saturation ⎩⎪k( on ) 2 ⎝ L ⎠k Assuming that the input voltages of all driver transistors are identical, VGS, k = VGS for k = 1,2,...,n Institute of 8: Combinational MOS Microelectronic 7 Logic Circuits Systems The pull-down current expression can be rewritten as ⎧µnCox ⎛W ⎞ 2 ⎡2(VGS − VT 0 )Vout − V ⎤ linear ⎪ ∑ ⎜ ⎟ )⎢ out ⎥ ⎪ 2 ( k( on ) ⎝ L ⎠k ⎣ ⎦ ID = ⎨ ⎪µnCox ⎛W ⎞ 2 ∑ ⎜ ⎟ )(VGS − VT 0 ) saturation ⎩⎪ 2 ( k( on ) ⎝ L ⎠k Equivalent inverter circuit corresponding to the n-input NOR gate The (W/L) ratio of the driver transistor here is: ⎛W ⎞ ⎛W ⎞ ⎜ ⎟ = ∑ ⎜ ⎟ ⎝ L ⎠equivalent k( on ) ⎝ L ⎠k Institute of 8: Combinational MOS Microelectronic 8 Logic Circuits Systems Transient analysis of NOR Gate Parasitic device capacitances in the NOR2 gate and the lumped equivalent load capacitance. The gate-to-source capacitances of the driver transistors are included in the load of the previous stages driving the inputs A and B. The value of the combined load capacitance can be found: Cload = Cgd , A + Cgd , B + Cgd , load + Cdb, A + Cdb, B + Csb, load + Cwire Institute of 8: Combinational MOS Microelectronic 9 Logic Circuits Systems Two-input NAND Gate A two-input depletion-load NAND gate, its logic symbol, and the corresponding truth table. It can easily be seen that the drain currents of all transistors in the circuit are equal to each other. ID, load = ID, driverA = ID, driverB Institute of 8: Combinational MOS Microelectronic 10 Logic Circuits Systems kload 2 kdriver , A ⎡ 2 ⎤ VT , load(VOL ) = 2(VGS, A − VT , A )VDS, A − V DS, A 2 2 ⎣⎢ ⎦⎥ kdriver , B ⎡ 2 ⎤ = 2(VGS, B − VT , B )VDS, B − V DS, B 2 ⎣⎢ ⎦⎥ The gate-to-source voltages of both driver transistors can be assumed to be V approximately equal to VOH. ( V GS , A = V OH − V DS , B ≈ V OH , since DS low in NSAT) The drain-to-source voltages of both transistors can be solved: 2 ⎛ kload ⎞ 2 VDS, A = VOH − VT 0 − (VOH − VT 0 ) − ⎜ ⎟VT , load(VOL ) ⎝ kdriver , A ⎠ 2 ⎛ kload ⎞ 2 VDS, B = VOH − VT 0 − (VOH − VT 0 ) − ⎜ ⎟VT , load(VOL ) ⎝ kdriver , B ⎠ Let the two driver transistors be identical, i.e., kdriver,A=kdriver,B=kdriver. Noting that the output voltage VOL is equal to the sum of the drain-to-source voltages of both drivers, we obtain: ⎛ ⎛ ⎞ ⎞ ⎜ 2 ⎜ kload ⎟ 2 ⎟ VOL ≈ 2⎜VOH − VT 0 − (VOH − VT 0 ) − VT , load(VOL ) ⎟ ⎜ ⎜ ⎟ ⎟ ⎝ ⎝ kdriver ⎠ ⎠ Institute of 8: Combinational MOS Microelectronic 11 Logic Circuits Systems The following analysis gives a better and more accurate view of the operation of two series-connected driver transistors.Consider the two identical enhancement- type nMOS transistors with their gate terminals connected. At this point, the only simplifying assumption will be VT,A=VT,B=VT0. When both driver transistors are in the linear region, the drain currents can be written as: kdriver ⎡ 2 ⎤ ID, A = 2(VGS, A − VT 0 )VDS, A − V DS, A 2 ⎣⎢ ⎦⎥ kdriver ⎡ 2 ⎤ ID, B = 2(VGS, B − VT 0 )VDS, B − V DS, B 2 ⎣⎢ ⎦⎥ Since ID,A=ID,B, this current can also be expressed as ID, A + ID, B ID = ID, A = ID, B = 2 Using VGS,A=VGS,B-VDS,B yields kdriver 2 ID = ⎡2(VGS, B − VT 0 )(VDS, A + VDS, B ) − (VDS, A + VDS, B ) ⎤ 4 ⎣⎢ ⎦⎥ Now let VGS=VGS,B and VDS=VDS,A+VDS,B. The drain-current expression can be written as follows. kdriver 2 ID = ⎡2(VGS − VT 0 )VDS − VDS ⎤ 4 ⎣⎢ ⎦⎥ Institute of 8: Combinational MOS Microelectronic 12 Logic Circuits Systems Generalized NAND Structure with Multiple Inputs The generalized NAND2 structure and its inverter equivalent Neglecting the substrate-bias effect, and assuming that the threshold voltages of all transistors equal to VT0, the driver current ID in the linear region can be derived: ⎛ ⎞ ⎜ ⎟ ⎜ ⎟⎧ 2 ⎡2(Vin − VT 0 )Vout − V ⎤ linear µnCox ⎜ 1 ⎟⎪⎢ out ⎥ ID ⎣ ⎦ = ⎜ ⎟⎨ 2 1 2 ⎜ ∑ ⎟⎪(Vin − VT 0 ) saturation ⎛W ⎞ ⎩ ⎜ k( on ) ⎜ ⎟ ⎟ ⎝ ⎝ L ⎠k ⎠ Institute of 8: Combinational MOS Microelectronic 13 Logic Circuits Systems Hence, the (W/L) ratio of the equivalent driver transistor is ⎛W ⎞ 1 = ⎜ ⎟ 1 ⎝ L ⎠equivalent ∑ ⎛W ⎞ k( on ) ⎜ ⎟ ⎝ L ⎠k If the series-connected transistors are identical, i.e., (W/L)1= (W/L)2=...= (W/L), the width-to-length ratio of the equivalent transistor becomes ⎛W ⎞ 1 ⎛W ⎞ ⎜ ⎟ = ⎜ ⎟ ⎝ L ⎠equivalent n ⎝ L ⎠ Institute of 8: Combinational MOS Microelectronic 14 Logic Circuits Systems Transient Analysis of NAND Gate Parasitic device capacitances in the NAND2 gate Institute of 8: Combinational MOS Microelectronic 15 Logic Circuits Systems As in the inverter case, we can combine the capacitances into one capacitance, connected between the output and node and the ground. The value of the lumped capacitance Cload depends on the input voltage conditions. For example, the input VA is equal to VOH and the other input VB is switching from VOH to VOL. In this case, both the output voltage Vout and the internal node voltage Vx will rise, resulting in: Cload = Cgd , load + Cgd , A + Cgd , B + Cgs, A + Cdb, A + Cdb, B + Csb, A + Csb, load + Cwire Note that this value is quite conservative and fully reflects the internal node capacitances into the lumped output capacitance Cload.
Load more

Recommended publications
  • Transistors and Logic Gates
    Introduction to Computer Engineering CS/ECE 252, Spring 2013 Prof. Mark D. Hill Computer Sciences Department University of Wisconsin – Madison Chapter 3 Digital Logic Structures Slides based on set prepared by Gregory T. Byrd, North Carolina State University Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. Transistor: Building Block of Computers Microprocessors contain millions of transistors • Intel Pentium II: 7 million • Compaq Alpha 21264: 15 million • Intel Pentium III: 28 million Logically, each transistor acts as a switch Combined to implement logic functions • AND, OR, NOT Combined to build higher-level structures • Adder, multiplexer, decoder, register, … Combined to build processor • LC-3 3-3 Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. Simple Switch Circuit Switch open: • No current through circuit • Light is off • Vout is +2.9V Switch closed: • Short circuit across switch • Current flows • Light is on • Vout is 0V Switch-based circuits can easily represent two states: on/off, open/closed, voltage/no voltage. 3-4 Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. N-type MOS Transistor MOS = Metal Oxide Semiconductor • two types: N-type and P-type N-type • when Gate has positive voltage, short circuit between #1 and #2 (switch closed) • when Gate has zero voltage, open circuit between #1 and #2 Gate = 1 (switch open) Gate = 0 Terminal #2 must be connected to GND (0V). 3-5 Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. P-type MOS Transistor P-type is complementary to N-type • when Gate has positive voltage, open circuit between #1 and #2 (switch open) • when Gate has zero voltage, short circuit between #1 and #2 (switch closed) Gate = 1 Gate = 0 Terminal #1 must be connected to +2.9V.
    [Show full text]
  • EE 434 Lecture 2
    EE 330 Lecture 6 • PU and PD Networks • Complex Logic Gates • Pass Transistor Logic • Improved Switch-Level Model • Propagation Delay Review from Last Time MOS Transistor Qualitative Discussion of n-channel Operation Source Gate Drain Drain Bulk Gate n-channel MOSFET Source Equivalent Circuit for n-channel MOSFET D D • Source assumed connected to (or close to) ground • VGS=0 denoted as Boolean gate voltage G=0 G = 0 G = 1 • VGS=VDD denoted as Boolean gate voltage G=1 • Boolean G is relative to ground potential S S This is the first model we have for the n-channel MOSFET ! Ideal switch-level model Review from Last Time MOS Transistor Qualitative Discussion of p-channel Operation Source Gate Drain Drain Bulk Gate Source p-channel MOSFET Equivalent Circuit for p-channel MOSFET D D • Source assumed connected to (or close to) positive G = 0 G = 1 VDD • VGS=0 denoted as Boolean gate voltage G=1 • VGS= -VDD denoted as Boolean gate voltage G=0 S S • Boolean G is relative to ground potential This is the first model we have for the p-channel MOSFET ! Review from Last Time Logic Circuits VDD Truth Table A B A B 0 1 1 0 Inverter Review from Last Time Logic Circuits VDD Truth Table A B C 0 0 1 0 1 0 A C 1 0 0 B 1 1 0 NOR Gate Review from Last Time Logic Circuits VDD Truth Table A B C A C 0 0 1 B 0 1 1 1 0 1 1 1 0 NAND Gate Logic Circuits Approach can be extended to arbitrary number of inputs n-input NOR n-input NAND gate gate VDD VDD A1 A1 A2 An A2 F A1 An F A2 A1 A2 An An A1 A 1 A2 F A2 F An An Complete Logic Family Family of n-input NOR gates forms
    [Show full text]
  • Digital IC Listing
    BELS Digital IC Report Package BELS Unit PartName Type Location ID # Price Type CMOS 74HC00, Quad 2-Input NAND Gate DIP-14 3 - A 500 0.24 74HCT00, Quad 2-Input NAND Gate DIP-14 3 - A 501 0.36 74HC02, Quad 2 Input NOR DIP-14 3 - A 417 0.24 74HC04, Hex Inverter, buffered DIP-14 3 - A 418 0.24 74HC04, Hex Inverter (buffered) DIP-14 3 - A 511 0.24 74HCT04, Hex Inverter (Open Collector) DIP-14 3 - A 512 0.36 74HC08, Quad 2 Input AND Gate DIP-14 3 - A 408 0.24 74HC10, Triple 3-Input NAND DIP-14 3 - A 419 0.31 74HC32, Quad OR DIP-14 3 - B 409 0.24 74HC32, Quad 2-Input OR Gates DIP-14 3 - B 543 0.24 74HC138, 3-line to 8-line decoder / demultiplexer DIP-16 3 - C 603 1.05 74HCT139, Dual 2-line to 4-line decoders / demultiplexers DIP-16 3 - C 605 0.86 74HC154, 4-16 line decoder/demulitplexer, 0.3 wide DIP - Small none 445 1.49 74HC154W, 4-16 line decoder/demultiplexer, 0.6wide DIP none 446 1.86 74HC190, Synchronous 4-Bit Up/Down Decade and Binary Counters DIP-16 3 - D 637 74HCT240, Octal Buffers and Line Drivers w/ 3-State outputs DIP-20 3 - D 643 1.04 74HC244, Octal Buffers And Line Drivers w/ 3-State outputs DIP-20 3 - D 647 1.43 74HCT245, Octal Bus Transceivers w/ 3-State outputs DIP-20 3 - D 649 1.13 74HCT273, Octal D-Type Flip-Flops w/ Clear DIP-20 3 - D 658 1.35 74HCT373, Octal Transparent D-Type Latches w/ 3-State outputs DIP-20 3 - E 666 1.35 74HCT377, Octal D-Type Flip-Flops w/ Clock Enable DIP-20 3 - E 669 1.50 74HCT573, Octal Transparent D-Type Latches w/ 3-State outputs DIP-20 3 - E 674 0.88 Type CMOS CD4000 Series CD4001, Quad 2-input
    [Show full text]
  • Additional Gates and Circuits, Other Gate Types, Exclusive-OR Operator and Gates, High-Impedance Outputs 5
    Introduction to Digital Logic Course Outline 1. Digital Computers, Number Systems, Arithmetic Operations, Decimal, Alphanumeric, and Gray Codes 2. Binary Logic, Gates, Boolean Algebra, Standard Forms 3. Circuit Optimization, Two-Level Optimization, Map Manipulation, Multi-Level Prof. Nizamettin AYDIN Circuit Optimization 4. Additional Gates and Circuits, Other Gate Types, Exclusive-OR Operator and Gates, High-Impedance Outputs 5. Implementation Technology and Logic Design, Design Concepts and Automation, The Design Space, Design Procedure, The major design steps [email protected] 6. Programmable Implementation Technologies: Read-Only Memories, Programmable Logic Arrays, Programmable Array Logic,Technology mapping to programmable [email protected] logic devices 7. Combinational Functions and Circuits 8. Arithmetic Functions and Circuits 9. Sequential Circuits Storage Elements and Sequential Circuit Analysis 10. Sequential Circuits, Sequential Circuit Design State Diagrams, State Tables 11. Counters, register cells, buses, & serial operations 12. Sequencing and Control, Datapath and Control, Algorithmic State Machines (ASM) 13. Memory Basics 1 2 Introduction to Digital Logic Other Gate Types • Why? – Implementation feasibility and low cost – Power in implementing Boolean functions Lecture 4 – Convenient conceptual representation Additional Gates and Circuits • Gate classifications – Primitive gate - a gate that can be described using a single – Other Gate Types primitive operation type (AND or OR) plus an optional – Exclusive -OR Operator and Gates inversion(s). – High -Impedance Outputs – Complex gate - a gate that requires more than one primitive operation type for its description • Primitive gates will be covered first 3 4 Buffer NAND Gate • A buffer is a gate with the function F = X: • The basic NAND gate has the following symbol, illustrated for three inputs: XF – AND-Invert (NAND) • In terms of Boolean function, a buffer is the X Y (F X, ,Y Z) === X ⋅⋅⋅ Y ⋅⋅⋅ Z same as a connection! Z • So why use it? • NAND represents NOT AND , i.
    [Show full text]
  • Design a 3-Input CMOS NAND Gate (PUN/PDN) with Fan-Out of 3. Total Output Load of the NAND Gate Is Equal to 15Ff and Μn/Μp = 2.5
    Tutorial on Transistor Sizing Problem #1 (Static CMOS logic): Design a 3-input CMOS NAND gate (PUN/PDN) with fan-out of 3. Total output load of the NAND gate is equal to 15fF and µn/µp = 2.5. For 0.35µm process technology tox = -9 -12 7.6*10 m, εox = 35*10 F/m. Compare the above design with that of a 3-input NOR (PUN/PDN) gate. State any benefits of one implementation over the other. For the sake of simplicity assume all capacitance is lumped and gate capacitance neglecting diffusion and wiring capacitance. Solution: Cox = εoxWL/ tox = 15fF. So W = 9.2µm. Leff = 0.35µm. Assuming output load is all gate capacitance. This is a simplifying assumption made for this problem. A more realistic approach would be to calculate the diffusion and wiring capacitances as well. Equivalent inverter for fan-out of 3 and µn/µp = 2.5 would result in: A B C 2.23 2.23 2.23 Wp = 2.5*Wn for equal rise and fall times. Also, Wp + Wn = 9.2/3 = 3.16µm for fan-out of 3. A 2.67 B Solving the above equations we have, 2.67 C 2.67 Wp = 2.23µm and Wn = 0.89µm. NAND implementation: NAND implementation Therefore, for the 3-ip NAND gate implementation, each PDN n-MOS transistor will be: 3*0.89µm = 2.67µm A and each p-MOS transistor in the PUN network will be: 2.23µm 6.69 B NOR implementation: 6.69 For a 3-ip NOR gate implementation, each PDN n-MOS transistor C will be: 0.89µm 6.69 A BC Each PUN p-MOS transistor will be 3*2.23µm = 6.69µm 0.89 0.89 0.89 Area comparison: NOR implementation Total gate area of NAND gate is: 3*(2.67+2.23)µm = 14.7µm Total gate area of NOR gate is: 3*(6.69+0.89) µm = 22.7µm Thus we infer that the NAND gate has less area and power compared to the NOR gate for identical loading and fan-out conditions and is the preferred implementation.
    [Show full text]
  • Hardware Abstract the Logic Gates References Results Transistors Through the Years Acknowledgements
    The Practical Applications of Logic Gates in Computer Science Courses Presenters: Arash Mahmoudian, Ashley Moser Sponsored by Prof. Heda Samimi ABSTRACT THE LOGIC GATES Logic gates are binary operators used to simulate electronic gates for design of circuits virtually before building them with-real components. These gates are used as an instrumental foundation for digital computers; They help the user control a computer or similar device by controlling the decision making for the hardware. A gate takes in OR GATE AND GATE NOT GATE an input, then it produces an algorithm as to how The OR gate is a logic gate with at least two An AND gate is a consists of at least two A NOT gate, also known as an inverter, has to handle the output. This process prevents the inputs and only one output that performs what inputs and one output that performs what is just a single input with rather simple behavior. user from having to include a microprocessor for is known as logical disjunction, meaning that known as logical conjunction, meaning that A NOT gate performs what is known as logical negation, which means that if its input is true, decision this making. Six of the logic gates used the output of this gate is true when any of its the output of this gate is false if one or more of inputs are true. If all the inputs are false, the an AND gate's inputs are false. Otherwise, if then the output will be false. Likewise, are: the OR gate, AND gate, NOT gate, XOR gate, output of the gate will also be false.
    [Show full text]
  • Designing Combinational Logic Gates in Cmos
    CHAPTER 6 DESIGNING COMBINATIONAL LOGIC GATES IN CMOS In-depth discussion of logic families in CMOS—static and dynamic, pass-transistor, nonra- tioed and ratioed logic n Optimizing a logic gate for area, speed, energy, or robustness n Low-power and high-performance circuit-design techniques 6.1 Introduction 6.3.2 Speed and Power Dissipation of Dynamic Logic 6.2 Static CMOS Design 6.3.3 Issues in Dynamic Design 6.2.1 Complementary CMOS 6.3.4 Cascading Dynamic Gates 6.5 Leakage in Low Voltage Systems 6.2.2 Ratioed Logic 6.4 Perspective: How to Choose a Logic Style 6.2.3 Pass-Transistor Logic 6.6 Summary 6.3 Dynamic CMOS Design 6.7 To Probe Further 6.3.1 Dynamic Logic: Basic Principles 6.8 Exercises and Design Problems 197 198 DESIGNING COMBINATIONAL LOGIC GATES IN CMOS Chapter 6 6.1Introduction The design considerations for a simple inverter circuit were presented in the previous chapter. In this chapter, the design of the inverter will be extended to address the synthesis of arbitrary digital gates such as NOR, NAND and XOR. The focus will be on combina- tional logic (or non-regenerative) circuits that have the property that at any point in time, the output of the circuit is related to its current input signals by some Boolean expression (assuming that the transients through the logic gates have settled). No intentional connec- tion between outputs and inputs is present. In another class of circuits, known as sequential or regenerative circuits —to be dis- cussed in a later chapter—, the output is not only a function of the current input data, but also of previous values of the input signals (Figure 6.1).
    [Show full text]
  • Class 10: CMOS Gate Design
    Class 10: CMOS Gate Design Topics: 1. Exclusive OR Implementation 2. Exclusive OR Carry Circuit 3. PMOS Carry Circuit Equivalent 4. CMOS Full-Adder 5. NAND, NOR Gate Considerations 6. Logic Example 7. Logic Negation 8. Mapping Logic ‘0’ 9. Equivalent Circuits 10. Fan-In and Fan-Out 11. Rise Delay Time 12. Rise Delay Time 13. Rise Delay Time 14. Fall Delay Time 15. Equal Delays Joseph A. Elias, PhD 1 Class 10: CMOS Gate Design Exclusive OR Design (Martin c4.5) 3-input XOR Truth Table Similar to how one derives a 2-input XOR (Martin, p.183) using (a’+b’)=(ab)’ (a’b’)=(a+b)’ a XOR b = a’b + ab’ = a’a + a’b + ab’ + bb’ = a’(a+b) + b’(a+b) = (a’+b’)(a+b) = (ab)’(a+b) = (ab + (a’b’) )’ = (ab + (a + b)’ )’ Joseph A. Elias, PhD 2 Class 10: CMOS Gate Design Exclusive OR Carry Circuit (Martin c4.5) NMOS realization PMOS equivalent •A in parallel with B •A in series with B •A||B in series with C •AB in parallel with C •AB in parallel with (A||B)C •A||B in series with (AB)||C Vout = Joseph A. Elias, PhD 3 Class 10: CMOS Gate Design PMOS Carry Circuit Equivalent (Martin c4.5) •Martin indicates equivalency between these circuits •Is this true? (AB+C)(A+B) = (A+B)C + (AB) ABA + ABB + AC + BC = AC +BC +AB AB + AB + AC + BC = AC + BC + AB AB + AC + BC = AB + AC + BC equivalent Joseph A. Elias, PhD 4 Class 10: CMOS Gate Design CMOS Full-Adder (Martin c4.5) Sum: (A+B+C) Carry + ABC Carry: (A+B)C + AB Joseph A.
    [Show full text]
  • –Not –And –Or –Xor –Nand –Nor
    Gates Six types of gates –NOT –AND –OR –XOR –NAND –NOR 1 NOT Gate A NOT gate accepts one input signal (0 or 1) and returns the complementary (opposite) signal as output 2 AND Gate An AND gate accepts two input signals If both are 1, the output is 1; otherwise, the output is 0 3 OR Gate An OR gate accepts two input signals If both are 0, the output is 0; otherwise, the output is 1 4 XOR Gate An XOR gate accepts two input signals If both are the same, the output is 0; otherwise, the output is 1 5 XOR Gate Note the difference between the XOR gate and the OR gate; they differ only in one input situation When both input signals are 1, the OR gate produces a 1 and the XOR produces a 0 XOR is called the exclusive OR because its output is 1 if (and only if): • either one input or the other is 1, • excluding the case that they both are 6 NAND Gate The NAND (“NOT of AND”) gate accepts two input signals If both are 1, the output is 0; otherwise, the output is 1 NOR Gate The NOR (“NOT of OR”) gate accepts two inputs If both are 0, the output is 1; otherwise, the output is 0 8 AND OR XOR NAND NOR 9 Review of Gate Processing Gate Behavior NOT Inverts its single input AND Produces 1 if all input values are 1 OR Produces 0 if all input values are 0 XOR Produces 0 if both input values are the same NAND Produces 0 if all input values are 1 NOR Produces 1 if all input values are 0 10 Combinational Circuits Gates are combined into circuits by using the output of one gate as the input for another This same circuit using a Boolean expression is AB + AC 11 Combinational Circuits Three inputs require eight rows to describe all possible input combinations 12 Combinational Circuits Consider the following Boolean expression A(B + C) Does this truth table look familiar? Compare it with previous table 13.
    [Show full text]
  • Logic Gate - Wikipedia, the Free Encyclopedia 10-3-13 下午8:30
    Logic gate - Wikipedia, the free encyclopedia 10-3-13 下午8:30 Logic gate From Wikipedia, the free encyclopedia A logic gate performs a logical operation on one or more logic inputs and produces a single logic output. The logic normally performed is Boolean logic and is most commonly found in digital circuits. Logic gates are primarily implemented electronically using diodes or transistors, but can also be constructed using electromagnetic relays (relay logic), fluidic logic, pneumatic logic, optics, molecules, or even mechanical elements. In electronic logic, a logic level is represented by a voltage or current, (which depends on the type of electronic logic in use). Each logic gate requires power so that it can source and sink currents to achieve the correct output voltage. In logic circuit diagrams the power is not shown, but in a full electronic schematic, power connections are required. Contents 1 Truth table 2 Background 3 Logic gates 4 Symbols 5 De Morgan equivalent symbols 6 Storage of bits 7 Three-state logic gates 8 Miscellaneous 9 History and development 10 Implementations 11 See also 12 References 13 Further reading 14 External links Truth table Main article: Truth table A truth table is a table that describes the behaviour of a logic gate. It lists the value of the output for every possible combination of the inputs and can be used to simplify the number of logic gates and level of nesting in an electronic circuit. In general the truth table does not lead to an efficient implementation; a minimization procedure, using Karnaugh maps, the Quine–McCluskey algorithm or an heuristic algorithm is required for reducing the circuit complexity.
    [Show full text]
  • Design and Simulation of V&Pl Submodules Using Nand And
    DESIGN AND SIMULATION OF V&PL SUBMODULES USING NAND AND NOR GATE H.Hasim, Syirrazie CS Instrumentation and Automation Center, Technical Support Division, Malaysia Nuclear Agensi 43000, Bangi, Kajang, Selangor Abstract Digital Integarted Circuit(IC) design is an alternative to current analog IC design. Both have vise verse advan- tages and disadvantages. This paper investigate and compare sub-modules of voting and protecting logic (V&PL) using only two input either NAND gate(74LS00) or NOR gate (74LS02). On the previous research, V&PL sub- module are mixed of six input NOR gate, 2 input AND gate, and Inverter. The result show a complexity of circuity and difficulty of finding six input NOR gate. We extend this analysis by comparable of less complexity of PMOS and NMOS used in NAND and NOR gate as V&PL sub-module, less time propagation delay, with high frequency and less total nombor of transistor used. Kanaugh map minimizer, logisim, and LTSpice used to design and develop of V&PL sub-module Complementary Metal Oxide Semiconductor(CMOS) NAND and NOR gate.Result show that, propagation delay of NAND gate is less with high frequency than NOR gate. Keywords: CMOS, NOR gate, NAND gate, Voting and Protecting Logic(V&PL) 1 Introduction One of the key challenges in IC design is making used of transistor. Transistor can be either biasing and funtion as amplifier or operated in saturated and cut-off region. To be digitalize, transistor will operated in saturated and cut-off region. The saturated region is when the flat or staedy-state amount of voltage throught out of time while in cut-off region it is approximately zeros volt.
    [Show full text]
  • Logic Families
    Logic Families PDF generated using the open source mwlib toolkit. See http://code.pediapress.com/ for more information. PDF generated at: Mon, 11 Aug 2014 22:42:35 UTC Contents Articles Logic family 1 Resistor–transistor logic 7 Diode–transistor logic 10 Emitter-coupled logic 11 Gunning transceiver logic 16 Transistor–transistor logic 16 PMOS logic 23 NMOS logic 24 CMOS 25 BiCMOS 33 Integrated injection logic 34 7400 series 35 List of 7400 series integrated circuits 41 4000 series 62 List of 4000 series integrated circuits 69 References Article Sources and Contributors 75 Image Sources, Licenses and Contributors 76 Article Licenses License 77 Logic family 1 Logic family In computer engineering, a logic family may refer to one of two related concepts. A logic family of monolithic digital integrated circuit devices is a group of electronic logic gates constructed using one of several different designs, usually with compatible logic levels and power supply characteristics within a family. Many logic families were produced as individual components, each containing one or a few related basic logical functions, which could be used as "building-blocks" to create systems or as so-called "glue" to interconnect more complex integrated circuits. A "logic family" may also refer to a set of techniques used to implement logic within VLSI integrated circuits such as central processors, memories, or other complex functions. Some such logic families use static techniques to minimize design complexity. Other such logic families, such as domino logic, use clocked dynamic techniques to minimize size, power consumption, and delay. Before the widespread use of integrated circuits, various solid-state and vacuum-tube logic systems were used but these were never as standardized and interoperable as the integrated-circuit devices.
    [Show full text]