Webbläsaren som du använder stöds inte av denna webbplats. Alla versioner av Internet Explorer stöds inte längre, av oss eller Microsoft (läs mer här: * https://www.microsoft.com/en-us/microsoft-365/windows/end-of-ie-support).

Var god och använd en modern webbläsare för att ta del av denna webbplats, som t.ex. nyaste versioner av Edge, Chrome, Firefox eller Safari osv.

Fast antenna selection algorithms for MIMO systems

Författare

  • Y S Choi
  • Andreas Molisch
  • M Z Win
  • J H Winters

Summary, in English

We consider the capacity of multiple-input-multiple-output (MIMO) systems with reduced complexity. One link end uses all available antennas, while the other chooses the "best" L out of N antennas. The selection of the optimum antenna subset requires an exhaustive search of all possible combinations, involving (/sub L//sup N/) computations of determinants of size L /spl times/ L, which can become prohibitively complex. In this paper, we suggest a class of fast antenna selection algorithm that are based on the correlation or mutual information between the signals at the different antenna elements. It requires less than N/sup 2/ vector multiplications and thus leads to dramatic savings on the computation time. Its performance is very close to the optimum selection procedure: the capacity penalty is less than l bit/s/Hz for the analyzed examples. The algorithm thus offers the possibility of almost-optimum selection even in fast-changing environments.

Publiceringsår

2003

Språk

Engelska

Sidor

1733-1737

Publikation/Tidskrift/Serie

IEEE 58th Vehicular Technology Conference, 2003. VTC 2003-Fall.

Volym

3

Dokumenttyp

Konferensbidrag

Ämne

  • Electrical Engineering, Electronic Engineering, Information Engineering

Nyckelord

  • correlation methods
  • antenna arrays
  • antenna accessories
  • MIMO systems

Conference name

IEEE Vehicular Technology Conference. VTC Fall, 2003

Conference date

2003-10-06 - 2003-10-09

Conference place

Orlando, FL, United States

Status

Published

ISBN/ISSN/Övrigt

  • ISSN: 1090-3038
  • ISBN: 0-7803-7954-3