Spring 2018 Semester
Computer Arithmetic
Class Meeting Time: 2:00-3:20 M-W  Location: Caruth Hall 184

Instructor: Mitch Thornton Office: Caruth 483, email: mitch@smu.edu

Office Hours: M-W 1:00-1:50PM or by appointment

Text:

Computer Arithmetic Algorithms and Hardware Designs, B. Parhami,Oxford University Press, 2nd ed., 2010, ISBN 978-0-19-532848-6 (errata)

Reccommended:

        Handbook of Floating-Point Arithmetic, J.-M. Muller, et. al, Birkhauser, Boston, MA, 2010, ISBN 978-0-8176-4705-6 (errata - at bottom of webpage)
        Elementary Functions Algorithms and Implementation, J.-M. Muller, Birkhauser, Boston, MA, 2nd ed., 2016, ISBN978-1-4899-7981-0

References:

Computer Arithmetic Algorithms, I. Koren, A.K. Peters, Ltd., 2nd ed., 2002, ISBN 1-56881-160-8 (errata)(simulator)
Finite Precision Number Systems and Arithmetic, P. Kornerup and D.W. Matula, Cambridge University Press., 1st ed., 2010, ISBN 10-0521790174
Digital Arithmetic, M.D. Ercegovac and T. Lang, Morgan-Kaufman Publishers, 2004, ISBN 10-1558607986

DISABILITY ACCOMMODATIONS
Students needing academic accommodations for a disability must first register with Disability Accommodations & Success Strategies (DASS). Students can call 214-768-1470 or visit http://www.smu.edu/Provost/ALEC/DASS to begin the process. Once registered, students should then schedule an appointment with the professor as early in the semester as possible, present a DASS Accommodation Letter, and make appropriate arrangements. Please note that accommodations are not retroactive and require advance notice to implement.(See University Policy No. 2.4; an attachment describes the DASS procedures and relocated office.)

OBSERVANCE OF RELIGIOUS HOLIDAYS
Religiously observant students wishing to be absent on holidays that require missing class should notify their professors in writing at the beginning of the semester, and should discuss with them, in advance, acceptable ways of making up any work missed because of the absence. (See University Policy No. 1.9, University Undergraduate Catalogue - General Policies)

EXCUSED ABSENCES FOR UNIVERSITY EXTRACURRICULAR ACTIVITIES
Students participating in an officially sanctioned, scheduled University extracurricular activity should be given the opportunity to make up class assignments or other graded assignments missed as a result of their participation. It is the responsibility of the student to make arrangements with the instructor prior to any missed scheduled examination or other missed assignment for making up the work.(University Undergraduate Catalogue - General Policies)

COURSE OUTLINE
Advanced topics in switching theory and electronic design automation methods. Emphasizes the underlying theory and algorithms of EDA tools and their application. Particular emphasis on the representation and properties of discrete mathematics and synthesis, verification, and simulation problems. Includes binary and multiple-valued logic models that are targeted to conventional and emerging technologies, as well as optimization techniques for cost, performance, low power, and other constraints. Recommended: Experience in the use of HDLs and algorithm development and implementation.

TOPICS:

• Number Representation
• Addition and Subtraction
  
• Multiplication
• Division
• Real Arithmetic
• Function Evaluation
• Implementation Topics

PREREQUISITES:
C- or better in CSE3381 Digital Logic Design (or equivalent)
C- or better in CSE3358 Data Structures (or equivalent)
C- or better in CSE3353 Discrete Mathematics with Algorithms (or equivalent)
Recommended prerequesite: CSE5387/7387 or EE 5380 or Consent of Instructor

CLASS SCHEDULE AND TOPICS

GRADING POLICY