Computation of total capacity for discrete memoryless multiple-access channels

被引：14
|
作者：
Rezaeian, M [1 ]
Grant, A [1 ]
机构：
[1] Univ S Australia, Inst Telecommun Res, Mawson Lakes, SA 5095, Australia
来源：
IEEE TRANSACTIONS ON INFORMATION THEORY | 2004年 / 50卷 / 11期
基金：
澳大利亚研究理事会;
关键词：
Arimoto-Blahut algorithm; capacity; multiple-access channel (MAC); nonconvex optimization;
D O I：
10.1109/TIT.2004.836661
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
The Arimoto-Blahut algorithm is generalized for computation of the total capacity of discrete memoryless multiple-access channels (MACs). In addition, a class of MACs is defined with the property that the uniform distribution achieves the total capacity. These results are based on the specialization of the Kuhn-Tucker condition for the total capacity of the MAC, and an extension of a known symmetry property for single-user channels.
引用
收藏
页码：2779 / 2784
页数：6
相关论文
共 50 条
  • [1] Capacity of Two Semideterministic Classes of Multiple-Access Relay Channels
    Khormuji, Majid Nasiri
    Skoglund, Mikael
    IEEE COMMUNICATIONS LETTERS, 2012, 16 (10) : 1529 - 1531
  • [2] Sum-Rate Capacity of Poisson MIMO Multiple-Access Channels
    Ain-ul-Aisha
    Lai, Lifeng
    Liang, Yingbin
    Shamai , Shlomo
    IEEE TRANSACTIONS ON COMMUNICATIONS, 2017, 65 (11) : 4765 - 4776
  • [3] Commitment over Multiple-Access Channels
    Chou, Remi
    Bloch, Matthieu R.
    2022 58TH ANNUAL ALLERTON CONFERENCE ON COMMUNICATION, CONTROL, AND COMPUTING (ALLERTON), 2022,
  • [4] The capacity of the quantum multiple-access channel
    Winter, A
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2001, 47 (07) : 3059 - 3065
  • [5] NONWHITE GAUSSIAN MULTIPLE-ACCESS CHANNELS WITH FEEDBACK
    POMBRA, S
    COVER, TM
    IEEE TRANSACTIONS ON INFORMATION THEORY, 1994, 40 (03) : 885 - 892
  • [6] Compound Multiple-Access Channels With Partial Cooperation
    Simeone, Osvaldo
    Gunduz, Deniz
    Poor, H. Vincent
    Goldsmith, Andrea J.
    Shamai , Shlomo
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2009, 55 (06) : 2425 - 2441
  • [7] The capacity of discrete-time memoryless Rayleigh-Fading channels
    Abou-Faycal, IC
    Trott, MD
    Shamai, S
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2001, 47 (04) : 1290 - 1301
  • [8] Cooperative Multiple-Access Channels With Distributed State Information
    Miretti, Lorenzo
    Kobayashi, Mari
    Gesbert, David
    De Kerret, Paul
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2021, 67 (08) : 5185 - 5199
  • [9] Feedback Gains for Gaussian Massive Multiple-Access Channels
    Kramer, Gerhard
    2021 IEEE INFORMATION THEORY WORKSHOP (ITW), 2021,
  • [10] Capacity Region of Cooperative Multiple-Access Channel With States
    Zaidi, Abdellatif
    Piantanida, Pablo
    Shamai , Shlomo
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2013, 59 (10) : 6153 - 6174
12345