{"title":"基于BDD的多重矩阵乘法","authors":"T. Bhuvaneswari, V. Prasad, A. Singh","doi":"10.1109/SMELEC.2010.5549400","DOIUrl":null,"url":null,"abstract":"Binary Decision Diagrams (BDDs) are the most frequently used data structure for handling Boolean functions because of their excellent efficiency in terms of time and space. Algebraic Decision Diagrams (ADDs) have been used to solve general purpose problems such as Matrix Multiplication, logic synthesis and Formal Verification. We propose a Multiple BDD based Matrix Multiplication and compare the performance with ADD and WBDD based matrix multiplication. The results of the proposed method are promising and can be applied to other matrix related problems.","PeriodicalId":308501,"journal":{"name":"2010 IEEE International Conference on Semiconductor Electronics (ICSE2010)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Multiple BDD based matrix multiplication\",\"authors\":\"T. Bhuvaneswari, V. Prasad, A. Singh\",\"doi\":\"10.1109/SMELEC.2010.5549400\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Binary Decision Diagrams (BDDs) are the most frequently used data structure for handling Boolean functions because of their excellent efficiency in terms of time and space. Algebraic Decision Diagrams (ADDs) have been used to solve general purpose problems such as Matrix Multiplication, logic synthesis and Formal Verification. We propose a Multiple BDD based Matrix Multiplication and compare the performance with ADD and WBDD based matrix multiplication. The results of the proposed method are promising and can be applied to other matrix related problems.\",\"PeriodicalId\":308501,\"journal\":{\"name\":\"2010 IEEE International Conference on Semiconductor Electronics (ICSE2010)\",\"volume\":\"27 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-06-28\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 IEEE International Conference on Semiconductor Electronics (ICSE2010)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SMELEC.2010.5549400\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 IEEE International Conference on Semiconductor Electronics (ICSE2010)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SMELEC.2010.5549400","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Binary Decision Diagrams (BDDs) are the most frequently used data structure for handling Boolean functions because of their excellent efficiency in terms of time and space. Algebraic Decision Diagrams (ADDs) have been used to solve general purpose problems such as Matrix Multiplication, logic synthesis and Formal Verification. We propose a Multiple BDD based Matrix Multiplication and compare the performance with ADD and WBDD based matrix multiplication. The results of the proposed method are promising and can be applied to other matrix related problems.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
