Multiuser downlink beamforming with interference cancellation using a SDP-based branch-and-bound algorithm.
Anne PhilippStefan UlbrichYong ChengMarius PesaventoPublished in: ICASSP (2014)
Keyphrases
- branch and bound algorithm
- multipath
- long term evolution
- lower bound
- code division multiple access
- wireless channels
- branch and bound
- semidefinite programming
- upper bound
- optimal solution
- np hard
- resource allocation
- lower bounding
- combinatorial optimization
- upper bounding
- precedence constraints
- randomly generated problems
- end to end
- fourth generation
- mixed integer linear programming
- search algorithm
- single machine scheduling problem
- semidefinite
- cellular networks
- linear programming
- variable ordering
- branch and bound method
- wireless communication
- finding an optimal solution
- search space
- fading channels
- bit error rate
- max sat
- ofdm system
- lagrangian relaxation
- maximum clique