DocumentCode
1404157
Title
Genetic algorithm for minimisation of fixed polarity Reed-Muller expressions
Author
Drechsler, R. ; Becker, B. ; Drechsler, N.
Author_Institution
Inst. of Comput. Sci., Albert-Ludwigs-Univ., Freiburg, Germany
Volume
147
Issue
5
fYear
2000
fDate
10/1/2000 12:00:00 AM
Firstpage
349
Lastpage
353
Abstract
A genetic algorithm (GA) is developed to find small or minimal fixed polarity Reed-Muller expressions (FPRMs) for large functions. The authors combine the GA with greedy heuristics, i.e. they use hybrid GAs (HGAs). They show by experiments that results superior to all other approaches for large functions can be obtained using GAs. This mainly results from the use of a problem specific data structure and the incorporation of heuristics in the GA
Keywords
genetic algorithms; minimisation of switching nets; data structure; genetic algorithm; greedy heuristics; minimal fixed polarity Reed-Muller expressions;
fLanguage
English
Journal_Title
Computers and Digital Techniques, IEE Proceedings -
Publisher
iet
ISSN
1350-2387
Type
jour
DOI
10.1049/ip-cdt:20000743
Filename
881847
Link To Document