Per-antenna Constant Envelope Precoding for Large Multi-User MIMO Systems

Computer Science – Information Theory

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Submitted to IEEE Transactions on Communications

Scientific paper

We consider the multi-user MIMO broadcast channel with M single-antenna users and N transmit antennas under the constraint that each antenna emits signals having constant envelope (CE). The motivation for this is that CE signals facilitate the use of power-efficient RF power amplifiers. Analytical and numerical results show that, under certain mild conditions on the channel gains, for a fixed M, an array gain of O(N) is achievable even under the stringent per-antenna CE constraint (essentially, for a fixed M, at sufficiently large N the total transmitted power can be reduced linearly with increasing N while maintaining a fixed information rate to each user). We also propose a precoding scheme which finds near-optimal CE signals to be transmitted, and has O(MN) complexity. Also, in terms of the total transmit power required to achieve a fixed desired information sum-rate, despite the stringent per-antenna CE constraint, the proposed CE precoding scheme performs close to the sum-capacity achieving scheme for an average-only total transmit power constrained channel.

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

Per-antenna Constant Envelope Precoding for Large Multi-User MIMO Systems 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 Per-antenna Constant Envelope Precoding for Large Multi-User MIMO Systems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Per-antenna Constant Envelope Precoding for Large Multi-User MIMO Systems will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-350

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