Speaker: Fuw-Yi Yang 楊伏夷 伏夷非征番, 道德經 察政章(Chapter 58) 伏者潛藏也

Slides:



Advertisements
Similar presentations
Logic Gates.
Advertisements

CSIS 3510 Computer Organization and Architecture Topics covered in this lecture: –Review of De’Morgan’s Theorem –Using De’Morgan’s Theorem –Building a.
ECE 238L Computer Logic Design Spring 2010
Chapter 2 Logic Circuits.
ECE 331 – Digital System Design Boolean Algebra (Lecture #3) The slides included herein were taken from the materials accompanying Fundamentals of Logic.
ECE 331 – Digital System Design
Gate-Level Minimization. Digital Circuits The Map Method The complexity of the digital logic gates the complexity of the algebraic expression.
Chapter 2 – Combinational Logic Circuits Part 1 – Gate Circuits and Boolean Equations Logic and Computer Design Fundamentals.
CS 151 Digital Systems Design Lecture 6 More Boolean Algebra A B.
Boolean Algebra and Logic Gates
Chapter Two Boolean Algebra and Logic Gate
Digital Logic Design ESGD2201
Boolean Algebra and Logic Simplification. Boolean Addition & Multiplication Boolean Addition performed by OR gate Sum Term describes Boolean Addition.
Boolean Algebra. Binary Logic and Gates Binary variables take on one of two values. Logical operators operate on binary values and binary variables. Basic.
Gate Circuits and Boolean Equations BIL- 223 Logic Circuit Design Ege University Department of Computer Engineering.
Boolean Algebra Dr. Bernard Chen Ph.D. University of Central Arkansas Spring 2009.
CHAPTER 2 Boolean Algebra
Logic Design CS221 1 st Term Boolean Algebra Cairo University Faculty of Computers and Information.
1 Why study Boolean Algebra? 4 It is highly desirable to find the simplest circuit implementation (logic) with the smallest number of gates or wires. We.
Boolean Algebra and Digital Circuits
F = ∑m(1,4,5,6,7) F = A’B’C+ (AB’C’+AB’C) + (ABC’+ABC) Use X’ + X = 1.
ECE 331 – Digital System Design
©2004 Brooks/Cole FIGURES FOR CHAPTER 2 BOOLEAN ALGEBRA Click the mouse to move to the next page. Use the ESC key to exit this chapter. This chapter in.
Chapter 2: Boolean Algebra and Logic Gates. F 1 = XY’ + X’Z XYZX’Y’XY’X’ZF1F
Logic Gates. Outline  Logic Gates  The Inverter  The AND Gate  The OR Gate  The NAND Gate  The NOR Gate  The XOR Gate  The XNOR Gate  Drawing.
Why? What’s Boolean algebra used for? –“The purpose of Boolean algebra is to facilitate the analysis and design of digital circuits.” Express a truth table.
Lecture 22: 11/19/2002CS170 Fall CS170 Computer Organization and Architecture I Ayman Abdel-Hamid Department of Computer Science Old Dominion University.
Boolean Logic and Circuits ELEC 311 Digital Logic and Circuits Dr. Ron Hayne Images Courtesy of Cengage Learning.
LOGIC GATES & BOOLEAN ALGEBRA
ECE 301 – Digital Electronics Basic Logic Operations, Boolean Expressions, and Boolean Algebra (Lecture #3)
1 EG 32 Digital Electronics Thought for the day You learn from your mistakes..... So make as many as you can and you will eventually know everything.
Digital Integrated Circuit Design Laboratory Department of Computer Science and Information Engineering National Cheng Kung University Experiment on digital.
ENGIN112 L6: More Boolean Algebra September 15, 2003 ENGIN 112 Intro to Electrical and Computer Engineering Lecture 6 More Boolean Algebra A B.
Binary Logic and Gates Boolean Algebra Canonical and Standard Forms Chapter 2: Boolean Algebra and Logic Gates.
CMPUT Computer Organization and Architecture II1 CMPUT329 - Fall 2002 Topic2: DeMorgan Laws José Nelson Amaral.
BOOLEAN ALGEBRA – Digital Circuit 1 Choopan Rattanapoka.
Boolean Algebra and Logic Gates
ECEN 248: INTRODUCTION TO DIGITAL SYSTEMS DESIGN Lecture 4 Dr. Shi Dept. of Electrical and Computer Engineering.
CMPUT Computer Organization and Architecture II1 CMPUT329 - Fall 2003 Topic 4: Cost of Logic Circuits and Karnaugh Maps José Nelson Amaral.
ECE DIGITAL LOGIC LECTURE 8: BOOLEAN FUNCTIONS Assistant Prof. Fareena Saqib Florida Institute of Technology Spring 2016, 02/11/2016.
Boolean Algebra. BOOLEAN ALGEBRA Formal logic: In formal logic, a statement (proposition) is a declarative sentence that is either true(1) or false (0).
Boolean Algebra ELEC 311 Digital Logic and Circuits Dr. Ron Hayne Images Courtesy of Cengage Learning.
Lecture 5 More Boolean Algebra A B. Overview °Expressing Boolean functions °Relationships between algebraic equations, symbols, and truth tables °Simplification.
CSE 461. Binary Logic Binary logic consists of binary variables and logical operations. Variables are designated by letters such as A, B, C, x, y, z etc.
Fuw-Yi Yang1 數位系統 Digital Systems Department of Computer Science and Information Engineering, Chaoyang University of Technology 朝陽科技大學資工系 Speaker: Fuw-Yi.
©2010 Cengage Learning SLIDES FOR CHAPTER 3 BOOLEAN ALGEBRA (continued) Click the mouse to move to the next page. Use the ESC key to exit this chapter.
CHAPTER 2 Boolean algebra and Logic gates
Boolean Algebra How gates get picked. Boolean Arithmetic Boolean ≠ Binary – Boolean – 1/0 only, no places Boolean addition:
Speaker: Fuw-Yi Yang 楊伏夷 伏夷非征番, 道德經 察政章(Chapter 58) 伏者潛藏也
ECE 301 – Digital Electronics
Table 2.1 Postulates and Theorems of Boolean Algebra
Chapter 3 Notes – Part II Review Questions
Boolean Algebra.
CS 105 Digital Logic Design
Gate Circuits and Boolean Equations
CHAPTER 2 Boolean Algebra
CHAPTER 2 Boolean Algebra This chapter in the book includes:
Princess Sumaya University
SLIDES FOR CHAPTER 2 BOOLEAN ALGEBRA
FIGURES FOR CHAPTER 2 BOOLEAN ALGEBRA
Speaker: Fuw-Yi Yang 楊伏夷 伏夷非征番, 道德經 察政章(Chapter 58) 伏者潛藏也
Boolean Algebra Why study Boolean Algebra?
Boolean Algebra.
Boolean Algebra.
Boolean Algebra & Logic Circuits
Basic Logic Gates 1.
BOOLEAN ALGEBRA AND LOGIC SIMPLIFICATION Part (a)
Table 2.1 Postulates and Theorems of Boolean Algebra
Analysis of Logic Circuits Example 1
Computer Architecture
Presentation transcript:

Speaker: Fuw-Yi Yang 楊伏夷 伏夷非征番, 道德經 察政章(Chapter 58) 伏者潛藏也 數位系統  Digital Systems  Department of Computer Science and Information Engineering, Chaoyang University of Technology 朝陽科技大學資工系 Speaker: Fuw-Yi Yang 楊伏夷 伏夷非征番, 道德經 察政章(Chapter 58) 伏者潛藏也 道紀章(Chapter 14) 道無形象, 視之不可見者曰夷 Fuw-Yi Yang

Text Book: Digital Design 5th ed. Chapter 2 Problems 2.1 Demonstrate the validity of the following identities by means of truth tables: (a) DeMorgan’s theorem for three variables: (x + y + z) = x y z and (xyz) = (x+ y+ z) (b) The distributive law: x(y + z) = xy + xz and x + yz = (x + y)(x + z) (c) The associative law: x + (y + z) = (x + y) + z and x(yz) = (xy)z Fuw-Yi Yang 2

Text Book: Digital Design 5th ed. Chapter 2 Problems 2.1 Solution: (x + y + z) = x y z x y z x+y+z (x+y+z) xyz 1 Fuw-Yi Yang 3

Text Book: Digital Design 5th ed. Chapter 2 Problems 2.2 Simplify the following Boolean expressions to a minimum number of literals: (a) xy + xy (b) (x + y) (x + y) (c) xyz + xyz +yz (d) (A + B)(A + B) (e) (a + b + c)(ab + c) (f) abc + abc + abc + abc Fuw-Yi Yang 4

Text Book: Digital Design 5th ed. Chapter 2 Problems 2.2 Solution: (a) xy + xy = x(y + y) = x; The distributive law x(y + z) = xy + xz (b) (x + y)(x + y) = x + (yy) = x; The distributive law x + yz = (x + y)(x + z) (c) xyz + xyz +yz = yz(x + x) +yz = yz + yz = z (c) xyz + xyz +yz = yz(x + 1) + xyz = yz + xyz = y(z + xz ) = y(z + x)(z + z ) =y(z + x) (d) (A + B)(A + B) = (AB)(AB) = 0 (e) (a + b + c)(ab + c) = abc + ac + bc (f) abc + abc + abc + abc = c(ab + ab + ab + ab) = c Fuw-Yi Yang 5

Text Book: Digital Design 5th ed. Chapter 2 Problems 2.14 Implement the Boolean function F = xy + xz + xy (a) With AND, OR, and inverter gates (b) With OR and inverter gates (c) With AND and inverter gates (d) With NAND and inverter gates (e) With NOR and inverter gates Fuw-Yi Yang 6

Text Book: Digital Design 5th ed. Chapter 2 Problems 2.14 Solution: With AND, OR, and inverter gates F = xy + xz + xy = { (x)(y) + (x)(z) + (x)(y) } Two inverters (NOT gates), cost 2 * 2 = 4 Three 2-input AND gates, cost 3 * 3 = 9 One 3-input OR gates, cost 1 * 4 = 4 Total cost: 17 Fuw-Yi Yang 7

Text Book: Digital Design 5th ed. Chapter 2 Problems 2.14 Solution: (b) With OR and inverter gates F = xy + xz + xy = (x + y) + (x + (z)) + ((x) + (y)) Six inverters (NOT gates), cost 6 * 2 = 12 Three 2-input OR gates, cost 3 * 3 = 9 One 3-input OR gates, cost 1 * 4 = 4 Total cost: 25 Fuw-Yi Yang 8

Text Book: Digital Design 5th ed. Chapter 2 Problems 2.14 Solution: (c) With AND and inverter gates F = xy + xz + xy = ((x)(y)) + (x)z + xy = { [(x)(y)] [(x)z] [xy]} Six inverters (NOT gates), cost 6 * 2 = 12 Three 2-input AND gates, cost 3 * 3 = 9 One 3-input AND gates, cost 1 * 4 = 4 Total cost: 25 Fuw-Yi Yang 9

Text Book: Digital Design 5th ed. Chapter 2 Problems 2.14 Solution: (d) With NAND and inverter gates F = xy + xz + xy Sum of Product = 2-levels NAND = {(xy + xz + xy)} = {(xy) (xz) (xy)} = { [(x)(y)] [(x)z] (xy)} Two inverters (NOT gates), cost 2 * 2 = 4 Three 2-input NAND gates, cost 3 * 3 = 9 One 3-input NAND gates, cost 1 * 4 = 4 Total cost: 17 Fuw-Yi Yang 10

Text Book: Digital Design 5th ed. Chapter 2 Problems 2.14 Solution: (e) With NOR and inverter gates F = xy + xz + xy = {(xy + xz + xy)} = { (x + y) (x +z) (x + y) } Product of Sum = 2-levels NOR = { (x + y) + [x +(z)] + [(x) + (y)] } Four inverters (NOT gates), cost 4 * 2 = 8 Three 2-input NOR gates, cost 3 * 3 = 9 One 3-input NOR gates, cost 1 * 4 = 4 Total cost: 21 Fuw-Yi Yang 11

Text Book: Digital Design 5th ed. Chapter 2 Problems 2.14 Solution: (e) With NOR and inverter gates F = xy + xz + xy = (0, 1, 3, 6, 7) F = (2, 4, 5) = xyz + xyz + xyz = xyz + xy F = (x+ y + z)(x + y) Product of Sum = 2-levels NOR Two inverters (NOT gates), cost 2 * 2 = 4 Two 2-input NOR gates, cost 2 * 3 = 6 One 3-input NOR gates, cost 1 * 4 = 4 Total cost: 14 Fuw-Yi Yang 12

Text Book: Digital Design 5th ed. Chapter 2 Problems Mid-Term Assume that both the normal and complement inputs are available. Implement the Boolean function F = xyz + xy (a) With AND, OR, and inverter gates (b) With NAND gates (c) With NOR gates (d) Compare the cost of implementations (a), (b), and (c). Fuw-Yi Yang 13

Text Book: Digital Design 5th ed. Chapter 2 Problems F = xyz + xy With AND, OR, and inverter gates (b) With NAND gates Sol (a), (b) (a) AND gates: One 3-input and one 2-input OR gate: one 2-input (b) NAND gates: One 3-input and two 2-input Fuw-Yi Yang 14

Text Book: Digital Design 5th ed. Chapter 2 Problems F = xyz + xy (c) With NOR gates Sol.1 (c) F = xyz + xy = xyz + xyz + xyz = (2, 4, 5) F = (0, 1, 3, 6, 7) = xy + xy + xz or = xy + xy + yz F = (x + y)(x + z)(x + y) or = (x + y)(y + z)(x + y) Sol.2 (c) F = xyz + xy = ((x + y + z)(x + y)) = (xy + xy + xz + yz) = (x + y)(x + y)(x + z)(y + z) Fuw-Yi Yang 15