On Modulo-Sum Computation Over an Erasure Multiple-Access Channel

被引:5
|
作者
Khisti, Ashish [1 ]
Hern, Brett [2 ]
Narayanan, Krishna [2 ]
机构
[1] Univ Toronto, Toronto, ON M5S 1A1, Canada
[2] Texas A&M Univ, College Stn, TX 77840 USA
基金
美国国家科学基金会;
关键词
Compute and forward; erasure channels; modulo-sum computation; multiple-access channels (MACs); network information theory;
D O I
10.1109/TIT.2013.2252234
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
We study modulo-sum computation of two binary source sequences over a two-user erasure multiple access channel. The channel is modeled as a binary-input, erasure multiple access channel, which can be in one of three states-either the channel output is a modulo-sum of the two input symbols, or the channel output equals the input symbol on the first link and an erasure on the second link, or vice versa. The associated state sequence is independent and identically distributed. Unlike previously studied multiple-access channels, the proposed channel is not matched to the modulo-sum function and therefore we expect simple cut-set upper bounds to be far from capacity. In this paper, we establish a new upper bound on the modulo-sum capacity that is tighter than the cut-set bound. The key step in establishing this new bound is to provide suitable side information to the encoders to reduce the setup to a compound multiple-access channel and then capture the tension across multiple receivers required to compute the modulo-sum function. In our lower bound, it suffices to use identical linear codebooks at the two encoders. When a (strictly) causal feedback of the channel state is available to the encoders, we present a simple coding scheme that can achieve a rate larger than our upper bound for the case without feedback. This shows that the modulo-sum capacity is increased with feedback. An extension to the case of lossy reconstruction is also treated briefly.
引用
收藏
页码:4129 / 4138
页数:10
相关论文
共 50 条
  • [31] A Formulation of the Channel Capacity of Multiple-Access Channel
    Watanabe, Yoichiro
    Kamoi, Koichi
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2009, 55 (05) : 2083 - 2096
  • [32] On lp-norm Computation over Multiple-Access Channels (Invited Paper)
    Limmer, Steffen
    Stanczak, Slawomir
    2014 IEEE INFORMATION THEORY WORKSHOP (ITW), 2014, : 351 - 355
  • [33] ERASURE, CAPTURE, AND NOISE ERRORS IN CONTROLLED MULTIPLE-ACCESS NETWORKS
    SHWARTZ, A
    SIDI, M
    IEEE TRANSACTIONS ON COMMUNICATIONS, 1989, 37 (11) : 1228 - 1231
  • [34] On a Multiple-Access in a Vector Disjunctive Channel
    Frolov, Alexey
    Zyablov, Victor
    Sidorenko, Vladimir
    Fischer, Robert
    2013 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS (ISIT), 2013, : 211 - +
  • [35] Covert Communication Over a K-User Multiple-Access Channel
    Arumugam, Keerthi Suria Kumar
    Bloch, Matthieu R.
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2019, 65 (11) : 7020 - 7044
  • [36] The Dirty MIMO Multiple-Access Channel
    Khina, Anatoly
    Kochman, Yuval
    Erez, Uri
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2017, 63 (09) : 6031 - 6040
  • [37] Multiple-Access Channel Resolvability with Cribbing
    Helal, Noha
    Bloch, Matthieu
    Nosratinia, Aria
    2018 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2018, : 2052 - 2056
  • [38] On Faster-than-Nyquist Transmission over a Multiple-Access Channel
    Feng, Yi
    Bajcsy, Jan
    2014 IEEE MILITARY COMMUNICATIONS CONFERENCE: AFFORDABLE MISSION SUCCESS: MEETING THE CHALLENGE (MILCOM 2014), 2014, : 824 - 829
  • [39] Coding for the multiple-access adder channel
    Laczay, B.
    General Theory of Information Transfer and Combinatorics, 2006, 4123 : 165 - 195
  • [40] Sum-Rate Maximization in the Multicell MIMO Multiple-Access Channel with Interference Coordination
    Nguyen, Duy H. N.
    Tho Le-Ngoc
    IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, 2014, 13 (01) : 36 - 48