Low-Complexity Channel Resolvability Codes for the Symmetric Multiple-Access Channel

被引:0
|
作者
Chou, Remi A. [1 ]
Bloch, Matthieu R. [1 ]
Kliewer, Jorg [2 ]
机构
[1] Georgia Inst Technol, Sch Elect & Comp Engn, Atlanta, GA 30332 USA
[2] New Jersey Inst Technol, Dept Elect & Comp Engn, Newark, NJ 07102 USA
关键词
CAPACITY; SECRECY;
D O I
暂无
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
We investigate channel resolvability for the l-user multiple-access channel (MAC) with two different families of encoders. The first family consists of invertible extractors, while the second one consists of injective group homomorphisms, and was introduced by Hayashi for the point-to-point channel resolvability. The main benefit of these two families is to provide explicit low-complexity channel resolvability codes in the case of symmetric MACs. Specifically, we provide two examples of families of invertible extractors suitable for MAC resolvability with uniform input distributions, one based on finite-field multiplication, which can be implemented in O (n log n) for a limited range of values of the encoding blocklength n, and a second based on modified Toeplitz matrices, which can be implemented in O (n log n) for a wider range of values of n. We also provide an example of family of injective group homomorphisms based on finite-field multiplication suitable for MAC resolvability with uniform input distributions, which can be implemented in O (n log n) for some values of n.
引用
收藏
页码:466 / 470
页数:5
相关论文
共 50 条
  • [1] Explicit Low-complexity Codes for Multiple Access Channel Resolvability
    Sultana, Rumia
    Chou, Remi A.
    [J]. 2019 57TH ANNUAL ALLERTON CONFERENCE ON COMMUNICATION, CONTROL, AND COMPUTING (ALLERTON), 2019, : 116 - 123
  • [2] Separable Codes for the Symmetric Multiple-Access Channel
    D'yachkov, Arkadii
    Polyanskii, Nikita
    Shchukin, Vladislav
    Vorobyev, Ilya
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2019, 65 (06) : 3738 - 3750
  • [3] Separable Codes for the Symmetric Multiple-Access Channel
    D'yachkov, Arkadii
    Polyanskii, Nikita
    Shchukin, Vladislav
    Vorobyev, Ilya
    [J]. 2018 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2018, : 291 - 295
  • [4] Multiple-Access Channel Resolvability with Cribbing
    Helal, Noha
    Bloch, Matthieu
    Nosratinia, Aria
    [J]. 2018 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2018, : 2052 - 2056
  • [5] Resolvability theory for the multiple-access channel
    Steinberg, Y
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 1998, 44 (02) : 472 - 487
  • [6] Low-Complexity Coding Scheme to Approach Multiple-Access Channel Capacity
    Song, Guanghui
    Cheng, Jun
    [J]. 2015 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2015, : 2106 - 2110
  • [7] OPTIMAL AND LOW-COMPLEXITY ITERATIVE JOINT NETWORK/CHANNEL DECODING FOR THE MULTIPLE-ACCESS RELAY CHANNEL
    Vu, Xuan-Thang
    Di Renzo, Marco
    Duhamel, Pierre
    [J]. 2011 IEEE INTERNATIONAL CONFERENCE ON ACOUSTICS, SPEECH, AND SIGNAL PROCESSING, 2011, : 3312 - 3315
  • [8] Multiple Access Channel Resolvability Codes From Source Resolvability Codes
    Sultana, Rumia
    Chou, Remi A.
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2022, 68 (06) : 3608 - 3619
  • [9] Cooperative Resolvability and Secrecy in the Cribbing Multiple-Access Channel
    Helal, Noha
    Bloch, Matthieu
    Nosratinia, Aria
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2020, 66 (09) : 5429 - 5447
  • [10] Explicit Construction of Multiple Access Channel Resolvability Codes from Source Resolvability Codes
    Sultana, Rumia
    Chou, Remi A.
    [J]. 2020 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2020, : 1576 - 1580