Cart (Loading....) | Create Account
Close category search window
 

Constrained Viterbi Algorithm and its Application in Error Resilient Transmission of SPIHT Coded Images

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Zhou Ting ; Coll. of Inf. Eng., Fuzhou Univ. ; Xu Ming ; Chen Dong-xia ; Yu Lun

The Viterbi algorithm (VA) is well-known to be an optimum decoding method for channels with random error patterns. But the decoding complexity grows greatly while the memory size increases and it doesn't work while burst errors occurs. Constrained Viterbi algorithm (C-VA) was proposed in a novel product code scheme (Lei Cao and Chang Wen Chen, 2003) to overcome those drawbacks. The main idea of C-VA is to make full use of those bits known to be decoded correctly first. It has been proved in Lei Cao and Chang Wen Chen (2003) that once reliable constraint conditions can be given, the C-VA works well in normal image transmission. In this paper, a new scheme is proposed for error resilient transmission of set partitioning in hierarchical trees (SPIHT) coded images by adding constraint condition directly and simply. Experiments show that the C-VA is very useful under the extremely inferior channel conditions if the best quality of reconstructed images can be sacrificed.

Published in:

Communications and Networking in China, 2006. ChinaCom '06. First International Conference on

Date of Conference:

25-27 Oct. 2006

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.