Learn More
—Variable length codes (VLCs), used in data compression , are very sensitive to error propagation in the presence of noisy channels. To address this problem, several joint source-channel turbo techniques have been proposed in the literature. In this paper, we focus on pairs of source/VLC of low redundancy, i.e., when there is a good match between the source(More)
— The principles which have been prevailing so far for designing communication systems rely on Shannon's source and channel coding separation theorem [1]. This theorem states that source and channel optimum performance bounds can be approached as close as desired by designing independently the source and channel coding strategies. However, this theorem(More)
— A new joint source-channel (JSC) turbo-decoding scheme, with three soft-in/soft-out (SISO) modules, is presented for variable length coded sources protected by a turbo-code. This new scheme offers the advantage to combine the powerfulness of the used turbo-code with the robustness of the reversible variable length codes (VLC), and moreover with a decoding(More)
—Variable length codes (VLCs), used in data compression , are very sensitive to error propagation in the presence of noisy channels. Addressing this problem with joint source-channel turbo techniques has been proposed in the literature and looks quite promising. But to date, most code-related conclusions are based on simulations. This paper states and(More)
—When a telecommunication system is constrained in terms of delay and complexity, it is usually wise to allow some cross-layer cooperation between the source and channel layers. In this context, the success of joint source-channel turbo techniques has been attested several times in the literature, in particular to transmit variable length code (VLC) streams(More)
Recommended by Athanasios Rontogiannis Joint source-channel turbo techniques have recently been explored a lot in literature as one promising possibility to lower the end-to-end distortion, with fixed length codes, variable length codes, and (quasi) arithmetic codes. Still, many issues remain to be clarified before production use. This short contribution(More)
—We address the problem of distributed source coding of binary sources with side information at the decoder. We propose a compression scheme using irregular turbo codes. We optimize them by maximizing the distance between the two curves of their EXIT charts for given statistics and a compression rate close to the Slepian-Wolf limit in order to increase the(More)