Name
Abstract | ||
|---|---|---|
Motivated by recent results in Joint Source/ Channel JSC coding and decoding, this paper addresses the problem of soft input decoding of Arithmetic Codes AC. A new length-constrained scheme for JSC decoding of these codes is proposed based on the Maximum a posteriori MAP sequence estimation criterion. The new decoder, called Chase-like arithmetic decoder is supposed to know the source symbol sequence and the compressed bit-stream lengths. First, Packet Error Rates PER in the case of transmission on an Additive White Gaussian Noise AWGN channel are investigated. Compared to classical arithmetic decoding, the Chase-like decoder shows significant improvements. Results are provided for Chase-like decoding for image compression and transmission on an AWGN channel. Both lossy and lossless image compression schemes were studied. As a final application, the serial concatenation of an AC with a convolutional code was considered. Iterative decoding, performed between the two decoders showed substantial performance improvement through iterations. |
Year | DOI | Venue |
|---|---|---|
2011 | 10.4018/ijcvip.2011010103 | IJCVIP |
Keywords | Field | DocType |
channel jsc coding,classical arithmetic decoding,new decoder,chase-like decoder,chase-like decoding,awgn channel,iterative decoding,chase-like arithmetic decoder,arithmetic codes ac,jsc decoding,arithmetic coding | Sequential decoding,Berlekamp–Welch algorithm,Convolutional code,Computer science,Serial concatenated convolutional codes,Arithmetic,Soft-decision decoder,Decoding methods,List decoding,Arithmetic coding | Journal |
Volume | Issue | Citations |
1 | 1 | 0 |
PageRank | References | Authors |
0.34 | 17 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Amin Zribi | 1 | 4 | 1.76 |
| Sonia Zaibi | 2 | 10 | 2.59 |
| Ramesh Pyndiah | 3 | 79 | 17.12 |
| Ammar Bouallègue | 4 | 16 | 5.61 |