Designing Checksums for Detecting Errors in Fast Unitary Transforms

G. Robert Redinbo · IEEE Transactions on Computers · 2017

Parity computations, checksums, over the input and output data of fast unitary transforms are compared, down to roundoff noise levels, to detect the effects from a single error on any one line between stages of the fast algorithm. Error spaces and their dual spaces guide the design process.

Read the paper · More papers on PaperTik