Tight Bounds on the Capacity of Binary Input random CDMA Systems

Details Tight Bounds on the Capacity of Binary Input random CDMA Systems Tight Bounds on the Capacity of Binary Input random CDMA Systems

2008-03-10

arxiv.org/abs/0803.1454v1

Computer Science

Information Theory

34 pages

Scientific paper

We consider multiple access communication on a binary input additive white Gaussian noise channel using randomly spread code division. For a general class of symmetric distributions for spreading coefficients, in the limit of a large number of users, we prove an upper bound on the capacity, which matches a formula that Tanaka obtained by using the replica method. We also show concentration of various relevant quantities including mutual information, capacity and free energy. The mathematical methods are quite general and allow us to discuss extensions to other multiuser scenarios.

Affiliated with

Also associated with

No associations

Rating

Tight Bounds on the Capacity of Binary Input random CDMA Systems does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Tight Bounds on the Capacity of Binary Input random CDMA Systems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Tight Bounds on the Capacity of Binary Input random CDMA Systems will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-379227