270L17Notes

# 270L17Notes - EECS 270 Fall 2009 Lecture 16 Page 1 of 8...

This preview shows pages 1–4. Sign up to view the full content.

CLK X State Z CLK X State Z A[9:0] OE Data[7:0] WE Clock 10 8 EECS 270, Fall 2009, Lecture 16 Page 1 of 8 I. Datapath and control Let’s jump to the next obvious thing: designing a datapath. Let’s start fairly simple with the following problem (this is variation on a problem in our text) We want to measure distance with a laser-based measurement device (you can buy these fairly cheaply by the way). The idea is you shoot a laser at a target and you measure how long it took for the light to get back to you. We’ve got two inputs: Start_button (B) and Laser_sensor (S). We’ve got two outputs: Laser_on(L) and Display(D). Each of these are 1 bit values other than Display which is to output a 16-bit value indicating how far away the target is. Assume our clock runs at 1GHz and that light travels at 3x10 8 m/s. Our display value will be in terms of clockticks that occur before the light returns. (How far would 1 tick be?) At a high-level what’s the plan? Draw it as a “magic” state machine (that is, you don’t need to worry out inputs and outputs or anything, just give a high-level description). Now, what does the datapath need to do? _________________________________________________________ ____________________________________________________________________________________________ Draw the datapath Finish the diagram below. Where do the inputs and outputs go? What is going between the two components?

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
EECS 270, Fall 2009, Lecture 16 Page 2 of 8 Draw the state machine which controls the datapath.
EECS 270, Fall 2009, Lecture 16 Page 3 of 8 II. Class Status So where exactly are we? We finished up most of combinational logic design some weeks ago. o We covered everything from basic logic gates and truth tables to MSI devices like adders and the like. o Still could use some more work on carry-lookahead adders. We’ve nearly finished sequential logic design.

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
This is the end of the preview. Sign up to access the rest of the document.

## This note was uploaded on 04/18/2011 for the course EECS 270 taught by Professor David during the Spring '11 term at Michigan State University.

### Page1 / 8

270L17Notes - EECS 270 Fall 2009 Lecture 16 Page 1 of 8...

This preview shows document pages 1 - 4. Sign up to view the full document.

View Full Document
Ask a homework question - tutors are online