Information and multiaccess interference in a complexity-constrained vector channel

DOI10.1088/1751-8113/40/20/002MaRDI QIDQ3445809zbMATH OpenOpenAlexFDO

Authors Rodrigo de Miguel, Ori Shental, Ralf R. Müller, Ido Kanter

Publication date 7 June 2007

Published in Journal of Physics A: Mathematical and Theoretical (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/cs/0604074

Mathematics Subject Classification ID

Coding theorems (Shannon theory) (94A24) Channel models (including quantum) in information and communication theory (94A40)

Abstract: 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.

Recommendations

• On the capacity of a multiple-access vector adder channel
• The information capacity of amplitude- and variance-constrained sclar gaussian channels
• The effect of statistically dependent interference upon channel capacity
• Capacity of the mismatched Gaussian channel
• On the user capacity for a multiple-access system in a vector disjunctive channel with errors

Cited in

(2)

• On the T-user M-frequency noiseless multiple-access channel with and without intensity information
• Structured Mappings and Conferencing Common Information for Multiple-Access Channels

This page was built for publication: Information and multiaccess interference in a complexity-constrained vector channel

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3445809)