Linear Precoding for Relay Networks with Finite-Alphabet Constraints

Computer Science – Information Theory

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Accepted by IEEE Int. Conf. Commun. (ICC), Kyoto, Japan, 2011

Scientific paper

In this paper, we investigate the optimal precoding scheme for relay networks with finite-alphabet constraints. We show that the previous work utilizing various design criteria to maximize either the diversity order or the transmission rate with the Gaussian-input assumption may lead to significant loss for a practical system with finite constellation set constraint. A linear precoding scheme is proposed to maximize the mutual information for relay networks. We exploit the structure of the optimal precoding matrix and develop a unified two-step iterative algorithm utilizing the theory of convex optimization and optimization on the complex Stiefel manifold. Numerical examples show that this novel iterative algorithm achieves significant gains compared to its conventional counterpart.

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

Linear Precoding for Relay Networks with Finite-Alphabet Constraints 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 Linear Precoding for Relay Networks with Finite-Alphabet Constraints, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Linear Precoding for Relay Networks with Finite-Alphabet Constraints will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-483263

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