Ändra sökning
RefereraExporteraLänk till posten
Permanent länk

Direktlänk
Referera
Referensformat
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
How to Split UL/DL Antennas in Full-Duplex Cellular Networks
KTH, Skolan för elektroteknik och datavetenskap (EECS), Nätverk och systemteknik. Royal Inst Technol, KTH, Stockholm, Sweden..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 (Engelska)Ingår i: 2018 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS WORKSHOPS (ICC WORKSHOPS), IEEE, 2018Konferensbidrag, Publicerat paper (Refereegranskat)
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.

Ort, förlag, år, upplaga, sidor
IEEE, 2018.
Serie
IEEE International Conference on Communications Workshops, ISSN 2164-7038
Nationell ämneskategori
Kommunikationssystem
Identifikatorer
URN: urn:nbn:se:kth:diva-237174DOI: 10.1109/ICCW.2018.8403645ISI: 000445022200159Scopus ID: 2-s2.0-85050259231ISBN: 978-1-5386-4328-0 (tryckt)OAI: oai:DiVA.org:kth-237174DiVA, id: diva2:1258226
Konferens
IEEE International Conference on Communications (ICC), MAY 20-24, 2018, Kansas City, MO
Anmärkning

QC 20181024

Tillgänglig från: 2018-10-24 Skapad: 2018-10-24 Senast uppdaterad: 2018-10-30Bibliografiskt granskad

Open Access i DiVA

Fulltext saknas i DiVA

Övriga länkar

Förlagets fulltextScopusconference

Personposter BETA

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

Sök vidare i DiVA

Av författaren/redaktören
Barros da Silva Jr., José MairtonGhauch, HadiFodor, GaborFischione, Carlo
Av organisationen
Nätverk och systemteknikReglerteknik
Kommunikationssystem

Sök vidare utanför DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetricpoäng

doi
isbn
urn-nbn
Totalt: 365 träffar
RefereraExporteraLänk till posten
Permanent länk

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