DocumentCode
2834558
Title
Implementation by the special formula of an arbitrary subset of code words of (m, n)-code for designing a self-testing checker
Author
Butorina, N. ; Ostanin, S.
Author_Institution
Tomsk State Univ., Tomsk, Russia
fYear
2011
fDate
9-12 Sept. 2011
Firstpage
255
Lastpage
258
Abstract
The problem of synthesis of the self-testing checker for arbitrary l code words of (m, n)-code is considered. In particular, the problem of representation of number l by the sum of cardinal numbers of subsets of the code words corresponding to essential subtrees of the tree representing all code words of (m, n)-code is investigated. The properties such essential subtries are described.
Keywords
program testing; arbitrary subset; cardinal numbers; code words; number representation; self-testing checker design; special formula; Built-in self-test; Circuit faults; Computers; Field programmable gate arrays; Integrated circuit reliability; Single event upset; (m, n)-code; Self-checking circuit; self-testing checker;
fLanguage
English
Publisher
ieee
Conference_Titel
Design & Test Symposium (EWDTS), 2011 9th East-West
Conference_Location
Sevastopol
Print_ISBN
978-1-4577-1957-8
Type
conf
DOI
10.1109/EWDTS.2011.6116599
Filename
6116599
Link To Document