排序方式： 共有1条查询结果，搜索用时 0 毫秒
1
1.
The constrained Viterbi algorithm (C-VA) makes use of some prior reliable information to reduce complexity andimprove performance of Viterbi algorithm (VA). However it can only be used in the concatenate code scheme because thedetection result of cyclic redundancy check code (CRC) is exploited to provide reliable information. In this paper, a differentway is proposed to provide reliable information for C-VA, which is possible to be used in simple codec. Known bits were addedto the set partitioning in hierarchical trees (SPIHT) coded image sequence periodically and directly. They were thought to bereliable information for C-VA in the decoder. Experimental results show that the proposed scheme can obtain much bettererror resilient ability compared with conventional VA under the extremely inferior channel condition if the best desired qualityof reconstructed images can be sacrificed. 相似文献
1