一种四元决策图机及其代码的优化

2009 39th International Symposium on Multiple-Valued Logic Pub Date : 2009-05-21 DOI:10.1109/ISMVL.2009.35

Tsutomu Sasao, Hiroki Nakahara, M. Matsuura, Yoshifumi Kawamura, J. T. Butler

{"title":"一种四元决策图机及其代码的优化","authors":"Tsutomu Sasao, Hiroki Nakahara, M. Matsuura, Yoshifumi Kawamura, J. T. Butler","doi":"10.1109/ISMVL.2009.35","DOIUrl":null,"url":null,"abstract":"We show the advantage of Quarternary Decision Diagrams (QDDs) in representing and evaluating logic functions. That is, we show how QDDs are used to implement QDD machines, which yield high-speed implementations. We compare QDD machines with binary decision diagram (BDD) machines, and show a speed improvement of 1.28-2.02 times when QDDs are chosen. We consider 1-and 2-address BDD machines, and 3- and 4-address QDD machines, and we show a method to minimize the number of instructions.","PeriodicalId":115178,"journal":{"name":"2009 39th International Symposium on Multiple-Valued Logic","volume":"463 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"9","resultStr":"{\"title\":\"A Quaternary Decision Diagram Machine and the Optimization of its Code\",\"authors\":\"Tsutomu Sasao, Hiroki Nakahara, M. Matsuura, Yoshifumi Kawamura, J. T. Butler\",\"doi\":\"10.1109/ISMVL.2009.35\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We show the advantage of Quarternary Decision Diagrams (QDDs) in representing and evaluating logic functions. That is, we show how QDDs are used to implement QDD machines, which yield high-speed implementations. We compare QDD machines with binary decision diagram (BDD) machines, and show a speed improvement of 1.28-2.02 times when QDDs are chosen. We consider 1-and 2-address BDD machines, and 3- and 4-address QDD machines, and we show a method to minimize the number of instructions.\",\"PeriodicalId\":115178,\"journal\":{\"name\":\"2009 39th International Symposium on Multiple-Valued Logic\",\"volume\":\"463 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-05-21\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"9\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2009 39th International Symposium on Multiple-Valued Logic\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISMVL.2009.35\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 39th International Symposium on Multiple-Valued Logic","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISMVL.2009.35","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 9

摘要

我们展示了四分决策图(qdd)在表示和评估逻辑函数方面的优势。也就是说，我们展示了如何使用QDD来实现QDD机器，从而产生高速实现。我们将QDD机器与二进制决策图(binary decision diagram, BDD)机器进行了比较，发现当选择QDD机器时，速度提高了1.28-2.02倍。我们考虑了1地址和2地址的BDD机器，以及3地址和4地址的QDD机器，并展示了一种最小化指令数量的方法。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

A Quaternary Decision Diagram Machine and the Optimization of its Code

We show the advantage of Quarternary Decision Diagrams (QDDs) in representing and evaluating logic functions. That is, we show how QDDs are used to implement QDD machines, which yield high-speed implementations. We compare QDD machines with binary decision diagram (BDD) machines, and show a speed improvement of 1.28-2.02 times when QDDs are chosen. We consider 1-and 2-address BDD machines, and 3- and 4-address QDD machines, and we show a method to minimize the number of instructions.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2009 39th International Symposium on Multiple-Valued Logic

自引率

0.00%

发文量