Lossy Joint Source-Channel Coding Using Raptor Codes
The straightforward application of Shannon's separation principle may entail a significant suboptimality in practical systems with limited coding delay and complexity. This is particularly evident when the lossy source code is based on entropy-coded quantization. In fact, it is well known that...
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2008-01-01
|
| Series: | International Journal of Digital Multimedia Broadcasting |
| Online Access: | http://dx.doi.org/10.1155/2008/124685 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1832556762176159744 |
|---|---|
| author | O. Y. Bursalioglu M. Fresia G. Caire H. V. Poor |
| author_facet | O. Y. Bursalioglu M. Fresia G. Caire H. V. Poor |
| author_sort | O. Y. Bursalioglu |
| collection | DOAJ |
| description | The straightforward application of Shannon's separation principle may entail a significant suboptimality in practical systems with limited coding delay and complexity. This is particularly evident when the lossy source code is based on entropy-coded quantization. In fact, it is well known that entropy coding is not robust to residual channel errors. In this paper, a joint source-channel coding scheme is advocated that combines the advantages and simplicity of entropy-coded quantization with the robustness of linear codes. The idea is to combine entropy coding and channel coding into a single linear encoding stage. If the channel is symmetric, the scheme can asymptotically achieve the optimal rate-distortion limit. However, its advantages are more clearly evident under finite coding delay and complexity. The sequence of quantization indices is decomposed into bitplanes, and each bitplane is independently mapped onto a sequence of channel coded symbols. The coding rate of each bitplane is chosen according to the bitplane conditional entropy rate. The use of systematic raptor encoders is proposed, in order to obtain a continuum of coding rates with a single basic encoding algorithm. Simulations show that the proposed scheme can outperform the separated baseline scheme for finite coding length and comparable complexity and, as expected, it is much more robust to channel errors in the case of channel capacity mismatch. |
| format | Article |
| id | doaj-art-917800660bee4b98afb808d325b0c248 |
| institution | Kabale University |
| issn | 1687-7578 1687-7586 |
| language | English |
| publishDate | 2008-01-01 |
| publisher | Wiley |
| record_format | Article |
| series | International Journal of Digital Multimedia Broadcasting |
| spelling | doaj-art-917800660bee4b98afb808d325b0c2482025-02-03T05:44:30ZengWileyInternational Journal of Digital Multimedia Broadcasting1687-75781687-75862008-01-01200810.1155/2008/124685124685Lossy Joint Source-Channel Coding Using Raptor CodesO. Y. Bursalioglu0M. Fresia1G. Caire2H. V. Poor3Ming Hsieh Department of Electrical Engineering, University of Southern California, Los Angeles, CA 90089, USADepartment of Electrical Engineering, Princeton University, Princeton, NJ 08544, USAMing Hsieh Department of Electrical Engineering, University of Southern California, Los Angeles, CA 90089, USADepartment of Electrical Engineering, Princeton University, Princeton, NJ 08544, USAThe straightforward application of Shannon's separation principle may entail a significant suboptimality in practical systems with limited coding delay and complexity. This is particularly evident when the lossy source code is based on entropy-coded quantization. In fact, it is well known that entropy coding is not robust to residual channel errors. In this paper, a joint source-channel coding scheme is advocated that combines the advantages and simplicity of entropy-coded quantization with the robustness of linear codes. The idea is to combine entropy coding and channel coding into a single linear encoding stage. If the channel is symmetric, the scheme can asymptotically achieve the optimal rate-distortion limit. However, its advantages are more clearly evident under finite coding delay and complexity. The sequence of quantization indices is decomposed into bitplanes, and each bitplane is independently mapped onto a sequence of channel coded symbols. The coding rate of each bitplane is chosen according to the bitplane conditional entropy rate. The use of systematic raptor encoders is proposed, in order to obtain a continuum of coding rates with a single basic encoding algorithm. Simulations show that the proposed scheme can outperform the separated baseline scheme for finite coding length and comparable complexity and, as expected, it is much more robust to channel errors in the case of channel capacity mismatch.http://dx.doi.org/10.1155/2008/124685 |
| spellingShingle | O. Y. Bursalioglu M. Fresia G. Caire H. V. Poor Lossy Joint Source-Channel Coding Using Raptor Codes International Journal of Digital Multimedia Broadcasting |
| title | Lossy Joint Source-Channel Coding Using Raptor Codes |
| title_full | Lossy Joint Source-Channel Coding Using Raptor Codes |
| title_fullStr | Lossy Joint Source-Channel Coding Using Raptor Codes |
| title_full_unstemmed | Lossy Joint Source-Channel Coding Using Raptor Codes |
| title_short | Lossy Joint Source-Channel Coding Using Raptor Codes |
| title_sort | lossy joint source channel coding using raptor codes |
| url | http://dx.doi.org/10.1155/2008/124685 |
| work_keys_str_mv | AT oybursalioglu lossyjointsourcechannelcodingusingraptorcodes AT mfresia lossyjointsourcechannelcodingusingraptorcodes AT gcaire lossyjointsourcechannelcodingusingraptorcodes AT hvpoor lossyjointsourcechannelcodingusingraptorcodes |