Burst Error Recovery for VF Arithmetic Coding

Hongyuan CHEN, Masato KITAKAMI, Eiji FUJIWARA

Summary :

One of the disadvantages of compressed data is their vulnerability, that is, even a single corrupted bit in compressed data may destroy the decompressed data completely. Therefore, Variable-to-Fixed length Arithmetic Coding, or VFAC, with error detecting capability is discussed. However, implementable error recovery method for compressed data has never been proposed. This paper proposes Burst Error Recovery Variable-to-Fixed length Arithmetic Coding, or BERVFAC, as well as Error Detecting Variable-to-Fixed length Arithmetic Coding, or EDVFAC. Both VFAC schemes achieve VF coding by inserting the internal states of the decompressor into compressed data. The internal states consist of width and offset of the sub-interval corresponding to the decompressed symbol and are also used for error detection. Convolutional operations are applied to encoding and decoding in order to propagate errors and improve error control capability. The proposed EDVFAC and BERVFAC are evaluated by theoretical analysis and computer simulations. The simulation results show that more than 99.99% of errors can be detected by EDVFAC. For BERVFAC, over 99.95% of l-burst errors can be corrected for l 32 and greater than 99.99% of other errors can be detected. The simulation results also show that the time-overhead necessary to decode the BERVFAC is about 12% when 10% of the received words are erroneous.

• Publication: IEICE TRANSACTIONS on Fundamentals Vol.E84-A No.4 pp.1050-1063
• Publication Date: 2001/04/01
• Type of Manuscript: PAPER
• Category: Coding Theory

Authors

Hongyuan CHEN
Masato KITAKAMI
Eiji FUJIWARA

Keyword

text compression,  Error Detecting VF Arithmetic Coding (EDVFAC),  Burst Error Recovery VF Arithmetic Coding (BERVFAC),  internal states,  convolutional operations