Dept. of Electrical and Computer Eng., NCTU 1 Lab 5. 3-to-8 Decoder Presenter: Chun-Hsien Ko Contributors: Chung-Ting Jiang and Lin-Kai Chiu.

Slides:



Advertisements
Similar presentations
Give qualifications of instructors: DAP
Advertisements

CDA 3100 Recitation Week 10.
1 CK Cheng CSE Dept. UC San Diego CS 140, Lecture 2 Combinational Logic.
Logic Functions Logical functions can be expressed in several ways: ▫ Truth table ▫ Logical expressions ▫ Graphical form prepared by:eng.Rula Amjed.
Iteration & Branching CSC 171 FALL 2001 LECTURE 5.
Lecture 2 Dr Richard Reilly Dept. of Electronic & Electrical Engineering Room 153, Engineering Building To insert your company logo on this slide From.
1 Section 10.1 Boolean Functions. 2 Computers & Boolean Algebra Circuits in computers have inputs whose values are either 0 or 1 Mathematician George.
Sequential Logic Design
Section 10.3 Logic Gates.
BOOLEAN LOGIC CSC 171 FALL 2004 LECTURE 7. ASSIGNMENT Review Quiz # 2 Start reading Chapter 5.
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.
ECE 301 – Digital Electronics Multiplexers and Demultiplexers (Lecture #12)
Boolean Algebra and Truth Table The mathematics associated with binary number system (or logic) is call Boolean: –“0” and “1”, or “False” and “True” –Calculation.
Circuit Simplification: Boolean Algebra
22C:19 Discrete Math Boolean Algebra & Digital Logic Fall 2010 Sukumar Ghosh.
Boolean Algebra – I. Outline  Introduction  Digital circuits  Boolean Algebra  Two-Valued Boolean Algebra  Boolean Algebra Postulates  Precedence.
Chapter 4 The Building Blocks: Binary Numbers, Boolean Logic, and Gates.
Chapter 3.5 Logic Circuits. How does Boolean algebra relate to computer circuits? Data is stored and manipulated in a computer as a binary number. Individual.
Ch. 4 Boolean Algebra and Logic Simplification
Discrete Mathematics and Its Applications.  The English mathematician George Boole ( ) sought to give symbolic form to Aristotle's system of.
Logic Design CS 270: Mathematical Foundations of Computer Science Jeremy Johnson.
Binary System Presented by Mr. Wilhelmi Internal Representation of Data Input Input  Data that is put into the computer for processing Data Data  The.
Digital Integrated Circuit Design Laboratory Department of Computer Science and Information Engineering National Cheng Kung University Experiment on digital.
Chapter 4 Fundamentals of Computer Logic 1 Chapter 4: Fundamental of Computer Logic - IE337.
Dept. of Electrical and Computer Eng., NCTU 1 Lab 4. BCD Adder Presenter: Chun-Hsien Ko Contributors: Chung-Ting Jiang and Lin-Kai Chiu.
ECEN 248 Lab 2: Logic Minimization and Karnaugh Maps
R. Johnsonbaugh Discrete Mathematics 5 th edition, 2001 Chapter 9 Boolean Algebras and Combinatorial Circuits.
Dept. of Electrical and Computer Eng., NCTU 1 Lab 9. Up Counter Presenter: Chun-Hsien Ko Contributors: Chung-Ting Jiang and Lin-Kai Chiu.
Dept. of Electrical and Computer Eng., NCTU
1 Ch. 4 Boolean Algebra and Logic Simplification Boolean Operations and Expressions Laws and Rules of Boolean Algebra Boolean Analysis of Logic Circuits.
Dept. of Electrical and Computer Eng., NCTU 1 Lab 8. D-type Flip-Flop Presenter: Chun-Hsien Ko Contributors: Chung-Ting Jiang and Lin-Kai Chiu.
Dept. of Electrical and Computer Eng., NCTU
Combinational Circuits. Outline Boolean Algebra Decoder Encoder MUX.
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.
Boolean Algebra Boolean algebra was introduced by George Boole in his first book The Mathematical Analysis of Logic (1847), perfected in the late 19th.
Boolean Algebra. BOOLEAN ALGEBRA Formal logic: In formal logic, a statement (proposition) is a declarative sentence that is either true(1) or false (0).
Dept. of Electrical and Computer Eng., NCTU 1 Lab 1. Full Adder Presenter: Chun-Hsien Ko Contributors: Chung-Ting Jiang and Lin-Kai Chiu.
Dept. of Electrical and Computer Eng., NCTU 1 Lab 7. 8-to-1 Multiplexer Presenter: Chun-Hsien Ko Contributors: Chung-Ting Jiang and Lin-Kai Chiu.
Decoders Zhijian John Wang. What are they? Overview of a decoder A device that reverses the process of an encoder Convert information from one format.
Minute Paper 4/4/04 Z=50+j86.7=100
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.
Rise and rise again until lambs become lions 授課老師:伍紹勳 課程助教:邱麟凱、江長庭.
Dept. of Electrical and Computer Eng., NCTU 1 Lab 10. Up/Down Counter Presenter: Chun-Hsien Ko Contributors: Chung-Ting Jiang and Lin-Kai Chiu.
Chapter 3 Digital circuits. 3.1 Logic signals - Gates Binary system : (binary bits or digits) - 0 & 1 - LOW & HIGH - Negated and Asserted.
Logic Gates Binary Day 3 PEOPLE 2016.
Lesson Objectives Aims You should be able to:
Eng. Mai Z. Alyazji October, 2016
Dept. of Electrical and Computer Eng., NCTU
Computer Science 210 Computer Organization
Dept. of Electrical and Computer Eng., NCTU
Combinational Circuits
Lab02 :Logic Gate Fundamentals:
Gate Circuits and Boolean Equations
CSCI-100 Introduction to Computing
Overview Part 1 – Gate Circuits and Boolean Equations
CHAPTER 3 SETS AND BOOLEAN ALGEBRA
Dept. of Electrical and Computer Eng., NCTU
Combinational Circuits
Computer Architecture CST 250
Reference: Chapter 3 Moris Mano 4th Edition
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.
Thursday, 22 November 2018 Logic Gates
Example Question: Consider the expressions: (a) F = XY + XY'
Gates Type AND denoted by X.Y OR denoted by X + Y NOR denoted by X + Y
Prof. Onur Mutlu ETH Zurich Spring March 2019
BOOLEAN ALGEBRA.
Eng. Ahmed M Bader El-Din October, 2018
Dept. of Electrical and Computer Eng., NCTU
Dept. of Electrical and Computer Eng., NCTU
Presentation transcript:

Dept. of Electrical and Computer Eng., NCTU 1 Lab 5. 3-to-8 Decoder Presenter: Chun-Hsien Ko Contributors: Chung-Ting Jiang and Lin-Kai Chiu

Logic DesignLab 5. 3-to-8 DecoderChun-Hsien Ko Dept. of Electrical and Computer Eng., NCTU 2 Outlines What is Decoder? 3-bit to 8-output Decoder One-hot Logic Design Lab 5: 3-to-8 Decoder November 2, 2015: George Boole’s 200th Birthday

Logic DesignLab 5. 3-to-8 DecoderChun-Hsien Ko What is Decoder? Transformation between 2 different format 1-to-1 mapping Example : Taking attendance for demo The process of mapping the ID number to the corresponding name Dept. of Electrical and Computer Eng., NCTU ID numberName 000Tim 001Sony …… 111Tony

Logic DesignLab 5. 3-to-8 DecoderChun-Hsien Ko Dept. of Electrical and Computer Eng., NCTU 4

Logic DesignLab 5. 3-to-8 DecoderChun-Hsien Ko Dept. of Electrical and Computer Eng., NCTU 5

Logic DesignLab 5. 3-to-8 DecoderChun-Hsien Ko Lab 5: 3-to-8 Decoder Input: 3-bit binary input with DIP switch Output: 8 output with LED How do you design your 3-to-8 decoder from truth table? Dept. of Electrical and Computer Eng., NCTU 6 D0 D1D2 D3D4D5D6D7 Please put the LEDs in line and use them to denote the outputs of circuit

Logic DesignLab 5. 3-to-8 DecoderChun-Hsien Ko Lab 5: 3-to-8 Decoder Tip: Follow the step and construct these outcomes Dept. of Electrical and Computer Eng., NCTU 7 XYZXYZ X Y Z X’ Y’ Z’ X’Y’ X’Y XY’ XY (X’Y’)Z’ (X’Y’)Z (X’Y)Z’ (X’Y)Z (XY’)Z’ (XY’)Z (XY)Z’ (XY)Z

Logic DesignLab 5. 3-to-8 DecoderChun-Hsien Ko Dept. of Electrical and Computer Eng., NCTU 8

Logic DesignLab 5. 3-to-8 DecoderChun-Hsien Ko November 2, 2015 George Boole’s 200th Birthday E5%AD%B8%E5%8F%B2%E4%B8%8A%E7%9A%84%E4 %BB%8A%E5%A4%A9112%E5%B8%83%E7%88%BE%E 8%AA%95%E8%BE%B0george-boole E5%AD%B8%E5%8F%B2%E4%B8%8A%E7%9A%84%E4 %BB%8A%E5%A4%A9112%E5%B8%83%E7%88%BE%E 8%AA%95%E8%BE%B0george-boole Dept. of Electrical and Computer Eng., NCTU 9

Logic DesignLab 5. 3-to-8 DecoderChun-Hsien Ko November 2, 2015 George Boole’s 200th Birthday The Mathematical Analysis of Logic, by George Boole An Investigation of the Laws of Thought, by George Boole Dept. of Electrical and Computer Eng., NCTU 10 No matter how correct a mathematical theorem may appear to be, one ought never to be satisfied that there was not something imperfect about it until it gives the impression of also being beautiful. - George Boole