On Generalized Fibonacci Cubes and Unitary Transforms

Abstract. We present a new interconnection topology called generalized Fibonacci topology, which unifies a wide range of connection topologies such as the Boolean cube (or hypercube), classical Fibonacci cube, etc. Some basic topological properties of generalized Fibonacci cubes are established. Finally, we developed new classes of the discrete orthogonal transforms, based on the generalized Fibonacci recursions. They can be implemented efficiently by butterfly-type networks (like the Fourier, or the Haar transforms). A generalized Fibonacci cube based processor architecture (generalizing the known SIMD architecture — hypercube processor) can be efficiently used for hardware implementation of the proposed discrete orthogonal transforms.

[1]  Renato M. Capocelli A Generalization of Fibonacci Trees , 1990 .

[2]  K. R. Rao,et al.  Orthogonal Transforms for Digital Signal Processing , 1979, IEEE Transactions on Systems, Man and Cybernetics.

[3]  Thompson Fourier Transforms in VLSI , 1983, IEEE Transactions on Computers.

[4]  Emilio Montolivo,et al.  Representation of Natural Numbers as Sums of Fibonacci Numbers: An Application to Modern Cryptography , 1990 .

[5]  Jeffrey D Ullma Computational Aspects of VLSI , 1984 .

[6]  Jaakko Astola,et al.  Generalized Fibonacci cubes and trees for DSP applications , 1996, 1996 IEEE International Symposium on Circuits and Systems. Circuits and Systems Connecting the World. ISCAS 96.

[7]  Paul Cull,et al.  Generalized Fibonacci Numbers are Rounded Powers , 1990 .