Capacity of a Class of Modulo-Sum Relay Channels

被引:53
|
作者
Aleksic, Marko [1 ]
Razaghi, Peyman [1 ]
Yu, Wei [1 ]
机构
[1] Univ Toronto, Edward S Rogers Sr Dept Elect & Comp Engn, Toronto, ON M5S 3G4, Canada
基金
加拿大自然科学与工程研究理事会;
关键词
Channel with side information; cut-set bound; modulo-sum channel; quantize-and-forward; relay channel; SUCCESSIVE REFINEMENT; STATE INFORMATION; THEOREMS;
D O I
10.1109/TIT.2008.2011518
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
This paper characterizes the capacity of a class of modular additive noise relay channels, in which the relay observes a corrupted version of the noise and has a separate channel to the destination. The capacity is shown to be strictly below the cut-set bound in general and achievable using a quantize-and-forward strategy at the relay. This result confirms a previous conjecture on the capacity of channels with rate-limited side information at the receiver for this particular class of modulo-sum channels. This paper also considers a more general setting in which the relay is capable of conveying noncausal rate-limited side information about the noise to both the transmitter and the receiver. The capacity is characterized for the case where the channel is binary symmetric with a crossover probability 1/2. In this case, the rates available for conveying side information to the transmitter and to the receiver can be traded with each other arbitrarily-the capacity is a function of the stun of the two rates.
引用
收藏
页码:921 / 930
页数:10
相关论文
共 50 条
  • [21] Secrecy Capacity of a Class of Orthogonal Relay Eavesdropper Channels
    Vaneet Aggarwal
    Lalitha Sankar
    A. Robert Calderbank
    H. Vincent Poor
    EURASIP Journal on Wireless Communications and Networking, 2009
  • [22] On the Capacity of the Modulo Lattice Channels
    Mirghasemi, Hamed
    Belfiore, Jean-Claude
    2013 51ST ANNUAL ALLERTON CONFERENCE ON COMMUNICATION, CONTROL, AND COMPUTING (ALLERTON), 2013, : 607 - 614
  • [23] A Numerical Study of Multi-Letter Ahlswede-Han Scheme for Modulo-Sum Problem
    Kakishima, Takuto
    Watanabe, Shun
    2022 INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY AND ITS APPLICATIONS, ISITA, 2022, : 84 - 88
  • [24] A New Upper Bound on the Capacity of a Class of Primitive Relay Channels
    Tandon, Ravi
    Ulukus, Sennur
    2008 46TH ANNUAL ALLERTON CONFERENCE ON COMMUNICATION, CONTROL, AND COMPUTING, VOLS 1-3, 2008, : 1562 - 1569
  • [25] Capacity of a Class of State-Dependent Orthogonal Relay Channels
    Aguerri, Inaki Estella
    Guenduez, Deniz
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2016, 62 (03) : 1280 - 1295
  • [26] Lower and Upper Bounds on the Capacity of a Class of Gaussian Relay Channels
    Soleymani, M. Reza
    26TH IRANIAN CONFERENCE ON ELECTRICAL ENGINEERING (ICEE 2018), 2018, : 404 - 406
  • [27] Capacity to Within a Constant Gap for a Class of Interference Relay Channels
    Bassi, German
    Piantanida, Pablo
    Yang, Sheng
    2013 51ST ANNUAL ALLERTON CONFERENCE ON COMMUNICATION, CONTROL, AND COMPUTING (ALLERTON), 2013, : 1300 - 1306
  • [28] On the Sum Capacity of A Class of Cyclically Symmetric Deterministic Interference Channels
    Bandemer, Bernd
    Vazquez-Vilar, Gonzalo
    El Gamal, Abbas
    2009 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, VOLS 1- 4, 2009, : 2622 - 2626
  • [29] On the Sum-Capacity of Degraded Gaussian Multiple-Access Relay Channels
    Sankar, Lalitha
    Mandayam, Narayan B.
    Poor, H. Vincent
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2009, 55 (12) : 5394 - 5411
  • [30] Nonbinary Channel Coded Physical Layer Network Coding Over Modulo-Sum Algebraic Ring Structures
    Prochazka, Pavel
    IEEE COMMUNICATIONS LETTERS, 2016, 20 (03) : 538 - 541