Debugging EECS150 Fall Lab Lecture #4 Sarah Swisher

Slides:



Advertisements
Similar presentations
1 Brief Introduction to Verilog Weiping Shi. 2 What is Verilog? It is a hardware description language Originally designed to model and verify a design.
Advertisements

ECE 551 Digital System Design & Synthesis Lecture 09 Synthesis of Common Verilog Constructs.
1/27/06EECS150 Lab Lecture #21 Designing with Verilog EECS150 Spring 2006 – Lab Lecture #2 Brian Gawalt Greg Gibeling.
1/20/2006EECS150 Lab Lecture #11 EECS150 Intro. & CAD Tools EECS150 Spring 2006 Lab Lecture #1 David Lin.
2/16/2007EECS150 Lab Lecture #51 Logic Analyzers EECS150 Spring 2007 – Lab Lecture #5 Shah Bawany.
2/17/2006EECS150 Lab Lecture #51 Logic Analyzers EECS150 Spring 2006 – Lab Lecture #5 David Lin Greg Gibeling.
16/27/2015 3:38 AM6/27/2015 3:38 AM6/27/2015 3:38 AMTesting and Debugging Testing The process of verifying the software performs to the specifications.
9/5/2008EECS150 Lab Lecture #21 Designing with Verilog EECS150 Fall Lab Lecture #2 Chen Sun Adopted from slides designed by Greg Gibeling.
2/9/2007EECS150 Lab Lecture #41 Debugging EECS150 Spring2007 – Lab Lecture #4 Laura Pelton Greg Gibeling.
Prof. John Nestor ECE Department Lafayette College Easton, Pennsylvania ECE VLSI System Design Lecture 4 - Advanced Verilog.
8/31/2007EECS150 Lab Lecture #11 EECS150 Intro. & CAD Tools EECS150 Fall 2007 Lab Lecture #1 Shah Bawany.
02/10/06EECS150 Lab Lecture #41 Debugging EECS150 Spring 2006 – Lab Lecture #4 Philip Godoy Greg Gibeling.
1/19/2007EECS150 Lab Lecture #11 EECS150 Intro. & CAD Tools EECS150 Spring 2008 Lab Lecture #1 Ke Xu.
10/31/2008EECS150 Lab Lecture #10 The Waveform Generator EECS150 Fall Lab Lecture #10 Chris Fletcher Adopted from slides designed by Chris Fletcher.
Overview Logistics Last lecture Today HW5 due today
Guest Lecture by Ben Magstadt CprE 281: Digital Logic.
Guest Lecture by Ben Magstadt CprE 281: Digital Logic.
ASIC/FPGA design flow. FPGA Design Flow Detailed (RTL) Design Detailed (RTL) Design Ideas (Specifications) Design Ideas (Specifications) Device Programming.
Some Course Info Jean-Michel Chabloz. Main idea This is a course on writing efficient testbenches Very lab-centric course: –You are supposed to learn.
ECE 551 Digital System Design & Synthesis Fall 2011 Midterm Exam Overview.
Debugging Strategies from Software Carpentry. Agan's Rules Many people make debugging harder than it needs to be by: Using inadequate tools Not going.
1 CSE-308 Digital System Design (DSD) N-W.F.P. University of Engineering & Technology, Peshawar.
1 Ch. 1: Software Development (Read) 5 Phases of Software Life Cycle: Problem Analysis and Specification Design Implementation (Coding) Testing, Execution.
The UNIVERSITY of NORTH CAROLINA at CHAPEL HILL State Machines Anselmo Lastra.
Introduction to ASIC flow and Verilog HDL
Lecture 1 – Overview (rSp06) ©2008 Joanne DeGroat, ECE, OSU -1- Functional Verification of Hardware Designs EE764 – Functional Verification of Hardware.
2/3/2006EECS150 Lab Lecture #31 Implementation of FSMs EECS150 Spring 2006 – Lab Lecture #3 Guang Yang Greg Gibeling.
2/2/07EECS150 Lab Lecture #31 Verilog Synthesis & FSMs EECS150 Spring 2007 – Lab Lecture #3 Brent Mochizuki Greg Gibeling.
CprE 281: Verilog Tutorial Ben Magstadt – Master’s Student Electrical Engineering.
Lecture 5: Design for Testability. CMOS VLSI DesignCMOS VLSI Design 4th Ed. 12: Design for Testability2 Outline  Testing –Logic Verification –Silicon.
CMSC201 Computer Science I for Majors Lecture 05 – Comparison Operators and Boolean (Logical) Operators Prof. Katherine Gibson Prof. Jeremy.
CSC 108H: Introduction to Computer Programming
Overview Logistics Last lecture Today HW5 due today
Figure 8.1. The general form of a sequential circuit.
Last Lecture Talked about combinational logic always statements. e.g.,
ECE 448 Lecture 6 Finite State Machines State Diagrams, State Tables, Algorithmic State Machine (ASM) Charts, and VHDL Code.
Topics Modeling with hardware description languages (HDLs).
VLSI Testing Lecture 5: Logic Simulation
Lect 11 - Stimulus & Response
‘if-else’ & ‘case’ Statements
CSE 374 Programming Concepts & Tools
COMP541 Sequential Logic – 2: Finite State Machines
ECE 448 Lecture 6 Finite State Machines State Diagrams vs. Algorithmic State Machine (ASM) Charts.
Topics Modeling with hardware description languages (HDLs).
Cracking the Coding Interview
CSCE 315 – Programming Studio, Fall 2017 Tanzir Ahmed
EECS150 Intro & CAD Tools EECS150 Fall Lab Lecture #1
Logic Analyzers EECS150 Fall Lab Lecture #5 Arjun Singh
Lect 11 - Stimulus & Response
EECS150 Fall 2007 – Lab Lecture #4 Shah Bawany
Guest Lecture by David Johnston
Debugging EECS150 Fall Lab Lecture #4 Sarah Swisher
Designing with Verilog
Debugging “Why you were up till 2AM”
Lecture 9: Testbench and Division
CSE 370 – Winter Sequential Logic-2 - 1
ECE 352 Digital System Fundamentals
Tonga Institute of Higher Education IT 141: Information Systems
Good Design & Network Audio
The SDRAM Controller EECS150 Fall Lab Lecture #8 Chen Sun
Logic Analyzers EECS150 Fall Lab Lecture #5 Arjun Singh
Design of Digital Circuits Lab 6 Supplement: Testing the ALU
ECE 551: Digital System Design & Synthesis
Tonga Institute of Higher Education IT 141: Information Systems
ECE 352 Digital System Fundamentals
Verilog Synthesis & FSMs
Arrays.
Introduction to Digital IC Design
ECE 448 Lecture 6 Finite State Machines State Diagrams vs. Algorithmic State Machine (ASM) Charts.
Presentation transcript:

Debugging EECS150 Fall2008 - Lab Lecture #4 Sarah Swisher Adopted from slides designed by Greg Gibeling 9/19/2008 EECS150 Lab Lecture #4

Today (1) Lab #2 Solution Simulation vs Hardware Debugging Goals Tips Algorithm Administrative Info 9/19/2008 EECS150 Lab Lecture #4

Today (2) Lab #4 Kramnik Bottom Up Testing (Peak Detector) Designing Test Hardware (Broken Adder) Exhaustive FSM Testing (Broken FSM) Kramnik 9/19/2008 EECS150 Lab Lecture #4

Lab #2 Solution (1) module Accumulator(In, Out, Enable, Clock, Reset); input [7:0] In; output [7:0] Out; input Enable; input Clock, Reset; reg [7:0] Out; always @ (posedge Clock) begin if (Reset) Out <= 8'h00; else if (Enable) Out <= Out + In; end endmodule 9/19/2008 EECS150 Lab Lecture #4

Lab #2 Solution (2) 9/19/2008 EECS150 Lab Lecture #4

Lab #2 Solution (3) Accumulator Peak Detector Simple, easy to build What is the actual circuit? Get used to answering this in your head RTL View from Lab #1 (Section 5.3 Synthesis) Peak Detector Hard to build Minute control of hardware Tools couldn’t optimize though!! 9/19/2008 EECS150 Lab Lecture #4

Simulation vs. Hardware (1) Debugging in Simulation Slow Running Time Fast Debugging Waveforms Text messages Full Visibility Can examine any signal Easy to Fix A few minutes to compile and resimulate 9/19/2008 EECS150 Lab Lecture #4

Simulation vs. Hardware (2) Debugging in Hardware Fast Running Time Full speed in fact Slow Debugging Synthesis can take hours Little or No Visibility Very hard to probe signals Maybe Impossible to Fix (ASICs) 9/19/2008 EECS150 Lab Lecture #4

Simulation vs. Hardware (3) Functional Testing & Verification Test everything at least minimally Fully Verify what you can This will save you many sleepless nights Hardware Debugging Treat this as a last resort It is painful 9/19/2008 EECS150 Lab Lecture #4

Debugging (1) Debugging Algorithm Hypothesis: What’s broken? Control: Give it controlled test inputs Expected Output: What SHOULD it do? Observe: Did it work right? If it broke: THAT’S GREAT! If we can’t break anything like this then the project must be working… 9/19/2008 EECS150 Lab Lecture #4

Debugging (2) Don’t debug randomly What can you do? Just changing things at random often makes things look fixed It won’t really help Debug systematically Your first design may be the best “1000 CS150 students at a 1000 typewriters…” What can you do? 9/19/2008 EECS150 Lab Lecture #4

Debugging (3) High Level Debugging Localize the problem N64? SDRAM? Video? Test Patterns Lets you easily isolate the broken component If you know exactly what’s going in you can check what’s coming out 9/19/2008 EECS150 Lab Lecture #4

Debugging (4) Simulate the broken component(s) Writing test benches takes less time than sitting around wondering why its broken Everyone hates writing testbenches (Even me) Get used to it 9/19/2008 EECS150 Lab Lecture #4

Debugging (5) Your best debugging tool is logic If 3 out of 4 components work, what’s broken? Question all your assumptions! What you think is true isn’t really true Don’t debug the wrong problem Know how modules you interface with behave 9/19/2008 EECS150 Lab Lecture #4

Debugging (6) Before you change anything After the change Understand exactly what the problem is Find an efficient solution Evaluate alternative solutions After the change Fixes may make things worse sometimes May uncover a second bug May be an incorrect fix Repeat the debugging process 9/19/2008 EECS150 Lab Lecture #4

Debugging (7) Ask around TAs Someone else may have had the same bug They’ll probably at least know about where the problem is Different bugs may produce the same results TAs The TAs know common problems We’re here to help, not solve it for you 9/19/2008 EECS150 Lab Lecture #4

Administrative Info Partners Project in 3 weeks You MUST have one for this week Try someone other than your best friend Restrictions You can change partners until the project starts You must be in the same lab Project in 3 weeks 9/19/2008 EECS150 Lab Lecture #4

Part1: Bottom Up Testing (1) What if EqualOut = 1’b0 and GreaterOut = 1’b0? 9/19/2008 EECS150 Lab Lecture #4

Part1: Bottom Up Testing (2) Exhaustive Testing Ideal Testing Method Circuit is 100% tested! Requires us to test a LOT! Can we do it here? (24 possible inputs) Method Make a truth table Have the testbench generate all inputs Make sure outputs math truth table 9/19/2008 EECS150 Lab Lecture #4

Part1: Bottom Up Testing (3) 9/19/2008 EECS150 Lab Lecture #4

Part1: Bottom Up Testing (4) Exhaustive Testing? 28 = 256 Possible Inputs Method Use a for loop to generate all inputs Loops allowed only in testbenches They will not synthesize Compare against a “>=“ Print a message if they differ 9/19/2008 EECS150 Lab Lecture #4

Part1: Bottom Up Testing (5) 9/19/2008 EECS150 Lab Lecture #4

Part1: Bottom Up Testing (6) Exhaustive Testing? 24 = 16 Possible Inputs 24 = 16 Possible States 16*16 = 256 combinations We could do it in this case Can’t exhaustively test FSMs Too many state/input combinations Must rely on directed testing 9/19/2008 EECS150 Lab Lecture #4

Part1: Bottom Up Testing (7) initial begin end integer i; reg [3:0] TestValues[1:16]; $readmemh("TestValues.txt", TestValues); for(i = 1; i <= 16; i = i + 1) begin #(`Cycle); In = TestValues[i]; $display("In = %d, Peak = %d", In, Peak); end 9/19/2008 EECS150 Lab Lecture #4

Part1: Bottom Up Testing (8) Read Test Vectors from a File Designing Test Vectors Make sure to cover most cases We want 95%+ coverage Designing test vectors is a “black art” $ Processes Not synthesizeable More information in IEEE Verilog Reference 9/19/2008 EECS150 Lab Lecture #4

Part2: Test Hardware (1) 9/19/2008 EECS150 Lab Lecture #4

Part2: Test Hardware (2) Test Procedure Hit Reset (SW1) Hit Go (SW2) Record an error DD1-8 show {A, B} SW10[1] selects the sum on DD4-8 Hit Go Repeat until the tester stops 9/19/2008 EECS150 Lab Lecture #4

Part2: Test Hardware (3) The Broken Adder 16bit Adder Fail Modes 232 ≈4 Billion Test Vectors Can’t simulate this much 2:40 to test this at 27MHz Fail Modes 0: No Errors 2: Will claim 1 + 1 = 3 1-3: Can have anywhere from 0 to 4 errors 9/19/2008 EECS150 Lab Lecture #4

Part3: FSM Testing (1) Exhaustive Testing Again! Check every arc Check every output You don’t need to correct this one… We’re not giving you the source code Boring (and Easy) You will have FSM bugs Get used to debugging them 9/19/2008 EECS150 Lab Lecture #4

Part3: FSM Testing (2) 9/19/2008 EECS150 Lab Lecture #4