|
Taurida Journal of Computer Science Theory and Mathematics, 2018, Issue 2, Pages 29–44
(Mi tvim45)
|
|
|
|
Synthesis of fault-tolerant combination schemes by introducing information redundancy
S. V. Gavrilova, S. I. Gurovb, D. V. Telpukhova, T. D. Zhukovaa a Institute for Design Problems in Microelectronics of Russian Academy of Sciences, Moscow
b Lomonosov Moscow State University, Faculty of Computational Mathematics and Cybernetics
Abstract:
In the article, based on the analysis of the specifics of the problem of increasing the fault tolerance of combinational integrated circuits, the requirements for such a code are formulated by the methods of excessive coding. A linear non-cyclic code with parity checks satisfying these requirements is proposed. The code fixes single errors, detects double errors and has the advantages that are essential for the task at hand. The efficiency of the proposed code is estimated.
Keywords:
Synthesis of fault-tolerant circuits, redundant coding, codes with parity checks, R-code.
Citation:
S. V. Gavrilov, S. I. Gurov, D. V. Telpukhov, T. D. Zhukova, “Synthesis of fault-tolerant combination schemes by introducing information redundancy”, Taurida Journal of Computer Science Theory and Mathematics, 2018, no. 2, 29–44
Linking options:
https://www.mathnet.ru/eng/tvim45 https://www.mathnet.ru/eng/tvim/y2018/i2/p29
|
Statistics & downloads: |
Abstract page: | 109 | Full-text PDF : | 50 |
|