Precoding for the AWGN Channel with Discrete Interference

Computer Science – Information Theory

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

29 Pages, 9 figures, Submitted to IEEE Transactions on Information Theory

Scientific paper

$M$-ary signal transmission over AWGN channel with additive $Q$-ary interference where the sequence of i.i.d. interference symbols is known causally at the transmitter is considered. Shannon's theorem for channels with side information at the transmitter is used to formulate the capacity of the channel. It is shown that by using at most $MQ-Q+1$ out of $M^Q$ input symbols of the \emph{associated} channel, the capacity is achievable. For the special case where the Gaussian noise power is zero, a sufficient condition, which is independent of interference, is given for the capacity to be $\log_2 M$ bits per channel use. The problem of maximization of the transmission rate under the constraint that the channel input given any current interference symbol is uniformly distributed over the channel input alphabet is investigated. For this setting, the general structure of a communication system with optimal precoding is proposed. The extension of the proposed precoding scheme to continuous channel input alphabet is also investigated.

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

Precoding for the AWGN Channel with Discrete Interference 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 Precoding for the AWGN Channel with Discrete Interference, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Precoding for the AWGN Channel with Discrete Interference will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-290327

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