In this paper, an adaptive step size auto focus search algorithm and a reduced zoom tracking algorithm are proposed. Many different auto focus search algorithms exist, such as global search, binary search, Fibonacci search, and so on. Global search can ensure the global peak is found correctly, but the search time is too long. The search time of binary or Fibonacci search is shortened, but the ...

We introduce a matricial Toeplitz transform and prove that the Toeplitz transform of a second order recurrence sequence is another second order recurrence sequence. We investigate the injectivity of this transform and show how this distinguishes the Fibonacci sequence among other recurrence sequences. We then obtain new Fibonacci identities as an application of our transform.

The hypercube of dimension n is the graph whose vertices are $$2^n$$ binary words length n, and there an edge between two them if they have Hamming distance 1. We consider edit based on swaps mismatches, to which we refer as tilde-distance, define tilde-hypercube with edges linking at tilde-distance Then, introduce study some isometric subgraphs obtained by using special called tilde-isometric ...

Fibonacci Cubes (FCs), together with the enhanced and extended forms, are a family of interconnection topologies formed by diluting links from binary hypercube. While they scale up more slowly, they provide more choices of network size. Despite sparser connectivity, they allow efficient emulation of many other topologies. However, there is no existing fault-tolerant routing strategy for FCs or ...

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...

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...

We use automata-theoretic approach to analyze properties of Fibonacci words. The directed acyclic subword graph (dawg) is a useful deterministic automaton accepting all suffixes of the word. We show that dawg’s of Fibonacci words have particularly simple structure. Our main result is a unifying framework for a large collection of relatively simple properties of Fibonacci words. The simple struc...

In [3], H. Belbachir and F. Bencherif generalize to bivariate polynomials of Fibonacci and Lucas, properties obtained for Chebyshev polynomials. They prove that the coordinates of the bivariate polynomials over appropriate basis are families of integers satisfying remarkable recurrence relations. [7], Mario Catalani define generalized bivariate polynomials, from which specifying initial conditi...

The Fibonacci cube Γn is the subgraph of the n-cube induced by the binary strings that contain no two consecutive 1s. These graphs are applicable as interconnection networks and in theoretical chemistry, and lead to the Fibonacci dimension of a graph. In this paper a survey on Fibonacci cubes is given with an emphasis on their structure, including representations, recursive construction, hamilt...

We formalized some basic properties of the Fibonacci numbers using definitions and lemmas from [7] and [23], e.g. Cassini’s and Catalan’s identities. We also showed the connections between Fibonacci numbers and Pythagorean triples as defined in [31]. The main result of this article is a proof of Carmichael’s Theorem on prime divisors of prime-generated Fibonacci numbers. According to it, if we ...