High-speed counters in fibonacci numerical system

Possibility of executing the carriers and borrowings by means of elementary additive transformations in the process of calculation in Fibonacci numerical system is substantiated. Methods of counting in the given numerical system, based on the usage of information redundancy are suggested. The methods consist in the fact that at every step executed all possible elementary addition transformations of code in the counter simultaneously with adding one. The suggested methods enable to construct up-, down- and up/down counters with high speed, independent on the data capacity and small hardware cost that linearly grow with the increase of the capacity. Schemes of structural organization of one digit for each of the suggested methods are given.

Author: PaweĊ‚ Komada
Conference: Title