Antenna Selection for Full-Duplex Distributed Antenna Systems

Full-duplex (FD) distributed antenna system (DAS) can take advantage of both FD and DAS to dramatically improve system capacity. The challenges of designing such a system are self-interference at the base station (BS) and multiuser interference, as well as hardware cost, computational complexity and...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:IEEE access Ročník 7; s. 1
Hlavní autoři: Liu, Zhan, Feng, Suili
Médium: Journal Article
Jazyk:angličtina
Vydáno: Piscataway IEEE 01.01.2019
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Témata:
ISSN:2169-3536, 2169-3536
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:Full-duplex (FD) distributed antenna system (DAS) can take advantage of both FD and DAS to dramatically improve system capacity. The challenges of designing such a system are self-interference at the base station (BS) and multiuser interference, as well as hardware cost, computational complexity and signaling overhead, especially for dense antenna deployments. To address these problems mentioned above, in this paper, we investigate an antenna selection strategy at the BS for FD DAS including FD-capable BS antennas and half-duplex (HD) users. In particular, we separately optimize the receive and transmit antenna selection problems to maximize the achievable sum rate. To reduce the computational complexity and signaling overhead, each user is restricted to selecting only the BS antennas in its virtual cell. The optimization problem is a nonconvex integer programming problem, for which it is difficult to find a globally optimal solution. Using variable relaxation and successive convex approximation, we present an iterative antenna selection algorithm based on difference of convex functions (D.C.) programming to obtain a suboptimal solution. The simulation results demonstrate that the proposed antenna selection algorithm can provide significant performance gain over various reference algorithms.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:2169-3536
2169-3536
DOI:10.1109/ACCESS.2019.2941797