Tel: (413) 545-0401
- Ph.D., University of Rochester, 1984.
- M.S., Warsaw Technical University, 1974
- 1986-present, University of Massachusetts, Amherst.
- 1983-1986, GTE Laboratories, Waltham, MA;
Doctorate Honoris Causa , Universite de Bretagne Sud, Lorient, France, 2008.
- First-Year Experience Student Choice Award, University of Massachusetts Amherst, 2013.
Electronic Design Automation (EDA): CAD tools and algorithms.
VLSI CAD Laboratory
- Formal verification; functional verification of arithmetic circuits.
- Simulation-based design validation; parallel simulation.
- Behavioral and logic synthesis from high-level specifications.
- Mathematical optimization.
Publications and Slides
A set of selected research papers
and over 400 PowerPoint
presentation slides and tutorials.
is an experimental software tool to perform behavioral transformations of designs specified on algorithmic and behavioral levels. TDS transforms the initial design specifications into a data flow graph (DFG) optimized for a particular objective (latency, resource utilization, etc.) prior to high-level synthesis. The behavioral transformations are based on graph-based canonical representation, Taylor Expansion Diagram (TED), followed by structural transformations of the resulting DFG network.
Thanks to canonicity of the TED representation, the system can be also used for equivalence checking of designs specified in C or behavioral HDL.
The system is intended for data-flow and computation-intensive designs used in digital signal processing applications.
This project was supported by the National Science Foundation under
award No. CCR-0204146 and CCR-0702506 and was done in collaboration with Lab-STICC, Université de Bretagne Sud, Lorient, France.
- BDS (BDD-based Logic Synthesis system)
is our fast and efficient logic synthesis tool, based on a novel theory
of BDD-based bi-decomposition.
It provides both algebraic and Boolean decomposition of several types:
AND, OR, XOR, and MUX.
It handles random and control logic (AND-OR intensive) functions
as well as arithmetic (XOR-intensive) functions.
Its unique approach to partitioned BDD's allows it to handle very large
circuits. Version BDS-1.2 is now available from the following link:
This project has been supported by the National Science Foundation under
grant No. 9901254.
- Cunxi Yu (MS) - Formal
verification, sequential and floating point arithmetic circuits.
Walter Brown (2016) - Arithmetic verification.
REU in summer 2013 and 2014.
- Jordan Kaplan (2018) - Arithmetic verification. REU in summer 2015
- Michael Shliselberg (2018) - Arithmetic verification. REU in summer 2015
About Group, Department and University: