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

来源：

INTERNATIONAL JOURNAL OF ELECTRONICS | 1999年 / 86卷 / 06期

关键词：

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 条

[11] AN EFFICIENT METHOD OF COMPUTING GENERALIZED REED-MULLER EXPANSIONS FROM BINARY DECISION DIAGRAM [J].

PURWAR, S .

IEEE TRANSACTIONS ON COMPUTERS, 1991, 40 (11) :1298-1301

[12] EASILY TESTABLE REALIZATIONS FOR LOGIC FUNCTIONS [J].

REDDY, SM .

IEEE TRANSACTIONS ON COMPUTERS, 1972, C 21 (11) :1183-+

[13] Non-exhaustive search methods and their use in the minimization of Reed-Muller canonical expansions [J].

Robertson, GI ;

Miller, JF ;

Thomson, P .

INTERNATIONAL JOURNAL OF ELECTRONICS, 1996, 80 (01) :1-12

[14]

Zhang Y. Z., 1984, IEE Proceedings E (Computers and Digital Techniques), V131, P177, DOI 10.1049/ip-e.1984.0035

← 1 2 →