Random multiple access in a vector disjunctive channel

被引：0
|
作者：
Pustovalov, E. V. [1 ]
Turlikov, A. M. [1 ]
机构：
[1] St Petersburg State Univ Aerosp Instrumentat, St Petersburg, Russia
来源：
PROBLEMS OF INFORMATION TRANSMISSION | 2013年 / 49卷 / 02期
关键词：
Information Transmission; Interference Cancellation; Channel Output; Successive Interference Cancellation; Splitting Algorithm;
D O I：
10.1134/S0032946013020026
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
We consider a random multiple access (RMA) procedure in a vector disjunctive channel. We show that exploiting properties of the channel allows one to reduce collision resolution time and thus increase the maximal stable throughput (MST) of RMA algorithms in this channel. We propose an algorithm, belonging to the class of splitting algorithms, which achieves the MST of 0.603.
引用
收藏
页码：111 / 126
页数：16
相关论文
共 50 条
  • [21] A new universal random coding bound for the multiple-access channel
    Liu, YS
    Hughes, BL
    IEEE TRANSACTIONS ON INFORMATION THEORY, 1996, 42 (02) : 376 - 386
  • [22] CODE CONSTRUCTIONS FOR ASYNCHRONOUS RANDOM MULTIPLE-ACCESS TO THE ADDER CHANNEL
    PLOTNIK, E
    IEEE TRANSACTIONS ON INFORMATION THEORY, 1993, 39 (01) : 195 - 197
  • [23] On LDPC Code Based Massive Random-Access Scheme for the Gaussian Multiple Access Channel
    Glebov, Anton
    Medova, Luiza
    Rybin, Pavel
    Frolov, Alexey
    INTERNET OF THINGS, SMART SPACES, AND NEXT GENERATION NETWORKS AND SYSTEMS, NEW2AN 2018, 2018, 11118 : 162 - 171
  • [24] On the Maximal Achievable Rate for Signal-Code Construction Based on Interleaved Reed-Solomon Codes for Multiple Access System over Vector-Disjunctive Channel
    Ivanov, Fedor
    Rybin, Pavel
    2018 IEEE INTERNATIONAL BLACK SEA CONFERENCE ON COMMUNICATIONS AND NETWORKING (BLACKSEACOM), 2018, : 148 - 152
  • [25] Maximizing data rate-sum over vector multiple access channel
    Klimovitch, GV
    Cioffi, JM
    WCNC: 2000 IEEE WIRELESS COMMUNICATIONS AND NETWORKING CONFERENCE, VOLS 1-3, 2000, : 287 - 292
  • [26] RANDOM CODING BOUND AND CODES PRODUCED BY PERMUTATIONS FOR THE MULTIPLE-ACCESS CHANNEL
    POKORNY, J
    WALLMEIER, HM
    IEEE TRANSACTIONS ON INFORMATION THEORY, 1985, 31 (06) : 741 - 750
  • [27] FORWARD COLLISION RESOLUTION - A TECHNIQUE FOR RANDOM MULTIPLE-ACCESS TO THE ADDER CHANNEL
    BARDAVID, I
    PLOTNIK, E
    ROM, R
    IEEE TRANSACTIONS ON INFORMATION THEORY, 1993, 39 (05) : 1671 - 1675
  • [28] Bounds of E-capacity for multiple-access channel with random parameter
    Haroutunian, M. E.
    General Theory of Information Transfer and Combinatorics, 2006, 4123 : 196 - 217
  • [29] Doubly randomized protocols for a random multiple access channel with “success–nonsuccess” feedback
    S. G. Foss
    B. Hajek
    A. M. Turlikov
    Problems of Information Transmission, 2016, 52 : 156 - 165
  • [30] On Multiple Access Random Medium Access Control
    Cui, Tao
    Ho, Tracey
    2009 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, VOLS 1- 4, 2009, : 1869 - 1873
12345