Endre søk
RefereraExporteraLink to record
Permanent link

Direct link
Referera
Referensformat
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annet format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annet språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
How to Split UL/DL Antennas in Full-DuplexCellular Networks
KTH, Skolan för elektroteknik och datavetenskap (EECS), Nätverk och systemteknik.ORCID-id: 0000-0002-4503-4242
KTH, Skolan för elektroteknik och datavetenskap (EECS), Nätverk och systemteknik.ORCID-id: 0000-0002-9442-671X
KTH, Skolan för elektroteknik och datavetenskap (EECS), Reglerteknik.ORCID-id: 0000-0002-2289-3159
KTH, Skolan för elektroteknik och datavetenskap (EECS), Nätverk och systemteknik.ORCID-id: 0000-0001-9810-3478
2018 (engelsk)Inngår i: IEEE International Conference on Communication (ICC’18): ThirdWorkshop on Full-Duplex Communications for Future Wireless Networks, Kansas City, MO, USA: IEEE Communications Society, 2018Konferansepaper, Oral presentation with published abstract (Fagfellevurdert)
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.

sted, utgiver, år, opplag, sider
Kansas City, MO, USA: IEEE Communications Society, 2018.
Emneord [en]
full-duplex communication, antenna splitting, antenna selection, convex approximation, cellular networks
HSV kategori
Forskningsprogram
Telekommunikation
Identifikatorer
URN: urn:nbn:se:kth:diva-230184OAI: oai:DiVA.org:kth-230184DiVA, id: diva2:1216794
Konferanse
IEEE International Conference on Communication (ICC’18)
Forskningsfinansiär
Lars Hierta Memorial Foundation, FO2017-0236
Merknad

QC 20180614

Tilgjengelig fra: 2018-06-12 Laget: 2018-06-12 Sist oppdatert: 2018-06-14bibliografisk kontrollert

Open Access i DiVA

Fulltekst mangler i DiVA

Andre lenker

Arxiv linkConference webpage

Søk i DiVA

Av forfatter/redaktør
B. da Silva Jr., Jose MairtonGhauch, HadiFodor, GaborFischione, Carlo
Av organisasjonen

Søk utenfor DiVA

GoogleGoogle Scholar

urn-nbn

Altmetric

urn-nbn
Totalt: 371 treff
RefereraExporteraLink to record
Permanent link

Direct link
Referera
Referensformat
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annet format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annet språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf