Efficient manipulation algorithms for linearly transformed BDDs

Wolfgang Günther, R. Drechsler
{"title":"Efficient manipulation algorithms for linearly transformed BDDs","authors":"Wolfgang Günther, R. Drechsler","doi":"10.1109/ICCAD.1999.810620","DOIUrl":null,"url":null,"abstract":"Binary decision diagrams (BDDs) are the state-of-the-art data structure in VLSI CAD, but, due to their ordering restriction, only exponential-sized BDDs exist for many functions of practical relevance. Linear transformations (LTs) have been proposed as a new concept to minimize the size of BDDs, and it is known that, in some cases, even an exponential reduction can be obtained. In addition to a small representation, the efficient manipulation of a data structure is also important. In this paper, we present polynomial-time manipulation algorithms that can be used for linearly transformed BDDs (LT-BDDs) analogously to BDDs. For some operations, like synthesis algorithms based on ITE (if-then-else), it turns out that the techniques known from BDDs can be directly transferred, while for other operations, like quantification and cofactor computation, completely different algorithms have to be used. Experimental results are given to show the efficiency of the approach.","PeriodicalId":6414,"journal":{"name":"1999 IEEE/ACM International Conference on Computer-Aided Design. Digest of Technical Papers (Cat. No.99CH37051)","volume":"19 1","pages":"50-53"},"PeriodicalIF":0.0000,"publicationDate":"1999-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"15","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"1999 IEEE/ACM International Conference on Computer-Aided Design. Digest of Technical Papers (Cat. No.99CH37051)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCAD.1999.810620","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 15

Abstract

Binary decision diagrams (BDDs) are the state-of-the-art data structure in VLSI CAD, but, due to their ordering restriction, only exponential-sized BDDs exist for many functions of practical relevance. Linear transformations (LTs) have been proposed as a new concept to minimize the size of BDDs, and it is known that, in some cases, even an exponential reduction can be obtained. In addition to a small representation, the efficient manipulation of a data structure is also important. In this paper, we present polynomial-time manipulation algorithms that can be used for linearly transformed BDDs (LT-BDDs) analogously to BDDs. For some operations, like synthesis algorithms based on ITE (if-then-else), it turns out that the techniques known from BDDs can be directly transferred, while for other operations, like quantification and cofactor computation, completely different algorithms have to be used. Experimental results are given to show the efficiency of the approach.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
线性变换bdd的有效操作算法
二进制决策图(bdd)是VLSI CAD中最先进的数据结构,但是,由于它们的顺序限制,只有指数大小的bdd才存在于许多实际相关的功能中。线性变换(LTs)作为最小化bdd大小的新概念已经被提出,并且已知,在某些情况下,甚至可以获得指数缩小。除了较小的表示之外,数据结构的有效操作也很重要。在本文中,我们提出了一种多项式时间操作算法,可用于类似于bdd的线性变换bdd (lt - bdd)。对于某些操作,如基于ITE (if-then-else)的合成算法,事实证明,从bdd中已知的技术可以直接转移,而对于其他操作,如量化和辅因子计算,则必须使用完全不同的算法。实验结果表明了该方法的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Least fixpoint approximations for reachability analysis Performance optimization using separator sets A scalable substrate noise coupling model for mixed-signal ICs JMTP: an architecture for exploiting concurrency in embedded Java applications with real-time considerations Electromagnetic parasitic extraction via a multipole method with hierarchical refinement
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1