Publications
Theses
Journals
- Optimization
of Polynomial Datapaths using Finite Ring
Algebra, by Sivaram
Gopalakrishnan and Priyank Kalla, in ACM Transactions on Design Automation of Electronic Systems
(ACM-TODAES), Article. 49, Vol. 12, Issue 4, September 2007.
Conferences and Workshops
-
Finding
Linear Building-Blocks for RTL Synthesis of Polynomial
Datapaths with Fixed-Size Bit-Vectors, by Sivaram Gopalakrishnan,
Priyank Kalla, M. Brandon Meredith and Florian Enescu, in Proc. International Conference on
Computer-Aided Design (ICCAD) 2007.
-
Optimization
of Arithmetic
Datapaths with Finite Word-Length Operands, by Sivaram
Gopalakrishnan, Priyank Kalla and Florian Enescu, in
Asia/South-Pacific Design Automation Conference, (ASP-DAC) 2007.
-
Optimizing
Fixed-Size Bit-Vector Arithmetic using Finite Ring Algebra,
by Sivaram Gopalakrishnan,
Priyank Kalla and Florian Enescu, in International
Workshop on Logic and
Synthesis, (IWLS)
2006.
-
-
Exploiting
Vanishing
Polynomials for Equivalence Verification
of
Fixed-Size Arithmetic Datapaths,
by Namrata Shekhar, Priyank Kalla,
Florian Enescu and Sivaram
Gopalakrishnan, in
International Conference on Computer Design (ICCD)
2005.
-
Teaching
a HOL Course:
Experience Report, Konrad
Slind, Steven Barrus, Seungkeol Choe, Chris
Condrat,
Jianjun Duan, Sivaram Gopalakrishnan,
Aaron Knoll, Hiro Kuwahara,
Guodong Li, Scott Little, Lei Liu, Steanie Moore, Robert Palmer,
Claurissa Tuttle, Sean Walton, Yu Yang and Junxing Zhang, in
International Conference on Theorem Proving in
Higher
Order Logics, (TPHOLs) 2005.
-
Integrating
CNF and BDD
Based SAT
solvers,
by Sivaram
Gopalakrishnan, Vijay Durairaj and Priyank
Kalla, in High-Level Design Validation and Test Workshop, (HLDVT) 2003.
- BDD-Based Boolean
Satisfiability
using Search Space
Pruning, by Sivaram
Gopalakrishnan, Vijay Durairaj and
Priyank
Kalla, in International Workshop on Logic and
Synthesis, (IWLS)
2003.
|
|
|
