In this work, we propose a CODEC design for the forbidden transition free crosstalk avoidance CODEC. Our mapping and coding scheme is based on the binary number system. In this paper we investigate and propose a bus forbidden transition free CODECs for reducing bus delay and our experimental results shows that the proposed CODEC complexity is orders of magnitude better compared to the existing ...

The paper deals with some generalizations of Fibonacci and Lucas sequences, arising from powers of paths and cycles, respectively. In the first part of the work we provide a formula for the number of edges of the Hasse diagram of the independent sets of the h power of a path ordered by inclusion. For h = 1 such a diagram is called a Fibonacci cube, and for h > 1 we obtain a generalization of th...

Recently we have been making studies [1, 2] on the Fibonacci number system that appears to be of considerable importance to the Fibonacci computer [3], A specific result that appears to be of particular interest is that through multilevel coefficients on a Fibonacci radix system, efficient extension of representations can occur. For example, through a ternary coefficient system, a doubling of t...

Fibonacci cubes, extended Fibonacci cubes, and Lucas cubes are induced subgraphs of hypercubes 9 defined in terms of Fibonacci strings. It is shown that all these graphs are median. Several enumeration results on the number of their edges and squares are obtained. Some identities involving Fibonacci 11 and Lucas numbers are also presented. © 2005 Published by Elsevier B.V. 13

In 1985 Simion and Schmidt showed that the number of permutations in Sn which avoid 132, 213, and 123 is equal to the Fibonacci number Fn+1. We use generating function and bijective techniques to give other sets of pattern-avoiding permutations which can be enumerated in terms of Fibonacci or k-generalized Fibonacci numbers.

In this paper, we define five parameters generalization of Fibonacci numbers that generalizes Fibonacci, Pell, Modified Jacobsthal, Narayana, Padovan, k-Fibonacci, k-Pell, k-Jacobsthal and p-numbers, distance numbers, (2, k)-distance generalized (k, r)-Fibonacci in the sense by extending definition a recurrence relation with two adding three distance, simultaneously. Tiling combinatorial interp...

For a graph G, Fibonacci Number of G is defined as the number of subsets of V (G) in which no two vertices are adjacent in G. In this paper, we first investigate the orderings of two classes of trees by their Fibonacci numbers. Using these orderings, we determine the unique tree with the second, and respectively the third smallest Fibonacci number among all trees with n vertices.

We introduce two sets of permutations of {1, 2, . . . , n} whose cardinalities are generalized Fibonacci numbers. Then we introduce the generalized q-Fibonacci polynomials and the generalized q-Fibonacci numbers (of first and second kind) by means of the major index statistic on the introduced sets of permutations.