A General Formula of the Capacity Region for Multiple-Access Channels with Deterministic Feedback
スポンサーリンク
概要
- 論文の詳細を見る
The multiple-access channel (MAC) becomes very popular in various communication systems, because multi-terminal communication systems have been widely used in practical systems, e.g., mobile phones and P2P, etc. For some MACs, it is known that feedback can enlarge the capacity region, where the capacity region is the set of rate pairs such that the error probability can be made arbitrarily small for sufficiently large block length. The capacity region for general MACs, which are not required to satisfy ergodicity and stationarity with perfect feedback was first shown by Tatikonda and Mitter without the proof, where perfect feedback means that the channel output is perfectly fed back to senders. In this paper, we generalize Tatikonda and Mitters result to the case of deterministic feedback, where the values of deterministic functions of past channel outputs is fed back to senders. We show that the capacity region for general MACs with deterministic feedback can be represented by the information-spectrum formula introduced by Han and Verdú, and directed information introduced by Massey. We also investigate the compound MAC problem, the ε-coding problem, the strong converse property and the cost constraint problem for general MACs with deterministic feedback.
- 2011-11-01
著者
-
Uyematsu Tomohiko
Dept. Of Comm. And Integrated Systems Tokyo Institute Of Technology
-
Matsuta Tetsunao
Dept. Of Communications And Integrated Systems Tokyo Institute Of Technology
-
Matsuta Tetsunao
Dept. Of Communications And Integrated Systems Tokyo Inst. Of Technol.
-
MATSUTA Tetsunao
Dept. of Communications and Computer Engineering, Tokyo Institute of Technology
関連論文
- Secret Key Capacity for Ergodic Correlated Sources(Information Theory)
- Conditional Lempel-Ziv Complexity and Its Application to Source Coding Theorem with Side Information(Source Coding/Imge Processing)(Information Theory and Its Applications)
- Universal Lossy Coding for Individual Sequences Based on Complexity Functions(Information Theory)
- Relationship among Complexities of Individual Sequences over Countable Alphabet(Information Theory)
- Asymptotical Optimality of Two Variations of Lempel-Ziv Codes for Sources with Countably Infinite Alphabet
- Universal Slepian-Wolf Source Codes Using Low-Density Parity-Check Matrices
- Vulnerability of MRD-Code-based Universal Secure Network Coding against Stronger Eavesdroppers
- A New Unified Method for Fixed-Length Source Coding Problems of General Sources
- Fixed-Slope Universal Lossy Coding for Nonstationary Sources
- Applicability of the Sample Path Method of Ergodic Processes to Individual Sequences
- An algorithm for random number generation by using arithmetic of limited precision : Part II
- A General Formula of the Capacity Region for Multiple-Access Channels with Deterministic Feedback
- A Universal Affine Code for Symmetric Channels
- Parametric Forms of the Achievable Rate Region for Source Coding with a Helper