Spring 2008 Semester
Class Meeting Time: 2:00-3:20 M-W  Location: Junkins 203

Instructor: Mitch Thornton Office: Caruth 220A, email: mitch@engr.smu.edu

Office Hours: M-W 1:00-2:00, Tue. 10:00-11:00, or by appointment

Text:

Logic Synthesis and Verification Algorithms, G. Hachtel and F. Somenzi, Kluwer Academic Publishers, 1996.

References:

Multiple Valued Logic: Concepts and Representations, D. M. Miller and M. A. Thornton, Morgan-Claypool Publishers, 2008
Switching Theory for Logic Synthesis, Tsutomu Sasao, Kluwer Academic Publishers, 1999.
Algorithms for VLSI Design Automation, Sabih H. Gerez, John Wiley, 1998
Algorithms and Data Structures in VLSI Design, Christoph Meinel and Thorsten Theobold, Springer, 1998
Synthesis and Optimization of Digital Circuits, Giovanni De Micheli, McGraw-Hill, 1994.
Spectral Techniques in VLSI CAD, M. A. Thornton, R. Drechsler and D. M. Miller, Kluwer Academic Publishers, 2001.

DISABILITY ACCOMMODATIONS
If you need academic accommodations for a disability, you must first contact Ms. Rebecca Marin, Coordinator, Services for Students with Disabilities (214-768-4563) to verify the disability and establish eligibility for accommodations. Then you should schedule an appointment with the professor to make appropriate arrangements.

OBSERVANCE OF RELIGIOUS HOLIDAYS
Students wishing to be absent on religious holidays that require missing class should notify the instructor in writing at the beginning of the semester, and should discuss in advance with the professor acceptable ways of making up any work missed because of the absence.

COURSE OUTLINE
This course will concentrate on advanced topics in switching theory and CAD methods. The underlying theory of the course topics is emphasized in addition to their application. Particular emphasis is placed on the representation and properties of discrete functions and the synthesis and verification problems. In addition to the prerequisites, students are expected to have proficiency using a modern programming language. Previous exposure to an HDL will also be highly beneficial but it is not a strict prerequisite.

TOPICS:

• Overview of Typical EDA Design Tasks and Flow
• Discrete Function Representation and Models
• Decision Diagrams and Spectral Decompositions
• Introduction to Reversible and Quantum Logic
• Decomposition, Symmetry, and Classes of Boolean Functions
• Two Level Logic Forms and Optimization
• ESOP Forms and Spectral Techniques
• Multilevel Logic Synthesis
• Timing

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