Please use this identifier to cite or link to this item:
|Title:||Coding strategies for multiple-access channels with feedback and correlated sources|
|Source:||Ong, L., Motani, M. (2007-10). Coding strategies for multiple-access channels with feedback and correlated sources. IEEE Transactions on Information Theory 53 (10) : 3476-3497. ScholarBank@NUS Repository. https://doi.org/10.1109/TIT.2007.904968|
|Abstract:||The multiple-access channel with feedback and correlated sources (MACFCS) models a sensor network in which sensors collect and transmit correlated data to a common sink. We present four achievable rate regions and a capacity outer bound for the MACFCS. For the first achievable region, we construct a decode-forward based coding strategy. The sources first exchange their data, and then cooperate to send full information to the destination. We term this strategy full decoding at sources with decode-forward (FDS-DF). For two of the other achievable regions, we first perform Slepian-Wolf coding to remove the correlation among the source data. This is followed by either i) a compress-forward based coding strategy for the multiple-access channel with feedback, or ii) an existing coding strategy for the multiple-access channel. We also find another achievable region using a multihop coding strategy, which only uses point-to-point coding (no cooperation). From numerical computations, we see that different strategies perform better under certain source correlation structures and network topologies. More specifically, FDS-DF approaches the capacity when i) the inter-source distance decreases, or ii) the correlation among the sources gets higher. Furthermore, the cooperative coding strategies considered support larger achievable rate regions than the noncooperative multihop strategy. © 2007 IEEE.|
|Source Title:||IEEE Transactions on Information Theory|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Jan 17, 2018
WEB OF SCIENCETM
checked on Nov 18, 2017
checked on Jan 14, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.