Lab 5 Shift Registers and Counters Presented By Neha Kumar but while we wait for that to happen…

Slides:



Advertisements
Similar presentations
Basic Finite State Machines 1. 2 Finite State Machines Binary encoded state machines –The number of flip-flops is the smallest number m such that 2 m.
Advertisements

Lecture 15 Finite State Machine Implementation
Implementation Strategies
General Sequential Design
Computer Interfacing and Protocols
Registers and Counters
Counters. In class excercise How to implement a “counter”, which will count as 0,3,1,4,5,7,0,3,1,…… Q2Q1Q0D2D1D
Registers and Counters. Register Register is built with gates, but has memory. The only type of flip-flop required in this class – the D flip-flop – Has.
Copyright 2005, Agrawal & BushnellVLSI Test: Lecture 21alt1 Lecture 21alt BIST -- Built-In Self-Test (Alternative to Lectures 25, 26 and 27) n Definition.
Design for Testability Theory and Practice Lecture 11: BIST
Give qualifications of instructors: DAP
Sequential Logic Design
Contemporary Logic Design Finite State Machine Design © R.H. Katz Transparency No Chapter #8: Finite State Machine Design Finite State.
Logic and Computer Design Fundamentals Registers and Counters
Spring 2002EECS150 - Lec0-intro Page 1 EECS150 - Digital Design Lecture 9 - Finite State Machines 1 February 19, 2002 John Wawrzynek.
Shift Registers and Counters By Lakshmi Things that appear hard are normally trivial, If you do the obvious in the obvious way. After all, how “tough”
Sequential circuit design
1 Lecture 15 Registers Counters Finite State Machine (FSM) design.
Sequential Circuits Chapter 4 S. Dandamudi To be used with S. Dandamudi, “Fundamentals of Computer Organization and Design,” Springer,  S.
Generating Random Numbers in Hardware. Two types of random numbers used in computing: --”true” random numbers: ++generated from a physical source (e.g.,

Last Mod: March 2014  Paul R. Godin Shift Registers Registers 1.1.
Elevator Controller We’re hired to design a digital elevator controller for a four-floor building st try: Design a counter that counts up.
Rabie A. Ramadan Lecture 3
Status Report Atsushi Nukariya. FPGA training course ・ I solved 15 problems which are proposed by Uchida-san. ・ I used above circuit board. FPGA.
2017/4/24 CHAPTER 6 Counters Chapter 5 (Sections )
ECEN 248: INTRODUCTION TO DIGITAL SYSTEMS DESIGN Lecture 17 Dr. Shi Dept. of Electrical and Computer Engineering.
1 CSE370, Lecture 15 Lecture 15 u Logistics n HW5 due this Friday n HW6 out today, due Friday Feb 20 n I will be away Friday, so no office hour n Bruce.
Linear Feedback Shift Register. 2 Linear Feedback Shift Registers (LFSRs) These are n-bit counters exhibiting pseudo-random behavior. Built from simple.
Lecture #27 Page 1 ECE 4110– Sequential Logic Design Lecture #27 Agenda 1.Counters Announcements 1.HW #12 due.
Counters. In class excercise How to implement a “counter”, which will count as 0,3,1,4,5,7,0,3,1,…… Q2Q1Q0D2D1D
DLD Lecture 26 Finite State Machine Design Procedure.
Digital Logic Design.
CBP 2006Comp 4070 Concepts and Philosophy of Computing 1 Wrestling with Complex Stuff. With the Correct Approach, even the smallest guy will succeed!
Counters Prepared by: Careene McCallum-Rodney. Introduction Counters uses a Toggle Flip Flops to count either UP or DOWN in binary. A toggle flip flop.
1 ENGG 1015 Tutorial Three Examples of Finite State Machines Supplementary notes Learning Objectives  Learn about Design of Finite State Machines Ack.:
1 COMP541 Finite State Machines - 1 Montek Singh Sep 22, 2014.
Lecture #27 Page 1 ECE 4110–5110 Digital System Design Lecture #27 Agenda 1.Counters Announcements 1.Finish reading Wakerly sections 8.1, 8.2, 8.4, 8.5.
RTL Hardware Design by P. Chu Chapter 9 – ECE420 (CSUN) Mirzaei 1 Sequential Circuit Design: Practice Shahnam Mirzaei, PhD Spring 2016 California State.
Class Report 林格名 : Reed Solomon Encoder. Reed-Solomom Error Correction When a codeword is decoded, there are three possible outcomes –If 2s + r < 2t (s.
1 Modeling Synchronous Logic Circuits Debdeep Mukhopadhyay Associate Professor Dept of Computer Science and Engineering NYU Shanghai and IIT Kharagpur.
1 COMP541 Sequential Logic – 2: Finite State Machines Montek Singh Feb 29, 2016.
FIRST REVIEW.
Digital Decode & Correction Logic
COMP541 Sequential Logic – 2: Finite State Machines
Figure 12-13: Synchronous Binary Counter
VLSI Testing Lecture 14: Built-In Self-Test
CPE/EE 428/528 VLSI Design II – Intro to Testing (Part 3)
Subject Name: Information Theory Coding Subject Code: 10EC55
Sequential circuits and Digital System Reliability
Sequential circuit design
CSE 370 – Winter Sequential Logic-2 - 1
Sequential circuit design
Instructor: Alexander Stoytchev
Introduction to Sequential Circuits
CSE 370 – Winter Sequential Logic-2 - 1
Lecture 17 Logistics Last lecture Today HW5 due on Wednesday
Finite State Machines.
Joseph Ravichandran, Srijan Chakraborty, Kanad Sarkar
Figure 8.1. The general form of a sequential circuit.
Switching Theory and Logic Design Chapter 5:
14 Digital Systems.
Counters.
Lecture 17 Logistics Last lecture Today HW5 due on Wednesday
Advanced Computer Architecture Lecture 1
Lecture 22 Logistics Last lecture Today HW7 is due on Friday
EGR 2131 Unit 12 Synchronous Sequential Circuits
ECE 448 Lab 3 – Part 1 FPGA Design Flow Based on
Lecture 22 Logistics Last lecture Today HW7 is due on Friday
Announcements Assignment 7 due now or tommorrow Assignment 8 posted
Presentation transcript:

Lab 5 Shift Registers and Counters Presented By Neha Kumar but while we wait for that to happen…

What is an LFSR? Linear Feedback Shift Register An n-bit counter that cycles through 2^n-1 different non-zero patterns in a pseudo-random fashion. In this lab, we use it for error checking.

How to build an LFSR –Place a linear array of D Flip Flops and feed the output of the last one back to the first i.e. FF(n) -> FF(1). –For an n-bit LFSR look at the table on Page 6 for a polynomial of degree n. –For every term x^k in the polynomial compute the XOR of the outputs of FF(n) and FF(k) and feed it to FF(k+1) as input. –(By the way, FFs here are numbered 1-n.)

Example: How to build a 5 bit LFSR XOR QQQQQ D DD D DDD  Look up the “primitive polynomial”: x^5+x^2+1.  x^2 implies an XOR between F2 and F3.  Feed F5’s output back to F1.  Voila! F5F4 F3F2F1 CLK

Parity Bits / Error Checking  Now let’s allow for serial input.  The last n bits constitute the parity bits.  These must all be 0 to allow for error checking.  Our input here, for example, must end with … XOR QQQQQ D D DDD Bit4Bit3 Bit2Bit1Bit0 CLK XOR Serial Input

Example: Error Checking Serial Input: (Note: 11 = 15-4 bits) >1010 (Parity bits = 1010) >0000 Correct! >0111 Introduce error in 5 th bit. A 4-bit LFSR:

When in lab… dipswitches ROM LFSR control FSM 8-bit counter LED output comparator spare reset count enable CLK TC BLOCK DIAGRAM

…build the following An 8-bit counter (CC8CE) and comparator - Standard XILINX parts… easy. An 8-bit LFSR –Feed it the 256-bit sequence provided by the ROM. –Set the DIP switches on the board to provide the last 8 bits. –Don’t forget the enable signal for the FFs. A Control FSM - Draw a state diagram and truth table. - Design the gate-level implementation.

Modes of Operation Mode 1 - Shift 256 bits from the ROM. - Display the results on the 8 LEDs. Mode 0 –Process the ROM output. –Stop when the LFSR pattern matches the DIP switches. –The position of the error, if one exists, is displayed. Modes are controlled by the SPARE button.

Control FSM INPUTS –TC = counter output –Comparator output –Mode button (SPARE) STATES –ACTIVE: Enter on RESET. Enable counter and LFSR. –DONE: Enter when TC or PAR=LED go high. Miss Wormwood: What state do you live in? Calvin: Denial. Miss Wormwood: I don’t suppose I can argue with that…

The Lab! Run MODE 1 with all DIP switches at 0. Get parity bits from LEDs. Enter parity bits on the DIP switches and check the LEDs. They should read “ ”. Introduce an error in the ROM schematic. Use MODE 1 to detect the error and MODE 0 to find its position.

A Side Note GALOIS FIELDS Fields can be infinite. Like the set of reals or complex numbers. Or they can be finite. These are called Galois fields. Binary numbers form a Galois field where XOR serves as addition and AND serves as multiplication.

Come prepared… Read the handout. Read it again. Draw the schematics. Do the problems on the check-off sheet.