Joint source-channel soft decoding of Huffman codes with turbo-codes

Author

Guivarch, Lionel ; Carlach, Jean-Claude ; Siohan, Pierre

Author_Institution

CCETT, CNET, Cesson-Sevigne, France

fYear

2000

fDate

2000

Firstpage

83

Lastpage

92

Abstract

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

Keywords

Huffman codes; combined source-channel coding; iterative decoding; probability; turbo codes; Huffman codes; bit probabilities; iterative decoding; joint source-channel decoding; limited complexity; performance; soft decoding; symbol probabilities; turbo codes; Channel coding; Communication system control; Communication systems; Iterative algorithms; Iterative decoding; Redundancy; Signal to noise ratio; Source coding; Telecommunications; Turbo codes;

fLanguage

English

Publisher

ieee

Conference_Titel

Data Compression Conference, 2000. Proceedings. DCC 2000

Conference_Location

Snowbird, UT

ISSN

1068-0314

Print_ISBN

0-7695-0592-9

Type

conf

DOI

10.1109/DCC.2000.838148

Filename

838148