The advantages of the orthogonal frequency division multiplexing (OFDM) are high spectral efficiency, resiliency to RF interference, lower multi-path distortion and others. To further utilize the vast channel capacity of the multiuser OFDM, one has to find the efficient adaptive subcarrier and bit allocation among users. In this paper, we propose a 0-1 integer programming model formulating the optimal subcarrier and bit allocation problem of the multiuser OFDM. We proved that the continuous relaxation of our formulation is tighter than the previous convex optimization formulation based on perspective function and the Lagrangian dual bound of our formulation is equivalent to the linear programming relaxation bound. The proposed Lagrangian dual is seperable with respect to subcarriers and allows an efficient dual maximization algorithm. We compared the performance of the integer programming formulation and the Lagrangian dual of our formulation and the continuous relaxation and the primal heuristic proposed in [3]. Computer simulation on a system employing M-ary quadrature amplitude modulation (MQAM) assuming a frequency-selective channel consisting of three independent Rayleigh multipaths is carried out with the optimal subcarrier and bit allocation solution generated by the 0-1 integer programming model.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copy
Taehyung PARK, Sungbin IM, "The Optimal Subcarrier and Bit Allocation for Multiuser OFDM System: A Dual-Decomposition Approach" in IEICE TRANSACTIONS on Fundamentals,
vol. E94-A, no. 9, pp. 1826-1832, September 2011, doi: 10.1587/transfun.E94.A.1826.
Abstract: The advantages of the orthogonal frequency division multiplexing (OFDM) are high spectral efficiency, resiliency to RF interference, lower multi-path distortion and others. To further utilize the vast channel capacity of the multiuser OFDM, one has to find the efficient adaptive subcarrier and bit allocation among users. In this paper, we propose a 0-1 integer programming model formulating the optimal subcarrier and bit allocation problem of the multiuser OFDM. We proved that the continuous relaxation of our formulation is tighter than the previous convex optimization formulation based on perspective function and the Lagrangian dual bound of our formulation is equivalent to the linear programming relaxation bound. The proposed Lagrangian dual is seperable with respect to subcarriers and allows an efficient dual maximization algorithm. We compared the performance of the integer programming formulation and the Lagrangian dual of our formulation and the continuous relaxation and the primal heuristic proposed in [3]. Computer simulation on a system employing M-ary quadrature amplitude modulation (MQAM) assuming a frequency-selective channel consisting of three independent Rayleigh multipaths is carried out with the optimal subcarrier and bit allocation solution generated by the 0-1 integer programming model.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.E94.A.1826/_p
Copy
@ARTICLE{e94-a_9_1826,
author={Taehyung PARK, Sungbin IM, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={The Optimal Subcarrier and Bit Allocation for Multiuser OFDM System: A Dual-Decomposition Approach},
year={2011},
volume={E94-A},
number={9},
pages={1826-1832},
abstract={The advantages of the orthogonal frequency division multiplexing (OFDM) are high spectral efficiency, resiliency to RF interference, lower multi-path distortion and others. To further utilize the vast channel capacity of the multiuser OFDM, one has to find the efficient adaptive subcarrier and bit allocation among users. In this paper, we propose a 0-1 integer programming model formulating the optimal subcarrier and bit allocation problem of the multiuser OFDM. We proved that the continuous relaxation of our formulation is tighter than the previous convex optimization formulation based on perspective function and the Lagrangian dual bound of our formulation is equivalent to the linear programming relaxation bound. The proposed Lagrangian dual is seperable with respect to subcarriers and allows an efficient dual maximization algorithm. We compared the performance of the integer programming formulation and the Lagrangian dual of our formulation and the continuous relaxation and the primal heuristic proposed in [3]. Computer simulation on a system employing M-ary quadrature amplitude modulation (MQAM) assuming a frequency-selective channel consisting of three independent Rayleigh multipaths is carried out with the optimal subcarrier and bit allocation solution generated by the 0-1 integer programming model.},
keywords={},
doi={10.1587/transfun.E94.A.1826},
ISSN={1745-1337},
month={September},}
Copy
TY - JOUR
TI - The Optimal Subcarrier and Bit Allocation for Multiuser OFDM System: A Dual-Decomposition Approach
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1826
EP - 1832
AU - Taehyung PARK
AU - Sungbin IM
PY - 2011
DO - 10.1587/transfun.E94.A.1826
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E94-A
IS - 9
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - September 2011
AB - The advantages of the orthogonal frequency division multiplexing (OFDM) are high spectral efficiency, resiliency to RF interference, lower multi-path distortion and others. To further utilize the vast channel capacity of the multiuser OFDM, one has to find the efficient adaptive subcarrier and bit allocation among users. In this paper, we propose a 0-1 integer programming model formulating the optimal subcarrier and bit allocation problem of the multiuser OFDM. We proved that the continuous relaxation of our formulation is tighter than the previous convex optimization formulation based on perspective function and the Lagrangian dual bound of our formulation is equivalent to the linear programming relaxation bound. The proposed Lagrangian dual is seperable with respect to subcarriers and allows an efficient dual maximization algorithm. We compared the performance of the integer programming formulation and the Lagrangian dual of our formulation and the continuous relaxation and the primal heuristic proposed in [3]. Computer simulation on a system employing M-ary quadrature amplitude modulation (MQAM) assuming a frequency-selective channel consisting of three independent Rayleigh multipaths is carried out with the optimal subcarrier and bit allocation solution generated by the 0-1 integer programming model.
ER -