7 - MinMax Lab Introduction ee457x6_051606

7 - MinMax Lab Introduction ee457x6_051606 - EE4 5’!...

Info iconThis preview shows pages 1–10. Sign up to view the full content.

View Full Document Right Arrow Icon
Background image of page 1

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

View Full DocumentRight Arrow Icon
Background image of page 2
Background image of page 3

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

View Full DocumentRight Arrow Icon
Background image of page 4
Background image of page 5

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

View Full DocumentRight Arrow Icon
Background image of page 6
Background image of page 7

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

View Full DocumentRight Arrow Icon
Background image of page 8
Background image of page 9

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

View Full DocumentRight Arrow Icon
Background image of page 10
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: EE4 5’! Design of Data path unit (DPU) and identifying control signals required to control the DPU. Control unit design using one—hot method as well as microprogrammed control unit method Example: Sixteen 4-bit unsigned numbers are stored in a 16x4 memory. You need to search and find the largest number and the smallest number. Assume the availability of two 4-bit comparators. Think of an appropriate data unit, identify control signals, and design a control unit to go with it. Repeat the design for the case of a single comparator. Remember that, unlike in software, you try to perform in hardware as many operations as possible in parallel. This is to achieve speed. For example, you can increment iteration counter while performing the iteration and simultaneously check if it is time to exit the iteration loop. How many clocks do you think you need to complete the above job once you aregitren aSTAFtT command? 1? Po Wilda 1‘1?“ EE45? Items in DPU for the ease of two comparators: There must be a memory (16x4) and two comparators as per the problem state ment. In addition we need data register(s) to hold the largest and smallest numbers found in the iterative search. Algorithm: After the START is available, load the first (zero—th) number (in the memory) in both the MAX and MIN registers. Enter an iterative loop and compare subsequent numbers (in the mem- ory) with both the running largest and smallest numbers found so far, updating the MAX and MIN registers appropriately. When all iterations are done (or about to be doneill???) go to a done state. Draw a flow chart and a state diagram. 13 Puwada 8-H": EEAST Data Unit for the case of two comparators: SCI Control Unit: D 2H Puvvada 9-1 *1 EEAET Data Unit for the- oasa of two comparators: 2G Puwada S'I‘FT Design Twhniqucs Exercises FLOW CHART (not a State Diagram!) compare i with max count YES DONE Back to INITIAL © Copyright Puwada 1993 9'19“? EE45? FLOW CHART (not a SIaIeWDIag ram!) -.....................-.§3.y IN ITIAL E; compare l with max count compare M i with MIN NO MIN Iz- MU) Back to INITIAL 19 Puwada L'i‘l’O‘I E1345? FLOW CHART (not a StatehDiagram!) 19 Puwada Design Techniques Exercises Single comparator case, Mealy machine: Write the state transitional conditions. List outputs to be generated or control actions to be performed in each state. Load ‘ Comp. Min Max <== Mn) . Min <= MU) i :1: | +1 9 © Copyrighl Put-I vada 1993 ...
View Full Document

This note was uploaded on 06/27/2008 for the course EE 457x taught by Professor Puvvada during the Fall '07 term at USC.

Page1 / 10

7 - MinMax Lab Introduction ee457x6_051606 - EE4 5’!...

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

View Full Document Right Arrow Icon
Ask a homework question - tutors are online