By Topic

Joint source-channel soft decoding of Huffman codes with turbo-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
$33 $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)
L. Guivarch ; CCETT, CNET, Cesson-Sevigne, France ; J. -C. Carlach ; P. Siohan

We present a new method for using a priori information at a bit level in the decoding of Huffman codes. Its basic principle is the computation and use of the bit probabilities derived from the symbol probabilities of Huffman codes. Thus, we obtain a joint source-channel decoding algorithm which takes advantage of this a priori knowledge. Even better performances are obtained when a turbo code-like iterative decoding is carried out. Compared to separate decoding systems, the gain in signal to noise ratio varies from 0.5 up to 1 dB with an added complexity which is relatively limited

Published in:

Data Compression Conference, 2000. Proceedings. DCC 2000

Date of Conference:

2000