CSE 8351 Computer Arithmetic Fall 2005 Instructor: Peter-Michael Seidel.

Slides:



Advertisements
Similar presentations
CSE 246: Computer Arithmetic Algorithms and Hardware Design Instructor: Prof. Chung-Kuan Cheng Fall 2006 Lecture 11 Cordic, Log, Square, Exponential Functions.
Advertisements

Distributed Arithmetic
CSE 246: Computer Arithmetic Algorithms and Hardware Design Instructor: Prof. Chung-Kuan Cheng Winter 2004 Lecture 2.
Basic Integer Arithmetic Building Block
Multimedia Systems Course Overview & Introduction Instructor: Leila Sharifi UUT Fall
UNIVERSITY OF MASSACHUSETTS Dept
CSE 246: Computer Arithmetic Algorithms and Hardware Design Instructor: Prof. Chung-Kuan Cheng Lecture 5.
CSE 246: Computer Arithmetic Algorithms and Hardware Design Instructor: Prof. Chung-Kuan Cheng Winter 2004 Lecture 1.
Overview Discrete Mathematics and Its Applications Baojian Hua
What You Have Always Wanted to Know about FP Hardware Implementation (But Were Afraid to Ask) Acknowledgements: Based on Prof. Shaaban lecture notes, Prof.
ECE 171 first class in logic and computers Dr Marek Perkowski Introduction Grading What is this class.
CSE 246: Computer Arithmetic Algorithms and Hardware Design Instructor: Prof. Chung-Kuan Cheng Winter 2005 Lecture 1: Numbers.
Energy and Delay Improvement via Decimal Floating Point Hossam A.H.Fahmy, Electronics and Communications Department, CairoUniversity Egypt and.
CSE 246: Computer Arithmetic Algorithms and Hardware Design Instructor: Prof. Chung-Kuan Cheng Fall 2006 Lecture 1: Introduction and Numbers.
ECE 301 – Digital Electronics Course Introduction, Number Systems, Conversion between Bases, and Basic Binary Arithmetic (Lecture #1)
ECE 331 – Digital System Design

CSE 246: Computer Arithmetic Algorithms and Hardware Design Instructor: Prof. Chung-Kuan Cheng Winter 2004 Lecture 7.
Slide 1 Instructor: Dr. Hong Jiang Teaching Assistant: Mr. Sheng Zhang Department of Computer Science & Engineering University of Nebraska-Lincoln Classroom:
Ch. 21. Square-rootingSlide 1 VI Function Evaluation Topics in This Part Chapter 21 Square-Rooting Methods Chapter 22 The CORDIC Algorithms Chapter 23.
CSE 20 Discrete Mathematics Instructor CK Cheng, CSE2130 tel: Teaching Assistants Jingwei Lu
Roman Numerals. Developed by Romans Roman Numerals Use 7 letters as numbers.
Roman Numerals. The Numbers I-1 II-2 III-3 IV-4 V-5 VI-6 VII-7 VIII-8 IX-9 X-10 C-100 D-500 M-1000.
Lecture 12: Computer Arithmetic Today’s topic –Numerical representations –Addition / Subtraction –Multiplication / Division 1.
November 2013 Network Team Institute
ECE 8053 Introduction to Computer Arithmetic (Website: Course & Text Content: Part 1: Number Representation.
ENG3050 Embedded Reconfigurable Computing Systems General Information Handout Winter 2015, January 5 th.
Floating Point vs. Fixed Point for FPGA 1. Applications Digital Signal Processing -Encoders/Decoders -Compression -Encryption Control -Automotive/Aerospace.
Lecture 1: Introduction CS 6903: Modern Cryptography Spring 2009 Nitesh Saxena Polytechnic Institute of NYU.
ECEN 248: INTRODUCTION TO DIGITAL DESIGN
1 Appendix J Authors: John Hennessy & David Patterson.
Topic: Arithmetic Circuits Course: Digital Systems Slide no. 1 Chapter # 5: Arithmetic Circuits.
COSC 3330/6308 Computer Architecture Jehan-François Pâris
CSE 8351 Computer Arithmetic Fall 2005 Instructor: Peter-Michael Seidel.
CH09 Computer Arithmetic  CPU combines of ALU and Control Unit, this chapter discusses ALU The Arithmetic and Logic Unit (ALU) Number Systems Integer.
ΑΡΙΘΜΗΤΙΚΕΣ ΜΕΘΟΔΟΙ ΜΟΝΤΕΛΟΠΟΙΗΣΗΣ 4. Αριθμητική Επίλυση Συστημάτων Γραμμικών Εξισώσεων Gaussian elimination Gauss - Jordan 1.
Follow-up Courses. ECE Department MS in Electrical Engineering MS EE MS in Computer Engineering MS CpE COMMUNICATIONS & NETWORKING SIGNAL PROCESSING CONTROL.
Sequential Multipliers Lecture 9. Required Reading Chapter 9, Basic Multiplication Scheme Chapter 10, High-Radix Multipliers Chapter 12.3, Bit-Serial.
Lecture 4 Multiplier using FPGA 2007/09/28 Prof. C.M. Kyung.
ECE 8053 Introduction to Computer Arithmetic (Website: Course & Text Content: Part 1: Number Representation.
DATA REPRESENTATION, DATA STRUCTURES AND DATA MANIPULATION TOPIC 4 CONTENT: 4.1. Number systems 4.2. Floating point binary 4.3. Normalization of floating.
ELEC692/04 course_des 1 ELEC 692 Special Topic VLSI Signal Processing Architecture Fall 2004 Chi-ying Tsui Department of Electrical and Electronic Engineering.
CS 179.4/215 3D Modeling & Animation DISCS. Course Description This course will focus on the theories of geometry, algorithms in computer graphics and.
Lecture notes Reading: Section 3.4, 3.5, 3.6 Multiplication
How did the ancients use numbers?
1 Ó1998 Morgan Kaufmann Publishers Chapter 4 計算機算數.
COPYRIGHT LAW FALL 2006: CLASS 1 Professor Fischer Introduction to Copyright August 21, 2006.
Copyright 2008 Koren ECE666/Koren Part.7b.1 Israel Koren Spring 2008 UNIVERSITY OF MASSACHUSETTS Dept. of Electrical & Computer Engineering Digital Computer.
CSE 246: Computer Arithmetic Algorithms and Hardware Design Instructor: Prof. Chung-Kuan Cheng Fall 2006 Lecture 7 Division.
High-Radix Sequential Multipliers Bit-Serial Multipliers Modular Multipliers Lecture 9.
CSE 8351 Computer Arithmetic Fall 2005 Instructors: Peter-Michael Seidel.
Uses some of the slides for chapters 3 and 5 accompanying “Introduction to Parallel Computing”, Addison Wesley, 2003.
CIS 681 Course Introduction CSE681: Introduction to 3D Image Generation.
CH.3 Floating Point Hardware and Algorithms 3/10/
High Computation Mahendra Sharma. Hybrid number representation The hybrid number representations proposed are capable of bounding the maximum length of.
Floating Point Arithmetic – Part I
Array multiplier TU/e Processor Design 5Z032.
UNIVERSITY OF MASSACHUSETTS Dept
CSE 575 Computer Arithmetic Spring 2003 Mary Jane Irwin (www. cse. psu
CS598CXZ (CS510) Advanced Topics in Information Retrieval (Fall 2016)
CSE 575 Computer Arithmetic Spring 2005 Mary Jane Irwin (www. cse. psu
Autonomous Cyber-Physical Systems: Course Introduction
CSE 575 Computer Arithmetic Spring 2002 Mary Jane Irwin (www. cse. psu
Topic 1: Be able to combine functions and determine the resulting function. Topic 2: Be able to find the product of functions and determine the resulting.
Computer Organization and Design
CPU Design & Computer Arithmetic
ECE 301 – Digital Electronics
UNIVERSITY OF MASSACHUSETTS Dept
WELCOME TO EE457 COMPUTER SYSTEMS ORGANIZATION
Chapter 4 計算機算數.
Presentation transcript:

CSE 8351 Computer Arithmetic Fall 2005 Instructor: Peter-Michael Seidel

CSE 8351 Computer ArithmeticSeidel - Fall Administrative Issues Class times: TTh 5:00-6:20 Office hours: (SIC301) W 2-3, Th 2-3 Course Webpage: Class material –Handouts, slides and references will be provided on course webpage –no required textbook References will be provided on WWW Computer Arithmetic Page (to be setup) Grade distribution –Project40% –Paper Summaries/Presentations 40% –Examination 20% 8000 level - Research focus in class –Quality Research is based on a combination of Knowledge (facts) / Skills (methodology) / Motivation (effort)

CSE 8351 Computer ArithmeticSeidel - Fall I. Introduction (1 class) II. Historical Perspectives(1 class) III. Simple Algorithms for Arithmetic Unit Design in Hardware (3 classes) Addition/Multiplication/ SRT Division/Square Root / Reciprocal Approximation IV. (Long) Arithmetic Algorithms in Software(4 classes) Addition / Multiplication (Karatsuba/FFT) / Division (Karatsuba) / Powering V. Redundant Radix Representations and Partial Compressions (3 classes) General Framework, Classification and Hardware / On-line Arithmetic VI. Highly Parallel Add/Multiply/Divide/Square Root Algorithms (5 classes) Parallel Adders/ Parallel Multiplication / Booth, High Radix Digit Speculation/ Conversion Methods // Low-Power Multiplication VII. (IEEE) Floating-Point Arithmetic & Rounding(5 classes) Standard / Representatives / Rounding Multiplication, Division / Addition / Dual Path / Pipelined-Packet FP expansions in Software Transcendental functions VIII. Vector and Matrix Arithmetic, Arithmetic for Encryption (3 classes) Matrix Multiplication (LUP decomposition) / RSA and modular Arithmetic Tentative Content

CSE 8351 Computer ArithmeticSeidel - Fall Importance of Number Representations A German merchant of the fifteenth century asked an eminent professor where he should send his son for a good business education. The professor responded that German universities would be sufficient to teach the boy addition and subtraction but he would have to go to Italy to learn multiplication and division. Before you smile indulgently, try multiplying or even just adding the Roman numerals CCLXIV, MDCCCIX, DCL, and MLXXXI without first translating them. John Allen Paulos, Beyond Numeracy

CSE 8351 Computer ArithmeticSeidel - Fall Implementation Radix-k Serial FP-Adder Formal Verification of optimized Arithmetic HW (PVS) Scalable multiplicative FP-Dividers Effective Arithmetic on FPGAs Optimal Compressor Implementations Multiple-Path Fused Multiply-Add Arithmetic Optimization by combining CMOS & Threshold logic Low-cost low-precision transcendentals for computer graphic Hardware acceleration for Encryption Algorithms Long Arithmetic based on Floating-Point Expansions Others Selected Project Topics