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 条

[21] On the Capacity of Gaussian Multiple-Access Wiretap Channels with Feedback
Dai, Bin
Li, Chong
Liang, Yingbin
Ma, Zheng
Shamai , Shlomo
PROCEEDINGS OF 2020 INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY AND ITS APPLICATIONS (ISITA2020), 2020, : 397 - 401
[22] Permutation Capacity Region of Adder Multiple-Access Channels
Lu, William
Makur, Anuran
IEEE TRANSACTIONS ON INFORMATION THEORY, 2024, 70 (07) : 4693 - 4720
[23] FDMA capacity of Gaussian multiple-access channels with ISI
Yu, W
Cioffi, JM
IEEE TRANSACTIONS ON COMMUNICATIONS, 2002, 50 (01) : 102 - 111
[24] Transport Capacity for Networks of Interfering Multiple-Access Channels
Peel, Christian B.
Zhan, Pengcheng
2010 CONFERENCE RECORD OF THE FORTY FOURTH ASILOMAR CONFERENCE ON SIGNALS, SYSTEMS AND COMPUTERS (ASILOMAR), 2010, : 2072 - 2076
[25] Commitment capacity of discrete memoryless channels
Winter, A
Nascimento, ACA
Imai, H
CRYPTOGRAPHY AND CODING, PROCEEDINGS, 2003, 2898 : 35 - 51
[26] ANALOG COMPUTATION VIAWIRELESS MULTIPLE-ACCESS CHANNELS: UNIVERSALITY AND ROBUSTNESS
Goldenbaum, Mario
Boche, Holger
Stanczak, Slawomir
2012 IEEE INTERNATIONAL CONFERENCE ON ACOUSTICS, SPEECH AND SIGNAL PROCESSING (ICASSP), 2012, : 2921 - 2924
[27] A NOTE ON THE COMPUTATION OF CAPACITY OF A DISCRETE MEMORYLESS CHANNEL
CHANG, CI
PROCEEDINGS OF THE 22ND CONFERENCE ON INFORMATION SCIENCES AND SYSTEMS, VOLS 1 & 2, 1988, : 367 - 367
[28] Expurgation for Discrete Multiple-Access Channels via Linear Codes
Haim, Eli
Kochman, Yuval
Erez, Uri
2012 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS (ISIT), 2012, : 31 - 35
[29] Capacity regions of Gaussian multiple-access channels with intersymbol inference
Cheng, R.S.
Verdu, S.
Proceedings of the Annual Conference on Information Sciences and Systems, 1991,
[30] User Capacity Scaling Laws for Fading Multiple-Access Channels
Keshavarz, Hengameh
Xie, Liang-Liang
Mazumdar, Ravi R.
IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, 2009, 8 (09) : 4498 - 4507

← 1 2 3 4 5 →