USING GENETIC ALGORITHMS FOR THE VARIABLE ORDERING OF REED-MULLER BINARY DECISION DIAGRAMS

被引：4

作者：

ALMAINI, AEA

ZHUANG, N

机构：

[1] Electrical, Electronic and Computer Engineering Department, Napier University, Edinburgh, EH14 1DJ

来源：

MICROELECTRONICS JOURNAL | 1995年 / 26卷 / 05期

关键词：

D O I：

10.1016/0026-2692(95)98949-R

中图分类号：

TM [电工技术]; TN [电子技术、通信技术];

学科分类号：

0808 ; 0809 ;

摘要：

Results are reported of the use of genetic algorithms for the variable ordering problem in Reed-Muller binary decision diagrams. Tests carried out on benchmark examples and randomly generated functions are very encouraging and compare favourably with other non-exhaustive algorithms. The results show significant reduction in the number of nodes and gates for multi-level designs. This work is confined to single output fixed polarity Reed-Muller expansions: the method will be developed further to extend to other forms and to multi-outputs.

引用

页码：471 / 480

页数：10

共 25 条

[1]

ALMAINI AEA, IN PRESS IEE P E

[2]

ALMAINI AEA, 1994, ELECTRONIC LOGIC SYS

[3]

BRYANT RE, 1986, IEEE T COMPUT, V35, P677, DOI 10.1109/TC.1986.1676819

[4] A CHARACTERIZATION OF BINARY DECISION DIAGRAMS [J].

CHAKRAVARTY, S .

IEEE TRANSACTIONS ON COMPUTERS, 1993, 42 (02) :129-137

[5]

Davis L. E.., 1991, HDB GENETIC ALGORITH

[6]

FFUJITA M, 1991, P EUROPEAN C DESIGN, P50

[7] FINDING THE OPTIMAL VARIABLE ORDERING FOR BINARY DECISION DIAGRAMS [J].

FRIEDMAN, SJ ;

SUPOWIT, KJ .

IEEE TRANSACTIONS ON COMPUTERS, 1990, 39 (05) :710-713

[8]

FUJITA M, 1993, FUJITSU SCI TECH J, V29, P138

[9]

Goldberg DE, 1989, GENETIC ALGORITHMS S

[10]

GREEN DH, 1986, MODERN LOGIC DESIGN

← 1 2 3 →