IEEE Journal on Selected Areas in Communications · 2000 · 76 citations · 6 references
EngineeringComputer EngineeringComputer ScienceDigital CommunicationFault-tolerant ComputingFault-tolerant SystemsChannel CodingCoding TheoryError Control CodingError DetectionError-correcting CodesSource CodingArithmetic CodingAutomatic Repeat RequestBinary CodesBit Error RateCyclic Redundancy ChecksError Detection CodesRedundancy DesignThroughput
Block cyclic redundancy check (CRC) codes are typically used to perform error detection in automatic repeat request (ARQ) protocols for data communications. Although efficient, CRCs can detect errors only after an entire block of data has been received and processed. We propose a new "continuous" error detection scheme using arithmetic coding that provides a novel tradeoff between the amount of added redundancy and the amount of time needed to detect an error once it occurs. This method of error detection, first introduced by Bell, Witten, and Cleary (1990), is achieved through the use of an arithmetic codec, and has the attractive feature that it can be combined physically with arithmetic source coding, which is widely used in state of-the-art image coders. We analytically optimize the tradeoff between added redundancy and error-detection time, achieving significant gains in bit rate throughput over conventional ARQ schemes for binary symmetric channel models for all probabilities of error.
6
J. Rissanen, Glen G. Langdon · IBM Journal of Research and Development · 1979 · 739 citations
An Introduction to Arithmetic Coding
Glen G. Langdon · IBM Journal of Research and Development · 1984 · 525 citations
A tutorial on CRC computations
Tenkasi V. Ramabadran, S. S. Gaitonde · IEEE Micro · 1988 · 226 citations