> Depends. The 1bit correction/ 2bit detection Hamming ECC algorithm found
> in the kernel is not too bad, but Reed Solomon is a quite conmputation
> expensive algorithm. Look into the encoder / decoder code in
> lib/reed_solomon.
Do NAND errors tend to clump in sequences of bits (ie, something reed
solomon is paticularly good at)?
> In general you have to iterate over the data buffer and compute on each
> step. The performance penalty depends on the complexitiy of the
> algortihm. If you have enough space in your FPGA then its definitely a
> good idea to put some ECC calculation mechanism into it. There are
> implementations for both ECC and Reed Solomon available.
Care to recommend any?
(text/plain)