Blog
About

64
views
0
recommends
+1 Recommend
0 collections
    4
    shares
      • Record: found
      • Abstract: found
      • Article: found
      Is Open Access

      Linear Precoding for Relay Networks with Finite-Alphabet Constraints

      Preprint

      , , ,

      Read this article at

      Bookmark
          There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.

          Abstract

          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.

          Related collections

          Author and article information

          Journal
          2011-01-06
          2011-01-14
          Article
          10.1109/icc.2011.5962566
          1101.1345

          http://arxiv.org/licenses/nonexclusive-distrib/1.0/

          Custom metadata
          Accepted by IEEE Int. Conf. Commun. (ICC), Kyoto, Japan, 2011
          cs.IT math.IT

          Numerical methods, Information systems & theory

          Comments

          Comment on this article