Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
How to Split UL/DL Antennas in Full-Duplex Cellular Networks
KTH, School of Electrical Engineering and Computer Science (EECS), Network and Systems engineering. Royal Inst Technol, KTH, Stockholm, Sweden..ORCID iD: 0000-0002-4503-4242
KTH, School of Electrical Engineering and Computer Science (EECS), Network and Systems engineering.ORCID iD: 0000-0002-9442-671X
KTH, School of Electrical Engineering and Computer Science (EECS), Automatic Control.ORCID iD: 0000-0002-2289-3159
KTH, School of Electrical Engineering and Computer Science (EECS), Network and Systems engineering.ORCID iD: 0000-0001-9810-3478
2018 (English)In: 2018 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS WORKSHOPS (ICC WORKSHOPS), IEEE, 2018Conference paper, Published paper (Refereed)
Abstract [en]

To further improve the potential of full-duplex communications, networks may employ multiple antennas at the base station or user equipment. To this end, networks that employ current radios usually deal with self-interference and multi-user interference by beamforming techniques. Although previous works investigated beamforming design to improve spectral efficiency, the fundamental question of how to split the antennas at a base station between uplink and downlink in full-duplex networks has not been investigated rigorously. This paper addresses this question by posing antenna splitting as a binary nonlinear optimization problem to minimize the sum mean squared error of the received data symbols. It is shown that this is an NP-hard problem. This combinatorial problem is dealt with by equivalent formulations, iterative convex approximations, and a binary relaxation. The proposed algorithm is guaranteed to converge to a stationary solution of the relaxed problem with much smaller complexity than exhaustive search. Numerical results indicate that the proposed solution is close to the optimal in both high and low self-interference capable scenarios, while the usually assumed antenna splitting is far from optimal. For large number of antennas, a simple antenna splitting is close to the proposed solution. This reveals that the importance of antenna splitting diminishes with the number of antennas.

Place, publisher, year, edition, pages
IEEE, 2018.
Series
IEEE International Conference on Communications Workshops, ISSN 2164-7038
National Category
Communication Systems
Identifiers
URN: urn:nbn:se:kth:diva-237174DOI: 10.1109/ICCW.2018.8403645ISI: 000445022200159Scopus ID: 2-s2.0-85050259231ISBN: 978-1-5386-4328-0 (print)OAI: oai:DiVA.org:kth-237174DiVA, id: diva2:1258226
Conference
IEEE International Conference on Communications (ICC), MAY 20-24, 2018, Kansas City, MO
Note

QC 20181024

Available from: 2018-10-24 Created: 2018-10-24 Last updated: 2018-10-30Bibliographically approved

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full textScopusconference

Authority records BETA

Barros da Silva Jr., José MairtonGhauch, HadiFodor, GaborFischione, Carlo

Search in DiVA

By author/editor
Barros da Silva Jr., José MairtonGhauch, HadiFodor, GaborFischione, Carlo
By organisation
Network and Systems engineeringAutomatic Control
Communication Systems

Search outside of DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric score

doi
isbn
urn-nbn
Total: 365 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf