Documents Found!
As seen in
Less Work, Better Grades
Join
Course Hero
Access
best resources
Ace
your classes
Ace your courses with Course Hero!

Submit your homework question or assignment here:
352 Tutors are online
 
We are so confident that you will love our service, we will answer your first homework question for FREE!
*  Attach Assignment (optional):
 
Study Smarter, Score Higher
 
Document Content (unformatted)
Course Hero has millions of student submitted documents similar to the one below including study guides, homework solutions, papers, exam answer keys and textbook solutions.
369-Spring ECE 2009 Instructor Name: Ali Akoglu Office: ECE 356-B Phone: (520) 626-5149 TR 0930AM - 1045AM M LNG 210 Teaching Assistant Chad Rossmeisl ECE250 TBA rossmeis@email.arizona.edu Wednesdays 1:00 PM - 3:00 PM Fridays 10:00 AM 12:00 PM or by appointment Email: akoglu@ece.arizona.edu Office Hours: Tuesdays 11:00 AM - 12:00 PM Thursdays 1:00 PM 2:00 PM or by appointment Textbook D. A. Patterson and J.L. Hennessy, Computer Organization and Design: The Hardware /Software Interface, 3rd Edition, Revised Printing, Morgan Kaufmann Publishers, 2007. Overall Educational Goal Computer architecture is the science and art of selecting and interconnecting hardware components to create a computer that meets functional, performance and cost goals. This course qualitatively and quantitatively examines computer design trade-offs, teaches the fundamentals of computer architecture and organization, including CPU, memory, registers, arithmetic unit, control unit, and input/output components. Topics include reduced instruction set computer architectures (RISC), using the MIPS central processor as an example, interface between assembly and high level programming constructs and hardware, instruction and memory cache systems, performance evaluation, benchmarks, and use of the SPIM/WinDLX/Verilog Simulators for the MIPS architecture. ECE369 serves students two ways. For those who will continue in computer architecture, it lays foundation of state-of-the-art techniques implemented in current and future high-performance microprocessors. For those students not continuing in computer architecture, it gives an overview of the kind of techniques used in today's microprocessors. Prerequisite You must have the following background: ECE274 (Logic Design): Full Adder Design , Sequential Logic vs. Combinational Logic, Synchronous vs Asynchronous Circuits, Finite State Machine Design, Latches, Flip Flops (RS, D, etc) and their characteristics Programming in C Programming in Veriolg/VHDL Course outline Computer Abstractions and Technology Arithmetic for Computers Role of Performance Instruction Sets and Software Systems SPIM/WinDLX/Verilog Simulators MIPS CPU and Control Unit Organization Pipelining in MIPS CPU Exploiting Memory Hierarchy Philosophy "I never did anything by accident, nor did any of my inventions come by accident; they came by work." Thomas Alva Edison. Read before the class Participate and ask questions Manage your time (3 hours outside class for each credit hour) Start working on assignments early Outcomes Each one of you will soon have a degree from Electrical and Computer Engineering Department. You are getting closer to graduation. Believe me time passes very quickly. In the very near future you will have interviews for internships and then for full time jobs. May be you will apply for graduate schools. In my opinion ECE369 is a class that an Electrical and Computer Engineering student has to take to call him/herself as engineer. This class will be a big step into computer architecture world and we will build the fundamentals throughout this semester. My task is to convey the significance of this field to you and motivate you to computer explore architecture paradigm. By the end of the semester I want each one of you to have the ability to articulate the design issues involved in the computer architecture both in theoretical and application levels. I want you to reach a level of confidence where you can go for an interview and talk about design tradeoffs involved in computer design, issues in instruction set architecture, pipelining concepts, memory hierarchy and cache issues comfortably. Finally you should be able to apply the techniques you have learnt and analytical thinking skills you have gained throughout the computer architecture experience to other courses as well. Students with Disabilities If you anticipate the need for reasonable accommodations to meet the requirements of this course, you must register with the Disability Resource Center and request that the DRC send me official notification of your accommodation needs as soon as possible. Please plan to meet with me by appointment or during office hours to discuss accommodations and how my course requirements and activities may impact your ability to fully participate. General policies Course will have 8 to 12 assignments, 2 mid-term examinations, a final project, and a final comprehensive examination. NO LATE ASSIGNMENTS WILL BE ACCEPTED, except under extreme nonacademic circumstances discussed with the instructor at least one week before the assignment is due. Make-ups for assignments and exams may be arranged if a student's absence is caused by documented illness or personal emergency. A written explanation (including supporting documentation) must be submitted to your instructor; if the explanation is acceptable, an alternative to the graded activity will be arranged. When possible, makeup arrangements must be completed prior to the scheduled activity. Any extenuating circumstances that have an impact on your participation in the course should be discussed with your instructor as soon as those circumstances are known. Inquiries about graded material have to be turned in within 3 days of receiving a grade. Approximate weight of each assignment will be specified when the assignment is handed out. Assignments will be due in class on the due date. The instructor reserves the right to modify course policies, course calendar, assignment values and due dates, as circumstances require. Students are strongly encouraged to attend the class. Lecture notes are intended to serve as a supplement and not as a substitute for attending class. You are encouraged to discuss the assignment specifications with your instructor, your teaching assistant, and your fellow students. However, anything you submit for grading must be unique and should NOT be a duplicate of another source. The Department of Electrical and Computer Engineering expects all students to adhere to UofA's policies and procedures on Code of Academic Integrity. http://web.arizona.edu/~studpubs/policies/cacaint.htm Distribution of Components Grades Scale Component Assignments Midterm-I Midterm-II Percentage 15 15 15 Percentage 90-100% 80-89% 70-79% Grade A B C Project Final exam 30 25 60-69% Below 60% D E Final Exam: May 14, 2009- 8:00am-10:00am
Find millions of documents here - Study Guides, Homework Solutions, Papers, Exam Answer Keys and more. Course Hero has millions of course related materials that will enable you to learn better, faster and get an A in all your courses.
Below is a small sample set of documents:

Arizona >> ECE >> 507 (Fall, 2008)
Fall 2008 Syllabus ECE 407/507: Digital VLSI system design Instructor Lectures Labs, Exams, Presentations Office hours E-mail Secretary Class web page: Course Description Prerequisites Required textbook Optional textbook Homework Janet Wang Mon, Weds...
Arizona >> ECE >> 498 (Fall, 2009)
<?xml version=\"1.0\" encoding=\"UTF-8\"?> <Error><Code>InternalError</Code><Message>We encountered an internal error. Please try again.</Message><RequestId>141D7330B5565BF9</RequestId><HostId>EUjIlHJ66NM7g0PKAhQJ XxKmZZYTfVj0PE9LaMFNuvf+LvMKRoqQ/AJe1chJ...
Arizona >> ECE >> 498 (Fall, 2009)
Design Day Schedule Spring 2007 Time 8:30-9 Activities Breakfast and registration Location Santa Rita Room Santa Rita Room Ballroom K-12, ENGR 102 Location 9-10 Welcome and orientation 1011:40 11:4012 12-1 Judging Nominations Santa Rita Room Sa...
Arizona >> ECE >> 498 (Fall, 2009)
ELECTRICAL AND COMPUTER ENGINEERING COURSE INFORMATION FOR ECE 498A CAPSTONE DESIGN Spring 2007 Tuesday/Thursday 3:304:45 Class Location: Harv 204 Ms. Martha Ostheimer Office: 422P Phone: 6219921 email: martha@ece.arizona.edu Office Hours: TTH 1:003:...
Arizona >> ECE >> 675 (Fall, 2008)
ECE 675: Optical Networking Chapter 5 Transmission Engineering Crosstalk Leakage of undesired signal power into a desired signal\'s channel Crosstalk types Intra-channel: Crosstalk between two channels at same wavelength Inter-channel: Crosstalk...
Arizona >> ECE >> 675 (Fall, 2008)
ECE 675 - Optical Networking Assignment 2 Due: February 26, 2008 P1. (30 points) (a) Draw a block diagram of an 8 8 coupler built using 2 2 couplers. (b) Suppose the above device is to be used as an 8-way power splitter (let\'s say only the top-most...
Arizona >> ECE >> 675 (Fall, 2008)
ECE 675 - Optical Networking Assignment 3 Due: March 13, 2008 P1. (40 points) Problem 3.24. P2. (40 points) Consider the following simplified model of a direct detection binary FSK system. By using a pair of optical filters and a pair of photodetecto...
Arizona >> ECE >> 675 (Fall, 2008)
ECE 675: OPTICAL NETWORKING Offering Alternate Spring Textbook: Rajiv Ramaswami and Kumar Sivarajan, \"Optical Networks: A Practical Perspective,\" Second Edition, Morgan Kaufmann, 2001. Reference: Wayne D. Grover \"Mesh-Based Survivable Networks,\" Pren...
Arizona >> ECE >> 474 (Fall, 2009)
05 05 67 86 57 60 18 30 95 04 55 68 05 47 43 69 05 80 12 45 67 58 47 68 52 21 33 05 87 49 05 05 ...
Arizona >> ECE >> 474 (Fall, 2009)
ECE 474a/574a Programming Assignment 2 (40 points) Due February 25, 2009 (Wednesday) at 8:00 pm Deliverables HLFSM - high-level finite state machine illustrating how your circuit operates Datapath behavioral implementation of various datapath com...
Arizona >> ECE >> 474 (Fall, 2009)
ECE 474A/57A Computer-Aided Logic Design Introduction Technology In Our Everyday Lives Semiconductor Industry forecasts $252 billion in sales for 2007 Computers Military Entertainment Automotive 20-80 microprocessor controlling break systems, a...
Arizona >> ECE >> 474 (Fall, 2009)
Using the Iterated Consensus Method, determine the complete sum of F(a, b, c, d) = abc + abc + abc + ab. Why is the (10 points) Using the Row/Column Dominance Method, minimize F(a, b, c, d) = m(0, 2, 5, 6, 7, 8, 9, 13) + d(1, 12, 15). The complete su...
Arizona >> ECE >> 474 (Fall, 2009)
ECE 474A/574AComputer-Aided Logic Design, Fall 2008 Instructor Information Susan Lysecky, slysecky@ece.arizona.edu Office Hours: M 9-10, W 3-4, or by appointment. Office: ECE 356C Lecture MWF 12:00P-12:50P, ARCH 103 Course Website: http:/www.ece.ari...
Arizona >> ECE >> 474 (Fall, 2009)
ECE 474A/57A Computer-Aided Logic Design Lecture 6 Algorithmic State Machines (ASMs) ECE 474a/575a Susan Lysecky 1 of 21 Control and Datapath Interaction Binary information in digital system can be classified into two categories Control Signals I...
Arizona >> ECE >> 474 (Fall, 2009)
ECE 474A/574A Exam1 Cheat Sheet Boolean Algebra Commutative a+b=b+a a*b=b*a Complement a + a\' = 1 a * a\' = 0 Distributive a * (b + c) = a*b + a*c a + (b * c) = (a + b) * (a + c) Null Elements a+1=1 a*0=0 Associative (a + b) + c = a + (b + c) (a * b) ...
Arizona >> ECE >> 474 (Fall, 2009)
...
Arizona >> ECE >> 474 (Fall, 2009)
...
Arizona >> ECE >> 474 (Fall, 2009)
...
Arizona >> ECE >> 474 (Fall, 2009)
ECE 474a/574a - Programming Project 1 (20 points) Due February 2, 2009 (Monday) at 8:00 pm DELIVERABLES Verilog code implementing behavioral 4-bit multifunction register, REG_beh Verilog code implementing structural 4-bit multifunction register, R...
Arizona >> ECE >> 474 (Fall, 2009)
result ...
Arizona >> ECE >> 474 (Fall, 2009)
Survey Results ECE474A 4.2 4.1 4.1 3.5 3.4 2 3.7 3.5 3.8 ECE574A 3.92 4.23 3.54 3.62 3.62 3.08 3.15 4 2.77 Topics K-maps, 2-level AND/OR logic, truth tables Boolean Algebra Basic Datapath components - muxes, encoders, decoders Storage Elements - flip...
Arizona >> ECE >> 474 (Fall, 2009)
4. Create an FSM that interfaces the datapath shown below. The FSM should use the datapath to compute the average value of the 16 32bit elements of any array A. Array A is stored in a memory, with the first element at address 25, the second at addre...
Arizona >> ECE >> 474 (Fall, 2009)
...
Arizona >> ECE >> 474 (Fall, 2009)
110 010 ...
Arizona >> ECE >> 474 (Fall, 2009)
ECE 474A/574A Passport Note: All fields must be completed for credit 1. Identification Name Nickname (or other name you prefer to go by) 2. Recent Photograph email Major/year 3. Unique or interesting fact about yourself. 4. Why are you taking th...
Arizona >> ECE >> 474 (Fall, 2009)
In-class Exercise 1 (PAR 5) Create FSM to detect when four 1s have appeared on input stream (doesnt need to be consecutive) input : w (bit) output : f (bit) Create high-level FSM to achieve same functionality ECE 474a/575a Susan Lysecky ...
Arizona >> ECE >> 474 (Fall, 2009)
In-class Exercise 1 (PAR 5) Create FSM to detect when four 1s have appeared on input stream (doesnt need to be consecutive) input : w (bit) output : f (bit) Create high-level FSM to achieve same functionality ECE 474a/575a Susan Lysecky ...
Arizona >> ECE >> 474 (Fall, 2009)
...
Arizona >> ECE >> 474 (Fall, 2009)
clk rst enb FibGen out rst = 1 - resets to the beginning of the Fibonacci sequence enb = 1 FibGen outputs Fibonacci sequence on every clk cycle enb = 0 FibGen stops and outputs the Fibonacci number last outputted rst = 1 rst = 1 rst = 1 rst = 1...
Arizona >> ECE >> 474 (Fall, 2009)
Spring 2008 ECE 474A/574A Survey Name Email Major/Department Year (circle freshman one) sophomore junior senior graudate MS graduate PhD 1. Have you taken any of the following courses (or an equivalent)? ECE 175 Computer Programming for Enginee...
Arizona >> ECE >> 474 (Fall, 2009)
...
Arizona >> ECE >> 474 (Fall, 2009)
...
Arizona >> ECE >> 474 (Fall, 2009)
...
Arizona >> ECE >> 474 (Fall, 2009)
All signals are re-initialized to zero at the beginning of each iteration, states need only overwrite signals that should be assigned to 1 x_ld = 0 y_ld = 0 output_enb = 0 x_sel = 0 y_sel = 0 done = 0 S4 (x=x-y) !go_i x_ld = 1 start go_i S1 (load st...
Arizona >> ECE >> 474 (Fall, 2009)
ECE 474A/574A Passport Note: All fields must be completed for credit 1. Identification Name Nickname (or other name you prefer to go by) 2. Recent Photograph email Major/year 3. Unique or interesting fact about yourself. 4. Why are you taking th...
Arizona >> ECE >> 474 (Fall, 2009)
ECE 474A/57A Computer-Aided Logic Design Lecture 1 Review - Datapath Elements Digital Design Copyright 2006 Frank Vahid ECE 474a/575a Susan Lysecky 1 of 46 Datapath Elements Datapath components store/transform data, put components together to f...
Arizona >> ECE >> 474 (Fall, 2009)
...
Arizona >> ECE >> 474 (Fall, 2009)
PRACTICE PROBLEMS 4 Lecture 6 - Lecture 7 1. Which function does the ASM in Figure 1 describe? (a) (b) (c) (d) (e) Half Subtractor Borrow Bit 2-to1 MUX Half Subtractor Difference Bit 2-input XOR gate none of the above 1 input2 1 input1 1 0 0 S_0 001 ...
Arizona >> ECE >> 474 (Fall, 2009)
ECE 474a/574a Programming Project 3 I2C Bus Interface Due April 27, 2009 (Monday) at 8:00 pm Deliverables High-level behavioral model of master controller updated to utilize I2C interface High-level behavioral model of memory updated to utilize I2...
Arizona >> ECE >> 474 (Fall, 2009)
10 22 00 10 30 05 A0 0B 09 10 50 42 97 50 05 05 05 70 12 64 56 78 10 22 18 CC 0E 2F 01 02 03 09 AA C0 20 50 05 47 74 01 04 50 60 24 20 05 02 01 02 05 10 11 12 3F 01 C0 D0 E0 0F 0A 05 05 05 00...
Arizona >> ECE >> 474 (Fall, 2009)
PRACTICE PROBLEMS 4 Lecture 6 - Lecture 7 1. Which function does the ASM in Figure 1 describe? (a) Half Subtractor Borrow Bit (b) 2-to1 MUX (c) Half Subtractor Difference Bit (d) 2-input XOR gate (e) none of the above 1 input2 0 1 input1 1 0 S_0 001 ...
Arizona >> ECE >> 474 (Fall, 2009)
PRACTICE PROBLEMS 7 Lecture 10 - 10E 1. Implement F(a, b, c) = m(2, 4, 5) + d(1, 6) a. as a Boolean n-space cube b. in compact cubical form (show the on-set FON, the off-set FOFF, and the dont care set FDC) 2. Calculate c d for c= 0 2 0 2 0 1 3 4 ...
Arizona >> ECE >> 474 (Fall, 2009)
PRACTICE PROBLEMS 8 Lecture 11 - 12 1. Fill in the following table X1= X0= X+1= X+0= 2. What does canonical mean? Provide two canonical representations of F = a + bc + bc. 3. Using only muxes, build a circuit to perform a. F = A NAND B b. F = A +...
Arizona >> ECE >> 474 (Fall, 2009)
ECE 474A/574A Programming Project 3 - 2-Level Logic Minimizer (60 pts) Due December 3, 2008 (Wednesday) at 8:00 pm DELIVERABLES ECE 474A Deliverables Espresso Expand implemented in C/C+ Makefile ECE 574A Deliverables TURNIN Submit your project...
Arizona >> ECE >> 474 (Fall, 2009)
ECE 474a/574a Programming Project 2 FSM+D Interface to Memory Module (40pts) Due October 13, 2008 (Monday) at 8:00 pm DELIVERABLES Text copy of the FSM+D circuit, specifically the FSM used to define the controller and the datapath components/c...
Arizona >> ECE >> 474 (Fall, 2009)
...
Arizona >> ECE >> 474 (Fall, 2009)
ECE 474A/57A Computer-Aided Logic Design Lecture 11 Binary Decision Diagrams (BDDs) ECE 474a/575a Susan Lysecky 1 of 47 Boolean Logic Functions Representations Function can be represented in different ways Truth table, equation, K-map, circuit, e...
Arizona >> ECE >> 474 (Fall, 2009)
...
Arizona >> ECE >> 474 (Fall, 2009)
PRACTICE PROBLEMS 6 Lecture 9 1. Using the MIS_QUICK algorithm, find the size of the maximally independent set. (a) (b) Base your weights on row counts Base your weights on column counts m0 m1 m2 m5 x x x x x Fig 1. Constraint matrix for problem 1. ...
Arizona >> ECE >> 474 (Fall, 2009)
...
Arizona >> ECE >> 474 (Fall, 2009)
...
Arizona >> ECE >> 474 (Fall, 2009)
...
Arizona >> ECE >> 474 (Fall, 2009)
...
Arizona >> ECE >> 474 (Fall, 2009)
...
Arizona >> ECE >> 474 (Fall, 2009)
...
Arizona >> ECE >> 474 (Fall, 2009)
# test2.txt # F1 = w\'x\'y\'z\' + w\'x\'y\'z + w\'xy\'z\' + w\'xy\'z + # wx\'y\'z\' + wx\'y\'z + wxy\'z\' + wxy\'z # F1 = y\' (optimized) .i 4 .o 1 .ilb w x y z .ob F1 0000 1 0001 1 0010 0 0011 0 0100 1 0101 1 0110 0 0111 0 1000 1 1001 1 1010 0 1011 0 1100 1 1101 ...
Arizona >> ECE >> 474 (Fall, 2009)
# test1.txt # F = a\'b + ab\' + ab # F = a + b (opitmized) .i 2 .o 1 .ilb a b .ob F 00 0 01 1 10 1 11 1 ...
Arizona >> ECE >> 304 (Fall, 2008)
From higgins at ece.arizona.edu Wed Dec 3 12:06:46 2008 From: higgins at ece.arizona.edu (Charles M. Higgins) Date: Wed, 3 Dec 2008 12:06:46 -0700 Subject: [ECE304] Final technical report turn-in Message-ID: <4cd71080812031106o45d4daedn65dec221cfa6...
Arizona >> ECE >> 509 (Fall, 2009)
Email Fundamentals Systems Architecture This article describes the high-level \"architecture\" of systems for handling Internet mail, and does not discuss the protocols used in a message transfer [Klensin08], the format of the messages [Resnick08], or...
Arizona >> ECE >> 373 (Fall, 2008)
A calculator program using Object Oriented Data Structures Ben Terris (bterris@email.arizona.edu) Phillip Toussaint (ptoussaint@yahoo.com) Steve Varga (sdvargs@mail.arizona.edu) David MacQuigg (macquigg@box67.com) ECE373Object-Oriented Software Desi...
Arizona >> ECE >> 373 (Fall, 2008)
/home/edatools/ece373/python/READme.txt David MacQuigg ece373 11/20/07 This directory ~edatools/ece373/python/ contains python packages and modules for the homework assignments in ECE373 [Note 1]. You can view these wit...
Arizona >> ECE >> 373 (Fall, 2008)
# Language Comparisons http:/ece.arizona.edu/~edatools/ece373/python/Comparisons/ - SourceForgeProjects.htm - number of new projects over the last 4 years - RubyPython.htm - comparing Ruby to Python # Comparing Java to Python - a medium complexity e...
Arizona >> ECE >> 373 (Fall, 2008)
Logic Gates - Class Diagrams - LightweightActor = -inputPorts:List -outputPorts:List - fire getInputPorts setInputPort getOutputPorts AndGate(LightweightActor) = - fire - Check compatibility...
Arizona >> ECE >> 05 (Fall, 2009)
HW05 Question2 - objectDiagram.vsd Q1: GenericAdder inputs do not *contain* any port objects, they simply have references to the output ports contained by the GenericAdder and Inverter outputs (and two miscellaneous ports contained in obect q1). S...
Arizona >> ECE >> 373 (Fall, 2008)
HW05 Question2 - objectDiagram.vsd Q1: GenericAdder inputs do not *contain* any port objects, they simply have references to the output ports contained by the GenericAdder and Inverter outputs (and two miscellaneous ports contained in obect q1). S...
Arizona >> ECE >> 3 (Fall, 2009)
> help(Question3) Help on module Question3: NAME Question3 FILE /home/edatools/ece373/python/hw03/question3/Question3.py DESCRIPTION Test the Adder class. Adders must be fired in the order listed, or the correct values will not pr...
Arizona >> ECE >> 373 (Fall, 2008)
> help(Question3) Help on module Question3: NAME Question3 FILE /home/edatools/ece373/python/hw03/question3/Question3.py DESCRIPTION Test the Adder class. Adders must be fired in the order listed, or the correct values will not pr...
Arizona >> ECE >> 01 (Fall, 2009)
Help on module Coins01: NAME Coins01 - This module has all the different classes of coins. FILE /home/macquigg/373/python/hw01/question2/Coins01.py CLASSES BiasedCoin FairCoin TemplateCoin class BiasedCoin | A bi...
Arizona >> ECE >> 373 (Fall, 2008)
Help on module Coins01: NAME Coins01 - This module has all the different classes of coins. FILE /home/macquigg/373/python/hw01/question2/Coins01.py CLASSES BiasedCoin FairCoin TemplateCoin class BiasedCoin | A bi...
Arizona >> ECE >> 4 (Fall, 2009)
Email Fundamentals Mail Handling Systems Architecture This article describes the high-level \"architecture\" of systems for handling Internet mail, and does not discuss the protocols used in a message transfer [Klensin08], the format of the messages [...
What are you waiting for?