CSE:-670 DESIGN OF EMBEDDED SYSTEMS USING FPGA. PROFESSOR:-Dr. RICHARD E. HASKELL. MIDTERM EXAM. NAME:-RAVI D. SHAH.

Slides:

Advertisements

Similar presentations

© 2003 Xilinx, Inc. All Rights Reserved Course Wrap Up DSP Design Flow.

Advertisements

Register Transfer Level

1ASM Algorithmic State Machines (ASM) part 1. ASM2 Algorithmic State Machine (ASM) ‏ Our design methodologies do not scale well to real-world problems.

ES 112 Project 2 bit ALU.

Division Algorithms By: Jessica Nastasi.

Introduction Digital systems (logic design, digital logic, switching circuits) are employed in: computers data communication control systems many other.

1 ALUs. 2 Topics: ALU Overview - core of the integer datapath - 2 operands, 32-bits wide, plus control signals Exercise: A simple multiplier.

DATAPATHS 3) Shifters. 4) Comparators 5) Counters.

Charles Kime © 2008 Pearson Education, Inc. (Hyperlinks are active in View Show mode) Chapter 7 – Registers and Register Transfers Part 3 – Control of.

Insertion Sort using FPGA’s Aaron Tiedje CSE 670 Winter 2004 March 1, 2004 Professor R. Haskell Embedded Systems using FPGA's.

Integer Square Root CSE 670 Exam 1 Robert Hodge March 1, 2004.

Divide Polynomial by Monomial 3x 2 + 6x 3x = 3x 2 3x + 6x 3x = 3xx 3x + 32x32x = x x 2 y - 6xy + 12y 6xy = 6  3xxy 6xy  2y 6xy = 3x 1 x.

Basic Register A register is a sequential component that can store multiple bits.

LAB 9 Simulator Chap 14 REED. Datapath Simulator accompanying the text is a datapath simulator a.k.a. the Knob & Switch Computer developed by Grant Braught.

Lab 10 RT methodology (cont’d) Example 1 – a counter Example 2 – a repetitive-adder multiplier.

Homework Reading Machine Projects Labs

Datapath and Control Andreas Klappenecker CPSC321 Computer Architecture.

Chapter 6 Memory and Programmable Logic Devices

9/15/09 - L25 Registers & Load Enable Copyright Joanne DeGroat, ECE, OSU1 Registers & Load Enable.

They are the same as registers since they store binary numbers. Called shifting registers since they shift (left or right) the binary number stored in.

Multiplication CPSC 252 Computer Organization Ellen Walker, Hiram College.

COMPUTER NUMBER SYSTEMS & DIGITAL DEVICES By: Sohaib Rehman.

How Computers Work Dr. John P. Abraham Professor UTPA.

ABCDNumber = Off 1 = On Binary Coded Decimal (BCD)

Lecture 16 Today’s topics: –MARIE Instruction Decoding and Control –Hardwired control –Micro-programmed control 1.

Advanced Computer Architecture 0 Lecture # 1 Introduction by Husnain Sherazi.

1 Binary Coded Decimal Presented By Chung Wai Chow.

Topic 1Topic 2Topic 3Topic 4Topic

Divisibility Test For Different Numbers

Introduction to structured VLSI Projects 4 and 5 Rakesh Gangarajaiah

The Central Processing Unit (CPU) and the Machine Cycle.

General Concepts of Computer Organization Overview of Microcomputer.

Microsoft FrontPage 2003 Illustrated Complete Creating a Form.

Floating-Point Representation We can store integers and characters easily in binary, but what about fractions? ¼ =.25 = 2.5 * *

MicroProcessors Dr. Tamer Samy Gaafar Dept. of Computer & Systems Engineering Faculty of Engineering Zagazig University.

Instructor: Oluwayomi Adamo Digital Systems Design.

Introduction ELEC 330 Digital Systems Engineering Dr. Ron Hayne.

1 ENGG 1015 Tutorial Three Examples of Finite State Machines Supplementary notes Learning Objectives  Learn about Design of Finite State Machines Ack.:

8421 Binary Hexadecimal Seven segment display 8421 Welcome to the Binary Hex Clock 1.The Display shows the Hexadecimal Values going up from 0 to F 2.Unfortunately.

8421 Binary Hexadecimal Seven segment display 8421 Binary Hexadecimal Seven segment display 0000.

CSE 378 Computer Hardware Design (Formerly, Design of Digital Systems) Prof. Richard E. Haskell – –Tel: –Web site:

Lecture 13 PicoBlaze I/O & Interrupt Interface Example of Assembly Language Routine ECE 448 – FPGA and ASIC Design with VHDL.

Teaching Digital Logic courses with Altera Technology

Flowchart. a diagram of the sequence of movements or actions of people or things involved in a complex system or activity. a graphical representation.

CSE477 L21 Multiplier Design.1Irwin&Vijay, PSU, 2002 CSE477 VLSI Digital Circuits Fall 2002 Lecture 21: Multiplier Design Mary Jane Irwin (

Multipliers. More complicated than addition accomplished via shifting and addition More time and more area Multiplication What should be the length of.

Math Properties A property is something that is true for all situations.

Program Program is a collection of instructions that will perform some task.

1 ICS103 Programming in C Lecture 7: Repetition Structures.

Lecture No. 18 Combinational Functional Devices. Recap Decoder Decoder –3-to-8 Decoder –Cascading of Decoders 4-to-16 decoder –Implementing SOP & POS.

Chapter I: Introduction to Computer Science. Computer: is a machine that accepts input data, processes the data and creates output data. This is a specific-purpose.

Digital Design: With an Introduction to the Verilog HDL, 5e M. Morris Mano Michael D. Ciletti Copyright ©2013 by Pearson Education, Inc. All rights reserved.

Introduction to the FPGA and Labs

Array multiplier TU/e Processor Design 5Z032.

Subtitle: How to design the data path of a processor.

CSE 3322 Computer Architecture

COMPUTER ORGANIZATION & ASSEMBLY LANGUAGE

Homework Reading Machine Projects Labs

Part 4 Combinational Logic.

Combinational Logic Circuits

CMPT 238 Data Structures Midterm Exam Review.

Knowing your math operation terms

Reference: Moris Mano 4th Edition Chapter 4

Partial Products Algorithm for Multiplication

BEE1244 Digital System and Electronics BEE1244 Digital System and Electronic Chapter 2 Number Systems.

ECE 434 Advanced Digital System L13

Computer Organization and Design

Homework Reading Machine Projects Labs

Designing Algorithms for Multiplication of Fractions

Applying the Principles to Formulas

Presentation transcript:

CSE:-670 DESIGN OF EMBEDDED SYSTEMS USING FPGA. PROFESSOR:-Dr. RICHARD E. HASKELL. MIDTERM EXAM. NAME:-RAVI D. SHAH

ALGORITHM. Accept the input (number whose factorial is desired) from switches and store it in R2 making wld = ‘1’ for display. Accept the input (number whose factorial is desired) from switches and store it in R2 making wld = ‘1’ for display. Provide the first number using which the algorithm starts. (i.e. 1) using the switches and store it in R0 and R1 making wld = ‘1’ for display. Provide the first number using which the algorithm starts. (i.e. 1) using the switches and store it in R0 and R1 making wld = ‘1’ for display. Now bring R1 to input a of the alu and perform multiplication. Now bring R1 to input a of the alu and perform multiplication. Store the answer in R1. Store the answer in R1.

Bring R0 to input a of the alu and perform a+b. Now input b of the alu has the value of a+b on it. Now bring R2 to input a of the alu and perform a-b. If z = ‘0’ then bring R1 again to input a of the alu and perform multiplication and so on. If z = ‘1’ perform multiplication, store the answer in R2 register and keep displaying it untill the new number is entered. Bring R0 to input a of the alu and perform a+b. Now input b of the alu has the value of a+b on it. Now bring R2 to input a of the alu and perform a-b. If z = ‘0’ then bring R1 again to input a of the alu and perform multiplication and so on. If z = ‘1’ perform multiplication, store the answer in R2 register and keep displaying it untill the new number is entered.

DATAPATHANDCONTROL UNIT Components used in the Datapath:- Registers, Multiplexer, ALU, Binary to BCD convertor and BCD to seven segment convertor for display. Control Unit:- It employs the state machine approach with a total of 13 states communicating with each other.

ADVANTAGES OF THE ALGORITHM. Can be a part of any Embedded System where multiply and add operation is being performed like in a correlator in a Global Positioning System. Implemented through the state machine approach which provides clear and perfect communication between the states, which facilitates both debugging and implementation. With more display options in terms of the number of LCD displays it is a smooth implementation for finding factorial of as large a number as required.