多值逻辑系统中Reed-Muller展开式的有效推导

[1992] Proceedings The Twenty-Second International Symposium on Multiple-Valued Logic Pub Date : 1992-05-27 DOI:10.1109/ISMVL.1992.186828

B. Harking, C. Moraga

{"title":"多值逻辑系统中Reed-Muller展开式的有效推导","authors":"B. Harking, C. Moraga","doi":"10.1109/ISMVL.1992.186828","DOIUrl":null,"url":null,"abstract":"A method for computing Reed-Muller expansions for multivalued logic functions is presented. All coefficients are constructed directly without the use of matrix multiplication. Due to the high degree of parallelism, the complexity of the algorithm in terms of the area-time tradeoff (AT/sup 2/) yields a better result than a butterfly algorithm does.<<ETX>>","PeriodicalId":127091,"journal":{"name":"[1992] Proceedings The Twenty-Second International Symposium on Multiple-Valued Logic","volume":"24 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1992-05-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"32","resultStr":"{\"title\":\"Efficient derivation of Reed-Muller expansions in multiple-valued logic systems\",\"authors\":\"B. Harking, C. Moraga\",\"doi\":\"10.1109/ISMVL.1992.186828\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A method for computing Reed-Muller expansions for multivalued logic functions is presented. All coefficients are constructed directly without the use of matrix multiplication. Due to the high degree of parallelism, the complexity of the algorithm in terms of the area-time tradeoff (AT/sup 2/) yields a better result than a butterfly algorithm does.<<ETX>>\",\"PeriodicalId\":127091,\"journal\":{\"name\":\"[1992] Proceedings The Twenty-Second International Symposium on Multiple-Valued Logic\",\"volume\":\"24 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1992-05-27\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"32\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"[1992] Proceedings The Twenty-Second International Symposium on Multiple-Valued Logic\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISMVL.1992.186828\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"[1992] Proceedings The Twenty-Second International Symposium on Multiple-Valued Logic","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISMVL.1992.186828","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 32

摘要

给出了一种计算多值逻辑函数Reed-Muller展开的方法。所有系数都是直接构造的，不需要使用矩阵乘法。由于高度的并行性，该算法在面积-时间权衡(AT/sup 2/)方面的复杂性比蝴蝶算法产生更好的结果。

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

查看原文本刊更多论文

Efficient derivation of Reed-Muller expansions in multiple-valued logic systems

A method for computing Reed-Muller expansions for multivalued logic functions is presented. All coefficients are constructed directly without the use of matrix multiplication. Due to the high degree of parallelism, the complexity of the algorithm in terms of the area-time tradeoff (AT/sup 2/) yields a better result than a butterfly algorithm does.<>

求助全文

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

来源期刊

[1992] Proceedings The Twenty-Second International Symposium on Multiple-Valued Logic

自引率

0.00%

发文量