Fibonacci Counter Based on Zeckendorf's Theorem (Boolean Realization)

Alexey Stakhov, Alexey Borisenko, Svetlana Matsenko

The purpose of this article is to present the research results on the development of the original noise-immune Fibonacci counter based on Zeckendorf's Theorem. The main peculiarity of the counter consists in the fact that we use only the socalled minimal forms of the Fibonacci code for error detection what increases noise immunity and informational reliability. The Fibonacci counter demonstrates significant benefits in comparison with the known Fibonacci counters based on the “convolutions” and “devolutions,” both in speed and error detection ability. The Fibonacci counter can be the important step for designing noise-immune Fibonacci microcontrollers and microprocessors.