MULTIUSER DOWNLINK BEAMFORMING WITH INTERFERENCE CANCELLATION USING A SDP-BASED BRANCH-AND-BOUND ALGORITHM

被引：0

作者：

Philipp, Anne ^{[1
]}

Ulbrich, Stefan ^{[1
]}

Cheng, Yong ^{[2
]}

Pesavento, Marius ^{[2
]}

机构：

[1] Tech Univ Darmstadt, Nonlinear Optimizat Grp, Darmstadt, Germany

[2] Tech Univ Darmstadt, Commun Syst Grp, Darmstadt, Germany

来源：

2014 IEEE INTERNATIONAL CONFERENCE ON ACOUSTICS, SPEECH AND SIGNAL PROCESSING (ICASSP) | 2014年

关键词：

Downlink Beamforming; Interference Cancellation; SDP-based Branch-and-Bound; Fast Heuristic Algorithm; SUM-RATE MAXIMIZATION; POWER-CONTROL; OPTIMIZATION;

D O I：

暂无

中图分类号：

O42 [声学];

学科分类号：

070206 ; 082403 ;

摘要：

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 signalto- 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.

引用

页数：5

共 50 条

[21] An improved hybrid multiuser interference cancellation scheme based on the clustering algorithm
Jung, SJ
Kim, HM
IEEE 54TH VEHICULAR TECHNOLOGY CONFERENCE, VTC FALL 2001, VOLS 1-4, PROCEEDINGS, 2001, : 683 - 687
[22] A FINITE CONCAVE MINIMIZATION ALGORITHM USING BRANCH-AND-BOUND AND NEIGHBOR GENERATION
BENSON, HP
SAYIN, S
JOURNAL OF GLOBAL OPTIMIZATION, 1994, 5 (01) : 1 - 14
[23] BRANCH-AND-BOUND ALGORITHM FOR INTERFACE-BASED MODULAR PRODUCT DESIGN
Yoo, John Jung-Woon
Aryasomayajula, Anirudh
PROCEEDINGS OF THE ASME INTERNATIONAL DESIGN ENGINEERING TECHNICAL CONFERENCES AND COMPUTERS AND INFORMATION IN ENGINEERING CONFERENCE 2012, VOL 2, PTS A AND B, 2012, : 287 - 296
[24] Using an interval branch-and-bound algorithm in the Hartree-Fock method
Lavor, CC
Cardozo, TM
Nascimento, MAC
INTERNATIONAL JOURNAL OF QUANTUM CHEMISTRY, 2005, 103 (05) : 500 - 504
[25] Global router for analog function blocks based on the branch-and-bound algorithm
Tsubota, Tadanao, 1600, Inst of Electronics, Inf & Commun Engineers of Japan, Tokyo, Japan (E78-A):
[26] Effectiveness of a parallel branch-and-bound based algorithm for analyzing management configurations
Song, YJ
Bauer, M
PDPTA '04: PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED PROCESSING TECHNIQUES AND APPLICATIONS, VOLS 1-3, 2004, : 54 - 60
[27] A Lagrangian based branch-and-bound algorithm for production-transportation problems
Kuno, T
Utsunomiya, T
JOURNAL OF GLOBAL OPTIMIZATION, 2000, 18 (01) : 59 - 73
[28] Parallelised branch-and-bound algorithm for raster-based landfill siting
Liu, Kun-Hsing
Kao, Jehng-Jung
CIVIL ENGINEERING AND ENVIRONMENTAL SYSTEMS, 2013, 30 (01) : 15 - 25
[29] A GLOBAL ROUTER FOR ANALOG FUNCTION BLOCKS BASED ON THE BRANCH-AND-BOUND ALGORITHM
TSUBOTA, T
KAWAKITA, M
WATANABE, T
IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 1995, E78A (03) : 345 - 352
[30] A branch-and-bound algorithm for the quadratic assignment problem based on the Hungarian method
Hahn, P
Grant, T
Hall, N
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1998, 108 (03) : 629 - 640

← 1 2 3 4 5 →