• DocumentCode
    1711341
  • Title

    Beamforming in large-scale MIMO multiuser links under a per-node power constraint

  • Author

    Anderson, Adam L. ; Jensen, Michael A.

  • Author_Institution
    Electr. & Comput. Eng. Dept., Tennessee Technol. Univ., Cookeville, TN, USA
  • fYear
    2012
  • Firstpage
    821
  • Lastpage
    825
  • Abstract
    Large-scale multiple-input multiple-output (MIMO) systems use a large array of nodes to offer high communication performance to multiple mobile users. For such systems to be economically practical, each node participating in the large-scale link likely has limited transmit power capability, and therefore properly limiting the per-node transmit power must be incorporated into the signal processing algorithm. This work generalizes an iterative beamforming algorithm for multiuser MIMO signaling, subject to such a per-node power constraint, that can accommodate nonlinear precoding and detection. Simulations using the algorithm for large-scale MIMO systems reveal that the approach can offer performance similar to that obtained with a more traditional sum-power constraint without the wide range of per-antenna transmit power distribution typical of such a constraint.
  • Keywords
    MIMO communication; array signal processing; iterative methods; multiuser channels; precoding; radio links; iterative beamforming algorithm; large-scale MIMO multiuser links; large-scale MIMO systems; large-scale link; large-scale multiple-input multiple-output systems; multiple mobile users; multiuser MIMO signaling; multiuser channels; nonlinear precoding; per-node power constraint; signal processing algorithm; sum-power constraint; transmit power capability; Array signal processing; Arrays; Interference; MIMO; Receiving antennas; Transmitting antennas; Array signal processing; Large MIMO systems; Multiuser channels;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Wireless Communication Systems (ISWCS), 2012 International Symposium on
  • Conference_Location
    Paris
  • ISSN
    2154-0217
  • Print_ISBN
    978-1-4673-0761-1
  • Electronic_ISBN
    2154-0217
  • Type

    conf

  • DOI
    10.1109/ISWCS.2012.6328482
  • Filename
    6328482