Permutation codes for the state assignment of fault tolerant sequential machinesA new fault-tolerant state assignment method is suggested for synchronous sequential machines. It is assumed that the inputs are fault free and that for no input it is possible to reach all or most of the states, whose number may be fairly large. Error correcting codes for the state assignment are generated by permutations of a chosen linear code. A state assignment algorithm is developed and its computational complexity is estimated. Examples are given.
Document ID
19920066641
Acquisition Source
Legacy CDMS
Document Type
Conference Paper
Authors
Chen, M. (NASA Langley Research Center Hampton, VA, United States)
Trachtenberg, E. A. (Drexel University Philadelphia, PA, United States)
Date Acquired
August 15, 2013
Publication Date
January 1, 1991
Subject Category
Cybernetics
Meeting Information
Meeting: IEEE/AIAA Digital Avionics Systems Conference