Department of Electrical & Computer Engineering

Spring 2016

Phone: (413) 545-0401

Office hours: Mon., Wed. 2:00 - 3:15, KEB 307, or by appointment.

Email:
ciesiel@ecs.umass.edu

Lectures: Tu, Th, 10:00 - 11:15, Marston 220

Email: ycunxi@engin.umass.edu

Office Hours: Th., 3:50 - 4:50 pm, KEB 314. /!>

The first part of the course covers basic techniques of high-level and
architectural synthesis, including operation scheduling, resource allocation
and binding.
Next, the fundamentals of Boolean algebra, logic function representations,
and basic logic optimization algorithms are introduced.
We shall concentrate on those parts of the theory that will help you
understand how logic synthesis and verification CAD tools work.
This is useful to those who want to develop such tools and to those
who simply want to use them proficiently.
The next part will be devoted to logic synthesis, concentrating mostly
on multi-level synthesis and technology mapping.
Application to both ASICs and FPGAs will be discussed.

The last part will cover Verification, with emphasis on formal methods (equivalence checking and model checking) and satisfiability.

There will be five homework assignments, one midterm exam (testing your knowledge of theory) and the final exam. Homework assignments will include the use of synthesis tools, such as GAUT, ABC, BDS, TDS, and commercial tools, available on CSE Unix servers.

The final grade will be determined as follows:

- Homework/project assignments - 40%
- Midterm exam - 30%
- Final exam - 30%

- G. DeMicheli,
*Synthesis and Optimization of Digital Circuits*, (Lecture notes available in pdf format). McGraw-Hill, 1994, ISBN: 9780070163331.

Additional references.

*Logic Synthesis and Verification Algorithms,*G. Hachtel and F. Somenzi, Kluwer Academic Publishers, 1996 (2nd printing). ISBN 7923-9746-0.

Errata*Logic Synthesis and Verification,*S. Hassoun, T. Sasao (editors), Kluwer Academic Publishers, 2001. ISBN 0-7923-7606-4.*Switching Theory for Logic Synthesis,*T. Sasao, Kluwer Academic Publishers, 1999. ISBN 0-7923-8456-3