DocumentCode :
2742658
Title :
Joint source-channel decoding of quasiarithmetic codes
Author :
Guionnet, Thomas ; Guillemot, Christine
Author_Institution :
IRISA-INRIA, Rennes, France
fYear :
2004
fDate :
23-25 March 2004
Firstpage :
272
Lastpage :
281
Abstract :
This paper addresses the issue of robust and joint source-channel decoding of quasiarithmetic codes. Quasiarithmetic coding is a reduced precision and complexity implementation of arithmetic coding. This paper provides first a state model of a quasiarithmetic decoder for binary and M-ary sources. The design of an error-resilient soft decoding algorithm follows quite naturally. The compression efficiency of quasiarithmetic codes allows to add extra redundancy in the form of markers designed specifically to prevent de-synchronization. The algorithm is directly amenable for iterative source-channel decoding in the spirit of serial turbo codes. The coding and decoding algorithms have been tested for a wide range of channel signal-to-noise ratios. Experimental results reveal improved SER and SNR performances against Huffman and optimal arithmetic codes.
Keywords :
arithmetic codes; combined source-channel coding; iterative decoding; telecommunication channels; turbo codes; SNR performances; binary M-ary sources; channel signal-to-noise ratios; desynchronization; error-resilient soft decoding algorithm; iterative decoding; joint source-channel decoding; quasiarithmetic codes; serial turbo codes; Data compression; Decoding;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Data Compression Conference, 2004. Proceedings. DCC 2004
ISSN :
1068-0314
Print_ISBN :
0-7695-2082-0
Type :
conf
DOI :
10.1109/DCC.2004.1281472
Filename :
1281472
Link To Document :
بازگشت