High-Throughput Random Access Using Successive Interference Cancellation in a Tree Algorithm

DOI10.1109/TIT.2007.909080zbMath1325.68028OpenAlexW2148398957MaRDI QIDQ3549016

Yingqun Yu, Georgios B. Giannakis

Publication date: 21 December 2008

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tit.2007.909080

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Related Items (4)

Throughput analysis of slotted ALOHA with cooperative transmission using successive interference cancellation ⋮ Random multiple access in a vector disjunctive channel ⋮ Protograph LDPC code design for asynchronous random access ⋮ Conflict-resolving tree algorithm stable to incomplete interference damping

This page was built for publication: High-Throughput Random Access Using Successive Interference Cancellation in a Tree Algorithm