Method for allocating subchannels in an OFDMA mobile communication system

• US 20050180354A1
• Filed: 11/24/2004
• Published: 08/18/2005
• Est. Priority Date: 11/25/2003
• Status: Active Grant

• Current Assignee: Korea Advanced Institute of Science and Technology, Samsung Electronics Co. Ltd.
• Original Assignee: Samsung Electronics Co. Ltd.
• Inventors: Cho, Yoon-Ok, Jung, Young-Ho, Nam, Seung-Hoon, Lee, Yong-Hoon, Kim, Eung-Sun, Hwang, Chan-Soo, Lee, Jong-Hyeuk, Chung, Jae-Hak
• Granted Patent: US 7,411,924 B2
• Time in Patent Office: Days
• US Class Current: 370/328
• CPC Class Codes: H04L 1/0003 by switching between different modulation schemes
• CPC Class Codes: H04L 1/0015 characterised by the adaptation strategy
• CPC Class Codes: H04L 5/0044 allocation of payload
• CPC Class Codes: H04L 5/023 Multiplexing of multicarrier modulation signals multicarrier modulation H04L27/2601

Abstract

An adaptive modulation scheme relating to an RA problem for maximizing the transmission rates of all users for maximum transmission rates in an OFDMA system including some users requiring to use services at fixed data rates. The scheme proposes introduction of an adaptive modulation using linear programming into an existing scheme for a system including a single kind of users, thereby enabling simultaneous execution of the adaptive modulation for all users in a system including two kinds of users. Further, the invention proposes another scheme of sequentially allocating subchannels to the users when the fixed transmission rate has a sufficiently small value, in order to reduce the complexity.

Claims

1. A method for allocating subchannels and bits to users in a mobile communication system including users requiring services of fixed transmission rates and users requiring services of variable transmission rates, for adaptive modulation, the method comprising the steps of:

determining a real number {z, c_k} using a Lagrange Multiplier Method, the real number {z, c_k} maximizing an objective equation in order to reconstruct a variable rate adaptive problem into a delivery problem;

solving the delivery problem through linear programming and allocating subchannels the users; and

allocating bits the subchannels allocated to the users using a Greedy Algorithm,

wherein the Lagrange Multiplier Method is based on

$\underset{z,c_k}{\max }<br><br>\left(z,c_k,\mathrm{\lambda <br><br>},\mathrm{\mu <br><br>}\right)=z-\mathrm{\lambda <br><br>}<br><br>\left(\underset{{\mathrm{k\epsilon <br><br>U}}_{\mathrm{Fixed}}}{\sum <br><br>}<br><br>\text{\hspace{1em}<br><br>}<br><br>f_k<br><br>\left(c_k\right)·<br><br>R_M/{\mathrm{\alpha <br><br>}}_k^2<br><br>c_k+\underset{{\mathrm{k\epsilon <br><br>U}}_{\mathrm{RA}}}{\sum <br><br>}<br><br>\text{\hspace{1em}<br><br>}<br><br>f_k<br><br>\left(c_k\right)·<br><br>z/{\mathrm{\alpha <br><br>}}_k^2<br><br>c_k-P_T\right)-\mathrm{\mu <br><br>}<br><br>\left(\underset{{\mathrm{k\epsilon <br><br>U}}_{\mathrm{Fixed}}}{\sum <br><br>}<br><br>\text{\hspace{1em}<br><br>}<br><br>R_M/c_k+\underset{{\mathrm{k\epsilon <br><br>U}}_{\mathrm{RA}}}{\sum <br><br>}<br><br>\text{\hspace{1em}<br><br>}<br><br>z/c_k-N\right)$

wherein c_k denotes a number of bits to be allocated to a k-th user, R_k denotes a k-th user'"'"'s data rate, P_T denotes total allocated power, U_Fixed denotes a number of users requiring services of fixed transmission rates, U_RA denotes a number of users requiring services of variable transmission rates, ƒ

_k(c_k) denotes the K-th user'"'"'s transmission power required for transmission satisfying a desired BER at a reception-side when a channel gain is 1, N denotes a number of the total subchannels, α

_k denotes a k-th user'"'"'s channel gain, and λ and

μ

are parameters.

2. The method as claimed in claim 1, wherein same bits are allocated to the subchannels allocated to the users.

3. The method as claimed in claim 1, wherein the bits are first allocated to the users requiring the services of the fixed transmission rates and next to the users requiring the services of the variable transmission rates.

4. A method for allocating subchannels and bits to first users and second users in a mobile communication system for adaptive modulation, the first users requiring services of fixed transmission rates and the second users requiring services of variable transmission rates, the method comprising the steps of:

(1) allocating subchannels and bits to the second users;

(2) determining an initial number N_MA of subchannels to be allocated to the first users;

(3) releasing the initial number N_MA of subchannels from among the subchannels allocated to the second users;

(4) reallocating the released subchannels to the first users;

(5) allocating bits for the first users to reallocated subchannels; and

(6) repeating steps 3 through 5 a predetermined number of times.

5. The method as claimed in claim 4, wherein, in step 3, the initial number of subchannels are released according to a sequence in which a subchannel having a lowest channel quality precedes other channels.

6. The method as claimed in claim 4, wherein, in step 2, the initial number N_MA is determined by

$N_{\mathrm{MA}}=\sum _{}$

kε

U Fixed ⁢

 

⁢

n k = ∑

kε

U Fixed ⁢

 

⁢

R M / c k *

wherein c_k denotes a number of bits to be allocated to a k-th user, R_k denotes a k-th user'"'"'s data rate, and U_Fixed denotes a number of the first users requiring services of fixed transmission rates.

7. The method as claimed in claim 4, wherein c_k is obtained by applying parameters (λ

, μ

) to

$\begin{array}{c}\underset{c_k,z}{\max }<br><br>\left(z,c_k,\mathrm{\lambda <br><br>},\mathrm{\mu <br><br>}\right)<br><br>=z-\mathrm{\lambda <br><br>}<br><br>\left(\underset{k=1}{\overset{K_1}{\sum <br><br>}}<br><br>\text{\hspace{1em}<br><br>}<br><br>f_k<br><br>\left(c_k\right)·<br><br>R_M/{\mathrm{\alpha <br><br>}}_k^2<br><br>c_k+\underset{k=1}{\overset{K_2}{\sum <br><br>}}<br><br>\text{\hspace{1em}<br><br>}<br><br>f_k<br><br>\left(c_k\right)·<br><br>z/{\mathrm{\alpha <br><br>}}_k^2<br><br>c_k-P_T\right)-\\ <br><br>\mathrm{\mu <br><br>}<br><br>\left(\underset{k=1}{\overset{K_1}{\sum <br><br>}}<br><br>\text{\hspace{1em}<br><br>}<br><br>R_M/c_k+\underset{k=1}{\overset{K_2}{\sum <br><br>}}<br><br>\text{\hspace{1em}<br><br>}<br><br>z/c_k-N\right)\\ <br><br>\approx <br><br>z_1-{\mathrm{\lambda <br><br>}}_1<br><br>\left(\underset{k=1}{\overset{K_2}{\sum <br><br>}}<br><br>\text{\hspace{1em}<br><br>}<br><br>f_k<br><br>\left(c_k\right)·<br><br>z_1/{\mathrm{\alpha <br><br>}}_k^2<br><br>c_k-P_T\right)-{\mathrm{\mu <br><br>}}_1<br><br>\left(\underset{k=1}{\overset{K_2}{\sum <br><br>}}<br><br>\text{\hspace{1em}<br><br>}<br><br>z_1/c_k-N\right),\end{array}$

wherein P_T denotes a total allocated power, K₁ denotes a number of the first users requiring services of fixed transmission rates, K₂ denotes a number of the second users requiring services of variable transmission rates, ƒ

_k(c_k) denotes the K-th user'"'"'s transmission power required for transmission satisfying a desired BER at a reception-side when a channel gain is 1, N denotes a number of the total subchannels, and α

_k denotes a k-th user'"'"'s channel gain.

8. An apparatus for transmitting data to users through adaptive modulation in a mobile communication system including users requiring services of fixed transmission rates and users requiring services of variable transmission rates, the apparatus comprising:

a subchannel allocation and bit loading algorithm unit for determining a real number {z, c_k} that maximizes an objective equation using a Lagrange Multiplier Method in order to reconstruct a variable rate adaptive problem into a delivery problem, solving the delivery problem through linear programming and allocating subchannels to each of the users, and allocating bits to the subchannels allocated to the users by using a Greedy Algorithm;

an adaptive modulator for adaptively modulating user data by means of the subchannels and bits allocated to the users and separately outputting the data for the allocated subchannels; and

an Inverse Fast Fourier Transform (IFFT) unit for converting the separated user data into a time domain signal and outputting the time domain signal as a signal sequence,

wherein the Lagrange Multiplier Method is based on

$\underset{z,c_k}{\max }<br><br>\left(z,c_k,\mathrm{\lambda <br><br>},\mathrm{\mu <br><br>}\right)=z-\mathrm{\lambda <br><br>}<br><br>\left(\underset{{\mathrm{k\epsilon <br><br>U}}_{\mathrm{Fixed}}}{\sum <br><br>}<br><br>\text{\hspace{1em}<br><br>}<br><br>f_k<br><br>\left(c_k\right)·<br><br>R_M/{\mathrm{\alpha <br><br>}}_k^2<br><br>c_k+\underset{{\mathrm{k\epsilon <br><br>U}}_{\mathrm{RA}}}{\sum <br><br>}<br><br>\text{\hspace{1em}<br><br>}<br><br>f_k<br><br>\left(c_k\right)·<br><br>z/{\mathrm{\alpha <br><br>}}_k^2<br><br>c_k-P_T\right)-\mathrm{\mu <br><br>}<br><br>\left(\underset{{\mathrm{k\epsilon <br><br>U}}_{\mathrm{Fixed}}}{\sum <br><br>}<br><br>\text{\hspace{1em}<br><br>}<br><br>R_M/c_k+\underset{{\mathrm{k\epsilon <br><br>U}}_{\mathrm{RA}}}{\sum <br><br>}<br><br>\text{\hspace{1em}<br><br>}<br><br>z/c_k-N\right)$

wherein c_k denotes a number of bits to be allocated to a k-th user, R_k denotes a k-th user'"'"'s data rate, P_T denotes a total allocated power, U_Fixed denotes a number of users requiring services of fixed transmission rates, U_RA denotes a number of users requiring services of variable transmission rates, ƒ

_k(c_k) denotes the K-th user'"'"'s transmission power required for transmission satisfying a desired BER at a reception-side when a channel gain is 1, N denotes a number of the total subchannels, a k denotes a k-th user'"'"'s channel gain, and λ and

μ

are parameters.

9. The apparatus as claimed in claim 8, wherein the subchannel allocation and bit loading algorithm unit allocates same bits to the subchannels allocated to the users.

10. The apparatus as claimed in claim 8, wherein the subchannel allocation and bit loading algorithm unit first allocates the bits to the users requiring the services of the fixed transmission rates and next to the users requiring the services of the variable transmission rates.

11. An apparatus for transmitting data to users through adaptive modulation in a mobile communication system including first users requiring services of fixed transmission rates and second users requiring services of variable transmission rates, the apparatus comprising:

a subchannel allocation and bit loading algorithm unit for allocating subchannels and bits to the second users, determining an initial number of subchannels to be allocated to the first users, releasing the initial number of subchannels from among the subchannels allocated to the second users, reallocating the released subchannels to the first users, and allocating bits for the first users to reallocated subchannels;

an adaptive modulator for adaptively modulating user data by means of the subchannels and bits allocated to the users and separately outputting the data for each of the allocated subchannels; and

an Inverse Fast Fourier Transform (IFFT) unit for converting the separated user data into a time domain signal and outputting the time domain signal as a signal sequence,

wherein the subchannel allocation and bit loading algorithm unit repeats the process from the releasing of the initial number of subchannels to the allocation of the bits a predetermined number of times.

12. The apparatus as claimed in claim 11, wherein the subchannel allocation and bit loading algorithm unit releases the initial number of subchannels according to a sequence in which a subchannel having a lowest channel quality precedes other channels.

13. The apparatus as claimed in claim 11, wherein the subchannel allocation and bit loading algorithm unit determines the initial number N_MA by

$N_{\mathrm{MA}}=\sum _{}$

kε

U Fixed ⁢

 

⁢

n k = ∑

kε

U Fixed ⁢

 

⁢

R M / c k * ,

wherein c_k denotes a number of bits to be allocated to a k-th user, R_k denotes a k-th user'"'"'s data rate, and U_Fixed denotes a number of the first users requiring services of fixed transmission rates.

14. The apparatus as claimed in claim 13, wherein c_k is obtained by applying parameters (λ

, μ

) to

$\begin{array}{c}\underset{c_k,z}{\max }<br><br>\left(z,c_k,\mathrm{\lambda <br><br>},\mathrm{\mu <br><br>}\right)<br><br>=z-\mathrm{\lambda <br><br>}<br><br>\left(\underset{k=1}{\overset{K_1}{\sum <br><br>}}<br><br>\text{\hspace{1em}<br><br>}<br><br>f_k<br><br>\left(c_k\right)·<br><br>R_M/{\mathrm{\alpha <br><br>}}_k^2<br><br>c_k+\underset{k=1}{\overset{K_2}{\sum <br><br>}}<br><br>\text{\hspace{1em}<br><br>}<br><br>f_k<br><br>\left(c_k\right)·<br><br>z/{\mathrm{\alpha <br><br>}}_k^2<br><br>c_k-P_T\right)-\\ <br><br>\mathrm{\mu <br><br>}<br><br>\left(\underset{k=1}{\overset{K_1}{\sum <br><br>}}<br><br>\text{\hspace{1em}<br><br>}<br><br>R_M/c_k+\underset{k=1}{\overset{K_2}{\sum <br><br>}}<br><br>\text{\hspace{1em}<br><br>}<br><br>z/c_k-N\right)\\ <br><br>\approx <br><br>z_1-{\mathrm{\lambda <br><br>}}_1<br><br>\left(\underset{k=1}{\overset{K_2}{\sum <br><br>}}<br><br>\text{\hspace{1em}<br><br>}<br><br>f_k<br><br>\left(c_k\right)·<br><br>z_1/{\mathrm{\alpha <br><br>}}_k^2<br><br>c_k-P_T\right)-{\mathrm{\mu <br><br>}}_1<br><br>\left(\underset{k=1}{\overset{K_2}{\sum <br><br>}}<br><br>\text{\hspace{1em}<br><br>}<br><br>z_1/c_k-N\right),\end{array}$

wherein P_T denotes a total allocated power, K₁ denotes a number of the first users requiring services of fixed transmission rates, K₂ denotes a number of the second users requiring services of variable transmission rates, ƒ

_k(c_k) denotes the K-th user'"'"'s transmission power required for transmission satisfying a desired BER at a reception-side when a channel gain is 1, N denotes a number of the total subchannels, and α

_k denotes a k-th user'"'"'s channel gain.

15. An apparatus for receiving user data transmitted through adaptive modulation in a mobile communication system including users requiring services of fixed transmission rates and users requiring services of variable transmission rates, the apparatus comprising:

a Fast Fourier Transform (FFT) unit for dividing the user data for each subchannel and converting divided user data streams into frequency domain signals;

a subchannel allocation and bit loading algorithm unit for determining a real number {z, c_k} using a Lagrange Multiplier Method, which maximizes an objective equation in order to reconstruct a variable rate adaptive problem into a delivery problem, solving the delivery problem through linear programming and allocating subchannels to each of the users, and allocating bits to the subchannels allocated to the users using a Greedy Algorithm; and

an adaptive demodulator for adaptively demodulating the user data streams of the frequency domain by using the allocated subchannels and bits,

wherein the Lagrange Multiplier Method is based on

$\underset{\stackrel{.}{z},{\stackrel{.}{c}}_k}{\max }<br><br>\left(z,c_k,\mathrm{\lambda <br><br>},\mathrm{\mu <br><br>}\right)=z-\mathrm{\lambda <br><br>}<br><br>\left(\underset{k\in <br><br>U_{\mathrm{Fixed}}}{\sum <br><br>}<br><br>f_k<br><br>\left(c_k\right)·<br><br>R_M/{\mathrm{\alpha <br><br>}}_k^2<br><br>c_k+\underset{k\in <br><br>U_{\mathrm{RA}}}{\sum <br><br>}<br><br>f_k<br><br>\left(c_k\right)·<br><br>z/{\mathrm{\alpha <br><br>}}_k^2<br><br>c_k-P_T\right)-\mathrm{\mu <br><br>}<br><br>\left(\underset{k\in <br><br>U_{\mathrm{Fixed}}}{\sum <br><br>}<br><br>R_M/c_k+\underset{k\in <br><br>U_{\mathrm{RA}}}{\sum <br><br>}<br><br>z/c_k-N\right)$

wherein c_k denotes a number of bits to be allocated to a k-th user, R_k denotes a k-th user'"'"'s data rate, P_T denotes a total allocated power, U_Fixed denotes a number of users requiring services of fixed transmission rates, U_RA denotes a number of users requiring services of variable transmission rates, ƒ

_k(c_k) denotes the K-th user'"'"'s transmission power required for transmission satisfying a desired BER at a reception-side when a channel gain is 1, N denotes a number of the total subchannels, α

_k denotes a k-th user'"'"'s channel gain, and λ and

μ

are parameters.