Art

J-GLOBAL ID：200902108046681891   Reference number：93A0195804

A Minimization Method for AND-EXOR Expressions Using Lower Bound Theorem.

下界定理を用いたAND-EXOR論理式の簡学化法

Author (2)： KODA NORIO (徳山工高専) ,  SASAO TSUTOMU (九州工大 情報工)
Material： 電子情報通信学会論文誌 D-1  (IEICE Transactions on Information and Systems, Pt.1 (Japanese Edition))
Volume： 76  Issue： 1  Page： 1-10  Publication year： Jan. 1993 
JST Material Number： S0757B  ISSN： 0915-1915  Document type： Article
Article type： 原著論文  Country of issue： Japan (JPN)  Language： JAPANESE (JA)

Thesaurus term： lower limit ,...
Semi thesaurus term： computational complexity

   To see more with JDream III (charged).   {{ this.onShowAbsJLink("http://jdream3.com/lp/jglobal/index.html?docNo=93A0195804&from=J-GLOBAL&jstjournalNo=S0757B") }}

JST classification (2)： General  (NC03161C) ,  Logic circuits  (NC05070B)

Reference (18)：

• BIOUL, G. Minimization of ring-sum expansion of Boolean functions. Philips Res. Rpts. 1973, 28, 17-36
• HELLIWELL, M. A fast algorithm to minimize multi-output mixed-polarity generalized Reed-Muller forms. Proc. of the 25th Design Automation Conference. 1988, 427-432
• SASAO, T. On the complexity of MOD -2 SUMPLA's. IEEE Trans. Compt. 1990, 39, 2, 262-266
• SASAO, T. EXMIN : A Simplification Algorithm for Exclusive-OR-Sum-of-Products Expressions for Multiple-Valued Input Two-Valued Output Functions. ISMVL-90. 1990, 128-135
• MULLER, D. E. Application of Boolean algebra to switching circuit design and to error detection. IRE Trans. Electron. Comput. 1954, EC-3, 6-12

Terms in the title (3)： EXOR ,  論理式 ,  学