计算四元Reed-Muller展开的新算法

Proceedings 30th IEEE International Symposium on Multiple-Valued Logic (ISMVL 2000) Pub Date : 2000-05-23 DOI:10.1109/ISMVL.2000.848614

S. Rahardja, B. Falkowski

{"title":"计算四元Reed-Muller展开的新算法","authors":"S. Rahardja, B. Falkowski","doi":"10.1109/ISMVL.2000.848614","DOIUrl":null,"url":null,"abstract":"A new algorithm to construct a full polarity matrix for n-variable quaternary Reed-Muller expansions has been introduced. The new algorithm directly utilizes the truth vector of the function to construct the polarity matrix. The computational complexity of the algorithm is analyzed and compared with other existing algorithms. It is shown that for n/spl les/6, the new algorithm is computationally more efficient than all existing algorithms. Finally the fast flow diagram which is useful for implementation of the algorithm in hardware has also been shown.","PeriodicalId":334235,"journal":{"name":"Proceedings 30th IEEE International Symposium on Multiple-Valued Logic (ISMVL 2000)","volume":"42 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2000-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"A new algorithm to compute quaternary Reed-Muller expansions\",\"authors\":\"S. Rahardja, B. Falkowski\",\"doi\":\"10.1109/ISMVL.2000.848614\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A new algorithm to construct a full polarity matrix for n-variable quaternary Reed-Muller expansions has been introduced. The new algorithm directly utilizes the truth vector of the function to construct the polarity matrix. The computational complexity of the algorithm is analyzed and compared with other existing algorithms. It is shown that for n/spl les/6, the new algorithm is computationally more efficient than all existing algorithms. Finally the fast flow diagram which is useful for implementation of the algorithm in hardware has also been shown.\",\"PeriodicalId\":334235,\"journal\":{\"name\":\"Proceedings 30th IEEE International Symposium on Multiple-Valued Logic (ISMVL 2000)\",\"volume\":\"42 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2000-05-23\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings 30th IEEE International Symposium on Multiple-Valued Logic (ISMVL 2000)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISMVL.2000.848614\",\"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 30th IEEE International Symposium on Multiple-Valued Logic (ISMVL 2000)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISMVL.2000.848614","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 4

摘要

介绍了一种构造n变量四元Reed-Muller展开的全极性矩阵的新算法。新算法直接利用函数的真值向量来构造极性矩阵。分析了该算法的计算复杂度，并与现有算法进行了比较。结果表明，对于n/spl /6，新算法的计算效率高于所有现有算法。最后给出了算法在硬件上实现的快速流程图。

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

查看原文本刊更多论文

A new algorithm to compute quaternary Reed-Muller expansions

A new algorithm to construct a full polarity matrix for n-variable quaternary Reed-Muller expansions has been introduced. The new algorithm directly utilizes the truth vector of the function to construct the polarity matrix. The computational complexity of the algorithm is analyzed and compared with other existing algorithms. It is shown that for n/spl les/6, the new algorithm is computationally more efficient than all existing algorithms. Finally the fast flow diagram which is useful for implementation of the algorithm in hardware has also been shown.

求助全文

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

来源期刊

Proceedings 30th IEEE International Symposium on Multiple-Valued Logic (ISMVL 2000)

自引率

0.00%

发文量