Abstract:
It is proposed to use polynomial codes in the design of self-checking discrete devices
with computation control via several diagnostic attributes. A fast algorithm is developed to
obtain functions describing check symbols of polynomial codes in the form of logical expressions.
As is shown, encoders of polynomial codes can be referred to devices of three types: 1) those
with only self-dual Boolean functions realized at the outputs, 2) those with only nearly self-dual
(self-quasidual) Boolean functions realized at the outputs, and 3) those with both self-dual and
self-quasidual Boolean functions realized at the outputs. A classification of polynomial codes
considering this feature is presented. The structural diagram of computation control at the
outputs of self-dual discrete devices via several diagnostic attributes is described. A novel
algorithm is proposed to design a fully self-checking discrete device with computation control
via several diagnostic attributes. In contrast to the well-known ones, this algorithm considers
the nature of errors occurring at the outputs of discrete devices and their preliminary detection
by checkers of self-dual and/or self-quasidual signals. The results can be used in the development
of automated design tools for discrete devices for a wide range of applications.
Keywords:self-checking discrete devices, computation control via several diagnostic attributes, control of self-duality of signals, control of self-quasiduality of signals, polynomial codes.
Fulltext:
PDF file (1099 kB)
First page:
PDF file