Optimization of multi-output fixed-polarity Reed-Muller circuits using the genetic algorithm

被引:10
作者
Yang, H [1 ]
Tan, EC [1 ]
机构
[1] Nanyang Technol Univ, Div Comp Engn, Sch Appl Sci, Singapore 639798, Singapore
关键词
D O I
10.1080/002072199133120
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
In this paper, we formulate the optimization problem of multi-output Reed-Muller (RM) circuits and suggest a non-exhaustive search method based on the genetic algorithm (GA) to solve it. Simple as well as randomly generated multi-output logic functions are used to test and compare the performance of GA and exhaustive-search methods. It is shown that the GA is well suited for this application, especially when the number of variables is more than ten.
引用
收藏
页码:663 / 670
页数:8
相关论文
共 14 条
[1]   TABULAR TECHNIQUES FOR REED MULLER LOGIC [J].
ALMAINI, AEA ;
THOMSON, P ;
HANSON, D .
INTERNATIONAL JOURNAL OF ELECTRONICS, 1991, 70 (01) :23-34
[2]   MINIMIZATION OF MULTIOUTPUT REED-MULLER BINARY DECISION DIAGRAMS USING HYBRID GENETIC ALGORITHM [J].
ALMAINI, AEA ;
ZHUANG, N ;
BOURSET, F .
ELECTRONICS LETTERS, 1995, 31 (20) :1722-1723
[3]  
ALMAINI AEA, 1994, ELECT LOGIC SYSTEMS
[4]  
BECKER B, 1994, PR IEEE COMP DESIGN, P106, DOI 10.1109/ICCD.1994.331866
[5]   EFFICIENT COMPUTER METHOD FOR EXOR LOGIC DESIGN [J].
BESSLICH, PW .
IEE PROCEEDINGS-E COMPUTERS AND DIGITAL TECHNIQUES, 1983, 130 (06) :203-206
[6]   Fast OFDD-based minimization of fixed polarity Reed-Muller expressions [J].
Drechsler, R ;
Theobald, M ;
Becker, B .
IEEE TRANSACTIONS ON COMPUTERS, 1996, 45 (11) :1294-1299
[7]  
Goldberg D., 1989, GENETIC ALGORITHMS S
[8]  
Green D. H., 1986, MODERN LOGIC DESIGN
[9]   MINIMIZATION OF MULTIPLE-OUTPUT EXCLUSIVE-OR SWITCHING-FUNCTIONS [J].
LIN, TL ;
TRAN, A .
INTERNATIONAL JOURNAL OF ELECTRONICS, 1993, 75 (04) :665-674
[10]   USING A GENETIC ALGORITHM FOR OPTIMIZING FIXED POLARITY REED-MULLER EXPANSIONS OF BOOLEAN FUNCTIONS [J].
MILLER, JF ;
LUCHIAN, H ;
BRADBEER, PVG ;
BARCLAY, PJ .
INTERNATIONAL JOURNAL OF ELECTRONICS, 1994, 76 (04) :601-609