Sciweavers

Share
CORR
2008
Springer

Tight Bounds on the Capacity of Binary Input random CDMA Systems

8 years 10 months ago
Tight Bounds on the Capacity of Binary Input random CDMA Systems
Abstract-- We consider code division multiple access communication over a binary input additive white Gaussian noise channel using random spreading. For a general class of symmetric distributions for spreading sequences, in the limit of a large number of users, we prove an upper bound to the capacity. The bound matches the formula obtained by Tanaka using the replica method. We also show concentration of various relevant quantities including mutual information and free energy. The mathematical methods are quite general and allow us to discuss extensions to other multiuser scenarios.
Satish Babu Korada, Nicolas Macris
Added 09 Dec 2010
Updated 09 Dec 2010
Type Journal
Year 2008
Where CORR
Authors Satish Babu Korada, Nicolas Macris
Comments (0)
books