High-Speed Counter based on the Minimum Form of the Fibonacci Code

9th IEEE International Conference on Dependable Systems, Services and Technologies (DESSERT 2018): Proceedings 2018
Svitlana Matsenko, O. Borysenko, O. Horiachev, O. Kobiakov

In this paper, a fast-acting Fibonacci counter is presented in the minimal representation form. The speed of this counter is estimated. Structure of the device was investigated by hardware costs, the corresponding expressions for its evaluation were obtained. An important property of considered counter is its homogeneity, simplicity of structure and high speed, comparable with its value in the fastest-running binary counters.

Atslēgas vārdi
code redundancy noise-immune codes permutationss peed of information transfer the percentage of detected errors
DOI
10.1109/dessert.2018.8409140
Hipersaite
https://ieeexplore.ieee.org/document/8409140

Matsenko, S., Borysenko, O., Horiachev, O., Kobiakov, O. High-Speed Counter based on the Minimum Form of the Fibonacci Code. No: 9th IEEE International Conference on Dependable Systems, Services and Technologies (DESSERT 2018): Proceedings, Ukraina, Kiev, 24.-27. maijs, 2018. Kyiv: IEEE, 2018, 257.-260.lpp. ISBN 978-1-5386-5904-5. e-ISBN 978-1-5386-5903-8. Pieejams: doi:10.1109/dessert.2018.8409140

Publikācijas valoda
English (en)