Reliability-Aware Design to Suppress Aging

Total Page:16

File Type:pdf, Size:1020Kb

Reliability-Aware Design to Suppress Aging Reliability-Aware Design to Suppress Aging Hussam Amrouch∗, Behnam Khaleghiy, Andreas Gerstlauerz and Jörg Henkel∗ ∗Karlsruhe Institute of Technology, Karlsruhe, Germany, ySharif University of Technology, Tehran, Iran, zUniversity of Texas, Austin, USA {amrouch; henkel}@kit.edu, [email protected], [email protected] ABSTRACT (when Si-H bonds break at the Si-SiO2 interface) and ox- Due to aging, circuit reliability has become extraordinary ide traps (when charges are captured in the oxide vacancies challenging. Reliability-aware circuit design flows do virtu- within the dielectric). Over time, generated defects (i.e. in- ally not exist and even research is in its infancy. In this pa- terface/oxide traps) accumulate inside the transistor, mani- per, we propose to bring aging awareness to EDA tool flows festing themselves as degradations in its electrical character- based on so-called degradation-aware cell libraries. These istics (Vth, µ, etc.). Hence, aged transistors become slower, libraries include detailed delay information of gates/cells which increases the likelihood of timing violations. BTI has under the impact that aging has on both threshold volt- also instantaneous effects in which degradations are observed age (V ) and carrier mobility (µ) of transistors. This is within a very short time domain (e.g., 1µs) [2]. However, th this work considers only the long-term effects of aging. unlike state of the art which considers Vth only. We show how ignoring µ degradation leads to underestimating guard- Timing Guardband: To overcome aging, manufacturers bands by 19% on average. Our investigation revealed that typically employ a guardband (TG) on top of the critical path the impact of aging is strongly dependent on the operating delay (T ) of a design [3] to guarantee that it will always be conditions of gates (i.e. input signal slew and output load clocked at a sustainable frequency for the projected lifetime. f = 1 ; T (t = lifetime) = T (t = 0) + T . capacitance), and not solely on the duty cycle of transistors. T (t=lifetime) G Neglecting this fact results in employing insufficient guard- Recent technology nodes operating under decreased supply bands and thus not sustaining reliability during lifetime. voltages steadily narrow the available design space for these We demonstrate that degradation-aware libraries and tool guardbands. Thus, minimizing guardbands becomes an in- flows are indispensable for not only accurately estimating evitable design task that additionally needs to be considered. guardbands, but also efficiently containing them. By consid- Traditionally, guardbanding is treated as a post-synthesis ering aging degradations during logic synthesis, significantly optimization. However, to avoid large guardbands (which more resilient circuits can be obtained. We further quantify may not be tolerated any longer), aging degradations should the impact of aging on the degradation of image process- be considered during the logic synthesis itself in order to ob- ing circuits. This goes far beyond investigating aging with tain circuits that are inherently more resilient against aging. respect to path delays solely. We show that in a standard Commercial EDA flows have evolved over three decades of design without any guardbanding, aging leads to unaccept- research. They provide powerful capabilities for analyzing able image quality after just one year. By contrast, if the the timing behavior of circuits and thus precisely determin- synthesis tool is provided with the degradation-aware cell ing their critical path delay based on information provided library, high image quality is sustained for 10 years (even within the targeted cell library. In addition, logic synthesis under worst-case aging and without a guardband). Hence, can (also based on delay information within the targeted cell using our approach, aging can be effectively suppressed. library) efficiently optimize the circuit's netlist to maximize the performance. Therefore, bringing reliability awareness 1. INTRODUCTION to tool flows is essential not only to accurately estimate Technology scaling is reaching limits where displacing a guardbands (i.e. without under/over-estimation) but also few atoms within transistors due to aging phenomena may to optimize the circuits against aging and thus containing endanger the functionality of the entire design. Negative and guardbands (i.e. having small, yet sufficient guardbands). Positive Bias Temperature Instability (NBTI and PBTI) are In this paper, we propose to provide the synthesis tool with the most prominent of these phenomena, with the potential the degradation-aware cell library to allow it addressing ag- to remarkably degrade the electrical characteristics of pMOS ing concerns { even if it was not designed for that purpose. and nMOS transistors, respectively. They occur due to elec- Our main contributions are as follows: trical field stresses in transistors resulting in interface traps (1) We explore the role of operating conditions of a gate/cell in determining the overall impact of aging in the scope of both timing analysis and logic synthesis { this holds even Permission to make digital or hard copies of all or part of this work for personal or more for complex designs like processors. classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full cita- (2) By providing logic synthesis tools with the delay infor- tion on the first page. Copyrights for components of this work owned by others than mation of gates/cells under aging, we leverage mature opti- ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or re- mization algorithms to effectively suppress aging effects. publish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]. (3) To achieve our goals, we created 121 degradation-aware DAC’16, June 05-09, 2016, Austin, TX, USA cell libraries under varied aging scenarios. Libraries are pub- licly available at [1] and ready to be used with existing tool c 2016 ACM. ISBN 978-1-4503-4236-0/16/06. $15.00 flows (e.g., Synopsys) without requiring any modifications. DOI: http://dx.doi.org/10.1145/2897937.2898082 (a) NAND Gate (b) NOR Gate 0 46ps 31ps 37ps (Total) 64ps 18ps 26ps (Total) 350 -10 114ps 108ps -20 X4 X4 300 300 X1 X1 -30 1 X2 D Q 1 X2 D Q 250 +20 250 -40 X1 X1 200 0 Path1 200 -50 Path2 150 -20 150 -60 43ps (Total) 73ps (Total) 100 -40 -70 36ps 40ps 21ps 28ps 50 100 119ps 121ps -60 20 X4 X4 Delay Increase [%] X1 X1 0 50 16 1 X2 D Q 1 X2 D Q 0.96 -80 0.80 0.96 12 X1 X1 Input slew0.64 [ns] 20 0.80 16 0.64 8 0.48 12 0.48 -6.5% +16.1% +8.1% +14.3% +13.2% +8.5% 0.32 8 Input slew [ns]0.32 4 0.16 4 0.16 +4.4% +12.5% 0 0 Load capacitance [fF] 0 0 Load capacitance [fF] Figure 1: Impact of aging on the delay of NAND and NOR gates Figure 3: Motivational example showing how path1, which was demonstrating how it is driven by its operating conditions. critical before aging, became uncritical after aging. Single (OP C) Multiple (OP Cs) role in determining the impact that aging has on a gates' ] delay increase. Importantly, our results also revealed that 3 80 40 under some OP Cs, the delay of some gates improves instead 60 30 84% of being degraded. Figs. 1(a, b) show the impact of aging on two different gates (NAND and NOR, respectively). As 40 20 16% is shown in Fig. 1(a), a larger input signal slew magnifies the impact of aging on increasing the NAND's delay as it 20 10 leads to activating both the pull-up (pMOS) and pull-down Occurrence [#] 0 0 (nMOS) networks of the NAND simultaneously. Since the Occurrence [# x 10 degradations of NBTI in pMOS transistors are higher than 0 4 8 12 16 -60 -30 0 30 60 the degradations of PBTI in nMOS transistors [6], the pull- Delay increase [%] Delay increase [%] down network becomes relatively stronger and thus opposes Figure 2: Considering a single operating condition (OP C) solely, the pull-up network { especially for larger slews in which instead of multiple OP Cs, leads to erroneous aging estimations. the \ON" periods of pMOS and nMOS transistors overlap further. On the other hand, increasing the output load ca- 2. MOTIVATIONAL ANALYSIS: LINKING pacitance diminishes the impact of aging. Since it makes the NAND slower, it allows the gate to tolerate the degradations THE PHYSICAL AND SYSTEM LEVELS in its pMOS and nMOS transistors. The NOR gate exhibits In the following, we briefly explain how aging-induced de- a different behavior (Fig. 1(b)). Here, NBTI degradations fects at the physical level may propagate all the way up to make the opposing current from the pull-up network become the system level where they finally manifest themselves as smaller and hence the fall delay improves1 { especially for timing errors. The complexity of having to jointly consider larger input slews. Note that even though aging may im- multiple levels motivates the necessity of addressing aging prove the delay of some gates under specific OP Cs, it will within EDA tools to effectively optimize reliability. We ob- still make the overall circuit slower. The high increase in tained our results in Figs. (1, 2 and 3) from our proposed the delay of other gates within each path will usually com- methods in Section 4 which presents the core of this work. pensate the small decrease in some individual gates. Fig. 2 1) Physical/Device-Level: During the operation of a summarizes the impact that worst-case aging (i.e.
Recommended publications
  • UCLA Electronic Theses and Dissertations
    UCLA UCLA Electronic Theses and Dissertations Title Implications of Modern Semiconductor Technologies on Gate Sizing Permalink https://escholarship.org/uc/item/56s9b2tm Author Lee, John Publication Date 2012 Peer reviewed|Thesis/dissertation eScholarship.org Powered by the California Digital Library University of California University of California Los Angeles Implications of Modern Semiconductor Technologies on Gate Sizing A dissertation submitted in partial satisfaction of the requirements for the degree Doctor of Philosophy in Electrical Engineering by John Hyung Lee 2012 c Copyright by John Hyung Lee 2012 Abstract of the Dissertation Implications of Modern Semiconductor Technologies on Gate Sizing by John Hyung Lee Doctor of Philosophy in Electrical Engineering University of California, Los Angeles, 2012 Professor Puneet Gupta, Chair Gate sizing is one of the most flexible and powerful methods available for the timing and power optimization of digital circuits. As such, it has been a very well-studied topic over the past few decades. However, developments in modern semiconductor technologies have changed the context in which gate sizing is performed. The focus has shifted from custom design methods to standard cell based designs, which has been an enabler in the design of modern, large-scale designs. We start by providing benchmarking efforts to show where the state-of-the-art is in standard cell based gate sizing. Next, we develop a framework to assess the impact of the limited precision and range available in the standard cell library on the power-delay tradeoffs. In addition, shrinking dimensions and decreased manufacturing process control has led to variations in the performance and power of the resulting designs.
    [Show full text]
  • 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]
  • Universal Gate - NAND Digital Electronics 2.2 Intro to NAND & NOR Logic
    Universal Gate - NAND Digital Electronics 2.2 Intro to NAND & NOR Logic Universal Gate – NAND This presentation will demonstrate • The basic function of the NAND gate. • How a NAND gate can be used to replace an AND gate, an OR gate, or an INVERTER gate. • How a logic circuit implemented with AOI logic gates can Universal Gate – NAND be re-implemented using only NAND gates. • That using a single gate type, in this case NAND, will reduce the number of integrated circuits (IC) required to implement a logic circuit. Digital Electronics AOI Logic NAND Logic 2 More ICs = More $$ Less ICs = Less $$ NAND Gate NAND Gate as an Inverter Gate X X X (Before Bubble) X Z X Y X Y X Z X Y X Y Z X Z 0 0 1 0 1 Equivalent to Inverter 0 1 1 1 0 1 0 1 1 1 0 3 4 Project Lead The Way, Inc Copyright 2009 1 Universal Gate - NAND Digital Electronics 2.2 Intro to NAND & NOR Logic NAND Gate as an AND Gate NAND Gate as an OR Gate X X Y Y X X Z X Y X Y Y Z X Y X Y X Y Y NAND Gate Inverter Inverters NAND Gate X Y Z X Y Z 0 0 0 0 0 0 0 1 0 0 1 1 Equivalent to AND Gate Equivalent to OR Gate 1 0 0 1 0 1 1 1 1 1 1 1 5 6 NAND Gate Equivalent to AOI Gates Process for NAND Implementation 1.
    [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]
  • Predictive Aging of Reliability of Two Delay Pufs
    Predictive Aging of Reliability of two Delay PUFs Naghmeh Karimi1, Jean-Luc Danger2;3, Florent Lozac'h3, and Sylvain Guilley2;3 1 ECE Department, Rutgers University, Piscataway, NJ, USA 08854 [email protected] 2 LTCI, CNRS, T´el´ecom ParisTech, Universit´eParis-Saclay, 75013 Paris, France [email protected] 3 Secure-IC SAS, 35510 Cesson-S´evign´e,France [email protected] Abstract. To protect integrated circuits against IP piracy, Physically Unclonable Functions (PUFs) are deployed. PUFs provide a specific signature for each integrated circuit. However, environmental variations, (e.g., temperature change), power supply noise and more influential IC aging affect the functionally of PUFs. Thereby, it is important to evaluate aging effects as early as possible, preferentially at design time. In this paper we investigate the effect of aging on the stability of two delay PUFs: arbiter-PUFs and loop-PUFs and analyze the architectural impact of these PUFS on reliability decrease due to aging. We observe that the reliability of the arbiter-PUF gets worse over time, whereas the reliability of the loop-PUF remains constant. We interpret this phenomenon by the asymmetric aging of the arbiter, because one half is active (hence aging fast) while the other is not (hence aging slow). Besides, we notice that the aging of the delay chain in the arbiter-PUF and in the loop-PUF has no impact on their reliability, since these PUFs operate differentially. 1 Introduction With the advancement of VLSI technology, people are increasingly relying on electronic devices and in turn integrated circuits (ICs).
    [Show full text]
  • Static CMOS Circuits
    Static CMOS Circuits • Conventional (ratio-less) static CMOS – Covered so far • Ratio-ed logic (depletion load, pseudo nMOS) • Pass transistor logic ECE 261 Krish Chakrabarty 1 Example 1 module mux(input s, d0, d1, output y); assign y = s ? d1 : d0; endmodule 1) Sketch a design using AND, OR, and NOT gates. ECE 261 Krish Chakrabarty 2 1 Example 1 module mux(input s, d0, d1, output y); assign y = s ? d1 : d0; endmodule 1) Sketch a design using AND, OR, and NOT gates. ECE 261 Krish Chakrabarty 3 Example 2 2) Sketch a design using NAND, NOR, and NOT gates. Assume ~S is available. ECE 261 Krish Chakrabarty 4 2 Example 2 2) Sketch a design using NAND, NOR, and NOT gates. Assume ~S is available. ECE 261 Krish Chakrabarty 5 Bubble Pushing • Start with network of AND / OR gates • Convert to NAND / NOR + inverters • Push bubbles around to simplify logic – Remember DeMorgan’s Law ECE 261 Krish Chakrabarty 6 3 Example 3 3) Sketch a design using one compound gate and one NOT gate. Assume ~S is available. ECE 261 Krish Chakrabarty 7 Example 3 3) Sketch a design using one compound gate and one NOT gate. Assume ~S is available. ECE 261 Krish Chakrabarty 8 4 Compound Gates • Logical Effort of compound gates ECE 261 Krish Chakrabarty 9 Example 4 • The multiplexer has a maximum input capacitance of 16 units on each input. It must drive a load of 160 units. Estimate the delay of the NAND and compound gate designs. H = 160 / 16 = 10 B = 1 N = 2 ECE 261 Krish Chakrabarty 10 5 NAND Solution ECE 261 Krish Chakrabarty 11 NAND Solution ECE 261 Krish Chakrabarty 12 6 Compound Solution ECE 261 Krish Chakrabarty 13 Compound Solution ECE 261 Krish Chakrabarty 14 7 Example 5 • Annotate your designs with transistor sizes that achieve this delay.
    [Show full text]
  • A Fine-Grained 3D IC Technology with NP-Dynamic Logic
    Received 13 June 2016; revised 24 February 2017; accepted 8 March 2017. Date of publication 20 March 2017; date of current version 7 June 2017. Digital Object Identifier 10.1109/TETC.2017.2684781 NP-Dynamic Skybridge: A Fine-Grained 3D IC Technology with NP-Dynamic Logic JIAJUN SHI, MINGYU LI, MOSTAFIZUR RAHMAN, SANTOSH KHASANVIS, AND CSABA ANDRAS MORITZ J. Shi, M. Li, and C.A. Moritz are with the Department of Electrical and Computer Engineering, University of Massachusetts, Amherst, MA 01003 M. Rahman is with the School of Computing and Engineering, University of Missouri, Kansas City, MO 65211 S. Khasanvis is with BlueRISC Inc., Amherst, MA 01002 CORRESPONDING AUTHOR: J. SHI ([email protected]) ABSTRACT A new 3D IC fabric named NP-Dynamic Skybridge is proposed that provides fine-grained vertical 3D integration for future technology scaling. Relying on a template of vertical nanowires, it expands our prior work to incorporate and utilize both n- and p-type transistors in a novel NP-Dynamic circuit-style compatible with true 3D integration. This enables a wide range of elementary logics leading to more compact circuits, simple clocking schemes for cascading logic stages and low buffer requirement. We detail new design concepts for larger-scale circuits, and evaluate our approach using a 4-bit nanoprocessor implemented in 16 nm technology node. A new pipelining scheme specifically designed for our 3D NP-Dynamic circuits is employed in the nanoprocessor. We compare our approach with 2D CMOS as well as state-of-the-art tran- sistor-level monolithic 3D IC (T-MI) approach. Benchmarking results for the 4-bit nanoprocessor show bene- fits of up to 56.7x density, 3.8x power and 1.7x throughput over 2D CMOS.
    [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]
  • Chapter 6 - Combinational Logic Systems GCSE Electronics – Component 1: Discovering Electronics
    Chapter 6 - Combinational logic systems GCSE Electronics – Component 1: Discovering Electronics Combinational logic systems Learners should be able to: (a) recognise 1/0 as two-state logic levels (b) identify and use NOT gates and 2-input AND, OR, NAND and NOR gates, singly and in combination (c) produce a suitable truth table from a given system specification and for a given logic circuit (d) use truth tables to analyse a system of gates (e) use Boolean algebra to represent the output of truth tables or logic gates and use the basic Boolean identities A.B = A+B and A+B = A.B (f) design processing systems consisting of logic gates to solve problems (g) simplify logic circuits using NAND gate redundancy (h) analyse and design systems from a given truth table to solve a given problem (i) use data sheets to select a logic IC for given applications and to identify pin connections (j) design and use switches and pull-up or pull-down resistors to provide correct logic level/edge-triggered signals for logic gates and timing circuits 180 © WJEC 2017 Chapter 6 - Combinational logic systems GCSE Electronics – Component 1: Discovering Electronics Introduction In this chapter we will be concentrating on the basics of digital logic circuits which will then be extended in Component 2. We should start by ensuring that you understand the difference between a digital signal and an analogue signal. An analogue signal Voltage (V) Max This is a signal that can have any value between the zero and maximum of the power supply. Changes between values can occur slowly or rapidly depending on the system involved.
    [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]
  • –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]