Lab 6 – Part C2 Circuit for Problem 3.6 p 20. a b s y z = ~s & a w = s & b = ~s & a  s & b b s a ~s w = (b & s ) z = (a & ~s ) y = ~ (z & w) De Morgan’s.

Slides:



Advertisements
Similar presentations
Basic Logic Gates Discussion D5.1 Section Sections 13-3, 13-4.
Advertisements

Combinational Logic Circuits Chapter 2 Mano and Kime.
Morgan Kaufmann Publishers
1/03/09 De 89 à 98. 1/03/09 De 89 à 98 1/03/09 De 89 à 98.
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.
Logic Design Fundamentals - 1 Lecture L1.1. Logic Design Fundamentals - 1 Basic Gates Basic Combinational Circuits Basic Sequential Circuits.
Example of Digital Problem  To build a logic circuit of an Alarm System at the office (with one door and one window) that will ring if the door or window.
Relationship Between Basic Operation of Boolean and Basic Logic Gate The basic construction of a logical circuit is gates Gate is an electronic circuit.
How to build a digital gate. CMOS NAND Gate Several realization of NOT 1. This is how a NOT operation is often represented schematically. 2. Sometimes.
Boolean Algebra Module M4.1 Section 5.1. Boolean Algebra and Logic Equations Switching Algebra Theorems Venn Diagrams.
Logic Gates.
4/11/03 Minute Paper How does MS window work? Like how do we have the screen on the computer. Is it just a bunch of Binary #’s representing colors? When.
Introduction to Computer Engineering by Richard E. Haskell Basic Logic Gates Module M1.1 Section 3.1.
10/25/2004EE 42 fall 2004 lecture 231 Lecture #23 Synthesis Next week: Converting gates into circuits.
Lab 1 Structure of a PLD Module M1.4 Experiment 1 (p. 40)
Generalized De Morgan’s Theorem Lecture L5.4 Section 5.1.
Combinational Logic Circuits Chapter 2 Mano and Kime.
ENGG 1203 Tutorial Combinational Logic (I) 1 Feb Learning Objectives
Floyd Digital Fundamentals, 9/e Copyright ©2006 by Pearson Education, Inc. Upper Saddle River, New Jersey All rights reserved. Slide 1 Digital Fundamentals.
Homework 2 Due 28 th May Implement This Function using 1)a 3-to-8 Line Decoder (with OR gates) 2) a 3-to-8 Line Active Low Decoder (with NAND gates)
Chapter 10_1 Digital Logic. Irvine, Kip R. Assembly Language for Intel-Based Computers, NOT AND OR XOR NAND NOR Truth Tables Boolean Operators.
Digital Electronics Lecture 4 Simplification using Boolean Algebra, Combinational Logic Circuit Design.
Rise and rise again until lambs become lions 授課老師:伍紹勳 課程助教:邱麟凱、江長庭 有情助教:蔡東倫.
COMPSCI 210 Semester Tutorial 2: Logic Gates.
Unit 7 Multi-Level Gate Circuits Nand and Nor Gates Fundamentals of Logic Design Roth and Kinny.
Logic Gates Shashidhara H S Dept. of ISE MSRIT. Basic Logic Design and Boolean Algebra GATES = basic digital building blocks which correspond to and perform.
Physics 343 Advanced Electronics Engineering 343 Digital Systems Electronics Courses.
NAND-NAND and NOR-NOR Circuits and Even and Odd Logic Functions
Using De’Morgan’s On of the most useful principles in boolean algebra is De’Morgan’s Theorem, which allows one to switch between ANDs and NORs and ORs.
Digital Integrated Circuit Design Laboratory Department of Computer Science and Information EngineeringNational Cheng Kung University 陳培殷 國立成功大學 資訊工程系.
Digital Electronics Digital Electronics G.S.UTHAYAKUMAR ST.JOSEPH’S COLLEGE OF ENGINEERING,CHENNAI-119.
NAND-NAND and NOR-NOR Circuits and Even and Odd Logic Functions ECE 301 – Digital Electronics.
Lecture 4 Introduction to Boolean Algebra. Binary Operators In the following descriptions, we will let A and B be Boolean variables and define a set of.
Solid-State Devices & Circuits
CEC 220 Digital Circuit Design More Karnaugh Maps Monday, February 02 CEC 220 Digital Circuit Design Slide 1 of 11.
CHAPTER 5 Combinational Logic Analysis
Dept. of Electrical and Computer Eng., NCTU 1 Lab 2. NAND and XOR Presenter: Chun-Hsien Ko Contributors: Chung-Ting Jiang and Lin-Kai Chiu.
Logic Design (CE1111 ) Lecture 2 (Chapter 2) Prepared by Dr. Lamiaa Elshenawy 1.
Chapter 5 Boolean Algebra and Reduction Techniques 1.
President UniversityErwin SitompulDigital Systems 4/1 Lecture 4 Digital Systems Dr.-Ing. Erwin Sitompul President University
WORKING PRINCIPLE OF DIGITAL LOGIC
Instructor: Alexander Stoytchev CprE 281: Digital Logic.
CHAPTER 13 Digital Logic Circuits. Figure Voltage analog of internal combustion engine in-cylinder pressure Figure 13.1.
。 33 投资环境 3 开阔视野 提升竞争力 。 3 嘉峪关市概况 。 3 。 3 嘉峪关是一座新兴的工业旅游城市,因关得名,因企设市,是长城文化与丝路文化交 汇点,是全国唯一一座以长城关隘命名的城市。嘉峪关关城位于祁连山、黑山之间。 1965 年建市,下辖雄关区、镜铁区、长城区, 全市总面积 2935.
Basic Gates and ICs 74LS00 Quad 2-Input NAND gate 74LS02 Quad 2-Input NOR gate 74LS04 Quad 2-Input NOT gate 74LS08 Quad 2-Input AND gate 74LS32 Quad 2-Input.
Hoda Roodaki Boolean Algebra Hoda Roodaki
Dr. Ameria Eldosoky Discrete mathematics
Eng. Mai Z. Alyazji October, 2016
ECE 3130 Digital Electronics and Design
NAND & NOR as Universal gates
Discussion D5.1 Section Sections 13-3, 13-4
Chapter 12 : Field – Effect Transistors
Circuits, Truth Tables & Boolean Algebra
Multi-Level Gate Circuits NAND and NOR Gates
Instructor: Alexander Stoytchev
Reading: Hambley Ch. 7 through 7.5
Chapter 2 Introduction to Logic Circuits
13 Digital Logic Circuits.
Gates Type AND denoted by X.Y OR denoted by X + Y NOR denoted by X + Y
University of Maryland Baltimore County Department of Computer Science and Electrical Engineering   CMPE 212 Laboratory (Discussion 4) Hasib Hasan
Discussion D5.1 Section Sections 13-3, 13-4
Basic Logic Gates.
Basic Logic Gates.
Circuits, Truth Tables & Boolean Algebra
Instructor: Alexander Stoytchev
Boolean Algebra By: Asst Lec. Besma Nazar Nadhem
Eng. Ahmed M Bader El-Din October, 2018
Dept. of Electrical and Computer Eng., NCTU
Boolean Algebra.
Presentation transcript:

Lab 6 – Part C2 Circuit for Problem 3.6 p 20

a b s y z = ~s & a w = s & b = ~s & a  s & b b s a ~s w = (b & s ) z = (a & ~s ) y = ~ (z & w) De Morgan’s Theorem : y = z  w = ~ (~z & ~w) ~s

b s a w = ~ (b & s ) z = ~ (a & ~s ) y = ~ (z & w ) Note that we now have four NAND gates so we can implement the above circuit using the 7400 chip b s a ~s w = (b & s ) z = (a & ~s ) y = ~ (z & w)

a b s y ~s & a s & b = ~s & a  s & b as b s & b ~s & a ~s y 1 ~s

b s a w = ~ (b & s ) z = ~ (a & ~s ) y = ~ (z & w ) as b ~(b & s)~(a & ~s) ~s y 1

a b s y a & ~s b & s = b & s  a & ~s b s a ~s w = ~ (b & s ) z = ~ (a & ~s ) y = ~ (z & w ) Thus the two circuits above realize the same function