16 Pages

05_491_F04

Course: ECE 491, Fall 2009
School: Lafayette
Rating:
 
 
 
 
 

Word Count: 646

Document Preview

491 ECE - Senior Design I Lecture 5 - Lab 2; The Xilinx Microblaze Fall 2004 Prof. John Nestor ECE Department Lafayette College Easton, Pennsylvania 18042 nestorj@lafayette.edu Where we are Last Time: New Verilog Material Coding guidelines initial blocks functions Tasks Verification and Testbenches Today: Discuss Lab 2 The Microblaze Processor ECE 491 Fall 2004 Lecture 5 - Xilinx Microblaze 2 Lab...

Register Now

Unformatted Document Excerpt

Coursehero >> Pennsylvania >> Lafayette >> ECE 491

Course Hero has millions of student submitted documents similar to the one
below including study guides, practice problems, reference materials, practice exams, textbook help and tutor support.

Course Hero has millions of student submitted documents similar to the one below including study guides, practice problems, reference materials, practice exams, textbook help and tutor support.
491 ECE - Senior Design I Lecture 5 - Lab 2; The Xilinx Microblaze Fall 2004 Prof. John Nestor ECE Department Lafayette College Easton, Pennsylvania 18042 nestorj@lafayette.edu Where we are Last Time: New Verilog Material Coding guidelines initial blocks functions Tasks Verification and Testbenches Today: Discuss Lab 2 The Microblaze Processor ECE 491 Fall 2004 Lecture 5 - Xilinx Microblaze 2 Lab 2 Overview 1. Parameterized counter (base on BCD example) BW parameter: bitwidth M parameter: counter modulus (counts from 0..M-1) Inputs: clk, reset, enb Outputs: Q, carry BW rclk Q carry enb eset 2. Generic counter testbench ECE 491 Fall 2004 Test counters with varying BW, M Modify self-check features to test different values Lecture 5 - Xilinx Microblaze 3 Lab 2 Overview (cont'd) 3. Write code to instantiate 4 counters with carry outputs generating 1MHz mhz_en 1KHz khz_en 1Hz hz_en 1/60 Hz min_en Connect all counters to common 50MHz clock Test using LED output ECE 491 Fall 2004 Lecture 5 - Xilinx Microblaze 4 Lab 2 Overview (cont'd) 4. Create a digital clock Buttons: reset - sets time to 12:00 hr_set - advances 1 hr/sec min_set - advances 1 min/sec reset min_set hr_set ECE 491 Fall 2004 Lecture 5 - Xilinx Microblaze 5 Lab 2 Overview (cont'd) 4. Create a digital clock (cont'd) Design ideas Use counters for clock digits (add extra logic where needed) Build a state machine or counter that time-multiplexes digits reset min_set hr_set ECE 491 Fall 2004 Lecture 5 - Xilinx Microblaze 6 Review: BCD Counter How can it be parameterized? module bcdcounter(clk, reset, enb, Q, carry); input clk, reset, enb; output [3:0] Q; output carry; reg [3:0] Q; // a signal that is assigned a value assign carry = (Q == 9) & enb; always @( posedge clk ) begin if (reset) Q <= 0; else if (enb) begin if (carry) Q <= 0; else Q <= Q + 1; end end endmodule ECE 491 Fall 2004 Lecture 5 - Xilinx Microblaze 7 Overview - Xilinx Microblaze Microblaze - a "soft processor core" 32-bit RISC Architecture similar to MIPS Pipelined (3 stages) Implementation in 1,000 Logic Cells (4,320 Logic Cells in a Xilinx XC3S200) Gnu development tools (gcc etc.) support programming Created and licensed by Xilinx Alternative Approaches: Xilinx Picoblaze - 8 bit soft core PowerPC - 32-bit hard core on Xilinx Pro Virtex-2 FPGAs Altera NIOS - 32-bit RISC soft core on Altera FPGAs Public domain cores - see www.opencores.org Lecture 5 - Xilinx Microblaze 8 ECE 491 Fall 2004 Microblaze Block Diagram ECE 491 Fall 2004 Lecture 5 - Xilinx Microblaze 9 More Microblaze Features Harvard-style architecture w/ optional caches Several peripherals available Three interface buses Local Memory Bus (LMB) - simple synchronous bus On-Chip Peripheral Bus (OPB) - peripheral bus from IBM Fast Simplex Link (FSL) - for fast streaming comm. ECE 491 Fall 2004 Lecture 5 - Xilinx Microblaze 10 Microblaze Registers and Memory 0 32 bits R0 R1 R2 31 0x00000000 0x00000004 0x00000008 0x0000000C 0x00000010 0x00000014 0x00000018 0x0000001C 0 0 1 2 3 31 R30 R31 32 General Purpose Registers 0 0 PC = 0x0000001C MSR (Machine Status Reg.) Registers 31 31 0xfffffff4 0xfffffffc 0xfffffffc Memory (Big-Endian) ECE 491 Fall 2004 Lecture 5 - Xilinx Microblaze 11 Microblaze Instructions All instructions exactly 32 bits wide Different formats for different purposes 6 bits 5 bits 5 bits 5 bits 11 bits Opcode 6 bits Rd 5 bits Ra 5 bits Rb 00000000000 16 bits Type A Opcode Rd Ra Imm. Value Type B ECE 491 Fall 2004 Lecture 5 - Xilinx Microblaze 12 Microblaze MSR CC Arithmetic Carry Copy DCE Data Cache Enable DZ Division by Zero ICE Instruction Cache Enable FSL FSL interface error BIP Break in Progr...

Find millions of documents on Course Hero - Study Guides, Lecture Notes, Reference Materials, Practice Exams and more. Course Hero has millions of course specific materials providing students with the best way to expand their education.

Below is a small sample set of documents:

Lafayette - ECE - 491
ECE 491 - Senior Design ILecture 5 - Verilog Simulation &amp; DelayFall 2006 Read Verilog Handout Section 7Prof. John Nestor ECE Department Lafayette College Easton, Pennsylvania 18042 nestorj@lafayette.eduToday's Outline Discuss Lab 2 Verilog Pa
Lafayette - ECE - 491
ECE 491 - Senior Design ILecture 5 - Coding Guidelines; Simulation &amp; DelayFall 2007 Read Verilog Handout Section 7Prof. John Nestor ECE Department Lafayette College Easton, Pennsylvania 18042 nestorj@lafayette.eduToday's Outline Verilog Coding
Lafayette - ECE - 491
ECE 491 - Senior Design ILecture 6 - Microblaze (cont'd); C ProgrammingFall 2004Prof. John Nestor ECE Department Lafayette College Easton, Pennsylvania 18042 nestorj@lafayette.eduSome graphics in this presentation are taken from the Xilinx Micr
Lafayette - ECE - 491
ECE 491 - Senior Design ILecture 6 - Verification &amp; TestbenchesFall 2006 Read Verilog Handout Sections 7-10Prof. John Nestor ECE Department Lafayette College Easton, Pennsylvania 18042 nestorj@lafayette.eduWhere we are Last Time: Coding g
Lafayette - ECE - 491
ECE 491 - Senior Design ILecture 6 - Verification &amp; TestbenchesFall 2007 Read Verilog Handout Sections 7-10Prof. John Nestor ECE Department Lafayette College Easton, Pennsylvania 18042 nestorj@lafayette.eduWhere we are Last Time: Coding g
Lafayette - ECE - 491
ECE 491 - Senior Design ILecture 7 - C Programming (continued)Fall 2004Prof. John Nestor ECE Department Lafayette College Easton, Pennsylvania 18042 nestorj@lafayette.eduSome examples in this presentation are taken from B. Kernighan and D. Ritc
Lafayette - ECE - 491
ECE 491 - Senior Design ILecture 7 - Verification Case StudyFall 2006Prof. John Nestor ECE Department Lafayette College Easton, Pennsylvania 18042 nestorj@lafayette.eduWhere we are Last Time Verification Techniques Today Finish Brooks Lect
Lafayette - ECE - 491
ECE 491 - Senior Design ILecture 7 - Verification Case Study - Pentium 4Fall 2007 Read Salt &amp; Rothery Ch. 4 (System Design) Colwell Ch. 3 (The Refinement Phase)Prof. John Nestor ECE Department Lafayette College Easton, Pennsylvania 18042 nestorj@
Lafayette - ECE - 491
ECE 491 - Senior Design ILecture 8 - Data CommunicationsFall 2004Prof. John Nestor ECE Department Lafayette College Easton, Pennsylvania 18042 nestorj@lafayette.eduSome examples in this presentation are taken from B. Kernighan and D. Ritchie, T
Lafayette - ECE - 491
ECE 491 - Senior Design ILecture 8 - Data CommunicationsFall 2006 Reading: S&amp;R Ch. 3 - Requirements Analysis Colwell Ch 2 - The Concept Phase Short Quiz on FridayProf. John Nestor ECE Department Lafayette College Easton, Pennsylvania 18042 nestor
Lafayette - ECE - 491
ECE 491 - Senior Design ILecture 8 - Data CommunicationsFall 2007 Reading: S&amp;R Ch. 4 (System Design) Colwell Ch 3 (The Refinement Phase)Prof. John Nestor ECE Department Lafayette College Easton, Pennsylvania 18042 nestorj@lafayette.eduData Comm
Lafayette - ECE - 491
ECE 491 - Senior Design ILecture 9 - Data Communications 2, Discuss Lab 4Fall 2004Prof. John Nestor ECE Department Lafayette College Easton, Pennsylvania 18042 nestorj@lafayette.eduWhere we are Last Time: Feedback from Lab 2 Network Protocol
Lafayette - ECE - 491
ECE 491 - Senior Design ILecture 9 - Requirements AnalysisFall 2006Prof. John Nestor ECE Department Lafayette College Easton, Pennsylvania 18042 nestorj@lafayette.eduWhere we are Last Time Data Communications (cont'd) RS-232 Receiver Design
Lafayette - ECE - 491
ECE 491 - Senior Design ILecture 9 - Data Communications 2, Discuss Lab 4Fall 2004Prof. John Nestor ECE Department Lafayette College Easton, Pennsylvania 18042 nestorj@lafayette.eduThe following references were used for this lecture: J. Wakerly,
Lafayette - ECE - 491
ECE 491 - Senior Design ILecture 10 - Control/Datapath ParadigmFall 2006Prof. John Nestor ECE Department Lafayette College Easton, Pennsylvania 18042 nestorj@lafayette.eduWhere we are Last Time: Serial Data Encoding Requirements Analysis T
Lafayette - ECE - 491
ECE 491 - Senior Design ILecture 10 - System Design &amp; Project Mgt.Fall 2007 Reading:S&amp;R Ch.4 - System Design, S&amp;R Ch. 5 - Project Management Colwell Ch. 2 - The Concept Phase, Colwell Ch. 3 - The Refinement PhaseQuiz Friday 10/5: Sequential Veri
Lafayette - ECE - 491
ECE 491 - Senior Design ILecture 11 - Verilog (again), Timing, SynchrnizationFall 2004Prof. John Nestor ECE Department Lafayette College Easton, Pennsylvania 18042 nestorj@lafayette.eduWhere we are Last Time: More about Serial Communication C
Lafayette - ECE - 491
ECE 491 - Senior Design ILecture 11 - Data Communications 2Fall 2007 Quiz FridayVerilog ASM Diagrams Design Readings (S&amp;R Ch. 1-5, Colwell Ch. 1-3)Prof. John Nestor ECE Department Lafayette College Easton, Pennsylvania 18042 nestorj@lafayette.ed
Lafayette - ECE - 491
ECE 491 - Senior Design ILecture 12 Manchester Transmitter, Drivers &amp; ReceiversFall 2004Prof. John Nestor ECE Department Lafayette College Easton, Pennsylvania 18042 nestorj@lafayette.eduWhere we are Last Time: More about Verilog Coding Cloc
Lafayette - ECE - 491
ECE 491 - Senior Design ILecture 12 - MetastabilityFall 2007 Homework due Friday 10/3: Metastability problem, p. 18Prof. John Nestor ECE Department Lafayette College Easton, Pennsylvania 18042 nestorj@lafayette.eduWhere we are Last Time: Data
Lafayette - ECE - 491
ECE 491 - Senior Design ILecture 13 - ASM DiagramsFall 2004Prof. John Nestor ECE Department Lafayette College Easton, Pennsylvania 18042 nestorj@lafayette.eduAnnouncements 2 tutors needed for Junior Electronics contact Prof. Wey if interested
Lafayette - ECE - 491
ECE 491 - Senior Design ILecture 13 - More Data CommunicationsFall 2006 Quiz FridayVerilog Sequential Circuits Design ReadingsReading:S&amp;R Ch. 4 - 5 Colwell Ch. 2 - 3 Prof. John Nestor ECE Department Lafayette College Easton, Pennsylvania 18042
Lafayette - ECE - 491
ECE 491 - Senior Design ILecture 14 - Communicating State MachinesFall 2004Prof. John Nestor ECE Department Lafayette College Easton, Pennsylvania 18042 nestorj@lafayette.eduWhere we are Last Time: More about Lab 5 - Test Circuit ASM Diagram
Lafayette - ECE - 491
ECE 491 - Senior Design ILecture 15- Project Assignment Part 1Fall 2004Prof. John Nestor ECE Department Lafayette College Easton, Pennsylvania 18042 nestorj@lafayette.eduWhere we are Last Time: Discuss Lab 6 - Manchester Receiver Today: Us
Lafayette - ECE - 491
ECE 491 - Senior Design ILecture 16 - Manchester Transmitter &amp; ReceiverFall 2007 Quiz Friday: Ethernet PaperProf. John Nestor ECE Department Lafayette College Easton, Pennsylvania 18042 nestorj@lafayette.eduWhere we are Last Time: Handshaking
Lafayette - ECE - 491
ECE 491 - Senior Design ILecture 13 - Detailed DesignFall 2007 Reading: Colwell, Ch. 3-4, Design Reviews Salt &amp; Rothery Chapter 5, 6Prof. John Nestor ECE Department Lafayette College Easton, Pennsylvania 18042 nestorj@lafayette.eduWhere we are
Lafayette - ECE - 491
ECE 491 - Senior Design ILecture 17 - Manchester Receiver DesignFall 2006 Reading: S&amp;R Ch. 6 Colwell Ch. 3-4Prof. John Nestor ECE Department Lafayette College Easton, Pennsylvania 18042 nestorj@lafayette.eduWhere we are Last Time: Ethernet
Lafayette - ECE - 491
ECE 491 - Senior Design ILecture 17 - Intellectual PropertyFall 2007Prof. John Nestor ECE Department Lafayette College Easton, Pennsylvania 18042 nestorj@lafayette.eduThe New Yorker, May 16, 1953Today's Outline Types of Intellectual Property
Lafayette - ECE - 491
&lt;?xml version=&quot;1.0&quot; encoding=&quot;UTF-8&quot;?&gt; &lt;Error&gt;&lt;Code&gt;NoSuchKey&lt;/Code&gt;&lt;Message&gt;The specified key does not exist.&lt;/Message&gt;&lt;Key&gt;f87875fda8dc693bbf38ae9b7fe62e7918bcb628.ppt&lt;/Key&gt;&lt;RequestId&gt;D 87435E3D7D11A55&lt;/RequestId&gt;&lt;HostId&gt;8NxLyUhpK68SqY5bvkZQYFoo8b9
Lafayette - ECE - 491
ECE 491 - Senior Design ILecture 18 - EthernetFall 2007Prof. John Nestor ECE Department Lafayette College Easton, Pennsylvania 18042 nestorj@lafayette.eduSome slides in this presentation are derived from Prof. Nick McKeown's class notes for CS
Lafayette - ECE - 491
ECE 491 - Senior Design ILecture 19 - Networks and SocietyFall 2006Prof. John Nestor ECE Department Lafayette College Easton, Pennsylvania 18042 nestorj@lafayette.eduWhere we are Last Time: Detailed Design Today: Networks and Society How
Lafayette - ECE - 491
ECE 491 - Senior Design ILecture 20 - Project AssignmentFall 2007Prof. John Nestor ECE Department Lafayette College Easton, Pennsylvania 18042 nestorj@lafayette.eduWhere we are Last Time: Networks and Society Today: Project AssignmentECE
Lafayette - ECE - 491
ECE 491 - Senior Design ILecture 20 - Project AssignmentFall 2006Prof. John Nestor ECE Department Lafayette College Easton, Pennsylvania 18042 nestorj@lafayette.eduWhere we are Last Time: Networks and Society Today: Project AssignmentECE
Lafayette - ECE - 491
ECE 491 - Senior Design ILecture 21 - Cyclic Redundancy Check (CRC), BRAMFall 2007Prof. John Nestor ECE Department Lafayette College Easton, Pennsylvania 18042 nestorj@lafayette.eduWhere we are Last Time: Project Assignment Today: Cyclic R
Lafayette - ECE - 491
ECE 491 - Senior Design ILecture 21 - Cyclic Redundancy Check (CRC)Fall 2006Prof. John Nestor ECE Department Lafayette College Easton, Pennsylvania 18042 nestorj@lafayette.eduWhere we are Last Time: Project Assignment Today: Cyclic Redunda
Virginia Tech - CS - 2605
STL ComponentsContainers Iterators Generic algorithms Adaptors Allocators classes for objects that contain &quot;pointers&quot; into containers functions that work on different types of containers classes that &quot;adapt&quot; other classes objects for allocating spac
Virginia Tech - CS - 2605
Binary TreesBinary Trees 1A binary tree is either empty, or it consists of a node called the root together with two binary trees called the left subtree and the right subtree of the root, which are disjoint from each other and from the root.For
Virginia Tech - CS - 2605
Big-O AnalysisAsymptotics1Order of magnitude analysis requires a number of mathematical definitions and theorems. The most basic concept is commonly termed big-O (Omicron). Definition: Suppose that f(n) and g(n) are nonnegative functions of n.
Virginia Tech - CS - 2605
Generalization versus AbstractionAbstraction:C+ Inheritance 1simplify the description of something to those aspects that are relevant to the problem at hand.Generalization:find and exploit the common properties in a set of abstractions. hier
Virginia Tech - CS - 2605
DefinitionpolymorphismPolymorphism 1 the ability to manipulate objects of distinct classes using only knowledge of their common properties without regard for their exact class (Kafura)Note that polymorphism involves both algorithms and types of
Virginia Tech - CS - 2605
Exceptionsexception a program error that occurs during execution, orExceptions 1a &quot;signal&quot; generated (&quot;thrown&quot;) when a program execution error is detectedExceptions may be thrown by hardware or software; we consider only the latter. If a softw
Virginia Tech - CS - 2605
Differences with JavaException handling in C+ and Java are very similar: s Same try block structure with catch handlers s Same throw statements s Same stack unwinding modelExceptions1The are also several differences: s No Throwable or Exceptio
Virginia Tech - CS - 2605
HeapsA heap is a complete binary tree.Heaps 1A max-heap is a complete binary tree in which the value in each internal node is greater than or equal to the values in the children of that node. A min-heap is defined similarly.97Mapping the elem
Virginia Tech - CS - 2605
Creating a Zip Archive in Windows XPI. Select the files to go into the Zip archive:Find the directory containing your source files and select all of the cpp and h files:Do not select any other files unless the specific instructions for an assign
Virginia Tech - CS - 2605
Binary Search TreesBSTs 1The general binary tree shown in the previous chapter is not terribly useful in practice. The chief use of binary trees is for providing rapid access to data (indexing, if you will) and the general binary tree does not ha
Virginia Tech - CS - 2605
Generalization versus AbstractionAbstraction:C+ Inheritance 1simplify the description of something to those aspects that are relevant to the problem at hand.Generalization:find and exploit the common properties in a set of abstractions. hier
Virginia Tech - CS - 2605
Inheritance ModesControlling Inheritance 1When deriving a class D from a base class B, we may specify that access to the base class is any of the following: public, protected, private. The base class access specifier controls the access derived t
Virginia Tech - CS - 2605
Exceptionsexception a program error that occurs during execution, orExceptions1a &quot;signal&quot; generated (&quot;thrown&quot;) when a program execution error is detectedExceptions may be thrown by hardware or software; we consider only the latter. If a soft
Virginia Tech - CS - 2605
Summation FormulasMath Review1Let N &gt; 0, let A, B, and C be constants, and let f and g be any functions. Then: Cf (k ) = C f (k )k =1 k =1NN ( f (k ) g (k ) = f (k ) g (k )k =1 k =1 k =1NNNS1: factor out constantNS2: s
Pontifical Catholic - LOGICA - 207
INSTRUCCIONES PARA AGREGAR AL GLOSARIOConlasaportacionesdetodos,haremosunglosariode trminosyconceptosfrecuentementeutilizados. Slotienesqueescribirlapalabradeseadaenestamisma pgina, marcarla y aadirle un hyperlink que ofrezca accesoaladefinic
Pontifical Catholic - FILOSOFIA - 312
La libertad humana sabe os dee Qu m lla?Enid Miranda, Ph. D.Caractersticas. La libertad humana es: Autode rm te inacin (Capacidad dehace algo por s r m o) ism Volitiva Individual y social itada y condicionada Lim nte m Plurivale y polis ica
Pontifical Catholic - FILOSOFIA - 312
S xualidad hum e anaDe finicin conce ptualEnid Miranda, Ph. D. C ptualm nteconcurre varios once e n factore polis icos. s m Biolgicos/som ticos: la se xualidad sem rializa e los cue pe ate n rpos ro de ndedenue pe stras m ras depe an
Pontifical Catholic - FILOSOFIA - 312
Los Instintos DefinicinEnid Miranda, Ph. D. Caractersticas Son patrones de conducta no aprendida Radican en el sistema lmbico &quot;archipallium&quot; o primitivo No son exclusivos de los humanos. Los primates los poseen..\Glosario de trminos\
Pontifical Catholic - FILOSOFIA - 312
Tipos de inteligencia humanaEl mayor producto de la hominizacin Considerada una de las ms importantes en nuestra cultura Propia de periodistas y escritores en general. Elemento esencial en el nacimiento, configuracin y establecimiento de
Pontifical Catholic - FILOSOFIA - 312
Concepto Persona y Derechos humanosJuan Eliseo Montoya Mar n dehombre1. Una Mirada a la Nocin de Hombre Palabras liminares A travs de la historia de los pueblos, se puede rastrear, en cada grupo social, una idea de hombre que responde a las co
Pontifical Catholic - FILOSOFIA - 312
El Hombre para los hebreos La primera palabra con que se define al Hombre en el Gnesis es mfdf, (adam), es decir,elnombregenricodehombre(queincluye hombremujer, gnero humano); no obstante, esta misma palabra proviene de la raz q
Pontifical Catholic - EDUCACION - 430
PONTIFICIAUNIVERSIDADCATOLICADEPUERTORICO COLEGIODEEDUCACION DEPARTAMENTODEEDUCACIONSECUNDARIAProntuariodelcursodeEducacin430 I.INFORMACIONGENERAL Programa: Codificacindelcurso: Ttulodelcurso: Horascrdito: Horascontacto: EducacinNuclear Educacin43
Pontifical Catholic - EDUCACION - 430
DEFIN IC IO NESCIENCIA (O EPISTME) C ONOCIM IE N TOPERFECTO , REFERIDO ALM UNDODE LASI DEAS , CONSECUENC IADELEJERCICIO DE LA RAZN .Platn distingue dos gneros fundamentales de conocimiento: la ciencia (epistme) y la Opinin. A su vez, el
Pontifical Catholic - CURSO - 737
PONTIFICIA UNIVERSIDAD CATLICA DE PUERTO RICO COLEGIO DE EDUCACIN ESCUELA GRADUADAMISINIntegrar una comunidad viva, acadmica y de servicio, consagrada a la bsqueda de la verdad y al estmulo de la ms plena realizacin del ser humano en todas sus dim
Pontifical Catholic - CURSO - 738
PONTIFICIA UNIVERSIDAD CATLICA DE PUERTO RICO COLEGIO DE EDUCACIN ESCUELA GRADUADAMISINIntegrar una comunidad viva, acadmica y de servicio, consagrada a la bsqueda de la verdad y al estmulo de la ms plena realizacin del ser humano en todas sus dim
Pontifical Catholic - EDU - 111
PONITIFICIA UNIVERSIDAD CATLICA DE PUERTO RICO COLEGIO DE EDUCACIN DEPARTAMENTO DE EDUCACIN ELEMENTAL PRONTUARIO I. INFORMACIN GENERAL: Programa : Educacin Elemental Educacin 111 Metodologa en la Enseanza de las Ciencias en la Escuela Elemental Tres