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.
Keywords
самотестируемость, детектор, программируемые логические блоки, равновесный код, selftesting, checker, configurable logical blocks (CLB), (m, n)-codeAuthors
Name | Organization | |
Butorina Nataly B. | Tomsk State University | nnattao7@mail.ru |
Pakhomova Elena G. | Tomsk State University | peg@tpu.ru |
References

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