4 ms·
I’m fairly sure you can’t do that. For example, suppose you have logic that uses some inputs to compute an output: A, B ⇒ C Add ECC bits to the inputs, and
by Someone 5y ago
I’m fairly sure you can’t do that. For example, suppose you have logic that uses some inputs to compute an output:
A, B ⇒ C
Add ECC bits to the inputs, and you want
Aa, Bb ⇒ Cc
Now, if you want this to detect errors made by the “⇒” part, you can’t do this as “drop the ECC bits, compute the result, compute the ECC bits of the result”.
So, how do you compute the ECC bits from only the Aa and Bb bits without having to compute the C part?
Depending on the ECC logic chosen, that might be doable for bit shifts, but for addition? For multiplication? For IEEE float square roots?
- extrapickles 5y agoYou would have to develop a ECC that worked similar to homomorphic encryption, where you can do computations on the chipertext (or in this case, the ECC) without knowing the plain text. For this application, plain text would effectively be the int/float you are doing math on. Since its possible with crypto, I don’t think it’s an insurmountable problem to create an ECC code where Ecc(a+b)=Ecc(a)+Ecc(b) It will likely not be as bit efficient as ECC without that property. Checking the ECC would also add a bit of overhead, so at first you would want to only check on a store instruction where you have to wait to select the RAM page anyways.
- Someone 5y ago“I don’t think it’s an insurmountable problem to create an ECC code where Ecc(a+b)=Ecc(a)+Ecc(b)” It wouldn’t, but that ECC wouldn’t work for multiplication instructions, square roots, etc. Dropping floating point and multiplication instructions will correct that, at the cost of significant speed. I also think any such ECC effectively would be a copy of computing a+b modulo some constant you can pick. If so, we’re effectively back at “compute the result twice, trap if the two results aren’t identical”