This preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: Y. He @ 02/14/11 CSM51A/EEM16Sec.1 W’05 L9.1 CS M51A/EE M16 Winter’05 Section 1 Logic Design of Digital Systems Lecture 9 Yutao He [email protected] 4532B Boelter Hall http://courseweb.seas.ucla.edu/classView.php?term=05W&srs=187154200 February 9 W ’0 5 Y. He @ 02/14/11 CSM51A/EEM16Sec.1 W’05 L9.2 Outline • Administrative Matter • Wrapup: – Analysis of Combinational Networks • Chapter 10: Computer Arithmetic • The VHDL Primer • Summary Y. He @ 02/14/11 CSM51A/EEM16Sec.1 W’05 L9.3 Administrative Matter • Guiz #2 – Is graded and will be handed back during the break – Does discose some problems • About VHDL Project #1 – Will be posted Tomorrow – Will be due on Feb. 22 – Some helpful materials (FAQs, etc) are available online • About Midterm – Will be held next Friday – Details will be given in the next lecture • Discussion on next week – Will be held on Wednesday Y. He @ 02/14/11 CSM51A/EEM16Sec.1 W’05 L9.4 Analysis of Comb. Systems  Recap Implementation Specification Analysis • Functional analysis – What does a system do? Functional equivalence • Timing analysis – How fast does an implementation perform? Y. He @ 02/14/11 CSM51A/EEM16Sec.1 W’05 L9.5 Example 5 (Cont’d) The Critical Path: number of gates: level types of gates fanins O1>N1>A2>O2>N2>A9>O5 Is the brown path a critical path? The number of levels: 7 Y. He @ 02/14/11 CSM51A/EEM16Sec.1 W’05 L9.6 Example 5 (Cont’d) LH LH LH HL HL HL LH HL HL HL LH LH LH HL Transition Direction: Y. He @ 02/14/11 CSM51A/EEM16Sec.1 W’05 L9.7 Example 5 (Cont’d) Network (Propagation) Delays: Y. He @ 02/14/11 CSM51A/EEM16Sec.1 W’05 L9.8 Example 5 (Cont’d) Network (Propagation) Delays: Y. He @ 02/14/11 CSM51A/EEM16Sec.1 W’05 L9.9 Computer Arithmetic  Motivation • Arithmetic circuits are excellent examples of combinational logic design – Time and space tradeoffs Doing things fast requires more logic and thus more space Example: carrylookahead logic • Arithmetic circuits are critical components of a microprocessor – Example: ALUs (Arithmetic Logic Units) Innermost "loop" of most computer instructions Y. He @ 02/14/11 CSM51A/EEM16Sec.1 W’05 L9.10 Computer Arithmetic  Overview • Representation of signed integer – Signed and Magnitude – One’s Complement, – Two’s Complement • Arithmetic operations – Addition – Subtraction – Multiplication, etc. • Arithmetic modules – Adders – Multipliers – ALUs, etc. Y. He @ 02/14/11 CSM51A/EEM16Sec.1 W’05 L9.11 Number System Revisited Integer Fraction Positive negative Number Negative Integer Chap 10 Positive Integer Chap 2 Y. He @ 02/14/11 CSM51A/EEM16Sec.1 W’05 L9.12 Representation of Negative Integers • Major schemes: – SignandMagnitude (SM) – TrueandComplement (TC) One’s complement Two’s complement • Primary differences: – How to decide (detect) a sign?...
View
Full
Document
This note was uploaded on 02/14/2011 for the course CS M51A taught by Professor Ercegovac during the Winter '07 term at UCLA.
 Winter '07
 ERCEGOVAC

Click to edit the document details