• DocumentCode
    3783559
  • Title

    Bit-level and word-level polynomial expressions for functions in Fibonacci interconnection topologies

  • Author

    R.S. Stankovic;M. Stankovic;J. Astola;K. Egiazarian

  • Author_Institution
    Dept. of Comput. Sci., Fac. of Electron., Nis, Yugoslavia
  • fYear
    2001
  • fDate
    6/23/1905 12:00:00 AM
  • Firstpage
    305
  • Lastpage
    310
  • Abstract
    In this paper, we extend various Boolean representations for switching functions, as SOPs, Reed-Muller expressions, Kronecker and Pseudo Kronecker ANDEXOR expressions, to functions used in Fibonacci interconnection topologies. Then, we extend the world-level expressions, as arithmetic expressions, and Walsh expressions, to these functions. We introduce the corresponding decision diagrams as graphic representations of these bit-level and word-level expressions. In this way, we provide a base to extend the application of powerful CAD design tools using polynomial expressions and DDs for switching functions to functions in Fibonacci interconnection topologies.
  • Keywords
    "Polynomials","Arithmetic","Data structures","Circuit topology","Graphics","Design automation","Boolean functions","Signal design","Computer science","Signal processing"
  • Publisher
    ieee
  • Conference_Titel
    Multiple-Valued Logic, 2001. Proceedings. 31st IEEE International Symposium on
  • ISSN
    0195-623X
  • Print_ISBN
    0-7695-1083-3
  • Type

    conf

  • DOI
    10.1109/ISMVL.2001.924588
  • Filename
    924588