Principles of fast count in modified Fibonacci numerical system

2018

Closed access Metadata (CSL-JSON)
DOI 10.1117/12.2501565
Data confidence 70 medium
How this score is calculated

It is built from checkable properties of the record itself: whether the article has a DOI, how many independent sources confirmed its data, whether the required fields are filled in, and how recent the latest confirmation is. Disagreement between sources and a missing identifier lower it. A value of 80 or above means the record was published without further checking; 60 to 79 means it is published at reduced confidence, with a manual check advisable. A record verified by an editor by hand is never pushed below 90 by a recalculation. This scores our data about the article, not the article itself.

Abstract

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.