Authors: Stanković, Radomir 
Stanković, Milena
Astola, Jaakko
Egiazarian, Karen
Title: Bit-level and word-level polynomial expressions for functions in Fibonacci interconnection topologies
Journal: Proceedings of The International Symposium on Multiple-Valued Logic
First page: 305
Last page: 310
Conference: 31st IEEE International Symposium on Multiple-Valued Logic; 22-24 May 2001; Warsaw, Poland
Issue Date: 1-Jan-2001
ISBN: 978-0-7695-1083-3
ISSN: 0195-623X
DOI: 10.1109/ISMVL.2001.924588
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.
Publisher: IEEE

Show full item record


checked on May 22, 2024

Page view(s)

checked on May 9, 2024

Google ScholarTM




Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.