DocumentCode
2839299
Title
Permutation codes for the state assignment of fault tolerant sequential machines
Author
Chen, M. ; Trachtenberg, E.A.
Author_Institution
Dept. of Electr. & Comput. Eng., Drexel Univ., Philadelphia, PA, USA
fYear
1991
fDate
14-17 Oct 1991
Firstpage
85
Lastpage
90
Abstract
A 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
Keywords
computational complexity; error correction codes; fault tolerant computing; sequential machines; computational complexity; error correcting codes; fault-free inputs; fault-tolerant state assignment; permutation codes; synchronous sequential machines; Circuit faults; Computational complexity; Condition monitoring; Counting circuits; Decoding; Error correction codes; Fault tolerance; Hardware; Linear code; State estimation;
fLanguage
English
Publisher
ieee
Conference_Titel
Digital Avionics Systems Conference, 1991. Proceedings., IEEE/AIAA 10th
Conference_Location
Los Angeles, CA
Type
conf
DOI
10.1109/DASC.1991.177148
Filename
177148
Link To Document