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-DuplexCellular Networks
KTH, School of Electrical Engineering and Computer Science (EECS), Network and Systems engineering.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: IEEE International Conference on Communication (ICC’18): ThirdWorkshop on Full-Duplex Communications for Future Wireless Networks, Kansas City, MO, USA: IEEE Communications Society, 2018Conference paper, Oral presentation with published abstract (Refereed)
Abstract [en]

To further improve the potential of full-duplex com-munications, networks may employ multiple antennas at thebase station or user equipment. To this end, networks thatemploy current radios usually deal with self-interference andmulti-user interference by beamforming techniques. Althoughprevious works investigated beamforming design to improvespectral efficiency, the fundamental question of how to split theantennas at a base station between uplink and downlink infull-duplex networks has not been investigated rigorously. Thispaper addresses this question by posing antenna splitting as abinary nonlinear optimization problem to minimize the sum meansquared error of the received data symbols. It is shown that thisis an NP-hard problem. This combinatorial problem is dealt withby equivalent formulations, iterative convex approximations, anda binary relaxation. The proposed algorithm is guaranteed toconverge to a stationary solution of the relaxed problem with muchsmaller complexity than exhaustive search. Numerical resultsindicate that the proposed solution is close to the optimal in bothhigh and low self-interference capable scenarios, while the usuallyassumed antenna splitting is far from optimal. For large numberof antennas, a simple antenna splitting is close to the proposedsolution. This reveals that the importance of antenna splittingdiminishes with the number of antennas.

Place, publisher, year, edition, pages
Kansas City, MO, USA: IEEE Communications Society, 2018.
Keywords [en]
full-duplex communication, antenna splitting, antenna selection, convex approximation, cellular networks
National Category
Telecommunications
Research subject
Telecommunication
Identifiers
URN: urn:nbn:se:kth:diva-230184OAI: oai:DiVA.org:kth-230184DiVA, id: diva2:1216794
Conference
IEEE International Conference on Communication (ICC’18)
Funder
Lars Hierta Memorial Foundation, FO2017-0236
Note

QC 20180614

Available from: 2018-06-12 Created: 2018-06-12 Last updated: 2018-06-14Bibliographically approved

Open Access in DiVA

No full text in DiVA

Other links

Arxiv linkConference webpage

Search in DiVA

By author/editor
B. da Silva Jr., Jose MairtonGhauch, HadiFodor, GaborFischione, Carlo
By organisation
Network and Systems engineeringAutomatic Control
Telecommunications

Search outside of DiVA

GoogleGoogle Scholar

urn-nbn

Altmetric score

urn-nbn
Total: 393 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