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 条
  • [31] Entanglement-assisted capacity of quantum multiple-access channels
    Hsieh, Min-Hsiu
    Devetak, Igor
    Winter, Andreas
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2008, 54 (07) : 3078 - 3090
  • [32] Capacity of Two Semideterministic Classes of Multiple-Access Relay Channels
    Khormuji, Majid Nasiri
    Skoglund, Mikael
    IEEE COMMUNICATIONS LETTERS, 2012, 16 (10) : 1529 - 1531
  • [33] Adaptive Analog Function Computation via Fading Multiple-Access Channels
    Jeon, Sang-Woon
    Jung, Bang Chul
    IEEE COMMUNICATIONS LETTERS, 2018, 22 (01) : 213 - 216
  • [34] RELIABLE COMPUTATION OF NOMOGRAPHIC FUNCTIONS OVER GAUSSIAN MULTIPLE-ACCESS CHANNELS
    Goldenbaum, Mario
    Boche, Holger
    Stanczak, Slawomir
    2013 IEEE INTERNATIONAL CONFERENCE ON ACOUSTICS, SPEECH AND SIGNAL PROCESSING (ICASSP), 2013, : 4814 - 4818
  • [35] Communication Versus Computation: Duality for Multiple-Access Channels and Source Coding
    Zhu, Jingge
    Lim, Sung Hoon
    Gastpar, Michael
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2019, 65 (01) : 292 - 301
  • [36] Unchaining from the Channel: Cooperative Computation over Multiple-access Channels
    Nokleby, Matthew
    Aazhang, Behnaam
    2011 IEEE INFORMATION THEORY WORKSHOP (ITW), 2011,
  • [37] Robust Analog Function Computation via Wireless Multiple-Access Channels
    Goldenbaum, Mario
    Stanczak, Slawomir
    IEEE TRANSACTIONS ON COMMUNICATIONS, 2013, 61 (09) : 3863 - 3877
  • [38] Upper bound on the distribution of computation of a sequential decoder for multiple-access channels
    Univ of Lund, Lund, Sweden
    IEEE Trans Inf Theory, 2 (399-408):
  • [39] ON THE CAPACITY OF DISCRETE MEMORYLESS CHANNELS FOR LINEAR CODES
    VANSACH, T
    PROBLEMS OF CONTROL AND INFORMATION THEORY-PROBLEMY UPRAVLENIYA I TEORII INFORMATSII, 1987, 16 (02): : 113 - 123
  • [40] An upper bound on the distribution of computation of a sequential decoder for multiple-access channels
    Balakirsky, VB
    IEEE TRANSACTIONS ON INFORMATION THEORY, 1996, 42 (02) : 399 - 408
12345