Authors: Stanković, Radomir 
Astola, Jaakko
Stanković, Milena
Egiazarian, Karen
Title: Circuit synthesis from Fibonacci decision diagrams
Journal: VLSI Design
Volume: 14
Issue: 1
First page: 23
Last page: 34
Issue Date: 7-Aug-2002
Rank: M23
ISSN: 1065-514X
DOI: 10.1080/10655140290009783
In decision diagrams (DDs) methods for circuit synthesis, it is possible to directly transfer a DD for a given function f into a network realizing f by the replacement of non-terminal nodes in the DD with the corresponding circuit modules. The chief bottleneck of mapping a DD into a network is the inherent feature that the depth of the network produced, is equal to the number of variables in f for this reason, it is proposed a method for small depth circuit synthesis through reachability matrices describing connections among the nodes in the DD for f. In this paper, we first generalized DD methods for circuit design to Fibonacci interconnection topologies through the Fibonacci decision diagrams (FibDDs). Then, we extended the small depth circuit synthesis method to FibDDs. In this way, design methods through DDs are completely transferred from Boolean to Fibonacci topologies.
Keywords: Circuit synthesis | Decision diagrams | Fibonacci sequences | Fibonacci transforms | Spectral transforms | Switching functions
Publisher: Hindawi

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.