Channel Protection: Random Coding Meets Sparse Channels

Computer Science – Information Theory

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

To appear in the proceedings of the 2009 IEEE Information Theory Workshop (Taormina)

Scientific paper

Multipath interference is an ubiquitous phenomenon in modern communication systems. The conventional way to compensate for this effect is to equalize the channel by estimating its impulse response by transmitting a set of training symbols. The primary drawback to this type of approach is that it can be unreliable if the channel is changing rapidly. In this paper, we show that randomly encoding the signal can protect it against channel uncertainty when the channel is sparse. Before transmission, the signal is mapped into a slightly longer codeword using a random matrix. From the received signal, we are able to simultaneously estimate the channel and recover the transmitted signal. We discuss two schemes for the recovery. Both of them exploit the sparsity of the underlying channel. We show that if the channel impulse response is sufficiently sparse, the transmitted signal can be recovered reliably.

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

Channel Protection: Random Coding Meets Sparse Channels 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 Channel Protection: Random Coding Meets Sparse Channels, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Channel Protection: Random Coding Meets Sparse Channels will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-193960

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