Bounds for the Sum Capacity of Binary CDMA Systems in Presence of Near-Far Effect
P. Pad, M. H. Shafinia, S. M. Mansouri, P. Kabir, F. Marvasti

TL;DR
This paper estimates the sum capacity of binary CDMA systems affected by near-far effects, providing tight bounds and extending existing models with new bounds and simulation validation.
Contribution
It introduces lower and conjectured upper bounds for the sum capacity considering near-far effects, extending prior work with asymptotic analysis and simulations.
Findings
Lower bound is very tight for typical parameters
Simulation results validate the bounds
Extension of Tanaka's formula to near-far effect scenarios
Abstract
In this paper we are going to estimate the sum capacity of a binary CDMA system in presence of the near-far effect. We model the near-far effect as a random variable that is multiplied by the users binary data before entering the noisy channel. We will find a lower bound and a conjectured upper bound for the sum capacity in this situation. All the derivations are in the asymptotic case. Simulations show that especially the lower bound is very tight for typical values Eb/N0 and near-far effect. Also, we exploit our idea in conjunction with the Tanaka's formula [6] which also estimates the sum capacity of binary CDMA systems with perfect power control.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsWireless Communication Networks Research · graph theory and CDMA systems · Advanced Topics in Algebra
