Novel Synthesis and Optimization of Multi-Level Mixed Polarity Reed-Muller Functions

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

“…The individuals in both populations will be as shown in Figure (2) Bits (0 -4) in Fig. (2a) contain ternary number to indicate polarity number (12112) 3 = (149) 10 Bits(0 -14) in Fig. (2b) contain binary number to indicate the existence of "don't care" terms.…”

“…In Polarity (021) 3 = Polarity (7) 10 , f ( x , y , z) = y z  y z  x y z  x y  x y z Variable x appears in true form; variable y appears in mixed form while variable z appears in the complement form. The problem here is how to find efficient solutions amongst the very large number of polarities in the MPRM domains for incompletely specified Boolean functions without resorting to exhaustive search.…”

“…There are other interesting aspects of logic design such as multi-valued and multi-levels, especially the graphical approach based on Binary Decision Diagram (BDD) and RM_BDD as in [9,10,11]. These, however, are outside the scope of this paper.…”

Power estimation technique for Reed-Muller logic circuits

“…The total power in COMS circuits is dominated by the dynamic power, which is mainly by charging and discharging of the load capacitances, and it can be modeled as (1) Where is the supply voltage, is the clock frequency, is the load capacitance at the output of gate , and (referred to as switching activity) is the expected number of gate transitions per clock cycle. According to Eq.1, the dynamic power of a RM logic can be estimated if and are known.…”

“…RM logic has advantages over Boolean logic such as easy for test and more simple expression for some logic [1] . Present approaches estimate the switching activity of RM logic circuits mostly only by using the probabilities of input signals [2][3][4][5] .…”