TU Bergakademie Freiberg | Fakultät für Mathematik und Informatik

Logo IFI 4th International Workshop Boolean Problems
Home Lehre Email

Boolean Representations for Functions in Fibonacci
Interconnection Topologies

Radomir S. Stankovic, Milena Stankovic, Jaakko Astola*, Karen Egiazarian*
Dept. of Computer Science, Faculty of Electronics, 18 000 Nis, Yugoslavia
TICSP, Tampere University of Technology, Tampere, Finland
mstankovic@elfak.ni.ac.yu, *jta@cs.tut.fi

Abstract

In this paper, we extend various Boolean representations for switching functions, as SOPs, Reed-Muller expressions, Kronecker, and Pseudo Kronecker AND-EXOR 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 introduced 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 for switching functions to functions in Fibonacci interconnection topologies.

Inhalt:/ Content: Institut für Informatik, TU Bergakademie Freiberg
Gestaltung/ Layout: Webmaster, 13. Oktober 2000