Rise and rise again until lambs become lions 授課老師:伍紹勳 課程助教:邱麟凱、江長庭.

Slides:



Advertisements
Similar presentations
Logic Gates.
Advertisements

5.5 Encoders A encoder is a multiple-input, multiple-output logic circuit that converts coded inputs into coded outputs, where the input and output codes.
Give qualifications of instructors: DAP
CDA 3100 Recitation Week 10.
Logic Circuits Design presented by Amr Al-Awamry
Logic Design Lab3 老師 : 伍紹勳 助教 : 江長庭 鄭仲傑. Equipment IC : –7408(AND) x 1 –7432(OR) x 1 –7486(XOR) x 1 –LED x 3.
7-Segment Displays Lecture L6.1 Section 6.3. Turning on an LED.
ECE 238L Computer Logic Design Spring 2010
التصميم المنطقي Second Course
Rise and rise again until lambs become lions 授課老師:伍紹勳 課程助教:邱麟凱、江長庭.
ECE 3110: Introduction to Digital Systems Simplifying Sum of Products using Karnaugh Maps.
Sequential Logic Design
ECE 301 – Digital Electronics Multiplexers and Demultiplexers (Lecture #12)
1 Forging new generations of engineers. 2 DESIGN EXAMPLE “Date of Birth Problem”
Rise and rise again until lambs become lions 授課老師:伍紹勳 課程助教:邱麟凱、江長庭.
Part 2: DESIGN CIRCUIT. LOGIC CIRCUIT DESIGN x y z F F = x + y’z x y z F Truth Table Boolean Function.
ITEC 352 Lecture 5 Low level components(3). Low level components Review Multiplexers Demultiplexer Minterm/Maxterm Karnaugh Map.
Rise and rise again until lambs become lions 授課老師:伍紹勳 課程助教:邱麟凱、江長庭.
Rise and rise again until lambs become lions 授課老師:伍紹勳 課程助教:江長庭、柯俊先.
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.
Logic Experiment 4 老師:伍紹勳 助教:江長庭 鄭仲傑.
F = ∑m(1,4,5,6,7) F = A’B’C+ (AB’C’+AB’C) + (ABC’+ABC) Use X’ + X = 1.
Rise and rise again until lambs become lions 授課老師:伍紹勳 課程助教:邱麟凱、江長庭 有情助教:蔡東倫.
COMPSCI 210 Semester Tutorial 2: Logic Gates.
Gates and Logic Dr John Cowell phones off (please)
Logic Design CS 270: Mathematical Foundations of Computer Science Jeremy Johnson.
Linear Algebra. Circuits The circuits in computers and other input devices have inputs, each of which is either a 0 or 1, the output is also 0s and 1s.
Rise and rise again until lambs become lions 授課老師:伍紹勳 課程助教:邱麟凱、江長庭.
Sneha.  A combinational circuit that performs the addition of two bits is called a half adder.  It has two inputs.  It has two outputs.
ECE 331 – Digital System Design Multiplexers and Demultiplexers (Lecture #13)
Digital Integrated Circuit Design Laboratory Department of Computer Science and Information Engineering National Cheng Kung University Experiment on digital.
Multiplexors Decoders  Decoders are used for forming separate signals for different combination of input signals.  The multiplexer circuit is a digital.
Chapter 3: Combinational Functions and Circuits 3-5 to 3-7: Decoders
MSI Combinational logic circuits
Rise and rise again until lambs become lions 授課老師:伍紹勳 課程助教:江長庭、柯俊先.
3.13 How many output lines will a five-input decoder have?
CEC 220 Digital Circuit Design Boolean Algebra II Fri, Sept 4 CEC 220 Digital Circuit Design Slide 1 of 13.
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.
Multiplexer.
Logic Design Lab1 老師 : 伍紹勳 助教 : 江長庭 鄭仲傑. 清點器材 邏輯分析儀 *1 1pin 線 *4 8pin 線 *2 紅鱷魚夾 *1 黑鱷魚夾 *1 USB 線 *1.
Decoders A decoder is a logic circuit that detects the presence of a specific combination of bits at its input. Two simple decoders that detect the presence.
Lab 07 :Converting an older IC technology drill machine to VHDL: Slide 2 Slide 3 Generate a Truth Table from an Equation Generate a Truth Table from a.
Instructor: Oluwayomi Adamo Digital Systems Design.
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.
Eng. Mai Z. Alyazji October, 2016
Logic Gates.
Logic Gates Practical Objective: to develop an understanding of logic circuits and truth tables.
Lab02 :Logic Gate Fundamentals:
Combinational Functions and Circuits
Lecture 4: Combinational Functions and Circuits
ECE 2110: Introduction to Digital Systems
Combinational Circuits
Computer Architecture CST 250
Reference: Chapter 3 Moris Mano 4th Edition
KS4 Electricity – Electronic systems
KS4 Electricity – Electronic systems
Summary Half-Adder Basic rules of binary addition are performed by a half adder, which has two binary inputs (A and B) and two binary outputs (Carry out.
Example Question: Consider the expressions: (a) F = XY + XY'
Design Example “Date of Birth Problem”
KS4 Electricity – Electronic systems
Gates Type AND denoted by X.Y OR denoted by X + Y NOR denoted by X + Y
DIGITAL ELECTRONICS B.SC FY
Digital Logic Experiment
Logic Design LAB 7 授課老師:伍紹勳 課程助教:邱麟凱、江長庭.
Prof. Onur Mutlu ETH Zurich Spring March 2019
Department of Electronics
Space groups Start w/ 2s and 21s 222.
Eng. Ahmed M Bader El-Din October, 2018
Dept. of Electrical and Computer Eng., NCTU
Presentation transcript:

Rise and rise again until lambs become lions 授課老師:伍紹勳 課程助教:邱麟凱、江長庭

Rise and rise again until lambs become lions Outlines 3-bit to 8-output Decoder – Truth table – Circuit Lab

Rise and rise again until lambs become lions 3-bit to 8-output Decoder Decoder – Example : Taking attendance for demo The process of mapping the ID number to the corresponding name 010 ID numberName 000Tim 001Sony 111Tony

Rise and rise again until lambs become lions 3-bit to 8-output Decoder Truth table – 3 inputs 2 3 (8) outputs

Rise and rise again until lambs become lions 3-bit to 8-output Decoder Logic circuit

Rise and rise again until lambs become lions Lab Build a 3-bit to 8-output decoder by AND, OR and Inverter – Use 8 LEDs to show different outcomes D0 D1D2 D3D4D5D6D7 Please put the LEDs in line and use them to denote the outcomes in order

Rise and rise again until lambs become lions Lab – Tip Follow the step and construct these outcomes 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

Rise and rise again until lambs become lions Lab You circuit should like this one