Compilation of optimized OBDD-algorithms

Stefan Höreth
{"title":"Compilation of optimized OBDD-algorithms","authors":"Stefan Höreth","doi":"10.5555/252471.252502","DOIUrl":null,"url":null,"abstract":"According to Bryant there exist basically two OBDD construction methods, namely Apply- and Compose-based approaches. In this paper we describe a compilation method that generates an optimized Apply-based OBDD-algorithm from a given combinational circuit description. The method is particularly useful in library-based synthesis- and verification environments. We also present a concise, machine independent measure for the efficiency of OBDD-construction methods. Experiments with our new method indicate a speedup of up to a factor 19 in the construction time for OBDDs while the maximum memory requirements are typically slightly smaller in comparison to conventional approaches.","PeriodicalId":308438,"journal":{"name":"EURO-DAC '96/EURO-VHDL '96","volume":"256 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1996-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"EURO-DAC '96/EURO-VHDL '96","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.5555/252471.252502","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

Abstract

According to Bryant there exist basically two OBDD construction methods, namely Apply- and Compose-based approaches. In this paper we describe a compilation method that generates an optimized Apply-based OBDD-algorithm from a given combinational circuit description. The method is particularly useful in library-based synthesis- and verification environments. We also present a concise, machine independent measure for the efficiency of OBDD-construction methods. Experiments with our new method indicate a speedup of up to a factor 19 in the construction time for OBDDs while the maximum memory requirements are typically slightly smaller in comparison to conventional approaches.
优化obdd算法的编译
根据Bryant的说法,基本上存在两种OBDD构建方法,即基于应用和基于组合的方法。本文描述了一种编译方法,根据给定的组合电路描述生成优化的基于应用程序的obdd算法。该方法在基于库的合成和验证环境中特别有用。我们还提出了一种简洁的、与机器无关的obdd构建方法效率度量方法。使用我们的新方法进行的实验表明,obdd的构建时间加快了19倍,而与传统方法相比,最大内存需求通常略小。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信