DOCSLIB.ORG

Chapter 3 Digital Logic Analog Systems Digital Vs. Analog Two

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Chapter 3 Digital Logic Analog Systems Digital Vs. Analog Two Digital Logic Definition: Chapter 3 digit, n. any of the Arabic figures of 0 through 9. digital, adj. involving using digits to Boolean Algebra and Combinational represent discretely all variables occurring Networks in a given problem. logic, n. a particular method of reasoning or argumentation. J. C. Huang, 2003 Digital Logic Design 1 Analog Systems Digital vs. Analog Definition: Digital solution to a problem is analog, adj. that solve a given problem by advantageous in that it allows us to build using physical analogies, such as electric more reliable components and implement voltages or shaft rotations (which are more sophisticated functions. quantitatively continuous), of the numerical variables occurring in the problem. J. C. Huang, 2003 Digital Logic Design 2 J. C. Huang, 2003 Digital Logic Design 3 Two main types of logic circuit: General form of a combinational circuit: • Combinational (without memory) - chapters 2-6 x1 • Sequential (with memory) - chapters 7 and 8 f1(x1, x2, … xm) x2 f2(x1, x2, … xm) xm fn(x1, x2, … xm) J. C. Huang, 2003 Digital Logic Design 4 J. C. Huang, 2003 Digital Logic Design 5 1 For example, the behavior Truth table of the combinational circuit x to the right can be described f(x, y) • The behavior of a combinational circuit can by the truth table shown y below: always be specified by using a truth table. x y f(x, y) A truth table exhaustively 0 0 f(0, 0) lists all possible input-output 0 1 f(0, 1) pairs. 1 0 f(1, 0) 1 1 f(1, 1) J. C. Huang, 2003 Digital Logic Design 6 J. C. Huang, 2003 Digital Logic Design 7 Example of a truth table Three Basic Logic Devices x y f(x, y) 0 0 0 x x x NOT y OR z AND z 0 1 1 y y 1 0 1 yy OR x NOT x 01AND 0 1 1 1 0 0 1 00 1 00 0 xx 1 0 11 1 10 1 J. C. Huang, 2003 Digital Logic Design 8 J. C. Huang, 2003 Digital Logic Design 9 Logic symbols for the basic gates x y f(x, y) x 0 0 1 f(x, y) 0 1 1 x x x•y x+y y 1 0 0 y y 1 1 1 AND gate OR gate The intended function of this combinational circuit can be directly described by the truth table on the right, which can be represented by the Boolean function below: xx’ f(x, y) = x’y’ + x’y + xy NOT gate which can be realized by the logic circuit shown in the next slide. J. C. Huang, 2003 Digital Logic Design 10 J. C. Huang, 2003 Digital Logic Design 11 2 x xy y Algebra (Mathematical System) x’y f An algebra (or a mathematical system) consists of S = <S, o , o , …, o , r , r , …, r , c , c , …, c > x’y’ 1 2 k 1 2 m 1 2 n Realization of f(x, y) = x’y’ + x’y + xy where oi's are operations defined on S, ri's are relations defined among elements of S, and ci's are constants, some elements of S having some special significance. x Furthermore, it satisfies a set of axioms or postulates y f that governs its behavior. Minimal realization of f(x, y) J. C. Huang, 2003 Digital Logic Design 12 J. C. Huang, 2003 Digital Logic Design 13 Boolean Algebras Boolean Algebras (continued) A Boolean algebra is a mathematical system: 2a. Existence of identity: there exists an element in B, denoted by 0, such that x+0=x for any x ∈ B. • B = <B, +, , =, 0, 1> 2b. Existence of identity: there exists an element in B, denoted by 1, such that x•1=x for any x ∈ B. that satisfies the following postulates: 3a. Commutativity: for any x, y ∈ B, x+y = y+x. ∈ ∈ 1a. Closure: for any x, y B, x+y B. 3b. Commutativity: for any x, y ∈ B, x•y = y•x. 1b. Closure: for any x, y ∈ B, x•y ∈ B. J. C. Huang, 2003 Digital Logic Design 14 J. C. Huang, 2003 Digital Logic Design 15 Boolean Algebras (continued) Boolean Algebras (continued) 4a. Distributive law: for any x, y, z ∈ B, 6. There exists at least two elements in B x•(y+z) = (x•y)+(x•z). These are known as the Huntington postulates. 4b. Distributive law: for any x, y, z ∈ B, x+(y•z) = (x+y)•(x+z). 5. For any element x ∈ B there exists an element x' ∈ B such that (a) x+x'=1 and (b) x•x'=0. J. C. Huang, 2003 Digital Logic Design 16 J. C. Huang, 2003 Digital Logic Design 17 3 Huntington postulates Theorems 1. (a) x+y ∈ B (b) x•y ∈ B Thm 1: The element x’ in a Boolean algebra is 2. (a) x+0 = 0+x = x (b) x•1 = 1•x = x uniquely determined by x. 3. (a) x+y = y+x (b) x•y = y•x Thm 2: • 4. (a) x+(y•z) = (x+y)•(x+z) (a) x + 1 = 1 (b) x 0 = 0 (b) x•(y+z) = x•y+x•z Thm 3: (involution) 5. (a) x+x' = 1 (b) x•x' = 0 (a) 0’ = 1 (b) 1’ = 0 6. |B| ≥ 2 J. C. Huang, 2003 Digital Logic Design 18 J. C. Huang, 2003 Digital Logic Design 19 Theorems (continued) Theorems (continued) Thm 4: (both operations are idempotent) Thm 7: (a) x + x = x (b) x • x = x (a) x + x’y = x + y (b) x(x’ + y) = xy Thm 5: (involution) Thm 8: (associativity) (x')' = x (a) (x + y) + z = x + (y + z) Thm 6: (absorption) (b) (x • y) • z = x • (y • z) • (a) x + xy = x (b) x (x+y) = x Thm 9: (De Morgan's Law) (a) (x+y)'=x'•y' (b) (x•y)'=x'+y' J. C. Huang, 2003 Digital Logic Design 20 J. C. Huang, 2003 Digital Logic Design 21 Theorems (continued) Dual Thm 10: Given an expression in Boolean algebra, its B = 〈 {0, 1}, +, •, = 〉, where the two dual is obtained by replacing every "+" operations are defined as shown below is a operator with "•" operator, and vice versa, Boolean algrbra. and by replacing every 0 with 1, and vice x+y y x•y y versa. +01 • 01 001 000 x x 111 101 J. C. Huang, 2003 Digital Logic Design 22 J. C. Huang, 2003 Digital Logic Design 23 4 Principle of duality Perfect induction The dual of any true statement in Boolean • Perfect induction is proof by exhaustion in algebra is also a true statement. which all possibilities are considered. J. C. Huang, 2003 Digital Logic Design 24 J. C. Huang, 2003 Digital Logic Design 25 The concept of a function Truth table and function • It is a one-to-one or many-to-one mapping. • A truth table, therefore, describes a • The preceding truth table describes a function. mapping of a set of pairs of 0’s and 1’s into • A truth table can be represented by using a a set consisting of 0 and 1, viz., Boolean expression, i.e., an expression → → <0, 0> 0 <0, 1> 1 written in terms of the language of Boolean <1, 0> → 1 <1, 1> → 0 algebra. • That mapping is a function because it is many-to-one. J. C. Huang, 2003 Digital Logic Design 26 J. C. Huang, 2003 Digital Logic Design 27 Truth table and Boolean function Literals and product/sum terms • An output of a combinational circuit, which •A literal is defined as each occurrence of can be exhaustively listed on a column in either a complemented or uncomplemented the truth table, can also be described by a variable in a Boolean expression. Boolean expression. •A product term is a literal or a product (i.e., • The Boolean expression can be constructed AND together, or conjunction) of literals. as explained below. •A sum term is a literal or a sum (i.e., OR together, or disjunction) of literals. J. C. Huang, 2003 Digital Logic Design 28 J. C. Huang, 2003 Digital Logic Design 29 5 Minterms of 2 variables Minterms minterm that is x y m-notation • A minterm is a product term in which all evaluated to 1 variables occur exactly once, either 0 0 x’y’ m0 complemented or uncomplemented. • A minterm has the property that it is 0 1 x’y m1 evaluated to 1 on one and only one row of 1 0 xy’ m the truth table. 2 1 1 xy m3 J. C. Huang, 2003 Digital Logic Design 30 J. C. Huang, 2003 Digital Logic Design 31 Minterms of 3 variables minterm that is → x y z m-notation Truth table Boolean expression evaluated to 1 0 0 0 x’y’z’ m 0 • The function described by a truth table can 0 0 1 x’y’z m1 also be described by a sum (i.e., OR 0 1 0 x’yz’ m2 together, or disjunction) of minterms. 0 1 1 x’yz m 3 • The minterms involved are those, and only 1 0 0 xy’z’ m4 those, associated with the rows on which 1 0 1 xy’z m5 the minterm is evaluated to 1. 1 1 0 xyz’ m6 1 1 1 xyz m7 J. C. Huang, 2003 Digital Logic Design 32 J. C. Huang, 2003 Digital Logic Design 33 Thus the following function can be described as f(x, y, z) = x’yz’ + xy’z + xyz f(x, y) = x’y’ + xy’ x y z f(x, y z) 0 0 0 0 x y f(x, y) 0 0 1 0 0 0 1 0 1 0 1 0 1 1 0 0 1 0 1 0 0 0 1 0 1 1 1 0 1 1 1 0 0 1 1 0 1 1 1 1 J.
Load more

Recommended publications
  • Episode 5.02 – NAND Logic
    Episode 5.02 – NAND Logic Welcome to the Geek Author series on Computer Organization and Design Fundamentals. I’m David Tarnoff, and in this series, we are working our way through the topics of Computer Organization, Computer Architecture, Digital Design, and Embedded System Design. If you’re interested in the inner workings of a computer, then you’re in the right place. The only background you’ll need for this series is an understanding of integer math, and if possible, a little experience with a programming language such as Java. And one more thing. Our topics involve a bit of figuring, so it might help to keep a pencil and paper handy. In our last episode, we covered three attributes of the sum-of-product expression including its general format and the benefits derived from it, a method to generate a truth table from a given sum-of- products expression, and lastly, a simple procedure we can use to create the proper sum-of-products expression from a given truth table. In this episode, we’re going to look at a fourth attribute. While this last trait may appear to be no more than an interesting exercise in Boolean algebra, it turns out that it offers several benefits when we implement our SOP expressions with digital circuitry. In Episode 4.08 – DeMorgan’s Theorem, we showed how an inverter can be distributed across the inputs of an AND or an OR gate by flipping the operation. In other words, we can distribute an inverter from the output of an AND gate across all the gate’s inputs as long as we change the gate operation to an OR.
    [Show full text]
  • ECSE-4760 Real-Time Applications in Control & Communications
    Rensselaer Polytechnic Institute ECSE-4760 Real-Time Applications in Control & Communications EXPERIMENTS IN DIGITAL LOGIC DESIGN Number of Sessions – 4 INTRODUCTION Over the past few decades the digital world has come into its own. Even though engineering has gone into specialization, it is necessary to understand digital circuits to be able to communicate with others. This experiment attempts to teach a simple method of designing digital circuits. Due to the quick pace of the lab, it is highly recommended that you read one of the references. This will enable you to proceed quickly through the preliminary problems so you will have more time for the design problems. The following is an outline of the experiment. Following each section will be a set of questions that should be answered to show an understanding of the material presented. Any difficulties should be referred to a reference or your instructor. You should use the DesignWorks (LogicWorks or any other you may have) logic circuit simulator on the Macintosh after most sections to cement together all the preceding sections. BACKGROUND THEORY Boolean Algebra Switching Algebra Combinational Logic Minimization Flip-Flops and Registers Counters Synthesis of Synchronous Circuits EXPERIMENTAL PROCEDURE Questions and Problems Simulator Operation & FPGA Implementation REFERENCES It is required that you show all circuits, as built, in your write-up. Please include equations too. The first part of the procedure section contains all the questions and problems to be answered and the second part describes the use of DesignWorks. Note: all references to DesignWorks (on Macintosh computers) throughout this procedure may be replaced with LogicWorks on the lab Windows PCs.
    [Show full text]
  • Digital Logic Design
    Digital Logic Design Chapter 3 Gate-Level Minimization Nasser M. Sabah Outline of Chapter 3 2 Introduction The Map Method Four-Variable Map Five-Variable Map Product of Sums Simplification NAND & NOR Implementation Other Two-Level Implementations Exclusive-OR Function Introduction 3 Gate-level minimization refers to the design task of finding an optimal gate-level implementation of Boolean functions describing a digital circuit. The Map Method 4 The complexity of the digital logic gates The complexity of the algebraic expression Logic minimization Algebraic approaches: lack specific rules The Karnaugh map A simple straight forward procedure A pictorial form of a truth table A diagram made up of squares Each square represents one minterm of the function that is to be minimized. Review of Boolean Function 5 Boolean function Sum of minterms Sum of products (or product of sum) in the simplest form A minimum number of terms A minimum number of literals The simplified expression may not be unique Two-Variable Map 6 A two-variable map Four minterms x' = row 0; x = row 1 y' = column 0; y = column 1 A truth table in square diagram Figure 3.1 Two-variable Map xy m3 xym 1 m 2 m 3 xyxy'' xy Representation of functions in the map Three-Variable Map 7 A three-variable map Eight minterms The Gray code sequence Any two adjacent squares in the map differ by only on variable. Primed in one square and unprimed in the other. e.g., m5 and m7 can be simplified. m57 m xy'(') z xyz xz y y xz Three-variable Map Three-Variable
    [Show full text]
  • Lab 1: Study of Gates & Flip-Flops
    Lab 1: Study of Gates & Flip-flops Aim To familiarize with circuit implementations using ICs and test the behavior of different logic gates and Flip-flops. Hardware Requirement a. Equipments - Digital IC Trainer Kit b. Discrete Components - 74LS00 Quad 2-Input NAND gate 74LS02 Quad 2-Input NOR gate 74LS04 Hex 1-Input NOT gate 74LS08 Quad 2-Input AND gate 74LS10 Triple 3-Input NAND gate 74LS11 Triple 3-Input AND gate 74LS32 Quad 2-Input OR gate 74LS86 Quad 2-Input XOR 74LS73 JK-Flip flop 74LS74 D Flip flop Background Digital logic devices are the circuits that electronically perform logic operations on binary variables. The binary information is represented by high and low voltage levels, which the device processes electronically. The devices that perform the simplest of the logic operations (such as AND, OR, NAND, etc.) are called gates. For example, an AND gate electronically computes the AND of the voltage encoded binary signals appearing at its inputs and presents the voltage encoded result at its output. The digital logic circuits used in this laboratory are contained in integrated circuit (IC) packages, with generally 14 or 16 pins for electrical connections. Each IC is labeled (usually with an 74LSxx number) to identify the logic it performs. The logic diagrams and pin connections for these IC’s are described in the TTL Data Book by Texas Instruments1. The transistor-transistor logic(TTL) IC’s used in this laboratory require a 5.0 volt power supply for operation. TTL inputs require a voltage greater than 2 volts to represent a binary 1 and a voltage less than 0.8 volts to represent a binary 0.
    [Show full text]
  • Realization of Morphing Logic Gates in a Repressilator with Quorum Sensing Feedback
    Realization of Morphing Logic Gates in a Repressilator with Quorum Sensing Feedback Vidit Agarwal, Shivpal Singh Kang and Sudeshna Sinha Indian Institute of Science Education and Research (IISER) Mohali, Knowledge City, SAS Nagar, Sector 81, Manauli PO 140 306, Punjab, India Abstract We demonstrate how a genetic ring oscillator network with quorum sensing feedback can operate as a robust logic gate. Specifically we show how a range of logic functions, namely AND/NAND, OR/NOR and XOR/XNOR, can be realized by the system, thus yielding a versatile unit that can morph between different logic operations. We further demonstrate the capacity of this system to yield complementary logic operations in parallel. Our results then indicate the computing potential of this biological system, and may lead to bio-inspired computing devices. arXiv:1310.8267v1 [physics.bio-ph] 30 Oct 2013 1 I. INTRODUCTION The operation of any computing device is necessarily a physical process, and this funda- mentally determines the possibilities and limitations of the computing machine. A common thread in the history of computers is the exploitation and manipulation of different natural phenomena to obtain newer forms of computing paradigms [1]. For instance, chaos comput- ing [2], neurobiologically inspired computing, quantum computing[3], and DNA computing[4] all aim to utilize, at the basic level, some of the computational capabilities inherent in natural systems. In particular, larger understanding of biological systems has triggered the interest- ing question: what new directions do bio-systems offer for understanding and implementing computations? The broad idea then, is to create machines that benefit from natural phenomena and utilize patterns inherent in systems to encode inputs and subsequently obtain a desired output.
    [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]
  • New Approaches for Memristive Logic Computations
    Portland State University PDXScholar Dissertations and Theses Dissertations and Theses 6-6-2018 New Approaches for Memristive Logic Computations Muayad Jaafar Aljafar Portland State University Let us know how access to this document benefits ouy . Follow this and additional works at: https://pdxscholar.library.pdx.edu/open_access_etds Part of the Electrical and Computer Engineering Commons Recommended Citation Aljafar, Muayad Jaafar, "New Approaches for Memristive Logic Computations" (2018). Dissertations and Theses. Paper 4372. 10.15760/etd.6256 This Dissertation is brought to you for free and open access. It has been accepted for inclusion in Dissertations and Theses by an authorized administrator of PDXScholar. For more information, please contact [email protected]. New Approaches for Memristive Logic Computations by Muayad Jaafar Aljafar A dissertation submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy in Electrical and Computer Engineering Dissertation Committee: Marek A. Perkowski, Chair John M. Acken Xiaoyu Song Steven Bleiler Portland State University 2018 © 2018 Muayad Jaafar Aljafar Abstract Over the past five decades, exponential advances in device integration in microelectronics for memory and computation applications have been observed. These advances are closely related to miniaturization in integrated circuit technologies. However, this miniaturization is reaching the physical limit (i.e., the end of Moore’s Law). This miniaturization is also causing a dramatic problem of heat dissipation in integrated circuits. Additionally, approaching the physical limit of semiconductor devices in fabrication process increases the delay of moving data between computing and memory units hence decreasing the performance. The market requirements for faster computers with lower power consumption can be addressed by new emerging technologies such as memristors.
    [Show full text]
  • Voltage Controlled Memristor Threshold Logic Gates, 2016 IEEE APCCAS, Jeju, Korea, October 25-28, 2016
    A. Maan, A. P. James, Voltage Controlled Memristor Threshold Logic Gates, 2016 IEEE APCCAS, Jeju, Korea, October 25-28, 2016 Voltage Controlled Memristor Threshold Logic Gates Akshay Kumar Maan Alex Pappachen James Queensland Microelectronic Facility School of Engineering, Nazabayev University Griffith University Astana, Kazakhastan Queensland 4111, Australia Web: www.biomicrosystems.info/alex Email: [email protected] Email: [email protected] Abstract—In this paper, we present a resistive switching weights to the inputs, while the CMOS inverter behaves as memristor cell for implementing universal logic gates. The cell a threshold logic device. The weights are programmed via has a weighted control input whose resistance is set based on a the resistive switching phenomenon of the memristor device. control signal that generalizes the operational regime from NAND We show that resistive switching makes it possible to use the to NOR functionality. We further show how threshold logic in same cell architecture to work in the NAND, NOR or XOR the voltage-controlled resistive cell can be used to implement a configuration, and can be implemented in a programmable XOR logic. Building on the same principle we implement a half adder and a 4-bit CLA (Carry Look-ahead Adder) and show array architecture. We hypothesise that if such circuits are that in comparison with CMOS-only logic, the proposed system developed in silicon that can be programmed and reused to shows significant improvements in terms of device area, power generate different logic gate functionalities, we will be able to dissipation and leakage power. move a step closer towards the development of low power and large scale threshold logic applications.
    [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]
  • Switching Theory and Logic Design
    SWITCHING THEORY AND LOGIC DESIGN LECTURE NOTES B.TECH (II YEAR – II SEM) (2018-19) Prepared by: Ms M H Bindu Reddy, Assistant Professor Department of Electrical & Electronics Engineering MALLA REDDY COLLEGE OF ENGINEERING & TECHNOLOGY (Autonomous Institution – UGC, Govt. of India) Recognized under 2(f) and 12 (B) of UGC ACT 1956 (Affiliated to JNTUH, Hyderabad, Approved by AICTE - Accredited by NBA & NAAC – ‘A’ Grade - ISO 9001:2015 Certified) Maisammaguda, Dhulapally (Post Via. Kompally), Secunderabad – 500100, Telangana State, India SYLLABUS UNIT -I: Number System and Gates: Number Systems, Base Conversion Methods, Complements of Numbers, Codes- Binary Codes, Binary Coded Decimal Code and its Properties, Excess-3 code, Unit Distance Code, Error Detecting and Correcting Codes, Hamming Code.Digital Logic Gates, Properties of XOR Gates, Universal Logic Gates. UNIT -II: Boolean Algebra and Minimization: Basic Theorems and Properties, Switching Functions, Canonical and Standard Forms,Multilevel NAND/NOR realizations. K- Map Method, up to Five variable K- Maps, Don’t Care Map Entries, Prime and Essential prime Implications, Quine Mc Cluskey Tabular Method UNIT -III: Combinational Circuits Design: Combinational Design, Half adder,Fulladder,Halfsubtractor,Full subtractor,Parallel binary adder/subtracor,BCD adder, Comparator, decoder, Encoder, Multiplexers, DeMultiplexers, Code Converters. UNIT -IV: Sequential Machines Fundamentals: Introduction, Basic Architectural Distinctions between Combinational and Sequential circuits, classification of sequential circuits, The binary cell, The S-R- Latch Flip-Flop The D-Latch Flip-Flop, The “Clocked T” Flip-Flop, The “ Clocked J-K” Flip-Flop, Design of a Clocked Flip-Flop, Conversion from one type of Flip-Flop to another, Timing and Triggering Consideration. UNIT -V: Sequential Circuit Design and Analysis: Introduction, State Diagram, Analysis of Synchronous Sequential Circuits, Approaches to the Design of Synchronous Sequential Finite State Machines, Design Aspects, State Reduction, Design Steps, Realization using Flip-Flops.
    [Show full text]
  • Boolean Algebra and Logic Gates
    BOOLEAN ALGEBRA AND Chapter 3 LOGIC GATES 3.1 INTRODUCTION inary logic deals with variables that have two discrete values—1 for TRUE and 0 for FALSE. A simple switching circuit containing active elements such as a diode and Btransistor can demonstrate the binary logic, which can either be ON (switch closed) or OFF (switch open). Electrical signals such as voltage and current exist in the digital system in either one of the two recognized values, except during transition. The switching functions can be expressed with Boolean equations. Complex Boolean equations can be simplifi ed by a new kind of algebra, which is popularly called Switching Algebra or Boolean Algebra, invented by the mathematician George Boole in 1854. Boolean Algebra deals with the rules by which logical operations are carried out. 3.2 BASIC DEFINITIONS Boolean algebra, like any other deductive mathematical system, may be defi ned with a set of elements, a set of operators, and a number of assumptions and postulates. A set of elements means any collection of objects having common properties. If S denotes a set, and X and Y are certain objects, then X ∈ S denotes X is an object of set S, whereas Y ∉ denotes Y is not the object of set S. A binary operator defi ned on a set S of elements is a rule that assigns to each pair of elements from S a unique element from S. As an example, consider this relation X*Y = Z. This implies that * is a binary operator if it specifi es a rule for fi nding Z from the objects ( X, Y ) and also if all X, Y, and Z are of the same set S.
    [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]