Sierpinski gaskets for logic functions representation

This paper introduces a new approach to represent logic functions in the form of Sierpinski gaskets. The structure of the gasket allows it to be manipulated with the corresponding logic expression using the recursive essence of fractals. Thus, the Sierpinski gasket's pattern has myriad useful properties which can enhance the practical features of other graphic representations like decision diagrams. We have covered possible applications of Sierpinski gaskets in logic design and justified our assumptions in logic function minimization (both Boolean and multiple-valued cases). Experimental results on benchmarks with advances in the novel structure are considered as well.