Graph-Based Algorithms for Boolean Function Manipulation
IEEE Transactions on Computers
Decompositional methods for stack filtering using Fibonacci p-codes
Signal Processing
Logic Synthesis and Optimization
Logic Synthesis and Optimization
Binary Polynomial and Nonlinear Digital Filters
Binary Polynomial and Nonlinear Digital Filters
Representations of Discrete Functions
Representations of Discrete Functions
AND/EXOR based Synthesis of Testable KFDD-Circuits with Small Depth
ATS '96 Proceedings of the 5th Asian Test Symposium
Synthesis for testability: circuits derived from ordered Kronecker functional decision diagrams
EDTC '95 Proceedings of the 1995 European conference on Design and Test
Circuit Design from Kronecker Galois Field Decision Diagrams for Multiple-Valued Functions
ISMVL '97 Proceedings of the 27th International Symposium on Multiple-Valued Logic
ISMVL '98 Proceedings of the The 28th International Symposium on Multiple-Valued Logic
| Hi-index | 0.00 |
In this article, we define the Fibonacci decision diagrams (FibDDs) permitting representation of functions defined in a number of points different from N = 2n by decision diagrams consisting of nodes with two outgoing edges.We show the relationships between the FibDDs and the contracted Fibonacci codes and propose a procedure for calculation of the generalized Fibonacci transforms through FibDDs. This procedure permits calculation of the generalized Fibonacci spectra of functions defined in a number of points equal to a large generalized Fibonacci number. We use FibDDs to design architectures for realization of discrete functions and calculation of the generalized Fibonacci p-transforms. We also consider the circuit realizations of functions represented by FibDDs and the circuit realizations of Fibonacci spectral transforms.