On the lengths of the paths in self-testing checkers based on CLB | Vestnik Tomskogo gosudarstvennogo universiteta. Upravlenie, vychislitelnaja tehnika i informatika – Tomsk State University Journal of Control and Computer Science. 2019. № 48. DOI: 10.17223/19988605/48/11

On the lengths of the paths in self-testing checkers based on CLB

When designing self-checking circuits, self-testing code detectors are used, in particular, equilibrium code detectors ((m, n) codes). A special decomposition formula is used to represent all kinds of code words for (m, n) codes. The paper compares two self-testing detectors of (m, n) codes based on the repeated use of this decomposition formula and the implementation of the resulting formula by programmable logic blocks (PLC). The specific form of the formula is determined by the set of code words it represents (parameters m, n), the number of k inputs in the PLC, and the way the variables are divided into subsets. The paper analyzes the influence of the method of splitting variables into subsets on the maximum path length in the detector circuit and on the number of PLCs in the detector.

Download file
Counter downloads: 165

Keywords

самотестируемость, детектор, программируемые логические блоки, равновесный код, selftesting, checker, configurable logical blocks (CLB), (m, n)-code

Authors

NameOrganizationE-mail
Butorina Nataly B.Tomsk State Universitynnattao7@mail.ru
Pakhomova Elena G.Tomsk State Universitypeg@tpu.ru
Всего: 2

References

Parag K.L. Self-Checking and Fault-Tolerant Digital Design. Morgan Kaufmann Pub., 2000. 400 p.
Anderson D.A., Metze G. Design of totally self-checking check circuits for m-out-of-n codes // IEEE Trans. Computers C-22. 1973. P. 263-269.
Marouf M.A., Friedman A.D. Efficient design of sel-checking checker for any m-out-of-n code // IEEE Trans. Computers C-27. 1978. P. 482-90.
Ubar R., Raik J., Vierhaus H.-T. Design and Test Technology for Dependable Systems-on-Chip. New York : IGI Global, 2011. 578 p.
Blanke M., Kinnaert M., Lunze J., Staroswiecki M. Diagnosis and Fault-Tolerant Control. 2nd ed. Berlin : Springer-Verlag Berlin Heidelberg, 2006. 672 p.
Fujiwara E. Code Design for Dependable Systems: Theory and Practical Applications. John Wiley & Sons, Inc., 2006. 720 p.
Goessel M., Ocheretny V., Sogomonyan E., Marienfeld D. New Methods of Concurrent Checking. Ed. 1. Dordrecht : Springer Science + Business Media B. V., 2008. 182 p.
Матросова А.Ю., Никитин К.В. Синтез самотестируемого детектора (m, п)-кодов на программируемых логических блоках // Вестник Томского государственного университета. Приложение. 2003. № 6. С. 124-136.
Буторина Н.Б., Цидендоржиева С.Р. Построение самотестируемого детектора равновесных кодовых слов // Новые ин формационные технологии в исследовании сложных структур : 7-я рос. конф. с междунар. участием. Томск : Том. гос. ун-т, 2008. С. 44.
 On the lengths of the paths in self-testing checkers based on CLB | Vestnik Tomskogo gosudarstvennogo universiteta. Upravlenie, vychislitelnaja tehnika i informatika – Tomsk State University Journal of Control and Computer Science. 2019. № 48. DOI: 10.17223/19988605/48/11

On the lengths of the paths in self-testing checkers based on CLB | Vestnik Tomskogo gosudarstvennogo universiteta. Upravlenie, vychislitelnaja tehnika i informatika – Tomsk State University Journal of Control and Computer Science. 2019. № 48. DOI: 10.17223/19988605/48/11

Download full-text version
Counter downloads: 631