Practical source-network decoding
When correlated sources are to be communicated over a network to more than one sink, joint source-network coding is, in general, required for information theoretically optimal transmission. Whereas on the encoder side simple randomized schemes based on linear codes suffice, the decoder is required t...
| Main Authors: | , , |
|---|---|
| Other Authors: | |
| Format: | Article |
| Language: | en_US |
| Published: |
Institute of Electrical and Electronics Engineers
2010
|
| Online Access: | http://hdl.handle.net/1721.1/59974 https://orcid.org/0000-0003-4059-407X |
| _version_ | 1826199090505973760 |
|---|---|
| author | Maierbacher, Gerhard Barros, Joao Medard, Muriel |
| author2 | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science |
| author_facet | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science Maierbacher, Gerhard Barros, Joao Medard, Muriel |
| author_sort | Maierbacher, Gerhard |
| collection | MIT |
| description | When correlated sources are to be communicated over a network to more than one sink, joint source-network coding is, in general, required for information theoretically optimal transmission. Whereas on the encoder side simple randomized schemes based on linear codes suffice, the decoder is required to perform joint source-network decoding which is computationally expensive. Focusing on maximum a-posteriori decoders (or, in the case of continuous sources, conditional mean estimators), we show how to exploit (structural) knowledge about the network topology as well as the source correlations giving rise to an efficient decoder implementation (in some cases even with linear dependency on the number of nodes). In particular, we show how to statistically represent the overall system (including the packets) by a factor-graph on which the sum-product algorithm can be run. A proof-of-concept is provided in the form of a working decoder for the case of three sources and two sinks. |
| first_indexed | 2024-09-23T11:14:36Z |
| format | Article |
| id | mit-1721.1/59974 |
| institution | Massachusetts Institute of Technology |
| language | en_US |
| last_indexed | 2024-09-23T11:14:36Z |
| publishDate | 2010 |
| publisher | Institute of Electrical and Electronics Engineers |
| record_format | dspace |
| spelling | mit-1721.1/599742022-10-01T02:17:13Z Practical source-network decoding Maierbacher, Gerhard Barros, Joao Medard, Muriel Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science Massachusetts Institute of Technology. Laboratory for Information and Decision Systems Massachusetts Institute of Technology. Research Laboratory of Electronics Medard, Muriel Medard, Muriel When correlated sources are to be communicated over a network to more than one sink, joint source-network coding is, in general, required for information theoretically optimal transmission. Whereas on the encoder side simple randomized schemes based on linear codes suffice, the decoder is required to perform joint source-network decoding which is computationally expensive. Focusing on maximum a-posteriori decoders (or, in the case of continuous sources, conditional mean estimators), we show how to exploit (structural) knowledge about the network topology as well as the source correlations giving rise to an efficient decoder implementation (in some cases even with linear dependency on the number of nodes). In particular, we show how to statistically represent the overall system (including the packets) by a factor-graph on which the sum-product algorithm can be run. A proof-of-concept is provided in the form of a working decoder for the case of three sources and two sinks. Fundação para a Ciência e a Tecnologia (grant SFRH/BD/29918/2006) European Commission (grant FP7-INFSOICT- 215252 (N-Crave Project)) United States. Air Force Office of Scientific Research (award number FA9550-09-1-0196) 2010-11-12T19:02:26Z 2010-11-12T19:02:26Z 2009-10 2009-09 Article http://purl.org/eprint/type/ConferencePaper 978-1-4244-3584-5 INSPEC Accession Number: 10917275 http://hdl.handle.net/1721.1/59974 Maierbacher, G., J. Barros, and M. Medard. “Practical source-network decoding.” Wireless Communication Systems, 2009. ISWCS 2009. 6th International Symposium on. 2009. 283-287. © 2009 IEEE. https://orcid.org/0000-0003-4059-407X en_US http://dx.doi.org/10.1109/ISWCS.2009.5285249 6th International Symposium on Wireless Communication Systems, 2009. ISWCS 2009 Article is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use. application/pdf Institute of Electrical and Electronics Engineers IEEE |
| spellingShingle | Maierbacher, Gerhard Barros, Joao Medard, Muriel Practical source-network decoding |
| title | Practical source-network decoding |
| title_full | Practical source-network decoding |
| title_fullStr | Practical source-network decoding |
| title_full_unstemmed | Practical source-network decoding |
| title_short | Practical source-network decoding |
| title_sort | practical source network decoding |
| url | http://hdl.handle.net/1721.1/59974 https://orcid.org/0000-0003-4059-407X |
| work_keys_str_mv | AT maierbachergerhard practicalsourcenetworkdecoding AT barrosjoao practicalsourcenetworkdecoding AT medardmuriel practicalsourcenetworkdecoding |