Evaluation of Code-Word Subsets to Ensure the Self-Testing Property of a Checker / N. B. Butorina, Yu. B. Burkatovskaya, E. G. Pakhomova

Основной Автор-лицо: Butorina, N. B., Nataljya BorisovnaАльтернативный автор-лицо: Burkatovskaya, Yu. B., mathematician, associate Professor of Tomsk Polytechnic University, candidate of physico-mathematical Sciences, 1973-, Yuliya Borisovna;Pakhomova, E. G., mathematician, Associate Professor of Tomsk Polytechnic University, Candidate of physical and mathematical sciences, 1945-, Elena GrigorievnaКоллективный автор (вторичный): Национальный исследовательский Томский политехнический университет, Инженерная школа информационных технологий и робототехники, Отделение информационных технологийЯзык: английский.Резюме или реферат: The method of a self-testing (m, n)-code checker design based on the use of CLBs is considered. CLBs are supposed to be carried out in the framework of LUT-technology. To design the checker, a special expansion formula is used. The set V of checker faults includes all multiple stuck-at faults occurred at CLB inputs. The number l of code words appearing at the inputs of the checker can be less than the number of all possible code words. It implies that some faults of the self-testing checker connected to the outputs of the self-checking circuit can be undetectable. The paper establishes a property of a subset of code words, which allows us to check if a given subset provides the self-testing property of the checker. The property is used in the developed algorithm for analyzing a subset of code words..Аудитория: .Тематика: электронный ресурс | труды учёных ТПУ | circuit faults | built-in self-test | complexity theory | integrated circuit reliability | boolean functions | detectors | неисправности | самопроверка | интегральные схемы | детекторы Ресурсы он-лайн:Щелкните здесь для доступа в онлайн
Тэги из этой библиотеки: Нет тэгов из этой библиотеки для этого заглавия. Авторизуйтесь, чтобы добавить теги.
Оценка
    Средний рейтинг: 0.0 (0 голосов)
Нет реальных экземпляров для этой записи

Title screen

The method of a self-testing (m, n)-code checker design based on the use of CLBs is considered. CLBs are supposed to be carried out in the framework of LUT-technology. To design the checker, a special expansion formula is used. The set V of checker faults includes all multiple stuck-at faults occurred at CLB inputs. The number l of code words appearing at the inputs of the checker can be less than the number of all possible code words. It implies that some faults of the self-testing checker connected to the outputs of the self-checking circuit can be undetectable. The paper establishes a property of a subset of code words, which allows us to check if a given subset provides the self-testing property of the checker. The property is used in the developed algorithm for analyzing a subset of code words.

Для данного заглавия нет комментариев.

оставить комментарий.