R. Stankovic, M. Stankovic, J. Astola, K. Egiazarian
{"title":"斐波那契互连拓扑中函数的位级和字级多项式表达式","authors":"R. Stankovic, M. Stankovic, J. Astola, K. Egiazarian","doi":"10.1109/ISMVL.2001.924588","DOIUrl":null,"url":null,"abstract":"In this paper, we extend various Boolean representations for switching functions, as SOPs, Reed-Muller expressions, Kronecker and Pseudo Kronecker ANDEXOR expressions, to functions used in Fibonacci interconnection topologies. Then, we extend the world-level expressions, as arithmetic expressions, and Walsh expressions, to these functions. We introduce the corresponding decision diagrams as graphic representations of these bit-level and word-level expressions. In this way, we provide a base to extend the application of powerful CAD design tools using polynomial expressions and DDs for switching functions to functions in Fibonacci interconnection topologies.","PeriodicalId":297353,"journal":{"name":"Proceedings 31st IEEE International Symposium on Multiple-Valued Logic","volume":"8 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2001-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Bit-level and word-level polynomial expressions for functions in Fibonacci interconnection topologies\",\"authors\":\"R. Stankovic, M. Stankovic, J. Astola, K. Egiazarian\",\"doi\":\"10.1109/ISMVL.2001.924588\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we extend various Boolean representations for switching functions, as SOPs, Reed-Muller expressions, Kronecker and Pseudo Kronecker ANDEXOR expressions, to functions used in Fibonacci interconnection topologies. Then, we extend the world-level expressions, as arithmetic expressions, and Walsh expressions, to these functions. We introduce the corresponding decision diagrams as graphic representations of these bit-level and word-level expressions. In this way, we provide a base to extend the application of powerful CAD design tools using polynomial expressions and DDs for switching functions to functions in Fibonacci interconnection topologies.\",\"PeriodicalId\":297353,\"journal\":{\"name\":\"Proceedings 31st IEEE International Symposium on Multiple-Valued Logic\",\"volume\":\"8 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2001-05-22\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings 31st IEEE International Symposium on Multiple-Valued Logic\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISMVL.2001.924588\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings 31st IEEE International Symposium on Multiple-Valued Logic","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISMVL.2001.924588","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1
摘要
在本文中,我们将交换函数的各种布尔表示,如SOPs, Reed-Muller表达式,Kronecker和Pseudo Kronecker and dexor表达式,扩展到Fibonacci互连拓扑中使用的函数。然后,我们将世界级表达式(如算术表达式和Walsh表达式)扩展到这些函数。我们引入相应的决策图作为这些位级和字级表达式的图形表示。通过这种方式,我们提供了一个基础来扩展功能强大的CAD设计工具的应用,使用多项式表达式和dd将函数转换为斐波那契互连拓扑中的函数。
Bit-level and word-level polynomial expressions for functions in Fibonacci interconnection topologies
In this paper, we extend various Boolean representations for switching functions, as SOPs, Reed-Muller expressions, Kronecker and Pseudo Kronecker ANDEXOR expressions, to functions used in Fibonacci interconnection topologies. Then, we extend the world-level expressions, as arithmetic expressions, and Walsh expressions, to these functions. We introduce the corresponding decision diagrams as graphic representations of these bit-level and word-level expressions. In this way, we provide a base to extend the application of powerful CAD design tools using polynomial expressions and DDs for switching functions to functions in Fibonacci interconnection topologies.