Title :
Analysis of checksums, extended-precision checksums, and cyclic redundancy checks
Author :
Saxena, Nirmal R. ; McCluskey, Edward J.
Author_Institution :
Center for Reliable Comput., Stanford Univ., CA, USA
fDate :
7/1/1990 12:00:00 AM
Abstract :
The effectiveness of extended-precision checksums is thoroughly analyzed. It is demonstrated that the extended-precision checksums most effectively exploit natural redundancy occurring in program codes. Honeywell checksums and cyclic redundancy checks are compared to extended-precision checksums. Two´s complement, unsigned, and one´s complement arithmetic checksums are treated in a unified manner. Results are also extended to any general radix-p arithmetic checksum. Asymptotic and closed-form formulas of aliasing probabilities for the various error models are derived
Keywords :
error correction codes; error detection codes; checksums; closed-form formulas; cyclic redundancy checks; extended-precision checksums; program codes; radix-p arithmetic checksum; Arithmetic; Bandwidth; Computer networks; Costs; Cyclic redundancy check; Distributed processing; Hardware; Multiprocessor interconnection networks; Routing; Switches; Throughput;
Journal_Title :
Computers, IEEE Transactions on
