Principles of fast count in modified fibonacci numerical system

PRINCIPLES OF FAST COUNT IN MODIFIED FIBONACCI NUMERICAL SYSTEM

The theoretical aspects of count in the modified Fibonacci numerical system are proposed in the article. It allows constructing of high-speed Fibonacci counters where the hardware costs are comparatively small and increase proportionally at code length growth. Fibonacci transformations of codes are described that play the role of carryings and borrowings at increment and reverse count. The admissible forms of codes for specifying the initial states of counters are explored.