| Item type |
学術雑誌論文 / Journal Article(1) |
| 公開日 |
2009-11-18 |
| タイトル |
|
|
タイトル |
A Faster Algorithm of Minimizing AND-EXOR Expressions |
| 資源タイプ |
|
|
資源タイプ識別子 |
http://purl.org/coar/resource_type/c_6501 |
|
資源タイプ |
journal article |
| 著者 |
HIRAYAMA, Takashi
NISHITANI, Yasuaki
SATO, Toru
|
| 著者(機関) |
|
|
値 |
Faculty of Engineering, Iwate University |
| 登録日 |
|
|
日付 |
2009-11-18 |
| 書誌情報 |
IEICE transactions on fundamentals of electronics, communications and computer sciences
巻 E85-A,
号 12,
p. 2708-2714,
発行日 2002-01-01
|
| ISSN |
|
|
収録物識別子タイプ |
ISSN |
|
収録物識別子 |
09168508 |
| Abstract |
|
|
内容記述タイプ |
Other |
|
内容記述 |
It has been considered difficult to obtain the minimum AND-EXOR expression of a given function with six variables in a practical computing time. In this paper, a faster algorithm of minimizing AND-EXOR expressions is proposed. We believe that our algorithm can compute the minimum ANDEXOR expressions of any six-variable and some seven-variable functions practically. In this paper, we first present a naive algorithm that searches the space of expansions of a given n-variable function f for a minimum expression of f. The space of expansions are generated by using all combinations of (n - 1)-variable product terms. Then, how to prune the branches in the search process and how to restrict the search space to obtain the minimum solutions are discussed as the key point of reduction of the computing time. Finally a faster algorithm is constructed by using the methods discussed. Experimental results to demonstrate the effectiveness of these methods are also presented. |
| 出版者 |
|
|
出版者 |
社団法人電子情報通信学会 |
| 権利 |
|
|
権利情報 |
copyright©2002 IEICE |
| 権利 |
|
|
権利情報 |
本文データは学協会の許諾に基づきCiNiiから複製したものである |
| 著者版フラグ |
|
|
出版タイプ |
VoR |
|
出版タイプResource |
http://purl.org/coar/version/c_970fb48d4fbd8a85 |
| 異版である |
|
|
関連タイプ |
isVersionOf |
|
|
識別子タイプ |
URI |
|
|
関連識別子 |
http://ci.nii.ac.jp/naid/110003212442/ |
ieice-ve85-an12p2708-2714.pdf (802.4 kB)
