By Topic

Bit- and trellis- based soft-decision sequential decoding for variable-length error-correcting codes

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

3 Author(s)
Yuh-Ming Huang ; Dept. of Comput. Sci. & Inf. Eng., Nat. Chi Nan Univ., Puli ; Chien-Feng Lo ; Han, Y.S.

Variable-length error-correcting codes (VLECCs) have recently received extensive attention because they can provide both compression and error-correction capabilities simultaneously. The larger free distance a VLECC has, the more redundancy the VLECC suffers from. The redundancy can be used to combat the channel noise effectively by using the technique of joint source-channel decoding (JSCD). However, for larger VLECCs, the high computational decoding complexity has prevented these codes from implementation in practice. In this work, a new bit metric with low computational complexity is derived first, then based on a code trellis rather than on a code tree, we proposed a maximum a posteriori (MAP) bit-level soft-decision sequential decoding algorithm and its two approximations. Simulation results indicate that both approximations can provide nearly the same performance as the MAP scheme while exhibiting a significantly lower complexity.

Published in:

Communications, 2008. APCC 2008. 14th Asia-Pacific Conference on

Date of Conference:

14-16 Oct. 2008