pith. sign in

arxiv: cs/0509048 · v1 · pith:HXQW7YSVnew · submitted 2005-09-16 · 💻 cs.IT · math.IT

Capacity of Complexity-Constrained Noise-Free CDMA

classification 💻 cs.IT math.IT
keywords channelcdmacapacitycomplexity-constrainednoise-freereceiveraccordingadopting
0
0 comments X
read the original abstract

An interference-limited noise-free CDMA downlink channel operating under a complexity constraint on the receiver is introduced. According to this paradigm, detected bits, obtained by performing hard decisions directly on the channel's matched filter output, must be the same as the transmitted binary inputs. This channel setting, allowing the use of the simplest receiver scheme, seems to be worthless, making reliable communication at any rate impossible. We prove, by adopting statistical mechanics notion, that in the large-system limit such a complexity-constrained CDMA channel gives rise to a non-trivial Shannon-theoretic capacity, rigorously analyzed and corroborated using finite-size channel simulations.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.