- Title
- Sparse graph codes for the two-way relay network with correlated sources
- Creator
- Lechner, Gottfried; Timo, Roy; Ong, Lawrence
- Relation
- 2011 IEEE Data Compression Conference (DCC 2011). Proceedings of the IEEE Data Compression Conference, DCC 2011 (Snowbird, UT 29-31 March, 2011) p. 466
- Publisher Link
- http://dx.doi.org/10.1109/DCC.2011.70
- Publisher
- Institute of Electrical and Electronics Engineers (IEEE)
- Resource Type
- conference paper
- Date
- 2011
- Description
- We consider the two-way relay network where two nodes communicate via a relay. We assume that the data at the nodes are correlated (e.g., measurements in a sensor network) and that there is no direct communication between the nodes. The nodes communicate via the relay using a two-phase protocol consisting of an uplink part over an orthogonal multiple access channel and a downlink part over a broadcast channel. The individual codes as well as the overall system can be represented by a joint factor graph consisting of a source code at each node, a channel code for the each uplink and a channel code for the downlink. The optimality of separation of source and channel coding implies that it is optimal to individually design these codes. We focus on low-density parity-check codes where code design corresponds to the optimisation of their degree distributions.
- Subject
- broadcast channels; channel coding; graph theory; parity check codes; source coding
- Identifier
- http://hdl.handle.net/1959.13/921808
- Identifier
- uon:9407
- Identifier
- ISBN:9781612842790
- Identifier
- ISSN:1068-0314
- Language
- eng
- Full Text
- Hits: 1493
- Visitors: 2578
- Downloads: 849
| Thumbnail | File | Description | Size | Format | |||
|---|---|---|---|---|---|---|---|
| View Details Download | ATTACHMENT02 | Author final version | 205 KB | Adobe Acrobat PDF | View Details Download |