USING A GENETIC ALGORITHM FOR OPTIMIZING FIXED POLARITY REED-MULLER EXPANSIONS OF BOOLEAN FUNCTIONS

被引：10

作者：

MILLER, JF

LUCHIAN, H

BRADBEER, PVG

BARCLAY, PJ

机构：

[1] AL I CUZA UNIV,FAC COMP SCI,IASI,ROMANIA

[2] NAPIER UNIV,DEPT COMP STUDIES,EDINBURGH EH14 1DJ,SCOTLAND

来源：

INTERNATIONAL JOURNAL OF ELECTRONICS | 1994年 / 76卷 / 04期

关键词：

D O I：

10.1080/00207219408925956

中图分类号：

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

学科分类号：

0808 ; 0809 ;

摘要：

The use of a genetic algorithm is presented which determines good sub-optimum fixed polarity Reed-Muller expansions of completely specified boolean functions. The algorithm performs better than previous techniques which find a good fixed polarity by non-exhaustive search.

引用

页码：601 / 609

页数：9

共 23 条

[1] TABULAR TECHNIQUES FOR REED MULLER LOGIC [J].

ALMAINI, AEA ;

THOMSON, P ;

HANSON, D .

INTERNATIONAL JOURNAL OF ELECTRONICS, 1991, 70 (01) :23-34

[2]

ALMAINI AEA, 1989, ELECTRONIC LOGIC SYS

[3] EFFICIENT COMPUTER METHOD FOR EXOR LOGIC DESIGN [J].

BESSLICH, PW .

IEE PROCEEDINGS-E COMPUTERS AND DIGITAL TECHNIQUES, 1983, 130 (06) :203-206

[4]

BIOUL G, 1973, 28 PHILL RES REP, P17

[5]

Davis L., 1991, HDB GENETIC ALGORITH

[6] ON MINIMAL MODULO 2 SUMS OF PRODUCTS FOR SWITCHING FUNCTIONS [J].

EVEN, S ;

KOHAVI, I ;

PAZ, A .

IEEE TRANSACTIONS ON ELECTRONIC COMPUTERS, 1967, EC16 (05) :671-&

[7]

GREEN DH, 1986, COMPUTERS DIGITAL TE, V134, P228

[8] BOOLEAN MATRIX REPRESENTATION FOR THE CONVERSION OF MINTERMS TO REED-MULLER COEFFICIENTS AND THE MINIMIZATION OF EXCLUSIVE-OR SWITCHING-FUNCTIONS [J].

HABIB, MK .

INTERNATIONAL JOURNAL OF ELECTRONICS, 1990, 68 (04) :493-506

[9] EFFICIENT ALGORITHM FOR CANONICAL REED-MULLER EXPANSIONS OF BOOLEAN FUNCTIONS [J].

HARKING, B .

IEE PROCEEDINGS-E COMPUTERS AND DIGITAL TECHNIQUES, 1990, 137 (05) :366-370

[10]

Holland J., 1989, GENETIC ALGORITHMS S

← 1 2 3 →