Information and multiaccess interference in a complexity-constrained vector channel

Computer Science – Information Theory

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

The author has withdrawn this submission [arXiv admin]

Scientific paper

10.1088/1751-8113/40/20/002

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.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Information and multiaccess interference in a complexity-constrained vector channel 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 Information and multiaccess interference in a complexity-constrained vector channel, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Information and multiaccess interference in a complexity-constrained vector channel will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-236952

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.