Name
Title | ||
|---|---|---|
K-best branch and bound technique for the MINLP resource allocation in multi-user OFDM systems |
Abstract | ||
|---|---|---|
In this paper, we propose a simplified approach for the Mixed Integer Non-linear Programming (MINLP) problem in the context of dynamic resource allocation for multiuser downlink Orthogonal Frequency Division Multiplexing (OFDM) systems. Our solution is based on the appropriate selection of the K-best branches of the branch and bound technique. The proposed algorithm significantly decreases the computational complexity of the conventional branch and bound technique, yet with a slight reduction in the average user throughput. Simulations results show that a trade-off between complexity decrease and performance reduction could be maintained with the proposed algorithm. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1109/SPAWC.2015.7227020 | 2015 IEEE 16th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC) |
Keywords | Field | DocType |
K-best Branch and Bound,MINLP,OFDM,Resource Allocation | Branch and bound,Mathematical optimization,Computer science,Resource allocation,Throughput,Computational resource,Orthogonal frequency-division multiplexing,Telecommunications link,Multi-user,Computational complexity theory | Conference |
ISSN | Citations | PageRank |
1948-3244 | 0 | 0.34 |
References | Authors | |
7 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Youssef Jaffal | 1 | 0 | 1.01 |
| Youssef Nasser | 2 | 115 | 35.36 |
| Yoann Corre | 3 | 76 | 13.64 |
| Yves Lostanlen | 4 | 177 | 20.28 |