synchronizing codewords (SC's) have been previously studied as a means to stop error propagation in variable-length codes, However, SC's retain one disadvantage: the symbols after the SC may be put in the wron...
详细信息
synchronizing codewords (SC's) have been previously studied as a means to stop error propagation in variable-length codes, However, SC's retain one disadvantage: the symbols after the SC may be put in the wrong positions since the number of decoded symbols before the SC can be different from the original number due to channel errors, Thus we propose the idea of extended synchronizing codewords (ESC's) which can overcome the drawback of SC's. After the decoder receives an ESC, the decoder correctly knows it is in synchronization, regardless of the preceding slippage, We derive some of the essential properties of ESC's and provide several upper bounds on the amount of overhead needed in designing a code with an ESC.
For a given set of codeword lengths, there are many different optimal variable-length codes, which are all Huffman equivalent codes, Some of these codes may contain a synchronizing codeword which resynchronizes the co...
详细信息
For a given set of codeword lengths, there are many different optimal variable-length codes, which are all Huffman equivalent codes, Some of these codes may contain a synchronizing codeword which resynchronizes the code whenever it is transmitted, The shorter the synchronizing codeword, the quicker the code will resynchronize. Ferguson and Rabinowitz suggest the problem of finding, for a given set of codeword lengths, the binary Huffman equivalent code with the shortest synchronizing codeword. In this correspondence we consider binary Huffman equivalent codes whose shortest codeword has length m > 1 and which contain a synchronizing codeword of length m + 1, the shortest possible in this case. We provide an algorithm for constructing these codes for a given set of codeword lengths, if such a code exists. We study further properties of these codes and show that when m greater than or equal to 3 the codes contain more than one synchronizing codeword. Finally, we suggest ways of improving the synchronization properties of the codes and provide some example codes.
Variable length codes offer advantages for data compression, but are susceptible to loss of synchronization if a bit error occurs. This can be mitigated by the use of variable length codes with specific mechanisms for...
详细信息
Variable length codes offer advantages for data compression, but are susceptible to loss of synchronization if a bit error occurs. This can be mitigated by the use of variable length codes with specific mechanisms for resynchronization. Such mechanisms exist in the codes known as Huffman Equivalent (HE) codes and T-codes. These have been extensively studied in the literature. For optimal compression a length vector is obtained from the probabilities of the symbols of the alphabet used. However, RE-codes and T-codes do not exist for all length vectors. In this paper, a new class of variable length codes with good synchronization properties is developed. These are referred to as ordered termination (OT) codes. OT-codes do exist for all length vectors. Experimental results and some theoretical support suggest that OT-codes compare favorably with HE- and T-codes.
暂无评论