2009 3rd International Conference on Signals, Circuits and Systems (SCS) 2009
DOI: 10.1109/icscs.2009.5412318
|View full text |Cite
|
Sign up to set email alerts
|

Minimization of incompletely specified mixed polarity reed muller functions using Genetic Algorithm

Abstract: -A New and efficient Genetic Algorithm (GA) based approach is presented to minimise the number of terms of Mixed Polarity Reed Muller (MPRM) single and multi output incompletely specified Boolean functions. The algorithm determines the allocation of don't care terms for the given function resulting in optimal MPRM expansions. For an n-variable function with β unspecified minterms there are (3 n × 2 β ) distinct MPRM expansions. A minimum MPRM is one with the fewest products. The algorithm is implemented in C++… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2010
2010
2022
2022

Publication Types

Select...
4
1

Relationship

0
5

Authors

Journals

citations
Cited by 6 publications
(1 citation statement)
references
References 8 publications
0
1
0
Order By: Relevance
“…If p i =0, (2) is presented; if p i =1, (3) is presented; otherwise, (1) is presented. Based on the above three conditions, the n-variable MPRM functions can be summarized as follow [8].…”
Section: A Mprm Expansionmentioning
confidence: 99%
“…If p i =0, (2) is presented; if p i =1, (3) is presented; otherwise, (1) is presented. Based on the above three conditions, the n-variable MPRM functions can be summarized as follow [8].…”
Section: A Mprm Expansionmentioning
confidence: 99%