Appendix B: Digital Logic

Slides:



Advertisements
Similar presentations
Logic Gates.
Advertisements

UNIT 8 DIGITAL LOGIC. (1) To study and understand Boolean algebra and Boolean properties. (2) To design and analyze Logic gates. (3) To design and analyze.
(CSC 102) Discrete Structures Lecture 5.
Multiplexer as a Universal Function Generator Lecture L6.7 Section 6.2.
Decoders/DeMUXs CS370 – Spring Decoder: single data input, n control inputs, 2 outputs control inputs (called select S) represent Binary index of.
Appendix B Digital Logic. Irvine, Kip R. Assembly Language for Intel-Based Computers, NOT AND OR XOR NAND NOR Truth Tables Boolean Operators.
Chapter 11_1 (chap 10 ed 8) Digital Logic. Irvine, Kip R. Assembly Language for Intel-Based Computers, NOT AND OR XOR NAND NOR Truth Tables Boolean.
1 Tutorial: ITI1100 Dewan Tanvir Ahmed SITE, UofO.
ECE 2373 Modern Digital System Design Exam 2. ECE 2372 Exam 2 Thursday March 5 You may use two 8 ½” x 11” pages of information, front and back, write.
Universal Gates Sum of Products Products of Sum
Boolean Algebra and Logic Gate
Basic Digital Design Discussion D5.4 Appendix F. Basic Digital Design Sum-of-Products Design Product-of-Sums Design.
Combinatorial Logic Design Process. Example: Three 1s pattern detector Detect whether a pattern of at least three adjacent 1s occurs anywhere in an 8-bit.
Multiplexer as a Universal Function Generator
1 Boolean Algebra & Logic Design. 2 Developed by George Boole in the 1850s Mathematical theory of logic. Shannon was the first to use Boolean Algebra.
Combinational Logic1 DIGITAL LOGIC DESIGN by Dr. Fenghui Yao Tennessee State University Department of Computer Science Nashville, TN.
Part 2: DESIGN CIRCUIT. LOGIC CIRCUIT DESIGN x y z F F = x + y’z x y z F Truth Table Boolean Function.
GK-12 Student designed project (AP physics) Digital logic and Boolean algebra exercise. IC logic gates brought from Stevens were used in making simple.
XOR, XNOR, and Binary Adders
22C:19 Discrete Math Boolean Algebra & Digital Logic Fall 2010 Sukumar Ghosh.
Chapter 10_1 Digital Logic. Irvine, Kip R. Assembly Language for Intel-Based Computers, NOT AND OR XOR NAND NOR Truth Tables Boolean Operators.
Binary Numbers.
XOR and XNOR Logic Gates. XOR Function Output Y is TRUE if input A OR input B are TRUE Exclusively, else it is FALSE. Logic Symbol  Description  Truth.
Logic gates & Boolean Algebra. Introduction Certain components (called logic elements) of the computer combine electric pulses using a set of rules. Electric.
Digital Computer Concept and Practice Copyright ©2012 by Jaejin Lee Logic Circuits I.
SUPLEMENTARY CHAPTER 1: An Introduction to Digital Logic The Architecture of Computer Hardware and Systems Software: An Information Technology Approach.
Digital Computer Concept and Practice Copyright ©2012 by Jaejin Lee Logic Circuits I.
9/15/09 - L15 Decoders, Multiplexers Copyright Joanne DeGroat, ECE, OSU1 Decoders and Multiplexer Circuits.
Digital Logic Structures: Chapter 3 COMP 2610 Dr. James Money COMP
Lecture 22: 11/19/2002CS170 Fall CS170 Computer Organization and Architecture I Ayman Abdel-Hamid Department of Computer Science Old Dominion University.
Boolean Algebra & Logic Prepared by Dr P Marais (Modified by D Burford)
4. Computer Maths and Logic 4.2 Boolean Logic Logic Circuits.
1 Ethics of Computing MONT 113G, Spring 2012 Session 5 Binary Addition.
Logic and computers 2/6/12. Binary Arithmetic /6/ Only two digits: the bits 0 and 1 (Think: 0 = F, 1.
CHAPTER 1 SETS, FUNCTIONs, ELEMENTARY LOGIC & BOOLEAN ALGEBRAs
Laws of Boolean Algebra Commutative Law Associative Law Distributive Law Identity Law De Morgan's Theorem.
Chapter-3: BOOLEAN ALGEBRA & LOGIC GATES Analysis and logical design.
Chapter 4 Fundamentals of Computer Logic 1 Chapter 4: Fundamental of Computer Logic - IE337.
Karnaugh Maps (K-Maps)
Chapter 3 Digital Logic Structures
Digital Design Lecture 8 Combinatorial Logic (Continued)
Multiplexers & Decoders By: Jason Pitts CS 147 Spring 2010.
BOOLEAN ALGEBRA LOGIC GATES. Introduction British mathematician George Boole( ) was successful in finding the link between logic and mathematics.
DIGITAL ELECTRONICS. Everything in digital world is based on binary system. Numerically it involves only two symbols 0 or 1. –0 = False = No –1 = True.
Chapter 5 Boolean Algebra and Reduction Techniques 1.
Logic Gates and Boolean Algebra Introduction to Logic II.
LOGIC CIRCUITLOGIC CIRCUIT. Goal To understand how digital a computer can work, at the lowest level. To understand what is possible and the limitations.
CHAPTER 13 Digital Logic Circuits. Figure Voltage analog of internal combustion engine in-cylinder pressure Figure 13.1.
Logic Gates Learning Objectives Learn that there is a one-to-one relationship between logic gates and Boolean expressions Learn how logic gates are combined.
Logic gates.
ECE 3130 Digital Electronics and Design
ECE 3130 Digital Electronics and Design
Computer Science 210 Computer Organization
Logic Gates and Boolean Algebra
Combinational Functions and Circuits
Combinational Circuit Design
4-1 LOGIC OPERATIONS In Chapter 3 we discussed the fact that data inside a computer is stored as patterns of bits. Logic operations refer to those operations.
Boolean Algebra.
Week 7: Gates and Circuits: PART II
Digital Logic.
Logic Gates.
13 Digital Logic Circuits.
Digital Logic.
Chapter 10.3 and 10.4: Combinatorial Circuits
XOR Function Logic Symbol  Description  Truth Table 
LOGIC Circuits.
Truth tables Mrs. Palmer.
DIGITAL ELECTRONICS AND LOGIC GATES. ANALOG SIGNAL:- Analog signal is continuous time varying current or voltage signal.
Conditionals.
Presentation transcript:

Appendix B: Digital Logic

Boolean Algebra  Algebra of logic  Devised by the English mathematician George Boole. Everything in the digital world is based on the binary number system. 0 = false = no 1 = true = yes Digital Logic  Using this two-valued logic system, every statement or condition must be either "true" or "false;"

Boolean Algebra Variables and Operations  Variables A variable can take on the value 1(True) or 0(False).  Operations Basic logical operations:  AND  OR  NOT A AND B = A ‧ B A OR B = A + B NOT A = A D = A +(B ‧ C)

Boolean Operators NOT AND OR XOR NAND NOR

Key Identities of Boolean Algebra

Gates Functional Complete Sets : AND, OR, NOT AND, NOT OR, NOT NAND NOR See Page 704 (Figure B.1)

The Use of NAND Gates

Implementation of Boolean Functions Sum-of-Products   Figure B.4 (page 688) Product-of-Sums   Figure B.5 (page 689)

Simplified Implementation Figure B.6 (Page 690)

Multiplexer 4-to-1 MUX D0 D1 D2 D3 S2 S1 F Figure B.13 (Page 699)

S1 S2 D0 D2 D1 D3 F 4-to-1 Multiplexer

Decoder 2-to-4 Decoder D0 D1 D2 D ABAB B A N-to-2 N Decoder ‧‧‧‧‧‧ N-bit Inputs ‧‧‧‧‧‧ 2 N Outputs Figure B.15 (Page 700)

2-to-4 Decoder/Demultiplexer

Half Adder

Full Adder See Figure B.22

4-bit Adder