DOCSLIB.ORG

Karnaugh Map Method for Memristive and Spintronic Asymmetric Basis Logic Functions

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Karnaugh Map Method for Memristive and Spintronic Asymmetric Basis Logic Functions 128 IEEE TRANSACTIONS ON COMPUTERS, VOL. 70, NO. 1, JANUARY 2021 Karnaugh Map Method for Memristive and Spintronic Asymmetric Basis Logic Functions Vaibhav Vyas , Lucian Jiang-Wei, Peng Zhou, Student Member, IEEE, Xuan Hu , Student Member, IEEE, and Joseph S. Friedman , Senior Member, IEEE Abstract—The development of beyond-CMOS technologies with alternative basis logic functions necessitates the introduction of novel design automation techniques. In particular, recently proposed computing systems based on memristors and bilayer avalanche spin-diodes both provide asymmetric functions as basis logic gates - the implication and inverted-input AND, respectively. This article therefore proposes a method by which Karnaugh maps can be directly applied to systems with asymmetric basis logic functions. A set of identities is defined for these memristor and spintronic logic functions, enabling the formal demonstration of the Karnaugh map method and an explanation of the proposed technique. This method thus, enables the direct minimization of spintronic and memristive logic circuits without translation to conventional Boolean algebra, facilitating the further development of these novel computing paradigms. Preliminary analyses demonstrate that this Karnaugh map minimization approach can provide a 28 percent reduction in step count as compared to previous manual optimization. Index Terms—Boolean algebra, beyond-CMOS computing, asymmetric logic, emerging technologies, memristors, spintronics Ç 1INTRODUCTION MERGING computing technologies provide unconven- implementation. For example, [13] minimizes a large func- Etional basis logic sets that introduce new challenges for tion into NAND, OR, and parity gates, which are then real- computing system design and integration. In particular, ized with memristors; [14] minimizes a function into OR and stateful logic based on memristors efficiently provides the inverter gates; [15] uses NOT, NAND, and OR gates; [16] implication and NAND functions, while a single bilayer ava- uses majority gates; [17] minimizes the number of memris- lanche spin-diode device can perform either an inverted- tors (but not the step count); and [18] minimizes functions input AND (IAND) function or an OR function (see Figs. 1, 2, with the assistance of CMOS buffer circuits. Binary decision and 3). However, both the implication and IAND functions diagrams have also been used [19], as has an interpretation are non-commutative and asymmetric, inhibiting the use of of memristors as threshold logic elements [20]. As all of these conventional techniques for logic design. Many of these con- techniques minimize circuits with conventional symmetric ventional techniques are based on Maurice Karnaugh’s 1953 logic functions and then implement these circuits with mem- proposal for a map method for the minimization of Boolean ristors, the circuit that is realized does not fully exploit the logic [1]. Karnaugh’s map method enables logic minimiza- fundamental basis logic operations provided by memristors. tion based on the AND and OR functions, while various logic Though helpful in significantly reducing circuit complexity, concepts based on memristors and spintronic devices pro- none of the previous works provide a technique for realizing vide basis logic gates for which there is no efficient technique a fully minimized circuit with asymmetric logic functions for translation to AND and OR gates [2], [3], [4], [5], [6], [7], that takes into account the true physical capabilities of these [8], [9], [10], [11], [12], preventing direct application of the devices. Karnaugh map. A previous work in the related field of quantum comput- Logic minimization for stateful memristor logic has previ- ing shows the advantage of using Karnaugh maps as the ously been investigated, but has not resulted in a minimiza- starting point of logic manipulation for unusual logic func- tion technique that fully exploits asymmetric logic functions. tions which lead to a gate and operation count reduction In much of the previous work, logic minimization is compared to previous methods at the time. Similar to the performed with a basis set of conventional logic functions, asymmetric logic gates addressed in this paper, quantum cir- with each basis logic gate mapped to an efficient memristor cuits do not support conventional logic functions, and thus modifications of the conventional techniques are needed in order to process them natively, in an efficient manner. The authors are with the Department of Electrical and Computer Engineer- The Karnaugh map method is an effective visual approach ing, University of Texas at Dallas, Richardson, TX 75080 USA. E-mail: [email protected], {Lucian.Jiang-Wei, peng.zhou, xuan.hu, for minimizing simple logical computations, and adapting joseph.friedman}@utdallas.edu. the Karnaugh map method is therefore a natural first step Manuscript received 26 Sept. 2019; revised 9 Feb. 2020; accepted 5 Apr. 2020. towards enabling efficient logic minimization for unconven- Date of publication 13 Apr. 2020; date of current version 11 Dec. 2020. tional computing systems. For example, previous results (Corresponding author: Joseph S. Friedman.) with Karnaugh maps adapted for quantum circuits [21] illus- Recommended for acceptance by A. L. E. Digital Object Identifier no. 10.1109/TC.2020.2986970 trate the potential of Karnaugh maps for minimizing unusual 0018-9340 ß 2020 IEEE. Personal use is permitted, but republication/redistribution requires IEEE permission. See https://www.ieee.org/publications/rights/index.html_ for more information. Authorized licensed use limited to: Univ of Texas at Dallas. Downloaded on December 13,2020 at 22:26:17 UTC from IEEE Xplore. Restrictions apply. VYAS ET AL.: KARNAUGH MAP METHOD FOR MEMRISTIVE AND SPINTRONIC ASYMMETRIC BASIS LOGIC FUNCTIONS 129 Fig. 1. Schematic of memristive implication logic, where voltages applied Fig. 3. Bilayer avalanche spin-diode, where the magnetic fields due to to the memristors modulate the resistance state. input currents A and B modulate the output current. enables the development of an algebra and Karnaugh map logic functions. This paper therefore proposes modifications method that enables logic minimization for both stateful of Karnaugh’s map method that enable the reduction of com- memristor logic and bilayer avalanche spin-diode logic. plex asymmetric logic functions directly into minimized stateful memristor logic circuits and bilayer avalanche spin- 2.1 Stateful Memristor Logic diode logic circuits. The component devices are described in A memristor (or, more generally, a memristive device) is a Section 2, and their asymmetric logic functionality is two-terminal non-volatile device with a resistance that can explained. Section 3 formally details the algebraic underpin- be modified through application of a voltage across the two nings of the proposed Karnaugh map method through neces- terminals [22], [23]. In general, the resistance is on a spectrum sary proofs of logical identities. The modified map method is determined by the history of applied voltages; in the ideal proposed and explained in Section 4, and examples are pro- case, applied voltages above a threshold magnitude switch a vided to enable its practical use. The approach is used to memristor between purely resistive and conductive states. algorithmically design a one-bit full adder in Section 5, dem- The memristors shown in Fig. 1 switch to a conductive ‘1’ onstrating the utility of this Karnaugh map approach in the state when VP À VN >VTH , and a resistive ‘0’ state when manipulation of asymmetric logic. Finally, conclusions are VN À VP >VTH , where VN is the voltage at node N, VP is the presented in Section 6. voltage at node P, and VTH is the threshold voltage. In some physical implementations, the resistance state is a result of the growth and retraction of a metallic filament [24]. 2BACKGROUND As shown in Table 1, the implication function OUT ¼ A ! B V V The asymmetric basis logic functions provided by stateful is performed by applying COND to memristor A and SET V <V <V V memristor logic and bilayer avalanche spin-diode logic can be to memristor B, where COND TH SET and SET À V <V 000 performed compactly, but an applicable device count reduc- COND TH [25]. When memristor A is in the resistive V tion method requires the development of techniques tailored state, the SET voltage across memristor B is greater than V 1 to these functions. In particular, the implication function can TH , causing memristor B to switch to the conductive ‘ ’ state 1 be performed by two non-volatile memristors, while a NAND or remain in that state. If memristor A is in the conductive ‘ ’ V V function can be performed by three such memristors. In state, the voltage across memristor B is SET À COND; as this V bilayer avalanche spin-diode logic, a single device can per- is less than TH , no switching occurs. This implication func- form the IAND and OR functions. The implication and IAND tion (IMPLY) can thus be performed by two memristors in a functions are both non-commutative and asymmetric, and single step, while a NAND function can be performed simi- their integration with NAND and OR functions, respectively, larly with three memristors in two steps [7], [13]. Cascaded logic operations are performed in a unique manner within the stateful memristor logic paradigm: rather than each cascaded operation being performed by a distinct set of devices, the memristors are continually reused through a step-wise application of VSET and VCOND voltages. Table
Load more

Recommended publications
  • Boolean Algebra
    Boolean Algebra Definition: A Boolean Algebra is a math construct (B,+, . , ‘, 0,1) where B is a non-empty set, + and . are binary operations in B, ‘ is a unary operation in B, 0 and 1 are special elements of B, such that: a) + and . are communative: for all x and y in B, x+y=y+x, and x.y=y.x b) + and . are associative: for all x, y and z in B, x+(y+z)=(x+y)+z, and x.(y.z)=(x.y).z c) + and . are distributive over one another: x.(y+z)=xy+xz, and x+(y.z)=(x+y).(x+z) d) Identity laws: 1.x=x.1=x and 0+x=x+0=x for all x in B e) Complementation laws: x+x’=1 and x.x’=0 for all x in B Examples: • (B=set of all propositions, or, and, not, T, F) • (B=2A, U, ∩, c, Φ,A) Theorem 1: Let (B,+, . , ‘, 0,1) be a Boolean Algebra. Then the following hold: a) x+x=x and x.x=x for all x in B b) x+1=1 and 0.x=0 for all x in B c) x+(xy)=x and x.(x+y)=x for all x and y in B Proof: a) x = x+0 Identity laws = x+xx’ Complementation laws = (x+x).(x+x’) because + is distributive over . = (x+x).1 Complementation laws = x+x Identity laws x = x.1 Identity laws = x.(x+x’) Complementation laws = x.x +x.x’ because + is distributive over .
    [Show full text]
  • Algorithm for Two-Level Simplification (Example)
    CSE 370 Spring 2006 Administrivia Introduction to Digital Design Homework 3 due Friday Lecture 8: Introduction to Verilog Last Lecture Design Examples a K-maps Minimization Algorithm Today Introduction to Verilog Algorithm for two-level simplification Algorithm for two-level Algorithm: minimum sum-of-products expression from a Karnaugh map simplification (example) A A A Step 1: choose an element of the ON-set X101 X101 X101 Step 2: find "maximal" groupings of 1s and Xs adjacent to that 0111 0111 0111 element D D D consider top/bottom row, left/right column, and corner 0XX0 0XX0 0XX0 adjacencies C C C this forms prime implicants (number of elements always a power 0101 0101 0101 of 2) B B B 2 primes around A'BC'D' 2 primes around ABC'D Repeat Steps 1 and 2 to find all prime implicants A A A Step 3: revisit the 1s in the K-map X101 X101 X101 if covered by single prime implicant, it is essential, and 0111 0111 0111 participates in final cover D D D 1s covered by essential prime implicant do not need to be 0XX0 0XX0 0XX0 revisited C C C Step 4: if there remain 1s not covered by essential prime implicants 0101 0101 0101 B B B select the smallest number of prime implicants that cover the 3 primes around AB'C'D' 2 essential primes minimum cover (3 primes) remaining 1s Visit All in the On Set? Activity List all prime implicants for the following K-map: A A 00X001X0 X0X0 0111X1 01X1 CD’ D BC BD AB AC’D D CD’ BC BD AB AC’D 010X11X0 0XX0 C C 00X10111 X111 B B CD’ BD AC’D CD’ BD AC’D Which are essential prime implicants? CD’ BD AC’D CD’ BD AC’D What
    [Show full text]
  • Combinational Logic Circuits
    CHAPTER 4 COMBINATIONAL LOGIC CIRCUITS ■ OUTLINE 4-1 Sum-of-Products Form 4-10 Troubleshooting Digital 4-2 Simplifying Logic Circuits Systems 4-3 Algebraic Simplification 4-11 Internal Digital IC Faults 4-4 Designing Combinational 4-12 External Faults Logic Circuits 4-13 Troubleshooting Prototyped 4-5 Karnaugh Map Method Circuits 4-6 Exclusive-OR and 4-14 Programmable Logic Devices Exclusive-NOR Circuits 4-15 Representing Data in HDL 4-7 Parity Generator and Checker 4-16 Truth Tables Using HDL 4-8 Enable/Disable Circuits 4-17 Decision Control Structures 4-9 Basic Characteristics of in HDL Digital ICs M04_WIDM0130_12_SE_C04.indd 136 1/8/16 8:38 PM ■ CHAPTER OUTCOMES Upon completion of this chapter, you will be able to: ■■ Convert a logic expression into a sum-of-products expression. ■■ Perform the necessary steps to reduce a sum-of-products expression to its simplest form. ■■ Use Boolean algebra and the Karnaugh map as tools to simplify and design logic circuits. ■■ Explain the operation of both exclusive-OR and exclusive-NOR circuits. ■■ Design simple logic circuits without the help of a truth table. ■■ Describe how to implement enable circuits. ■■ Cite the basic characteristics of TTL and CMOS digital ICs. ■■ Use the basic troubleshooting rules of digital systems. ■■ Deduce from observed results the faults of malfunctioning combina- tional logic circuits. ■■ Describe the fundamental idea of programmable logic devices (PLDs). ■■ Describe the steps involved in programming a PLD to perform a simple combinational logic function. ■■ Describe hierarchical design methods. ■■ Identify proper data types for single-bit, bit array, and numeric value variables.
    [Show full text]
  • Final Book -Architecture.Pdf
    1 BHARATHIDASAN UNIVERSITY (Re-accredited with ‘A’ Grade by NAAC) CENTRE FOR DISTANCE EDUCATION PALKALAIPERUR, TIRUCHIRAPPALLI – 24 MCA / PGDCA I - Semester Computer Organization and Architecture CORE COURSE III (Full Package) Copy right reserved For Private Circulation only 2 Chairman: Dr. V.M Muthukumar Vice-Chancellor Bharathidasan University Tiruchirappalli – 620 024. Co-Ordinator: Dr. R.Babu Rajendren Registrar i/c Centre for Distance Education Bharathidasan University Tiruchirappalli – 620 024. Course Director: Dr.V.Vinod Kumar Director i/c Centre for Distance Education Bharathidasan University Tiruchirappalli – 620 024. The Syllabus Revised from 2017-18 onwards Lesson Writer: Dr. J.Sai Geetha Asst. Professor Department of Computer Science Nehru Memorial College Puthanampatti Tituchirappalli – 621 007. 3 CORE COURSE III COMPUTER ORGANIZATION AND ARCHITECTURE Objective: To understand the principles of digital computer logic circuits and their design. To understand the working of a central processing unit architecture of a computer Unit I Number Systems – Decimal, Binary, Octal and Hexadecimal Systems – Conversion from one system to another – Binary Addition, Subtraction, Multiplication and Division – Binary Codes– 8421, 2421, Excess-3, Gray, BCD – Alphanumeric Codes – Error Detection Codes. Unit II Basic Logic Gates – Universal Logic – Boolean Laws and Theorems – Boolean Expressions – Sum of Products – Product of Sums – Simplification of Boolean Expressions –Karnaugh Map Method (up to 4 Variables) – Implementation of Boolean Expressions using Gate Networks. Unit III Combinational Circuits – Multiplexers – Demultiplexers – Decoders – Encoders – Arithmetic Building Blocks – Half and Full Adders – Half and Full Subtractors – Parallel adder –2’s Complement Adder – Subtractor – BCD Adder. Unit IV Sequential Circuits – Flip Flops – RS, Clocked RS, D, JK, T and Master- Slave Flip Flops –Shift Register – Counters – Asynchronous, MOD-n and Synchronous Counters – BCD Counter –Ring Counter.
    [Show full text]
  • 'N' VARIABLES - a NOVEL APPROACH Dr.V.D.Ambeth Kumar1 and Gokul Amuthan .S2 1
    STATIC STRUCTURE SIMPLIFICATION OF BOOLEAN FUNCTION FOR 'N' VARIABLES - A NOVEL APPROACH Dr.V.D.Ambeth Kumar1 and Gokul Amuthan .S2 1. Asso.Professor, Department of CSE, Panimalar Engineering College, Chennai, India-600123. 2. UG Student, Department of CSE, Panimalar Engineering College, Chennai, India-600123. Email: [email protected] ABSTRACT Digital Systems have a prominent role in everyday life that we refer to the present technological period as the digital age.[1] Digital Systems implement digital circuits which are mostly combination of digital gates. These gates can be represented in an understandable form called Boolean expressions. These expressions formed vary for each circuit. Hence for building an efficient circuit the Boolean expression should be minimized. To achieve this, we use, Karnaugh map (K-map) and Quine-McCluskey (QM) methods which are well known methods to simplify Boolean expression. The K-map until now is introduced to solve up to 6 variable and QM which can solve ‘n’ variables, yet it involve a serious of steps and does not provide a visual way to minimising the expression. The following paper implements the idea of K-map to reduce the expression except that it could solve ‘n’ variables as QM method. The method Divide and Conquer Karnaugh map (DC-K-map) implements 4 variable K-map in a redundant way to reduce the expression for variables greater than 7. Keywords: Karnaugh map, Boolean functions, Quine-McCluskey Method, Grouping and Simplification. 1. INTRODUCTION In 1854, George Boole introduced a systematic treatment of logic and developed for this purpose an algebraic system now called as Boolean Algebra[12].
    [Show full text]
  • Static Structure Simplification of Boolean Function for 'N' Variables
    VISVAM DEVADOSS AMBETH KUMAR AND S. GOKUL AMUTHAN: STATIC STRUCTURE SIMPLIFICATION OF BOOLEAN FUNCTION FOR ‘N’ VARIABLES - A NOVEL APPROACH DOI: 10.21917/ijme.2016.0024 STATIC STRUCTURE SIMPLIFICATION OF BOOLEAN FUNCTION FOR ‘N’ VARIABLES - A NOVEL APPROACH Visvam Devadoss Ambeth Kumar1 and S. Gokul Amuthan2 Department of Computer Science and Engineering, Panimalar Engineering College, India E-mail: [email protected], [email protected] Abstract referred to as tabulation method. This method was best suited for Digital Systems have a prominent role in everyday life that we refer to computer algorithms yet it has limited range of use as it solves the the present technological period as the digital age. Digital Systems problem in NP-Hard way. [5] This paper uses K-map method, implement digital circuits which are mostly combination of digital with slight modification to solve greater than 7 variables. gates. These gates can be represented in an understandable form called Boolean expressions. These expressions formed vary for each circuit. Hence for building an efficient circuit the Boolean expression should 2. SYMBOLIZING THE BOOLEAN FUNCTION be minimized. To achieve this, we use, Karnaugh map (K-map) and Quine-McCluskey (QM) methods which are well known methods to To represent the Boolean functions we use four golden simplify Boolean expression. The K-map until now is introduced to representations. solve up to 6 variable and QM which can solve ‘n’ variables, yet it involve a serious of steps and does not provide a visual way to 2.1 TRUTH TABLE minimising the expression. The following paper implements the idea of K-map to reduce the expression except that it could solve ‘n’ variables The common way of representing the Boolean function.
    [Show full text]
  • Digital Electronics
    LECTURE NOTES ON DIGITAL ELECTRONICS 4th semester Branch-Electrical Engineering DEPT. OF ELECTRONICS AND TELECOMMUNICATIONS ENGINEERING PADMASHREE KRUTARTHA ACHARYA COLLEGE OF ENGINEERING DISTRICT-BARGARH, PIN 768028 MODULE - 1 Number Systems Understanding Decimal Numbers ° Decimal numbers are made of decimal digits: (0,1,2,3,4,5,6,7,8,9) ° Decimal number representation: • 8653 = 8x103 + 6x102 + 5x101 + 3x100 ° What about fractions? • 97654.35 = 9x104 + 7x103 + 6x102 + 5x101 + 4x100 + 3x10-1 + 5x10-2 • In formal notation -> (97654.35)10 ° Why do we use 10 digits? Understanding Binary Numbers ° Binary numbers are made of binary digits (bits): • 0 and 1 ° How many items does an binary number represent? 3 2 + 1 + 0 • (1011)2 = 1x2 + 0x2 1x2 1x2 = (11)10 ° What about fractions? 2 + 1 + 0 -1 + -2 • (110.10)2 = 1x2 1x2 0x2 + 1x2 0x2 ° Groups of eight bits are called a byte • (11001001) 2 ° Groups of four bits are called a nibble. • (1101) 2 Why Use Binary Numbers? ° Easy to represent 0 and 1 using electrical values. ° Possible to tolerate noise. ° Easy to transmit data ° Easy to build binary circuits. AND Gate 1 0 0 Conversion Between Number Bases Octal(base 8) Decimal(base 10) Binary(base 2) Hexadecimal (base16) ° Learn to convert between bases. ° Conversion demonstrated in next slides Convert an Integer from Decimal to Another Base For each digit position: 1. Divide decimal number by the base (e.g. 2) 2. The remainder is the lowest-order digit 3. Repeat first two steps until no divisor remains. Example for (13)10: Integer Remainder Coefficient Quotient 13/2 = 6 + ½ a0 = 1 6/2 = 3 + 0 a1 = 0 3/2 = 1 + ½ a2 = 1 1/2 = 0 + ½ a3 = 1 Answer (13)10 = (a3 a2 a1 a0)2 = (1101)2 Convert an Fraction from Decimal to Another Base For each digit position: 1.
    [Show full text]
  • A Simplification Method of Polymorphic Boolean Functions Wenjian Luo and Zhifang Li
    1 A Simplification Method of Polymorphic Boolean Functions Wenjian Luo and Zhifang Li Abstract—Polymorphic circuits are a special kind of circuits adopted [4, 10, 11]. The evolutionary methods could design which possess multiple build-in functions, and these functions are area-efficient polymorphic circuits, but the Evolutionary activated by environment parameters, like temperature, light and Algorithms face the scalability problem. Therefore, only small VDD. The behavior of a polymorphic circuit can be described by scale circuits can be generated. Up to now, “3×4 multiplier / 7 a polymorphic Boolean function. For the first time, this brief presents a simplification method of the polymorphic Boolean bit sorting-net” reported in [4] is the biggest polymorphic function. circuits designed by evolutionary methods. In [12, 13], Sekanina and his colleagues proposed the Poly-BDD and Index Terms—Polymorphic electronics, polymorphic circuit, polymorphic multiplex methods for designing polymorphic polymorphic Boolean function, Karnaugh Map circuits. It is noted that polymorphic multiplex method is firstly proposed in [11], and also adopted in [14], but they are I. INTRODUCTION somewhat different. the In [15], the Poly_Bi_Decomposition ompared with the traditional electronics, the polymorphic method is proposed to synthesize polymorphic circuits. C electronic components possess multiple build-in functions The behavior of a polymorphic circuit can be described by a which are activated by environmental signals. For instance, polymorphic Boolean function. The simplification of a the AND/OR polymorphic logic gate controlled by Boolean function is common, and its importance stems from temperature perform the AND function when the temperature the fact that “the simpler the function is, the easier it is to is 27°C and perform the OR function when the temperature is realize” [16].
    [Show full text]
  • 2 Combinational Logic Circuits
    www.getmyuni.com 10CS 33 LOGIC DESIGN UNIT – 2 Combinational Logic Circuits Unit – 2 Combinational Logic Circuits Objectives • Understand what are combinational logic circuits • Use the sum-of-products method to design a logic circuit based on a design truth table • Be able to make Karnaugh maps and use them to simplify Boolean expressions Introduction Logic Circuits are categorized into 2 types (based on whether they contain memory or not): • Combinational Logic Circuits o Circuits without memory • Sequential Logic Circuits o Circuits with memory Combinational Logic Circuits The output of combinational logic circuit depends only on the current inputs. A combinational logic circuit block is as shown below: There are two fundamental approaches in logic design. They are: • The Sum-of-Products (SOP) Method – Solution results in an AND-OR or NAND-NAND network Page 1 www.getmyuni.com 10CS 33 LOGIC DESIGN UNIT – 2 Combinational Logic Circuits • The Product-of-Sums (POS) Method – Solution results in an OR-AND or NOR-NOR network We select a simpler circuit because it costs less and is more reliable. The Sum-of-Products (SOP) Method Product term A product term is a conjunction of literals, where each literal is either a Boolean variable or its complement. Examples: A . B A’ . B. C’ A Fundamental product or Minterm For a function of n variables, a product term in which each of the n variables appears once (in uncomplemented or complemented form) is called a fundamental product or minterm Fundamental Products for Two inputs Consider two inputs A and B. The fundamental products or minterms are listed below: Inputs Fundamental products or A B minterms 0 0 m0 = A’ .
    [Show full text]
  • Simplifying the Boolean Equation Based on Simulation System Using Karnaugh Mapping Tool in Digital Circuit Design
    Simplifying the Boolean Equation Based on Simulation System using Karnaugh Mapping Tool in Digital Circuit Design Md. Jahidul Islam , Md. Gulzar Hussain, Babe Sultana, Mahmuda Rahman , Md. Saidur Rahman and Muhammad Aminur Rahaman Abstract—In computerized integrated circuits, the Logic (PAL) and Programmable Logic Array (PLA) fundamental principle intends to avoid the multifaceted [1], and here the amount of logic circuits are to be nature of the circuitry by making it as brief as attainable maintained in a minimal form, the production costs and minimize the expenditure. Techniques like Quine- of such devices will be decreased. The K map is McCluskey (QM) and Karnaugh Map (K-Map) are often the graphical procedure to optimize Boolean function used approaches of simplifying Boolean functions. This study presents a recreation framework of simplification throughout the format of a minimal SOP form. Logic of the Boolean capacities by the utilize of the K- Gate-wise, these observations resulted such a two- Map definition for beginner-level learners. It uses the tier minimal system. It’s used mostly for many small algebraic expression of the Boolean function to decrease design problems. It is obvious that several larger mod- the number of terms, generates a circuit, and does els are carrying out using various computer method not use any redundant sets. In this way, it gets to be implementations, and so we can obtain a pretty good competent to deal with lots of parameters and minimize insight in to digital logic gate circuit after learning K the computational cost. The result of the assessment is performed in this paper by contrasting it with the C- map.
    [Show full text]
  • A Thesis Submitted in Conformity with the Requirements for the Degree Of
    SECRET SHARING FOR COLOR IMAGES by Mohsen Heidarinejad A thesis submitted in conformity with the requirements for the degree of Master of Applied Science Graduate Department of Electrical and Computer Engineering University of Toronto Copyright © 2008 by Mohsen Heidarinejad Library and Bibliotheque et 1*1 Archives Canada Archives Canada Published Heritage Direction du Branch Patrimoine de I'edition 395 Wellington Street 395, rue Wellington Ottawa ON K1A0N4 Ottawa ON K1A0N4 Canada Canada Your file Votre reference ISBN: 978-0-494-44991-2 Our file Notre reference ISBN: 978-0-494-44991-2 NOTICE: AVIS: The author has granted a non­ L'auteur a accorde une licence non exclusive exclusive license allowing Library permettant a la Bibliotheque et Archives and Archives Canada to reproduce, Canada de reproduire, publier, archiver, publish, archive, preserve, conserve, sauvegarder, conserver, transmettre au public communicate to the public by par telecommunication ou par Plntemet, prefer, telecommunication or on the Internet, distribuer et vendre des theses partout dans loan, distribute and sell theses le monde, a des fins commerciales ou autres, worldwide, for commercial or non­ sur support microforme, papier, electronique commercial purposes, in microform, et/ou autres formats. paper, electronic and/or any other formats. The author retains copyright L'auteur conserve la propriete du droit d'auteur ownership and moral rights in et des droits moraux qui protege cette these. this thesis. Neither the thesis Ni la these ni des extraits substantiels de nor substantial extracts from it celle-ci ne doivent etre imprimes ou autrement may be printed or otherwise reproduits sans son autorisation. reproduced without the author's permission.
    [Show full text]
  • Neural Networks As Universal Approximators, and the Issue of Depth 3 2.1 the Perceptron Revisited
    Contents Part I: Introductory Block 1 2 Neural networks as universal approximators, and the issue of depth 3 2.1 The perceptron revisited . 3 2.2 Deep structures and the concept of depth . 6 2.2.1 The formal notion of depth . 6 2.2.2 The multi-layer perceptron . 8 2.3 MLPs as approximate functions . 10 2.4 MLPs as universal Boolean functions . 11 2.4.1 The perceptron as a Boolean gate . 11 2.4.2 Reducing the Boolean function . 18 2.4.3 Width of a one-hidden-layer Boolean MLP . 24 2.4.4 Size of a deep MLP . 25 2.4.5 The challenge of depth . 28 2.4.6 The actual number of parameters in the network . 28 2.4.7 Depth vs size in Boolean circuits . 30 2.5 MLPs as universal classifiers . 33 2.5.1 Composing an arbitrarily shaped decision boundary . 40 2.6 MLPs as universal approximators . 49 2.7 The issue of depth . 53 2.8 RBF networks: a brief introduction . 60 i List of Figures 2.1 Recap: Threshold logic in a perceptron . 5 2.2 Examples of some activation functions . 6 2.3 The concept of layering and deep layering in a network of per- ceptrons . 7 2.4 Explaining the notion of depth in deep structures . 8 2.5 Explaining the notion of depth in MLPs . 9 2.6 Examples of Boolean and continuous valued functions modeled by an MLP . 10 2.7 AND, NOT and OR gates modeled by a perceptron . 11 2.8 Generalized gates modeled by a perceptron .
    [Show full text]