CSE 8387 Switching Theory and Applications in VLSI CAD

Fall 2017 Semester
Switching Theory and Applications in VLSI CAD
Class Meeting Time: 2:00-3:20 M-W  Location: Junkins 113

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

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


Modeling Digital Switching Circuits with Linear Algebra, M.A. Thornton, Morgan-Claypool Publishers, 2014
Multiple Valued Logic: Concepts and Representations
, D. M. Miller and M. A. Thornton, Morgan-Claypool Publishers, 2008


        Boolean Differential Equations, B. Steinbach and C. Posthoff, Morgan-Claypool Publishers, 2017


Logic Synthesis and Verification Algorithms, G. Hachtel and F. Somenzi, Kluwer Academic Publishers, 1996.
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.

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.)

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)

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)

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.


  • Models, Logic, & Switching Theory History
  • Cube Lists & Set Representation Models
  • Disjointness, Algebraic Normal Form, & ESOP
  • Decision Diagrams and Spectral Decompositions
  • Graph-based Models
  • Graph-based Disjointness, Synthesis, & Verification
  • MVL Algebras & Notation
  • Justification & Satisfiability
  • Switching Function Spectra
  • Linear Algebraic Models
  • Linear Algebraic Transfer Functions
  • Linear Algebraic Justification
  • Linear Algebraic MVL Models
  • Linear Algebraic Transfer Function Spectrum and Frequency Response

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