Optimal synthesis of digital counters in the fibonacci codes with the minimal form of representation
Keywords:Fibonacci numbers, minimal form, Fibonacci counters, noise immunity, high performance speed
At present, requirements for speed performance and noise immunity in the work of the counters increase. Among the existing structures, the Fibonacci counters meet such requirements. Their drawback is transfer while calculating from the minimal form of representation of the Fibonacci numbers to the maximal form and, consequently, to the use of operations of convolution and deconvolution, which decreases speed, noise immunity and increases required hardware expenses.
We propose for the Fibonacci counters to use only minimal form of representation of the Fibonacci numbers, which excludes operations of convolution and deconvolution. Based on it, the method of the Fibonacci calculation in the minimal form is developed and its logical model is built in the form of a set of logical operations, whose fulfillment leads to the Fibonacci calculation. It gives the possibility to design the method of synthesis of the Fibonacci counters with the optimal ratio of performance speed, noise immunity and amount of hardware expenses for specific conditions of its work.
The advantage of the Fibonacci counters with the minimal form is their increased noise immunity. It is due to both the nature of the Fibonacci calculation itself, which works in the excess codes, and to the absence of transfers to the maximal form, where it is permitted to have the forbidden combinations. In this case, the probability of detecting errors grows with an increase in the number of bits of counter.
Goryachev, A. E., Degtyar, S. A. (2012). Metod generacii perestanovok na osnove faktorialnyx chisel s ispolzovaniem dopolnyayushhego massiva. Visnik Sumskogo derzhavnogo unіversitetu. Serіya Tehnichni nauki, 4, 86–93.
Borysenko, O. A., Kalashnikov, V. V., Protasova, T. A., Kalashnikova, N. I.; Silva, R. N. (Ed.) (2014). A New Approach to the Classification of Positional Numeral Systems. Series Frontiers of Artificial Intelligence and Applications (FAIA). IOS Press (The Netherlands), 262, 441–450.
Vorobev, N. N. (1969). Chisla Fibonachchi. Мoscow: Nauka, 144.
Monteiro, P., Newcomb, R. (1976). Minimal and Maximal Fibonacci Representations: Boolean Generation. The Fibonacci Quarterly, 14 (1), 613–638.
Vajda, S. (1989). Fibonacci & Lucas Numbers, and the Golden Section. Ellis Horwood limited, 192.
Staxov, A. P. (1977). Vvedenie v algoritmicheskuyu teoriyu izmerenij. Мoscow: Sov. radio, 288.
Staxov, A. P. (2012). Kody Fibonachchi i zolotoj proporcii kak alternativa dvoichnoj sistemy schisleniya. Chast 1. Germany: Academic Publishing, 305.
Gupta, N., Agarval, A., Goyal, G. (2015). United States Patent No. US8983023 B2. Digital Self-Gated Binary Counter. No. US 13/935,552; declared: 04.07.2013; published: 17.03.2015, 23.
Yeh, C.-H., Parhami, B., Wang, Y. (2000). Designs of Counters with Near Minimal Counting/Sampling Period and Hardware Complexity. Pacific Grove, CA, USA, 894–898. doi: 10.1109/acssc.2000.910642
Thamaraiselvan, K., Gayathri, C., Divya, N. (2013). A High Speed CMOS Parallel Counter Using Pipeline Partitioning. International Journal of Engineering Research, 2 (8), 491–495.
Bindu, S., Vineeth, V., Paulin, J. (2015). A Review on High Speed CMOS Counter Using Altera MAX300A. International Journal of Advanced Research in Computer and Communication Engineering, 4 (12), 589–592. doi: 10.17148/ijarcce.2015.412140
Azarov, O. D., Chernyak, O. І., Murashhenko, O. G. (2015). Shvidkodіyuchij reversivnij fіbonachchіеvij lіchilnik. Іnformacіjnі texnologіі ta komp’yuterna іnzhenerіya, 1, 27–32.
Azarov, O. D., Chernyak, O. І. (2015). Metod shvidkodіyuchoі obernenoі lіchbi z lіnіjnim zrostannyam aparaturnix vitrat pri naroshhuvannі rozryadnostі. Visnyk Vinnyc'kogo politehnichnogo instytutu, 2 (119), 57–61.
Azarov, O. D., Chernyak, O. І., Murashhenko, O. G. (2014). Metod pobudovi shvidkodіyuchix fіbonachchіеvix lіchilnikіv. Problemy informatyzacii' ta upravlinnja, 2 (46), 5–8.
Borysenko, O. A., Stahov, O. P. (2014). Pat. na vynahid № 104939 U Ukrajna. MPK H03K 23/00 (2014.01). Pereshkodostijkyj lichyl'nyk impul'siv Borysenko-Stahova. № 201210506; zajavl. 05.09.2012; opubl. 25.03.2014, Bjul. № 6.
How to Cite
Copyright (c) 2016 Olexiy Borysenko, Lubomyr Petryshyn, Svitlana Matsenko, Igor Kulyk, Olga Berezhna
This work is licensed under a Creative Commons Attribution 4.0 International License.
The consolidation and conditions for the transfer of copyright (identification of authorship) is carried out in the License Agreement. In particular, the authors reserve the right to the authorship of their manuscript and transfer the first publication of this work to the journal under the terms of the Creative Commons CC BY license. At the same time, they have the right to conclude on their own additional agreements concerning the non-exclusive distribution of the work in the form in which it was published by this journal, but provided that the link to the first publication of the article in this journal is preserved.