在過去的研究中指出,霍夫曼編碼其壓縮效果良好,因此廣泛地被影像或視訊的壓縮標準所採用。使用此類變動長度碼對獨立訊源符號做編碼,其所對應的符號格狀圖架構於2000年首次被提出。在解碼時,利用此格狀圖及斐特比演算法(viterbi)可估算出符號序列的最大事後(maximum a posteriori; MAP)機率,然而霍夫曼碼存在著錯誤蔓延(error propagation)的隱憂。 經由霍夫曼編碼過後的位元串流(bit stream)中,有某些字串本身具有自我同步能力,稱之為自我同步字串(self-synchronization string; SSS),文獻[1]提出利用自我同步字串的特性與最大事後機率解碼結合,可減輕錯誤蔓延達到提高解碼的效能與減少計算的複雜度。
In the past study , Huffman coding has good capability of compression and it have been using to image or video compression widely. The symbol-level trellis has been proposed to correspond to variable length code which coded independent source symbol in 2000 . In the decoding ,it can use trellis and viterbi algorithm to estimate the maximum a posteriori probability of symbol sequence, but there is error propagation in the Huffman code.The string having self-synchronization capability in the bit stream after Huffman coding is called self-synchronization string. In[1],this paper proposed the method of maximum a posterior probability decoding with self-synchronization string to achieve improvement in both decoding performance and complexity reduction.