Polynomial circuit models for component matching in high-level synthesis
暂无分享,去创建一个
[1] Randal E. Bryant,et al. *PHDD: an efficient graph representation for floating point circuit verification , 1997, 1997 Proceedings of IEEE International Conference on Computer Aided Design (ICCAD).
[2] Wolfgang Rosenstiel,et al. Object-oriented reuse methodology for VHDL , 1999, DATE '99.
[3] Kenneth L. McMillan,et al. Approximation and decomposition of binary decision diagrams , 1998, Proceedings 1998 Design and Automation Conference. 35th DAC. (Cat. No.98CH36175).
[4] Randal E. Bryant,et al. Verification of Arithmetic Circuits with Binary Moment Diagrams , 1995, 32nd Design Automation Conference.
[5] Grant Martin. Design methodologies for system level IP , 1998, Proceedings Design, Automation and Test in Europe.
[6] Masahiro Fujita,et al. Spectral Transforms for Large Boolean Functions with Applications to Technology Mapping , 1993, 30th ACM/IEEE Design Automation Conference.
[7] S. Minato. Implicit manipulation of polynomials using zero-suppressed BDDs , 1995, Proceedings the European Design and Test Conference. ED&TC 1995.
[8] Masahiro Fujita,et al. Hybrid decision diagrams , 1995, ICCAD.
[9] Giovanni De Micheli,et al. Synthesis and Optimization of Digital Circuits , 1994 .
[10] Randal E. Bryant,et al. Graph-Based Algorithms for Boolean Function Manipulation , 1986, IEEE Transactions on Computers.
[11] Randal E. Bryant,et al. ACV: an arithmetic circuit verifier , 1996, Proceedings of International Conference on Computer Aided Design.