Verification of datapaths based on world level polynomial

Beijing(2008)

引用 0|浏览8
暂无评分
摘要
A reduced, canonical, weighted generalized list (WGL) is presented in this paper. This representation can effective describe world-level polynomial function. The reduction rules of WGL were proposed, and the equivalence verification method of register transfer level (RTL) design based on WGL was implemented. Experimental results show that WGL is more effective than other existent model, when it is used for the equivalent verification of RTL design.
更多
查看译文
关键词
equivalence verification method,register transfer level design,binary decision diagrams,datapaths verification,computational complexity,weighted generalized list,polynomials,world-level polynomial function,formal verification,register transfer level
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要