Complexity estimation and network synthesis based on functional smoothness and entropy measures
M. Shankaranarayana Bhat, H. S. Jamadagni · 2005
We propose a novel method to estimate the complexity of multiple-valued logic functions based on functional smoothness and information theoretic measures. Further, we show that such complexity measures can be used to (a) estimate the area of the circuit implementation and (b) reduce the search space of potential solutions in evolvable network synthesis.