EE1000 Project 4 Digital Volt Meter

Similar documents
ECE COMBINATIONAL BUILDING BLOCKS - INVEST 13 DECODERS AND ENCODERS

Seven-Segment Display Driver

Present state Next state Q + M N

CS September 2018

1 Introduction to Modulo 7 Arithmetic

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

QUESTIONS BEGIN HERE!

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

Designing A Concrete Arch Bridge

QUESTIONS BEGIN HERE!

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

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

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

Decimals DECIMALS.

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

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

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

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

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

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

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

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

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

Construction 11: Book I, Proposition 42

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

ICM7226A, ICM7226B. 8-Digit, Multi-Function, Frequency Counter/Timer. Features. Description. Applications. Ordering Information.

ICM7226A ICM7226B 8-Digit Multi-Function Frequency Counter/Timers

Section 3: Antiderivatives of Formulas

DUET WITH DIAMONDS COLOR SHIFTING BRACELET By Leslie Rogalski

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

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

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

Tangram Fractions Overview: Students will analyze standard and nonstandard

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

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

ICM7216A, ICM7216B ICM7216D 8-Digit Multi-Function Frequency Counter/Timer

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

Multipoint Alternate Marking method for passive and hybrid performance monitoring

Overview. Usages of Fault Simulators. Problem and Motivation. Alternatives and Their Limitations. VLSI Design Verification and Testing

Constructive Geometric Constraint Solving

ATF15xx-DK3 USER GUIDE. Introduction. Kit Contents. Device Support. CPLD Development/Programmer Kit

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

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

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

NO RECOMMENDED REPLACEMENT

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

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

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

ECE Experiment #6 Kitchen Timer

Schick CDR consumables catalogue

EE 209 Lab 3 Mind over Matter

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

learning objectives learn what graphs are in mathematical terms learn how to represent graphs in computers learn about typical graph algorithms

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

In which direction do compass needles always align? Why?

COMP108 Algorithmic Foundations

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

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

Instructions for Section 1

ECE Experiment #4 Seven Segment Display Interfacing and Timing

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...

12. Traffic engineering

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

Aquauno Video 6 Plus Page 1

Problem solving by search

Module 2 Motion Instructions

Outline. Binary Tree

CS 241 Analysis of Algorithms

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

Planar Upward Drawings

CONVERTING UNITS. Converting Units PASSPORT

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

BASIC CAGE DETAILS SHOWN 3D MODEL: PSM ASY INNER WALL TABS ARE COINED OVER BASE AND COVER FOR RIGIDITY SPRING FINGERS CLOSED TOP

Nefertiti. Echoes of. Regal components evoke visions of the past MULTIPLE STITCHES. designed by Helena Tang-Lim

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

5/1/2018. Huffman Coding Trees. Huffman Coding Trees. Huffman Coding Trees. Huffman Coding Trees. Huffman Coding Trees. Huffman Coding Trees

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

Liqiong Wei, Zhanping Chen, and Kaushik Roy. Yibin Ye and Vivek De. logic circuits more feasible.

NMEA 2000 GATEWAY ASSEMBLY

Numbering Boundary Nodes

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

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

COMPLEXITY OF COUNTING PLANAR TILINGS BY TWO BARS

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

BASIC CAGE DETAILS D C SHOWN CLOSED TOP SPRING FINGERS INNER WALL TABS ARE COINED OVER BASE AND COVER FOR RIGIDITY

The University of Sydney MATH 2009

SEE PAGE 2 FOR BRUSH MOTOR WIRING SEE PAGE 3 FOR MANUFACTURER SPECIFIC BLDC MOTOR WIRING EXAMPLES EZ SERVO EZSV17 WIRING DIAGRAM FOR BLDC MOTOR

b.) v d =? Example 2 l = 50 m, D = 1.0 mm, E = 6 V, " = 1.72 #10 $8 % & m, and r = 0.5 % a.) R =? c.) V ab =? a.) R eq =?

Thru CENTER OF SPHERICAL END ±.002 Cylindrical hole depth SMOOTH TRANSITION

Above. Below H&E. Above CD4. CD11b. Fluoromyelin BDA BDA BDA. Cerebral cortex. Focal lesion. Thoracic cord. Lumbar cord. Hindlimb placing score

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

160 SSC Variable Speed Drive (Series C)

Divided. diamonds. Mimic the look of facets in a bracelet that s deceptively deep RIGHT-ANGLE WEAVE. designed by Peggy Brinkman Matteliano

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

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

EXAMPLE 87.5" APPROVAL SHEET APPROVED BY /150HP DUAL VFD CONTROL ASSEMBLY CUSTOMER NAME: CAL POLY SLO FINISH: F 20

JEA - BARTRAM RE-PUMP FACILITY POTABLE WATER STORAGE EXPANSION STRUCTURAL STORAGE TANK PLANS

ENGR 323 BHW 15 Van Bonn 1/7

for Performance Potsdam, NY Urbana, IL can be connected to the inputs and outputs of the LUT to

H SERIES. Decimals. Decimals. Curriculum Ready ACMNA: 103, 128, 129, 130, 152, 154,

Transcription:

Ovrviw EE1000 Projt 4 Diitl Volt Mtr In this projt, w mk vi tht n msur volts in th rn o 0 to 4 Volts with on iit o ury. Th input is n nlo volt n th output is sinl 7-smnt iit tht tlls us wht tht input s volt is to th nrst volt. Dsin Rll tht whn w r with sin prolm, w n to ollow ths sin stps: 1. Unrstn th onpt. 2. Unrstn or rt n lorithm to o th jo W ll isuss this, low. 3. I th prolm is too omplit, suivi n rpt, othrwis, sin it. 4. Tst. Approh (Alorithm) On wy to mk (implmnt) this projt is: 1. Convrt th nlo sinl to iitl. 2. Convrt th iitl t into inry t. 3. Do th inry t or th 7-smnt isply. This lorithm n illustrt y lok irm (S Fiur 1). Anlo Input Convrt to Diitl Convrt to Binry 7-Smnt Dor 7-Smnt Disply Fiur 1 Blok Dirm Rll tht th rrows twn th loks rprsnt inormtion, not nssrily wirs. W will wnt to suivi this sin into 3 prts: () th iitl onvrsion, () th inry onvrsion n () th 7-smnt or n isply. Diitl Convrsion Th sist wy to onvrt n nlo sinl to iitl is to us omprtor. A omprtor tks two input volts (ll n -) n outputs hih iitl sinl i th () input hs hihr volt thn th (-) input, othrwis it outputs low sinl. W will n 4 omprtors to ompr th input to 0.5V, 1.5V, 2.5V n 3.5V s shown in Fiur 2. Th output o ths omprtors r iitl sinls w will ll C 0.5, C 1.5, C 2.5 n C 3.5 rsptivly.

V in 3.5V C 3.5 2.5V C 2.5 1.5V C 1.5 0.5V C 0.5 Fiur 2 Convrtin n Anlo Sinl to Diitl. For this projt, w will usin th MCP6544 qu omprtor (4 omprtors pr hip). A pin irm is inlu t th n o this oumnt. Bs on th input volt, Vin, th output sinls will rspon s shown in Fiur 3. Input Volt C 3.5 C 2.5 C 1.5 C 0.5 0.0<V in <0.5 0 0 0 0 0.5<V in <1.5 0 0 0 1 1.5<V in <2.5 0 0 1 1 2.5<V in <3.5 0 1 1 1 3.5<V in 1 1 1 1 Fiur 3 Comprtor Outputs Bs on Input Volt All tht rmins is to nrt th ix input volts (0.5V throuh 3.5V). Th sist wy to o this is y mns o Volt Divir. A volt ivir is simply nk o sris rsistors sin to prou on or mor spii volts. Sin w hv rult 5 Volt supply, w will us tht or th Volt Divir s shown in Fiur 4. V (5V) 3KΩ 1KΩ 3.5V 2.5V 1.5V 0.5V Fiur 4 Volt Divir

Th rul or th volt ivir is tht th rtio o rsistor to th totl rsistn quls th rtio o th volt ross tht rsistor to th supply volt. In othr wors, V = R V R In this s, V totl = 5V n R totl = 10K. I you work out th mth, th volt ross th 1KΩ rsistor is 0.5V, th volt ross h rsistor is 1.0V n th volt ross th 3KΩ rsistor is 1.5V. Ths volt rops iv us th vrious ix volts w n or th omprtors. Noti tht th rsistor vlus n sl y ny tor (.. oul or hlv) without tin th volts tht r prou. Convrsion to Binry Sin th volts w wish to isply r in th rn 0-4, it will nssry or us to us 3-it sinl to rprsnt th volt. W will ll thos its B 2, B 1 n B 0, with B 0 in lst siniint (i.. th 1 s it). Th inry sinl ns to nrt s on th inputs C 0.5, C 1.5, C 2.5 n C 3.5 s shown in Fiur 5. C 3.5 C 2.5 C 1.5 C 0.5 B 2 B 1 B 0 Disply 0 0 0 0 0 0 0 0 0 0 0 1 0 0 1 1 0 0 1 1 0 1 0 2 0 1 1 1 0 1 1 3 1 1 1 1 1 0 0 4 Fiur 5 Comprtor Outputs Bs on Input Volt Th simplii loi qutions or th 3-it inry sinls r: B = C. C. C. C. B = C. C. B = C. You will n to sin loi iruit (muh s you i in Projt 1) to implmnt ths qutions. Your inputs n outputs r tiv hih. (I tiv low inputs r sir, you n xhn th n inputs in Fiur 2.) 7-Smnt Dor n Disply Doin inry t or 7-smnt isplys is muh lik oin inry t or th i pips in Projt 1, n w n rtinly o h o th smnts with NAND n NOR ts, ut ortuntly n intrt iruit (IC) is vill tht n o ll 7 smnts t on. Th prt numr or tht IC is 74LS47. Th 74LS47 tks 4-it inry numr s input. (Sin w hv only 3 its, w will n to onnt th 4 th input to roun.). It lso hs rippl lnkin input

(RBI) n LED tst (LT) inputs, oth o whih must hih (.. onnt to V) or th vi to untion proprly. Th 74LS47 hs svn outputs ll -, ll tiv low, to riv th svn smnts o th isply. A typil iruit usin th 74LS47 is shown in Fiur 6. Pin irms or th 74LS74 n th isply r vill t th n o this oumnt. B 3 B 2 B 1 B 0 D C B A 74LS47 220Ω V Tstin Fiur 5 7-Smnt Dor n Disply Us on hnnl o th powr supply to provi powr to your iruit throuh th 5V rultor. Connt nothr powr supply to V in. B vry rul not to riv V in ovr 5 Volts or unr 0 Volts, s this my m th omprtor. Vry th volt on Vin rom 0 to 4V n vriy tht th isply shows th volt (to th nrst volt). Not tht minor rrors n our us th rsistors you us to mk th volt ivir hv tolrn o 5%.

Pin Dirms MCP6544 74LS47 SA56-11SRWA