Boolean Logic. Building a Modern Computer From First Principles.

Similar documents
Chapter 1: Boolean Logic

Elements of Computing Systems, Nisan & Schocken, MIT Press. Boolean Logic

Course Overview. Shimon Schocken. Spring Course Overview 1 Elements of Computing Systems

Boolean algebra.

Overview of Today s Lecture:

expression simply by forming an OR of the ANDs of all input variables for which the output is

Golden Section Search Method - Theory

Reasoning and programming. Lecture 5: Invariants and Logic. Boolean expressions. Reasoning. Examples

Unit 4. Combinational Circuits

ICTP Latin-American Advanced Course on FPGADesign for Scientific Instrumentation. 19 November - 17 December, 2012.

Fast Boolean Algebra

CS12N: The Coming Revolution in Computer Architecture Laboratory 2 Preparation

Resources. Introduction: Binding. Resource Types. Resource Sharing. The type of a resource denotes its ability to perform different operations

MATH1131 Mathematics 1A Algebra

Boolean Algebra. Boolean Algebra

Section 6.1 INTRO to LAPLACE TRANSFORMS

IST 4 Information and Logic

ELECTRICAL AND COMPUTER ENGINEERING DEPARTMENT, OAKLAND UNIVERSITY ECE-2700: Digital Logic Design Fall Notes - Unit 1

IST 4 Information and Logic

SIMPLIFICATION OF BOOLEAN ALGEBRA. Presented By: Ms. Poonam Anand

Engr354: Digital Logic Circuits

CS 330 Formal Methods and Models

IST 4 Information and Logic

Control with binary code. William Sandqvist

ECE223. R eouven Elbaz Office room: DC3576

Introduction to Electrical & Electronic Engineering ENGG1203

ELECTRICAL AND COMPUTER ENGINEERING DEPARTMENT, OAKLAND UNIVERSITY ECE-378: Computer Hardware Design Winter Notes - Unit 1

6.004 Computation Structures Spring 2009

BİL 354 Veritabanı Sistemleri. Relational Algebra (İlişkisel Cebir)

CHAPTER 3 LOGIC GATES & BOOLEAN ALGEBRA

CS375: Logic and Theory of Computing

The Evaluation Theorem

Digital Control of Electric Drives

Fault Modeling. EE5375 ADD II Prof. MacDonald

CS 275 Automata and Formal Language Theory

378 Relations Solutions for Chapter 16. Section 16.1 Exercises. 3. Let A = {0,1,2,3,4,5}. Write out the relation R that expresses on A.

CS415 Compilers. Lexical Analysis and. These slides are based on slides copyrighted by Keith Cooper, Ken Kennedy & Linda Torczon at Rice University

ECE 545 Digital System Design with VHDL Lecture 1A. Digital Logic Refresher Part A Combinational Logic Building Blocks

Good Review book ( ) ( ) ( )

Finite Automata-cont d

COSC 243. Introduction to Logic And Combinatorial Logic. Lecture 4 - Introduction to Logic and Combinatorial Logic. COSC 243 (Computer Architecture)

EEE130 Digital Electronics I Lecture #4

CS 310 (sec 20) - Winter Final Exam (solutions) SOLUTIONS

Theorem/Law/Axioms Over (.) Over (+)

The area under the graph of f and above the x-axis between a and b is denoted by. f(x) dx. π O

Example 1: Express as a sum of logarithms by using the Product Rule. (By the definition of log)

CS 301. Lecture 04 Regular Expressions. Stephen Checkoway. January 29, 2018

List all of the possible rational roots of each equation. Then find all solutions (both real and imaginary) of the equation. 1.

STRUCTURE OF CONCURRENCY Ryszard Janicki. Department of Computing and Software McMaster University Hamilton, ON, L8S 4K1 Canada

4.6 Numerical Integration

ECE 545 Digital System Design with VHDL Lecture 1. Digital Logic Refresher Part A Combinational Logic Building Blocks

CS 275 Automata and Formal Language Theory

Finite Field Arithmetic and Implementations. Xinmiao Zhang Case Western Reserve University

CS 311 Homework 3 due 16:30, Thursday, 14 th October 2010

Introduction to Computer Engineering EECS 203 dickrp/eecs203/ Brief course overview. What s your major?

Boolean Algebra. Boolean Algebras

Chapter 3. Vector Spaces

Section 6: Area, Volume, and Average Value

CLASSROOM NOTE Some new mean value theorems of Flett type

Number System. Decimal to binary Binary to Decimal Binary to octal Binary to hexadecimal Hexadecimal to binary Octal to binary

COS 140: Foundations of Computer Science

Math 154B Elementary Algebra-2 nd Half Spring 2015

Learning Goals. Relational Query Languages. Formal Relational Query Languages. Formal Query Languages: Relational Algebra and Relational Calculus

Fachgebiet Rechnersysteme1. 1. Boolean Algebra. 1. Boolean Algebra. Verification Technology. Content. 1.1 Boolean algebra basics (recap)

Answers and Solutions to (Some Even Numbered) Suggested Exercises in Chapter 11 of Grimaldi s Discrete and Combinatorial Mathematics

Exploring parametric representation with the TI-84 Plus CE graphing calculator

Boolean Logic Continued Prof. James L. Frankel Harvard University

The Trapezoidal Rule

Combinational Logic. Precedence. Quick Quiz 25/9/12. Schematics à Boolean Expression. 3 Representations of Logic Functions. Dr. Hayden So.

UNIT 8A Computer Circuitry: Layers of Abstraction. Boolean Logic & Truth Tables

Foundations of XML Types: Tree Automata

4.4 Areas, Integrals and Antiderivatives

Exercise 3 Logic Control

9/29/2016. Task: Checking for a Lower-Case Letter. ECE 120: Introduction to Computing. Change C 5 to C 5 to Obtain L(C) from U(C)

7. Indefinite Integrals

CS 330 Formal Methods and Models Dana Richards, George Mason University, Spring 2016 Quiz Solutions

Lecture 11 Binary Decision Diagrams (BDDs)

CS 330 Formal Methods and Models

AP Calculus AB Summer Packet

Lecture 9: LTL and Büchi Automata

The Regulated and Riemann Integrals

Having read this workbook you should be able to: design a logic circuit from its Boolean equation or truth table.

Arithmetic & Algebra. NCTM National Conference, 2017

The Fundamental Theorem of Calculus. The Total Change Theorem and the Area Under a Curve.

Chapter 2. Determinants

CSCI 340: Computational Models. Transition Graphs. Department of Computer Science

Exponentials - Grade 10 [CAPS] *

Hardware Verification 2IMF20

Lexical Analysis Finite Automate

EECS150 - Digital Design Lecture 4 - Boolean Algebra I (Representations of Combinational Logic Circuits)

Outline. EECS150 - Digital Design Lecture 4 - Boolean Algebra I (Representations of Combinational Logic Circuits) Combinational Logic (CL) Defined

AP Calculus AB Summer Packet

Digital Circuits. 1. Inputs & Outputs are quantized at two levels. 2. Binary arithmetic, only digits are 0 & 1. Position indicates power of 2.

A New Solution to the Intersection Problem of Mendelsohn Triple Systems. Rachel Watson

Matrix Solution to Linear Equations and Markov Chains

Section 4.8. D v(t j 1 ) t. (4.8.1) j=1

Matching patterns of line segments by eigenvector decomposition

CprE 281: Digital Logic

Regular expressions, Finite Automata, transition graphs are all the same!!

Chapter 2 Finite Automata

Transcription:

Boolen Logic Building Modern Computer From First Principles www.nnd2tetris.org Elements of Computing Systems, Nisn & Schocken, MIT Press, www.nnd2tetris.org, Chpter 1: Boolen Logic slide 1

Usge nd Copyright Notice: Copyright Nom Nisn nd Shimon Schocken This presenttion ccompnies the textook The Elements of Computing Systems y Nom Nisn & Shimon Schocken, MIT Press, 2005. We provide 13 such presenttions. Ech presenttion is designed to support 3 hours of clssroom or self-study instruction. You re welcome to use or edit this presenttion s you see fit for instructionl nd noncommercil purposes. If you use our ook nd course mterils, plese include reference to www.nnd2tetris.org If you hve ny questions or comments, plese write us t nnd2tetris@gmil.com This work is licensed under Cretive Commons Attriution-NonCommercil-ShreAlike 3.0 Unported License. Elements of Computing Systems, Nisn & Schocken, MIT Press, www.nnd2tetris.org, Chpter 1: Boolen Logic slide 2

Boolen lger Some elementry Boolen functions: Not(x) And(x,y) Or(x,y) Nnd(x,y) Boolen functions: x y z f ( x, y, z) = ( x + y) z x Not(x) 0 1 1 0 x y Or(x,y) 0 0 0 0 1 1 1 0 1 1 1 1 x y And(x,y) 0 0 0 0 1 0 1 0 0 1 1 1 x y Nnd(x,y) 0 0 1 0 1 1 1 0 1 1 1 0 0 0 0 0 0 0 1 0 0 1 0 1 0 1 1 0 1 0 0 1 1 0 1 0 1 1 0 1 1 1 1 0 A Boolen function cn e expressed using functionl expression or truth tle expression Importnt oservtion: Every Boolen function cn e expressed using And, Or, Not. Elements of Computing Systems, Nisn & Schocken, MIT Press, www.nnd2tetris.org, Chpter 1: Boolen Logic slide 3

Boolen lger Given: Nnd(,), flse We cn uild: Not() = Nnd(,) true = Not(flse) And(,) = Not(Nnd(,)) George Boole, 1815-1864 ( A Clculus of Logic ) Or(,) = Not(And(Not(),Not())) Xor(,) = Or(And(,Not()),And(Not(),))) Etc. Elements of Computing Systems, Nisn & Schocken, MIT Press, www.nnd2tetris.org, Chpter 1: Boolen Logic slide 4

Multiplexer sel 0 0 0 0 0 0 1 0 0 1 0 0 0 1 1 1 1 0 0 1 1 0 1 0 1 1 0 1 1 1 1 1 Mux sel sel 0 1 Proposed Implementtion: sed on Not, And, Or gtes. Elements of Computing Systems, Nisn & Schocken, MIT Press, www.nnd2tetris.org, Chpter 1: Boolen Logic slide 5

Exmple: Building n And gte And.cmp Contrct: And 0 0 0 0 1 0 1 0 0 1 1 1 When running your.hdl on our.tst, your. should e the sme s our.cmp. And.hdl And.tst CHIP And { IN, ; OUT ; // implementtion missing } lod And.hdl, put-file And., compre-to And.cmp, put-list ; set 0,set 0,evl,put; set 0,set 1,evl,put; set 1,set 0,evl,put; set 1, set 1, evl, put; Elements of Computing Systems, Nisn & Schocken, MIT Press, www.nnd2tetris.org, Chpter 1: Boolen Logic slide 6

Building n And gte Interfce: And(,) = 1 exctly when ==1 And And.hdl CHIP And { IN, ; OUT ; // implementtion missing } Elements of Computing Systems, Nisn & Schocken, MIT Press, www.nnd2tetris.org, Chpter 1: Boolen Logic slide 7

Building n And gte Implementtion: And(,) = Not(Nnd(,)) And.hdl CHIP And { IN, ; OUT ; // implementtion missing } Elements of Computing Systems, Nisn & Schocken, MIT Press, www.nnd2tetris.org, Chpter 1: Boolen Logic slide 8

Building n And gte Implementtion: And(,) = Not(Nnd(,)) Nnd x in Not And.hdl CHIP And { IN, ; OUT ; // implementtion missing } Elements of Computing Systems, Nisn & Schocken, MIT Press, www.nnd2tetris.org, Chpter 1: Boolen Logic slide 9

Building n And gte Implementtion: And(,) = Not(Nnd(,)) NAND x in NOT And.hdl CHIP And { IN, ; } OUT ; Nnd( =, =, = x); Not(in = x, = ) Elements of Computing Systems, Nisn & Schocken, MIT Press, www.nnd2tetris.org, Chpter 1: Boolen Logic slide 10

Hrdwre simultor (demonstrting Xor gte construction) HDL progrm test script Elements of Computing Systems, Nisn & Schocken, MIT Press, www.nnd2tetris.org, Chpter 1: Boolen Logic slide 11

Hrdwre simultor HDL progrm Elements of Computing Systems, Nisn & Schocken, MIT Press, www.nnd2tetris.org, Chpter 1: Boolen Logic slide 12

Hrdwre simultor HDL progrm put file Elements of Computing Systems, Nisn & Schocken, MIT Press, www.nnd2tetris.org, Chpter 1: Boolen Logic slide 13