EXMIN:多值输入、二值输出函数的异或积和表达式的简化算法

Proceedings of the Twentieth International Symposium on Multiple-Valued Logic Pub Date : 1990-05-23 DOI:10.1109/ISMVL.1990.122597

Tsutomu Sasao

{"title":"EXMIN:多值输入、二值输出函数的异或积和表达式的简化算法","authors":"Tsutomu Sasao","doi":"10.1109/ISMVL.1990.122597","DOIUrl":null,"url":null,"abstract":"Minimization of AND-EXOR PLAs (programmable logic arrays) with input decoders corresponds to minimization of the number of products in exclusive-OR sum-of-products (ESOPs) expressions for multiple-valued-input, two-valued-output functions. A simplification algorithm for ESOPs, called EXMIN, is presented. The algorithm is based on an iterative improvement. Seven rules are used to replace one pair of products with another. Many AND-EXOR PLAs for arithmetic circuits are simplified. It is shown that in most cases AND-EXOR PLAs require fewer products than AND-OR PLAs.<<ETX>>","PeriodicalId":433001,"journal":{"name":"Proceedings of the Twentieth International Symposium on Multiple-Valued Logic","volume":"83 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1990-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"158","resultStr":"{\"title\":\"EXMIN: a simplification algorithm for exclusive-OR-sum-of-products expressions for multiple-valued input two-valued output functions\",\"authors\":\"Tsutomu Sasao\",\"doi\":\"10.1109/ISMVL.1990.122597\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Minimization of AND-EXOR PLAs (programmable logic arrays) with input decoders corresponds to minimization of the number of products in exclusive-OR sum-of-products (ESOPs) expressions for multiple-valued-input, two-valued-output functions. A simplification algorithm for ESOPs, called EXMIN, is presented. The algorithm is based on an iterative improvement. Seven rules are used to replace one pair of products with another. Many AND-EXOR PLAs for arithmetic circuits are simplified. It is shown that in most cases AND-EXOR PLAs require fewer products than AND-OR PLAs.<<ETX>>\",\"PeriodicalId\":433001,\"journal\":{\"name\":\"Proceedings of the Twentieth International Symposium on Multiple-Valued Logic\",\"volume\":\"83 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1990-05-23\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"158\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the Twentieth International Symposium on Multiple-Valued Logic\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISMVL.1990.122597\",\"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 of the Twentieth International Symposium on Multiple-Valued Logic","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISMVL.1990.122597","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 158

摘要

带输入解码器的AND-EXOR PLAs(可编程逻辑阵列)的最小化对应于多值输入、双值输出函数的异或和(ESOPs)表达式中产品数量的最小化。提出了一种esop的简化算法EXMIN。该算法是基于迭代改进的。用一对产品替换另一对产品有七条规则。简化了许多用于算术电路的AND-EXOR PLAs。结果表明，在大多数情况下，AND-EXOR PLAs比AND-OR PLAs需要更少的产品。

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

查看原文本刊更多论文

EXMIN: a simplification algorithm for exclusive-OR-sum-of-products expressions for multiple-valued input two-valued output functions

Minimization of AND-EXOR PLAs (programmable logic arrays) with input decoders corresponds to minimization of the number of products in exclusive-OR sum-of-products (ESOPs) expressions for multiple-valued-input, two-valued-output functions. A simplification algorithm for ESOPs, called EXMIN, is presented. The algorithm is based on an iterative improvement. Seven rules are used to replace one pair of products with another. Many AND-EXOR PLAs for arithmetic circuits are simplified. It is shown that in most cases AND-EXOR PLAs require fewer products than AND-OR PLAs.<>

求助全文

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

来源期刊

Proceedings of the Twentieth International Symposium on Multiple-Valued Logic

CiteScore

1.90

自引率

0.00%

发文量