中文摘要：

抑制 Viterbi 算法(C-VA ) 使用一些优先的可靠信息减少复杂性并且改进 Viterbi 算法(VA ) 的性能。因为周期的冗余性的察觉结果检查代码(CRC ) 被利用提供可靠信息，然而，它能仅仅在 concatenate 代码计划被使用。在这篇论文，一个不同方法被建议为 C-VA 提供可靠信息，它是可能的在简单 codec 被过去常。已知的位被加到周期性地并且直接在编码的层次树(SPIHT ) 上划分图象顺序的集合。他们被认为是为在解码器的 C-VA 的可靠信息。如果重建的图象的最好需要的质量能被牺牲，试验性的结果证明建议计划能获得有弹性的能力与在极其劣等的隧道下面的常规 VA 相比调节的好一些的错误。

英文摘要：

The constrained Viterbi algorithm （C-VA） makes use of some prior reliable information to reduce complexity and improve performance of Viterbi algorithm （VA）. However it can only be used in the concatenate code scheme because the detection result of cyclic redundancy check code （CRC） is exploited to provide reliable information. In this paper, a different way is proposed to provide reliable information for C-VA, which is possible to be used in simple codec. Known bits were added to the set partitioning in hierarchical trees （SPIHT） coded image sequence periodically and directly. They were thought to be reliable information for C-VA in the decoder. Experimental results show that the proposed scheme can obtain much better error resilient ability compared with conventional VA under the extremely inferior channel condition if the best desired quality of reconstructed images can be sacrificed.