DocumentCode :
3267024
Title :
On the optimisation of Reed-Muller expressions
Author :
Adams, K.J. ; McGregor, J.
Author_Institution :
Fac. of Eng., Univ. of Ulster, Londonderry, UK
fYear :
2004
fDate :
19-22 May 2004
Firstpage :
168
Lastpage :
176
Abstract :
The choice of a set of basis functions with which to represent Reed-Muller canonical forms makes less and less difference, on average, to the efficiency, as measured by the number of non-zero terms, in which they can be expressed, as the number of variables in the function increases. This is because the possible efficiency gain itself declines exponentially in the general case, independently of the basis used. We explain why this is so, and using an integrated set of software tools, including a genetic algorithm, we provide supporting evidence of the phenomenon.
Keywords :
genetic algorithms; multivalued logic; Reed-Muller canonical forms; Reed-Muller expression optimisation; basis functions; genetic algorithm; multiple-valued logic function representation; optimisation efficiency gain; Algebra; Arithmetic; Convergence; Educational institutions; Genetic algorithms; Intelligent systems; Laboratories; Programmable logic arrays; Software tools; Systems engineering and theory;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Multiple-Valued Logic, 2004. Proceedings. 34th International Symposium on
ISSN :
0195-623X
Print_ISBN :
0-7695-2130-4
Type :
conf
DOI :
10.1109/ISMVL.2004.1319937
Filename :
1319937
Link To Document :
بازگشت