Go to
March 4, 2008
Behavioral Transformations and Verification using Canonical Taylor Expansion Diagrams
Maciej Ciesielski, Department of Electrical and Computer Engineering, University of Massachusetts, Amherst, MA-USA
Abstract: This talk introduces Taylor Expansion Diagrams (TED), a canonical, graph-based representation with applications to verification and synthesis of designs specified on behavioral level.
Due to their canonical property, TEDs can be used for equivalence checking of designs specified on high (algorithmic or behavioral) level, written in C, system C or behavioral HDL. They can also serve as an efficient vehicle to perform transformations of an initial design specification prior to "high-level" (architectural) synthesis. As a canonical functional representation, TED can capture an entire class of structural solutions (data flow graphs, DFG), rather than a single DFG. Through a unique graph-based decomposition procedure, involving factorization, common subexpression extraction, and simplification, TED can be converted into a DFG that is best suited for a particular design objective (latency, area, etc). Such constructed DFG provides a better starting point for architectural synthesis that those derived directly from the initial design specifications.
An experimental software system, TDS, is currently under development at the University of Massachusetts, Amherst. It is available for free download by clicking here.
About the speaker: Maciej Ciesielski is Professor in the Department of Electrical & Computer Engineering (ECE) at the University of Massachusetts, Amherst. He received M.S. in Electrical Engineering from Warsaw Technical University, Poland, in 1974 and Ph.D. in Electrical Engineering from the University of Rochester, N.Y. in 1983. From 1983 to 1986 he worked at GTE Laboratories on the silicon compilation project. He joined the University of Massachusetts in 1987, where he teaches and conducts research in the area of electronic design automation, and specifically in synthesis, optimization and verification of VLSI systems.
Secondary navigation
- January 29, 2018
- August 30, 2017
- Past seminars
- 2016 - 2017 Seminars
- 2015 - 2016 Seminars
- 2014 - 2015 Seminars
- 2013 - 2014 Seminars
- 2012 - 2013 Seminars
- 2011 - 2012 Seminars
- 2010 - 2011 Seminars
- 2009 - 2010 Seminars
- 2008 - 2009 Seminars
- 2007 - 2008 Seminars
- 2006 - 2007 Seminars
- August 31, 2007
- June 29, 2007
- June 20, 2007
- June 5, 2007
- May 30, 2007
- May 16, 2007
- May 15, 2007
- April 24, 2007
- March 27, 2007
- March 14, 2007
- February 9, 2007
- February 8, 2007
- January 12, 2007
- December 5, 2006
- November 14, 2006
- October 31, 2006
- October 27, 2006
- October 26, 2006
- October 20, 2006
- September 20, 2006
- September 20, 2006
- September 20, 2006
- September 19, 2006
- 2005 - 2006 Seminars
- August 23, 2006
- August 22, 2006
- June 26, 2006
- June 20, 2006
- June 16, 2006
- June 7, 2006
- June 6, 2006
- May 30, 2006
- May 17, 2006
- May 10, 2006
- April 27, 2006
- April 12, 2006
- March 31, 2006
- March 29, 2006
- March 22, 2006
- March 15, 2006
- February 27, 2006
- February 8, 2006
- January 25, 2006
- January 19, 2006
- January 18, 2006
- January 17, 2006
- January 11, 2006
- November 30, 2005
- November 23, 2005
- November 2, 2005
- October 26, 2005
- October 25, 2005
- October 5, 2005
- September 28, 2005
- 2005 Seminars