Philipp, Anne ; Ulbrich, Stefan ; Yong, Cheng ; Pesavento, Marius (2014)
Multiuser downlink beamforming with interference cancellation using a SDP-based branch-and-bound algorithm.
2014 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP). Florence, Italy (04.05.2014-09.05.2014)
doi: 10.1109/ICASSP.2014.6855103
Konferenzveröffentlichung, Bibliographie
Kurzbeschreibung (Abstract)
We consider in this paper multiuser downlink beamforming with interference cancellation (BFIC). In our BFIC problem, the total transmitted power of the base station (BS) is minimized under signal-to-interference-plus-noise ratio (SINR) requirements of the mobile stations (MSs) and single-stage interference cancellation (SSIC) is adopted at the MSs. The challenge of the problem lies in its combinatorial and non-convex nature. We propose a semidefinite programming (SDP) based branch-and-bound (BnB) algorithm to (optimally) solve the BFIC problem. The SDP-based BnB algorithm employs SDP and sequential second-order cone programming. We further develop a fast heuristic algorithm for large-scale applications. Simulations show that employing SSIC achieves significant reductions in total transmitted BS power. The proposed SDP-based BnB algorithm optimally solves all considered instances of the BFIC problem, and the heuristic algorithm yields near-optimal solutions.
| Typ des Eintrags: | Konferenzveröffentlichung |
|---|---|
| Erschienen: | 2014 |
| Autor(en): | Philipp, Anne ; Ulbrich, Stefan ; Yong, Cheng ; Pesavento, Marius |
| Art des Eintrags: | Bibliographie |
| Titel: | Multiuser downlink beamforming with interference cancellation using a SDP-based branch-and-bound algorithm |
| Sprache: | Englisch |
| Publikationsjahr: | 2014 |
| Verlag: | IEEE |
| Buchtitel: | 2014 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP) |
| Veranstaltungstitel: | 2014 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP) |
| Veranstaltungsort: | Florence, Italy |
| Veranstaltungsdatum: | 04.05.2014-09.05.2014 |
| DOI: | 10.1109/ICASSP.2014.6855103 |
| Kurzbeschreibung (Abstract): | We consider in this paper multiuser downlink beamforming with interference cancellation (BFIC). In our BFIC problem, the total transmitted power of the base station (BS) is minimized under signal-to-interference-plus-noise ratio (SINR) requirements of the mobile stations (MSs) and single-stage interference cancellation (SSIC) is adopted at the MSs. The challenge of the problem lies in its combinatorial and non-convex nature. We propose a semidefinite programming (SDP) based branch-and-bound (BnB) algorithm to (optimally) solve the BFIC problem. The SDP-based BnB algorithm employs SDP and sequential second-order cone programming. We further develop a fast heuristic algorithm for large-scale applications. Simulations show that employing SSIC achieves significant reductions in total transmitted BS power. The proposed SDP-based BnB algorithm optimally solves all considered instances of the BFIC problem, and the heuristic algorithm yields near-optimal solutions. |
| Fachbereich(e)/-gebiet(e): | 18 Fachbereich Elektrotechnik und Informationstechnik 18 Fachbereich Elektrotechnik und Informationstechnik > Institut für Nachrichtentechnik 18 Fachbereich Elektrotechnik und Informationstechnik > Institut für Nachrichtentechnik > Nachrichtentechnische Systeme Exzellenzinitiative Exzellenzinitiative > Exzellenzcluster Zentrale Einrichtungen Exzellenzinitiative > Exzellenzcluster > Center of Smart Interfaces (CSI) |
| Hinterlegungsdatum: | 03 Feb 2015 13:15 |
| Letzte Änderung: | 02 Feb 2023 11:15 |
| PPN: | |
| Export: | |
| Suche nach Titel in: | TUfind oder in Google |
 |
Frage zum Eintrag |
Optionen (nur für Redakteure)
 |
Redaktionelle Details anzeigen |
Drucken
Impressum