Information and multiaccess interference in a complexity-constrained vector channel
<|reference_start|>Information and multiaccess interference in a complexity-constrained vector channel: Rodrigo de Miguel et al 2007 J. Phys. A: Math. Theor. 40 5241-5260: A noisy vector channel operating under a strict complexity constraint at the receiver is introduced. According to this constraint, detected bits, obtained by performing hard decisions directly on the channel's matched filter output, must be the same as the transmitted binary inputs. An asymptotic analysis is carried out using mathematical tools imported from the study of neural networks, and it is shown that, under a bounded noise assumption, such complexity-constrained channel exhibits a non-trivial Shannon-theoretic capacity. It is found that performance relies on rigorous interference-based multiuser cooperation at the transmitter and that this cooperation is best served when all transmitters use the same amplitude.<|reference_end|>
@article{de miguel2006information,
    title={Information and multiaccess interference in a complexity-constrained
  vector channel},
    author={Rodrigo de Miguel, Ori Shental, Ralf R. Muller and Ido Kanter},
    journal={arXiv preprint arXiv:cs/0604074},
    year={2006},
    doi={10.1088/1751-8113/40/20/002},
    archivePrefix={arXiv},
    eprint={cs/0604074},
    primaryClass={cs.IT math.IT}
}