Size-energy tradeoffs for unate circuits computing symmetric Boolean functions

@article{Uchizawa2011SizeenergyTF,
  title={Size-energy tradeoffs for unate circuits computing symmetric Boolean functions},
  author={Kei Uchizawa and Eiji Takimoto and Takao Nishizeki},
  journal={Theor. Comput. Sci.},
  year={2011},
  volume={412},
  pages={773-782}
}
A unate gate is a logical gate computing a unate Boolean function, which is monotone in each variable. Examples of unate gates are AND gates, OR gates, NOT gates, threshold gates, etc. A unate circuit C is a combinatorial logic circuit consisting of unate gates. Let f be a symmetric Boolean function of n variables, such as the Parity function, MOD function, and Majority function. Let m0 and m1 be the maximum numbers of consecutive 0’s and consecutive 1’s in the value vector of f , respectively… CONTINUE READING

Similar Papers

Loading similar papers…