• DocumentCode
    1819473
  • Title

    Sierpinski gaskets for logic functions representation

  • Author

    Popel, Denis V. ; Dani, Anita

  • Author_Institution
    Dept. of Comput. Sci., Baker Univ., Baldwin City, KS, USA
  • fYear
    2002
  • fDate
    2002
  • Firstpage
    39
  • Lastpage
    45
  • Abstract
    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
  • Keywords
    formal logic; fractals; functions; logic design; minimisation; Boolean logic; Sierpinski gaskets; decision diagrams; fractals; graphic representations; logic design; logic expression; logic function minimization; logic function representation; multiple-valued logic; recursiveness; Binary decision diagrams; Boolean functions; Circuit synthesis; Computer science; Digital circuits; Fractals; Gaskets; Graphics; Logic design; Logic functions;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Multiple-Valued Logic, 2002. ISMVL 2002. Proceedings 32nd IEEE International Symposium on
  • Conference_Location
    Boston, MA
  • Print_ISBN
    0-7695-1462-6
  • Type

    conf

  • DOI
    10.1109/ISMVL.2002.1011068
  • Filename
    1011068