完整後設資料紀錄
DC 欄位語言
dc.contributor.authorRini, Stefanoen_US
dc.contributor.authorGoldsmith, Andreaen_US
dc.date.accessioned2017-04-21T06:55:13Z-
dc.date.available2017-04-21T06:55:13Z-
dc.date.issued2016-01en_US
dc.identifier.issn0018-9448en_US
dc.identifier.urihttp://dx.doi.org/10.1109/TIT.2015.2484073en_US
dc.identifier.urihttp://hdl.handle.net/11536/133402-
dc.description.abstractA unified graphical approach to random coding for any memoryless, single-hop, K-user channel with or without common information is defined through two steps. The first step is user virtualization. Each user is divided into multiple virtual sub-users according to a chosen rate-splitting strategy. This results in an enhanced channel with a possibly larger number of users for which more coding possibilities are available and for which common messages to any subset of users can be encoded. Following user virtualization, the message of each user in the enhanced model is coded using a chosen combination of coded time-sharing, superposition coding, and joint binning. A graph is used to represent the chosen coding strategies. Nodes in the graph represent codewords, while edges represent coding operations. This graph is used to construct a graphical Markov model, which illustrates the statistical dependence among codewords that can be introduced by the superposition coding or joint binning. Using this statistical representation of the overall codebook distribution, the error probability of the code is shown to vanish through a unified analysis. The rate bounds that define the achievable rate region are obtained by linking the error analysis to the properties of the graphical Markov model. This proposed framework makes it possible to numerically obtain an achievable rate region by specifying a user virtualization strategy and describing a set of coding operations. The union of these rate regions defines the maximum achievable rate region of our unified coding strategy. The achievable rates obtained based on this unified graphical approach to random coding encompass the best random coding achievable rates for all memoryless single-hop networks known to date, including broadcast, multiple access, interference, and cognitive radio channels, as well as new results for topologies not previously studied, as we illustrate with several examples.en_US
dc.language.isoen_USen_US
dc.subjectWireless networken_US
dc.subjectrandom codingen_US
dc.subjectachievable rate regionen_US
dc.subjectuser virtualizationen_US
dc.subjectchain graphen_US
dc.subjectgraphical Markov modelen_US
dc.subjectcoded time-sharingen_US
dc.subjectrate-splittingen_US
dc.subjectsuperposition codingen_US
dc.subjectbinningen_US
dc.subjectGelfand-Pinsker codingen_US
dc.titleA Unified Graphical Approach to Random Coding for Single-Hop Networksen_US
dc.identifier.doi10.1109/TIT.2015.2484073en_US
dc.identifier.journalIEEE TRANSACTIONS ON INFORMATION THEORYen_US
dc.citation.volume62en_US
dc.citation.issue1en_US
dc.citation.spage56en_US
dc.citation.epage88en_US
dc.contributor.department電信工程研究所zh_TW
dc.contributor.departmentInstitute of Communications Engineeringen_US
dc.identifier.wosnumberWOS:000369309500005en_US
顯示於類別:期刊論文