DocumentCode
1594605
Title
Guaranteed Synchronization of Huffman Codes with Known Position of Decoder
Author
Biskup, Marek Tomasz ; Plandowski, Wojciech
Author_Institution
Inst. of Inf., Univ. of Warsaw, Warsaw
fYear
2009
Firstpage
33
Lastpage
42
Abstract
In Huffman-encoded data a bit error may propagate arbitrarily long. This paper introduces a method for limiting such error propagation to at most L bits, L being a parameter. It is required that the decoder knows the bit number currently being decoded. The method utilizes the inherent tendency of Huffman codes to resynchronize spontaneously and does not introduce any redundancy if such a resynchronization takes place. The method is applied to parallel decoding of Huffman data and is tested on JPEG compression.
Keywords
Huffman codes; decoding; Huffman codes synchronization; JPEG compression; bit error propagation; parallel decoding; Automata; Binary trees; Buildings; Data compression; Decoding; Delay; Informatics; Redundancy; Testing; Transform coding; Huffman Code; Jpeg compression; error resilience; paralled Huffman decompression; synchronization;
fLanguage
English
Publisher
ieee
Conference_Titel
Data Compression Conference, 2009. DCC '09.
Conference_Location
Snowbird, UT
ISSN
1068-0314
Print_ISBN
978-1-4244-3753-5
Type
conf
DOI
10.1109/DCC.2009.18
Filename
4976447
Link To Document