Article Details

Strongly fault-secure designs for arithmetic arrays

Oleh   J.M. Tahir [-]
Kontributor / Dosen Pembimbing : S.S. Dlay., R.N. Gorgui-Naguib., O.R. Hinton
Jenis Koleksi : Jurnal elektronik
Penerbit : Lain-lain
Fakultas :
Subjek : Extraterrestrial worlds
Kata Kunci : Arithmetic arrays, Fault-secure designs, Redundant binary representation, Two-rail logic
Sumber : IEE PROCEEDINGS-E, Val. 140, Nu. 6, NOVEMBER 1993
Staf Input/Edit : Lili Sawaludin Mulyadi   Ena Sukmana
File : 1 file
Tanggal Input : 2018-12-20 10:05:30

Generic placeholder image
2018_EJRNL_PP_J_M_TAHIR.pdf

Terbatas
» ITB


In the paper we make a comparative study of two techniques to design error-detectable array architectures. These techniques are the redundant binary representation (RBR) where the data is encoded in the 1-out-of-3 code; and the two-rail logic where the data is encoded in the 1-out-of-2 code. In recent work, the RBR has been used to achieve online error detection and localisation by checking the data on the array borders. Here we show that another approach is also possible, with less hardware cost, where the checking takes place on the local (processor) level. This provides immediate error detection without delay. The performance of the RBR approaches has been compared with the two-rail approach. The results show that the RBR approaches require more hardware overheads, for small word lengths (n). However, the hardware cost of the two techniques are approximately the same for large n, while the RBR approaches offer much faster arithmetics for all n.