Capacity of Two Semideterministic Classes of Multiple-Access Relay Channels

被引：2
|
作者：
Khormuji, Majid Nasiri [1 ,2 ]
Skoglund, Mikael [1 ,2 ]
机构：
[1] Royal Inst Technol KTH, Sch Elect Engn, SE-10044 Stockholm, Sweden
[2] Royal Inst Technol KTH, ACCESS Linnaeus Ctr, SE-10044 Stockholm, Sweden
来源：
IEEE COMMUNICATIONS LETTERS | 2012年 / 16卷 / 10期
关键词：
Capacity; noisy network coding; multiple-access relay channels; channels with state and additive interference;
D O I：
10.1109/LCOMM.2012.092112.121289
中图分类号：
TN [电子技术、通信技术];
学科分类号：
0809 ;
摘要：
We investigate memoryless multiple-access relay channels (MARCs) and establish the capacity of two semideterministic classes of such channels: MARCs with orthogonal receive components and state-decoupled MARCs. For both cases, the achievability and converse are proved using the noisy network coding lower bound and the cutset upper bound, respectively. Finally, the capacity of a MARC with additive Gaussian interference is quantified.
引用
收藏
页码：1529 / 1531
页数：3
相关论文
共 50 条
  • [41] Channel capacity limits for multiple-access channels with slow Rayleigh fading
    Ali, FH
    Soysa, S
    Chandler, SAG
    ELECTRONICS LETTERS, 1996, 32 (16) : 1435 - 1437
  • [42] Multiple-access relay channel with network coding and non-ideal source-relay channels
    Woldegebreal, Dereje H.
    Karl, Holger
    2007 FOURTH INTERNATIONAL SYMPOSIUM ON WIRELESS COMMUNICATION SYSTEMS, VOLS 1 AND 2, 2007, : 834 - 838
  • [43] On multiple-access relay channel with common message
    Osmani-Bojd, Mohammad
    Hodtani, Ghosheh Abed
    TRANSACTIONS ON EMERGING TELECOMMUNICATIONS TECHNOLOGIES, 2016, 27 (08): : 1030 - 1043
  • [44] Gaussian Multiple-Access Relay Channels with Non-Causal Side Information at the Transmitters
    Sahebalam, A.
    Beheshti, Soosan
    2015 IEEE 14TH CANADIAN WORKSHOP ON INFORMATION THEORY (CWIT), 2015, : 190 - 194
  • [45] On the white Gaussian multiple-access relay channel
    Kramer, G
    van Wijngaarden, AJ
    2000 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, PROCEEDINGS, 2000, : 40 - 40
  • [46] Commitment over Multiple-Access Channels
    Chou, Remi
    Bloch, Matthieu R.
    2022 58TH ANNUAL ALLERTON CONFERENCE ON COMMUNICATION, CONTROL, AND COMPUTING (ALLERTON), 2022,
  • [47] ROBUST CODING FOR MULTIPLE-ACCESS CHANNELS
    GERANIOTIS, E
    IEEE TRANSACTIONS ON INFORMATION THEORY, 1986, 32 (04) : 550 - 560
  • [48] Computation over multiple-access channels
    Nazer, Bobak
    Gastpar, Michael
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2007, 53 (10) : 3498 - 3516
  • [49] Multiple-access channels with confidential messages
    Liang, Yingbin
    Poor, H. Vincent
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2008, 54 (03) : 976 - 1002
  • [50] The Cost of Synchronizing Multiple-Access Channels
    Jurdzinski, Tomasz
    Stachowiak, Grzegorz
    PODC'15: PROCEEDINGS OF THE 2015 ACM SYMPOSIUM ON PRINCIPLES OF DISTRIBUTED COMPUTING, 2015, : 421 - 430
12345