A Triple Modular Redundancy Technique Providing Multiple-Bit Error Protection Without Using Extra Redundancy
- 1 July 1986
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. C-35 (7) , 623-631
- https://doi.org/10.1109/tc.1986.1676803
Abstract
A well-known technique for providing tolerance against single hardware component failures is triplication of the component, called triple modular redundancy (TMR). In this paper a component is taken to be a processor-memory configuration where the memory is organized in a bit-sliced way. If voting is performed bitwise in an orthodox TMR configuration consisting of three of these components, failure of a complete component or failure of bit-slices not on corresponding positions in the memories can be tolerated. We present a TMR technique, not using more redundancy than orthodox TMR, that can tolerate the failure of arbitrary bit-slices (including those on corresponding positions) up to a certain amount. Additionally it can tolerate the failure of arbitrary bit-slices up to a certain amount whenever one component is known to be malfunctioning or whenever one component is disabled. This generalized TMR technique is described for processor-memory configurations processing 4-, 8-, and 16-bit words, respectively.Keywords
This publication has 7 references indexed in Scilit:
- Binary codes for compound channels (Corresp.)IEEE Transactions on Information Theory, 1985
- The Reliability of Computer MemoriesScientific American, 1985
- Fault-Tolerant Semiconductor MemoriesComputer, 1984
- A Class of Odd-Weight-Column SEC-DED-SbED Codes for Memory System ApplicationsIEEE Transactions on Computers, 1984
- Error-Correcting Codes with Byte Error-Detection CapabilityIEEE Transactions on Computers, 1983
- Code Constructions for Error Control in Byte Organized Memory SystemsIEEE Transactions on Computers, 1983
- Minimum-distance bounds for binary linear codesIEEE Transactions on Information Theory, 1973