ECE COMBINATIONAL BUILDING BLOCKS - INVEST 13 DECODERS AND ENCODERS

Similar documents
EE1000 Project 4 Digital Volt Meter

1 Introduction to Modulo 7 Arithmetic

Present state Next state Q + M N

Seven-Segment Display Driver

Cycles and Simple Cycles. Paths and Simple Paths. Trees. Problem: There is No Completely Standard Terminology!

b. How many ternary words of length 23 with eight 0 s, nine 1 s and six 2 s?

QUESTIONS BEGIN HERE!

Outline. 1 Introduction. 2 Min-Cost Spanning Trees. 4 Example

QUESTIONS BEGIN HERE!

Outline. Computer Science 331. Computation of Min-Cost Spanning Trees. Costs of Spanning Trees in Weighted Graphs

Designing A Concrete Arch Bridge

An undirected graph G = (V, E) V a set of vertices E a set of unordered edges (v,w) where v, w in V

# 1 ' 10 ' 100. Decimal point = 4 hundred. = 6 tens (or sixty) = 5 ones (or five) = 2 tenths. = 7 hundredths.

CSE 373: More on graphs; DFS and BFS. Michael Lee Wednesday, Feb 14, 2018

(2) If we multiplied a row of B by λ, then the value is also multiplied by λ(here lambda could be 0). namely

, each of which is a tree, and whose roots r 1. , respectively, are children of r. Data Structures & File Management

Math 61 : Discrete Structures Final Exam Instructor: Ciprian Manolescu. You have 180 minutes.

Decimals DECIMALS.

Walk Like a Mathematician Learning Task:

12/3/12. Outline. Part 10. Graphs. Circuits. Euler paths/circuits. Euler s bridge problem (Bridges of Konigsberg Problem)

Exam 1 Solution. CS 542 Advanced Data Structures and Algorithms 2/14/2013

5/9/13. Part 10. Graphs. Outline. Circuits. Introduction Terminology Implementing Graphs

What do you know? Listen and find. Listen and circle. Listen and chant. Listen and say. Lesson 1. sheep. horse

Constructive Geometric Constraint Solving

MAT3707. Tutorial letter 201/1/2017 DISCRETE MATHEMATICS: COMBINATORICS. Semester 1. Department of Mathematical Sciences MAT3707/201/1/2017

S i m p l i f y i n g A l g e b r a SIMPLIFYING ALGEBRA.

CS September 2018

Paths. Connectivity. Euler and Hamilton Paths. Planar graphs.

Limits Indeterminate Forms and L Hospital s Rule

CSE 373: AVL trees. Warmup: Warmup. Interlude: Exploring the balance invariant. AVL Trees: Invariants. AVL tree invariants review

V={A,B,C,D,E} E={ (A,D),(A,E),(B,D), (B,E),(C,D),(C,E)}

V={A,B,C,D,E} E={ (A,D),(A,E),(B,D), (B,E),(C,D),(C,E)}

Graphs. Graphs. Graphs: Basic Terminology. Directed Graphs. Dr Papalaskari 1

Integration Continued. Integration by Parts Solving Definite Integrals: Area Under a Curve Improper Integrals

Graph Isomorphism. Graphs - II. Cayley s Formula. Planar Graphs. Outline. Is K 5 planar? The number of labeled trees on n nodes is n n-2

SAMPLE PAGES. Primary. Primary Maths Basics Series THE SUBTRACTION BOOK. A progression of subtraction skills. written by Jillian Cockings

COMP108 Algorithmic Foundations

CSE 373. Graphs 1: Concepts, Depth/Breadth-First Search reading: Weiss Ch. 9. slides created by Marty Stepp

The University of Sydney MATH2969/2069. Graph Theory Tutorial 5 (Week 12) Solutions 2008

COMPLEXITY OF COUNTING PLANAR TILINGS BY TWO BARS

Module graph.py. 1 Introduction. 2 Graph basics. 3 Module graph.py. 3.1 Objects. CS 231 Naomi Nishimura

CSC Design and Analysis of Algorithms. Example: Change-Making Problem

12. Traffic engineering

0.1. Exercise 1: the distances between four points in a graph

Section 3: Antiderivatives of Formulas

Graphs. CSC 1300 Discrete Structures Villanova University. Villanova CSC Dr Papalaskari

Numbering Boundary Nodes

Aquauno Video 6 Plus Page 1

Outline. Binary Tree

The Plan. Honey, I Shrunk the Data. Why Compress. Data Compression Concepts. Braille Example. Braille. x y xˆ

The University of Sydney MATH 2009

Page 1. Question 19.1b Electric Charge II Question 19.2a Conductors I. ConcepTest Clicker Questions Chapter 19. Physics, 4 th Edition James S.

Instructions for Section 1

TOPIC 5: INTEGRATION

Garnir Polynomial and their Properties

ECE Experiment #6 Kitchen Timer

Multipoint Alternate Marking method for passive and hybrid performance monitoring

a b c cat CAT A B C Aa Bb Cc cat cat Lesson 1 (Part 1) Verbal lesson: Capital Letters Make The Same Sound Lesson 1 (Part 1) continued...

Last time: introduced our first computational model the DFA.

Algorithmic and NP-Completeness Aspects of a Total Lict Domination Number of a Graph

Outline. Circuits. Euler paths/circuits 4/25/12. Part 10. Graphs. Euler s bridge problem (Bridges of Konigsberg Problem)

d e c b a d c b a d e c b a a c a d c c e b

CS 241 Analysis of Algorithms

Using the Printable Sticker Function. Using the Edit Screen. Computer. Tablet. ScanNCutCanvas

Solutions to Homework 5

Solutions for HW11. Exercise 34. (a) Use the recurrence relation t(g) = t(g e) + t(g/e) to count the number of spanning trees of v 1

Why the Junction Tree Algorithm? The Junction Tree Algorithm. Clique Potential Representation. Overview. Chris Williams 1.

Planar Upward Drawings

Grade 7/8 Math Circles March 4/5, Graph Theory I- Solutions

5/7/13. Part 10. Graphs. Theorem Theorem Graphs Describing Precedence. Outline. Theorem 10-1: The Handshaking Theorem

Binomials and Pascal s Triangle

Module 2 Motion Instructions

Ch 1.2: Solutions of Some Differential Equations

Complete Solutions for MATH 3012 Quiz 2, October 25, 2011, WTT

HIGHER ORDER DIFFERENTIAL EQUATIONS

Experiment # 3 Introduction to Digital Logic Simulation and Xilinx Schematic Editor

SOLVED EXAMPLES. be the foci of an ellipse with eccentricity e. For any point P on the ellipse, prove that. tan

Physics 3150, Laboratory 9 Clocked Digital Logic and D/A Conversion

Math 166 Week in Review 2 Sections 1.1b, 1.2, 1.3, & 1.4

1. Determine whether or not the following binary relations are equivalence relations. Be sure to justify your answers.

10/30/12. Today. CS/ENGRD 2110 Object- Oriented Programming and Data Structures Fall 2012 Doug James. DFS algorithm. Reachability Algorithms

CS61B Lecture #33. Administrivia: Autograder will run this evening. Today s Readings: Graph Structures: DSIJ, Chapter 12

Polygons POLYGONS.

Organization. Dominators. Control-flow graphs 8/30/2010. Dominators, control-dependence. Dominator relation of CFGs

CS200: Graphs. Graphs. Directed Graphs. Graphs/Networks Around Us. What can this represent? Sometimes we want to represent directionality:

CSE303 - Introduction to the Theory of Computing Sample Solutions for Exercises on Finite Automata

Announcements. Not graphs. These are Graphs. Applications of Graphs. Graph Definitions. Graphs & Graph Algorithms. A6 released today: Risk

INTEGRALS. Chapter 7. d dx. 7.1 Overview Let d dx F (x) = f (x). Then, we write f ( x)

In order to learn which questions have been answered correctly: 1. Print these pages. 2. Answer the questions.

Trees as operads. Lecture A formalism of trees

Tangram Fractions Overview: Students will analyze standard and nonstandard

8Algebraic UNCORRECTED SAMPLE PAGES. techniques. What you will learn. Australian curriculum. Chapter 8A 8B 8C 8D 8E 8F

ECE Experiment #4 Seven Segment Display Interfacing and Timing

In which direction do compass needles always align? Why?

A Simple Code Generator. Code generation Algorithm. Register and Address Descriptors. Example 3/31/2008. Code Generation

Practice Final Exam. 3.) What is the 61st term of the sequence 7, 11, 15, 19,...?

CS 461, Lecture 17. Today s Outline. Example Run

Fundamental Algorithms for System Modeling, Analysis, and Optimization

FSA. CmSc 365 Theory of Computation. Finite State Automata and Regular Expressions (Chapter 2, Section 2.3) ALPHABET operations: U, concatenation, *

N=4 L=4. Our first non-linear data structure! A graph G consists of two sets G = {V, E} A set of V vertices, or nodes f

Transcription:

C 24 - COMBINATIONAL BUILDING BLOCKS - INVST 3 DCODS AND NCODS FALL 23 AP FLZ To o "wll" on this invstition you must not only t th riht nswrs ut must lso o nt, omplt n onis writups tht mk ovious wht h prolm is, how you'r solvin th prolm n wht your nswr is You lso n to inlu rwins o ll iruits s wll s pproprit rphs n tls In th lst Invstition w look t som o th si proprtis o th inputs n outputs o loi iruits Th ojtiv o this n th nt svrl Invstitions is to look t som si MSI (Mium Sl Intrtion) loi iruits m rom 2 to ts tht r vry usul in mny pplitions In this invstition w look t nors n ors or trnsltin t rom on o to nothr lik rom sin mnitu to 2's omplmnt W in with rviw prolm Givn th ollowin loi iruit with truth tl s ollows Fin th truth tl whn th nl n outputs r tiv low s ollows 2 Dors n nors r vry importnt loi iruits tht onvrt t rom on o to nothr Binry ors in prtiulr r loi iruits lik th ollowin 2-to-4 or with n=2 inputs n N = 2 n = 2 2 = 4 outputs n th ollowin Truth Tl

Dsri wht this or is oin Mmoriz this rltionship 3 On possil pplition o 2-to-4 or lik th on in Prolm (2) is tri liht ontrollr with ontrollin th lihts on Min Strt s ollows - Grn Liht n WALK sinl - DON'T WALK sinl - Yllow Liht - Liht s th input X X os rom to Com up with your own pplition o or tht is irnt rom thos o your rins 4 Drw rliztion o th 2-to-4 or in Prolm (2) rom AND ts n INVTS You n us ts with mor thn two inputs 5 Suppos th 2-to-4 or in Prolm (2) is hn so tht now th nl n th outputs r tiv low Drw th hip irm Drw th loi irm to rliz th iruit Writ out th truth tl 6 On o th rlly usul turs o MSI iruits lik ors is tht thy n put tothr to orm lrr ors Givn th ollowin 3-to-8 or m rom two 2-to-4 ors Y4 Y5 Y6 Y7 Writ th truth tl Dsri wht's oin on in this loi iruit 7 Th ojtiv o this prolm is to introu svn-smnt isplys I w look losly t iitl wths n loks w s svn-smnt isplys s ollows 2

with smnts (lins) tht liht up to orm th irnt numrs Whih o th smnts liht up to orm th numrs 3 5 8 Up to now w'v only n workin with inry ors tht hv on output ssrt t tim But mor nrl ors lik th ollowin BCD to svn-smnt or BL typilly hv mny outputs ssrt t tim Vriy this t y writin out th truth tl or th svn-smnt or ov tht tlls th isply whih smnts to turn ON n whih to kp OFF or h BCD numr rom to 9 Not tht whn th input BL= th isply is lnk - ll smnts r OFF An whn BL= th BCD input is o Also not tht thr r mny othr usul ors lik BCD-to-Binry n Binry-to-BCD 9 As w'v sn ov th output o inry or lik th ollowin tlls us th vlu o th inry numr t th input Th orrsponin inry nor s ollows os just th opposit It tlls us th inry o o th slt input 3

Writ th Truth Tl o th inry nor i only on input n slt t tim liz your nor with O ts plin th oprtion o th th ollowin iruit 5 volts 2 3 Kyor-to-BCD X9 onsistin o lultor kyor onnt to kyor-to-bcd nor In th prvious two prolms w'v n ssumin tht only on input woul slt t tim But thr r mny situtions in rl pplitions whr mor thn on input is "omptin or ttntion" lik whn svrl usrs r tryin to ss shr printr t th sm tim On wy to hnl this sitution is with priority nors Whn mor thn on input is slt th priority nor nos th on with th hihst priority Lt's suppos th ollowin is priority nor with hvin th hihst priority n th lowst Th trik in sinin suh iruit is to irst sin "prioritizr" n thn onnt it to "rulr" nor s ollows PIOITIZ H H H2 H3 D D D2 D3 4

with truth tl s ollows H H H2 H3 M M How n you tll rom th truth tl tht hs th hihst priority How n you tll rom th truth tl tht hs th lowst priority Dsin th prioritizr Dsri in wors th ovrll oprtion o th iruit 2 Th ojtiv o this prolm is to show how ors n us to rliz nrl loi qutions Suppos or mpl tht w wnt to rliz th ollowin loi qution F = X' Y' + X Y' Writ th Truth Tl or F Mk us o your truth tl in prt () to plin why F n rliz with 2-to-4 or s ollows X Y F Us 2-to-4 or with tiv hih inputs n outputs to rliz F = X Y' + X' Y pt prt () i th input o th or is tiv hih n th output tiv low Mmoriz th rsults o this prolm 5