The Multiplexing Gain of a Two-cell MIMO Channel with Unequal CSI

Computer Science – Information Theory

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Scientific paper

In this work, the joint precoding across two distant transmitters (TXs), sharing the knowledge of the data symbols to be transmitted, to two receivers (RXs), each equipped with one antenna, is discussed. We consider a distributed channel state information (CSI) configuration where each TX has its own local estimate of the channel and no communication is possible between the TXs. Based on the distributed CSI configuration, we introduce a concept of distributed MIMO precoding. We focus on the high signal-to-noise ratio (SNR) regime such that the two TXs aim at designing a precoding matrix to cancel the interference. Building on the study of the multiple antenna broadcast channel, we obtain the following key results: We derive the multiplexing gain (MG) as a function of the scaling in the SNR of the number of bits quantizing at each TX the channel to a given RX. Particularly, we show that the conventional Zero Forcing precoder is not MG maximizing, and we provide a precoding scheme optimal in terms of MG. Beyond the established MG optimality, simulations show that the proposed precoding schemes achieve better performances at intermediate SNR than known linear precoders.

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

The Multiplexing Gain of a Two-cell MIMO Channel with Unequal CSI 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 The Multiplexing Gain of a Two-cell MIMO Channel with Unequal CSI, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The Multiplexing Gain of a Two-cell MIMO Channel with Unequal CSI will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-378326

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