Circuit synthesis from Fibonacci decision diagrams

作     者：Stankovic, RS Astola, J Stankovic, M Egiazarian, K 

作者机构：Univ Nish Fac Elect Dept Comp Sci YU-18000 Nish Yugoslavia Tampere Univ Technol Int Ctr Signal Proc FIN-33101 Tampere Finland 

出 版 物：《VLSI DESIGN》 (超大规模集成电路设计)

年 卷 期：2002年第14卷第1期

页      面：23-34页

核心收录：

学科分类：0809[工学-电子科学与技术（可授工学、理学学位）] 08[工学] 0812[工学-计算机科学与技术（可授工学、理学学位）] 

主　　题：switching functions spectral transforms circuit synthesis Fibonacci sequences Fibonacci transforms decision diagrams 

摘      要：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.