Global optima for sum-rate in two-user SIC interference channels are characterized and a decentralized algorithm for symmetric channels is shown to outperform orthogonal access and greedy baselines without global CSI.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
verdicts
UNVERDICTED 2representative citing papers
Models show active transport in crowded 1D channels can extend molecular communication range beyond diffusion limits, evaluated via mutual information in relay and mixed-particle scenarios.
citing papers explorer
-
On Decentralized Sum-Rate Maximization with Successive Interference Cancellation
Global optima for sum-rate in two-user SIC interference channels are characterized and a decentralized algorithm for symmetric channels is shown to outperform orthogonal access and greedy baselines without global CSI.
-
Molecular communication in one-dimensional channels with active transport and crowding
Models show active transport in crowded 1D channels can extend molecular communication range beyond diffusion limits, evaluated via mutual information in relay and mixed-particle scenarios.