Radiotekhnika
Publishing house Radiotekhnika

"Publishing house Radiotekhnika":
scientific and technical literature.
Books and journals of publishing houses: IPRZHR, RS-PRESS, SCIENCE-PRESS


Тел.: +7 (495) 625-9241

 

The properties of programmable logic blocks realizing codewords of (m, n)-code

Keywords:

N.B. Butorina – Senior Lecturer, Faculty of Applied Mathematics and Cybernetics, Тomsk State University. E-mail: nnatta07@mail.ru


One of the part of self-checking systems is a self-testing checker. The checker for (m, n)-code can detect any unidirectional error manifestation on outputs of the circuit under testing. Some times is that the number of output codewords less than the number of all codewords. It is desirable to provide self-testing properties of the checker on a subset of codewords. Let the checker is constructed from the programmable logic blocks (PLB). PLBs realize by the LUT-technology, it can be programmed for implementing any Boolean function of a fixed number of variables. It uses a compact representation of a subset of (m, n)-code, which seems an appropriate tree. Synthesis of the checker is based on the cover of this tree by PLBs that realize the function of special type. Identify the properties of programmable logic blocks realizing the (m, n)-code, the input of which receives a subset of codewords of a special type.
References:

 

  1. Parag K. Lala. Self-Checking and Fault-Tolerant Digital Design. MorganKaufmannPub (June 26. 2000).
  2. Anderson D.A., Metze G. Design of totally self-checking check circuits for m-out-of-n codes // IEEE Trans. Computers. March 1973. C-22. P. 263−269.
  3. Marouf M.A., Friedman A.D. Efficient design of sel-checking checker for any m-out-of-n code // IEEE Trans. Computers. June 1978. C-27. P. 482−490.
  4. Matrosova A.JU., Nikitin K.V.Sintez samotestiruemogo detektora (m,n)-kodov na programmiruemykh logicheskikh blokakh // Vestnik Tomskogo gosudarstvennogo universiteta. Prilozhenie. 2003. № 6. S. 124−136.
  5. Butorina N., Burkatovskaya J. The properties of the essential subtrees of a graph representation of the (m,n)-codewords // Proceedings of the 7th International Forum on Strategic Technology (IFOST-2012). USA: IEEEComputerSociety. 2012. P. 472−476.
  6. Butorina N., Ostanin S. Implementation by the Special Formula of an Arbitrary Subset of Code Words of (m, n)-code for Designing of a Self-Testing Checker // Proceeding of IEEE East-West Design&Test Symposium. 2011. S. 255−258.

 

© Издательство «РАДИОТЕХНИКА», 2004-2017            Тел.: (495) 625-9241                   Designed by [SWAP]Studio