Fault tolerant and fault testable hardware design
Fault tolerant and fault testable hardware design
On-line error detection for finite field multipliers
DFT '97 1997 Workshop on Defect and Fault-Tolerance in VLSI Systems
Error Detection in Polynomial Basis Multipliers over Binary Extension Fields
CHES '02 Revised Papers from the 4th International Workshop on Cryptographic Hardware and Embedded Systems
On-Line Error Detection Schemes for a Systolic Finite-Field Inverter
ATS '98 Proceedings of the 7th Asian Test Symposium
A Novel Methodology for Designing TSC Networks Based on the Parity Bit Code
EDTC '97 Proceedings of the 1997 European conference on Design and Test
Design of a Self Checking Reed Solomon Encoder
IOLTS '05 Proceedings of the 11th IEEE International On-Line Testing Symposium
DFT '05 Proceedings of the 20th IEEE International Symposium on Defect and Fault Tolerance in VLSI Systems
A Self Checking Reed Solomon Encoder: Design and Analysis
DFT '05 Proceedings of the 20th IEEE International Symposium on Defect and Fault Tolerance in VLSI Systems
Low complexity bit parallel architectures for polynomial basis multiplication over GF(2m)
IEEE Transactions on Computers
Design of parallel fault-secure encoders for systematic cyclic block transmission codes
Microelectronics Journal
On distributed self fault diagnosis for wireless multimedia sensor networks
Proceedings of the 2011 International Conference on Communication, Computing & Security
Hi-index | 0.00 |
Reed-Solomon (RS) codes are widely used to identify and correct errors in transmission and storage systems. When RS codes are used for high reliable systems, the designer should also take into account the occurrence of faults in the encoder and decoder subsystems. In this paper, self-checking RS encoder and decoder architectures are presented. The RS encoder architecture exploits some properties of the arithmetic operations in GF(2m). These properties are related to the parity of the binary representation of the elements of the Galois Field. In the RS decoder, the implicit redundancy of the received codeword, under suitable assumptions explained in this paper, allows implementing concurrent error detection schemes useful for a wide range of different decoding algorithms with no intervention on the decoder architecture. Moreover, performances in terms of area and delay overhead for the proposed circuits are presented.