Académique Documents
Professionnel Documents
Culture Documents
1, JANUARY 2008
Abstract— The present correspondence deals with the rate and In this paper, we aim at finding a rate allocation to sub-
power allocation problem in multiuser orthogonal frequency carriers in a multiuser OFDM system which minimizes the
division multiple (OFDM) access systems. We first derive the total power consumption under the constraints that each user
solution of the single user OFDM power allocation problem
explicitly for a class of general rate-power functions by means receives the required minimum transmission rate. A single
of directional derivatives. This solution is employed for both transmitter and K receivers are considered. A new heuristic,
designing a new heuristic and obtaining bounds in a branch-and- named SUSI (successive user integration), and a branch-and-
bound algorithm for allocating power to subcarriers. The branch- bound algorithm are developed which utilize perfect channel
and-bound algorithm is used for performance evaluation of our state information (CSI) for assigning power to subcarriers.
new and two known power allocation heuristics by computing
the exact optimum, given the number of allocated subcarriers As a preparatory step, the single user OFDM problem is
per user. identified by help of directional derivatives for a general class
Index Terms— Multiuser channels, generalized water-filling,
of rate-power functions as generalized water-filling (cf. [10]),
directional derivatives. weighted by the derivative of the rate-power function. This
solution is used as a building block in our new heuristic
and, furthermore, to obtain bounds in the branch-and-bound
I. I NTRODUCTION
algorithm.
RTHOGONAL frequency division multiplexing
O (OFDM) is expected to be the transmission technology
of next generation mobile radio networks. The advantages
The material in this contribution is organized as follows.
We start with a precise problem formulation in Section II. The
single user OFDM optimal rate allocation problem is solved
of OFDM are flexibility of allocating subcarriers to users, in Section III by help of directional derivatives. Section IV
adaptive power allocation, high spectral efficiency, low introduces the new heuristic SUSI. Section V deals with the
receiver complexity and simple implementation by the inverse design of a branch-and-bound algorithm, which is tested and
fast Fourier transform (IFFT) and FFT, see [1], [2]. OFDM numerically evaluated on different problems in Section VI.
can also be integrated with multiple-input multiple-output
(MIMO) techniques to raise the diversity gain and increase
capacity, see [1], [3]. Further, OFDM has the advantage of II. S YSTEM M ODEL AND P ROBLEM F ORMULATION
mitigating the effect of inter-symbol interference (ISI) in high We consider a multiuser OFDM system with N subcarriers
speed wireless communications. and K users. Each user k ∈ {1, . . . , K} has a requirement of
One of the crucial problems is rate and power allocation of Rk bits per OFDM symbol, where Rk is a nonnegative real
users to subcarriers in the available frequency band. Various number. Each subcarrier can be used by only one user at any
studies have devised resource allocation algorithms. In [4], given time.
a greedy bit-removing algorithm is proposed and proven to
Perfect channel state information is assumed to be available
be optimal. However, it has a fairly high complexity and is
during transmission. Let hk,n denote the known channel gain
almost inapplicable for practical applications. Fast heuristic 2
of subcarrier n for user k, and σk,n the according noise power.
approaches are suggested in [5], [6], [7], [8]. Greedy al- 2
Hence, uk,n = hk,n /σk,n is the unit signal-to-noise ratio
gorithms are used both to determine how many and which
(SNR). If power pk,n is expended on subcarrier n for the
subcarriers are assigned to each user. However, the result
transmission to user k, then
is often not unique and sometimes unstable. The branch-
and-bound principle is applied in [9] to tackle two classes hk,n
pk,n 2 = pk,n uk,n
of problems, the minimization of the total transmit power σk,n
and the maximization of data throughput. The computational
complexity compared to exhaustive search is significantly is the received power.
reduced, however, computational results are presented only The interrelation between power and rate is described by
for small problem sizes up to six channels and four users. the
nonnegative
rate-power function ψ : R+ → R+ . Hence,
ψ rk,n denotes the received power which is needed to
Manuscript received August 9, 2006; accepted November 2, 2006. The transmit at rate rk,n over subcarrier n. It is quite natural
associate editor coordinating the review of this paper and approving it for
publication was V. Lau. This work was partly supported by DFG grant Ma to assume that ψ is monotone increasing and convex with
1184/11-3. ψ(0) = 0, for a conclusive motivation of these properties see
The authors are with the Institute for Theoretical Information Technology, [9], [11]. Function ψ depends on the minimum bit error rate
RWTH Aachen University, 52056 Aachen, Germany (e-mail: {feiten, mathar,
reyer}@ti.rwth-aachen.de). (BER) that can be tolerated and the modulation and coding
Digital Object Identifier 10.1109/TWC.2008.060559. scheme.
1536-1276/08$25.00
c 2008 IEEE
Authorized licensed use limited to: VELLORE INSTITUTE OF TECHNOLOGY. Downloaded on August 4, 2009 at 06:47 from IEEE Xplore. Restrictions apply.
IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, VOL. 7, NO. 1, JANUARY 2008 61
The objective now is to find a subcarrier assignment of Condition (4) holds if and only if the minimum on the right
minimum total transmit power such that each user receives hand side is attained for all addends on the left with positive
the required data rate. In mathematical terms this reads as r̂i . In summary, we have shown that rate allocation r̂ ∈ R is
K N optimal if and only if
ψ(rk,n )
min (1) ψ (r̂i ) ψ (r̂j )
n=1
k=1
uk,n = min for all i with r̂i > 0. (5)
ui 1≤j≤N uj
such that
N In order to construct an explicit solution, equation (5) is
rk,n = Rk , k = 1, . . . , K further evaluated. Let
n=1 ψ −1 (λui ), if λui > ψ (0)
N r̂i = ,
rk,n r,n = 0, k, = 1, . . . , K, k = 0, otherwise
N
(6)
n=1
rk,n ≥ 0, k = 1, . . . , K, n = 1, . . . , N λ such that r̂i = R.
i=1
Problem (1) is a complicated mixed continuous and com-
ψ (0) is understood as the right sided derivative of the convex
binatorial optimization problem since a joint decision on rate-power function ψ at 0, which exists. Any r̂ satisfying (6)
subcarrier and power allocation has to be made. is optimal since ψ (r̂i ) = λui , i.e., ψ (r̂i )/ui = λ is constant
In case that there is only one user (K = 1) the problem for all i with r̂i > 0. Otherwise, ψ (0)/ui ≥ λ holds such
becomes much easier. In the following, we give an explicit that λ = min1≤j≤N ψ (rj )/uj follows. Hence, condition (4)
solution to the single user OFDM problem, which will be em- is fulfilled, which shows optimality.
ployed later as a building block for a new effective heuristic, The following example visualizes the above principles. Let
and moreover for deriving bounds in the branch-and-bound the rate-power function, its derivative and inverse be given as
algorithm on the full OFDM assignment problem. Directional (cf. [9])
derivatives turn out to be a powerful tool for this purpose.
ψ(r) = a 2r − 1 ,
III. S INGLE U SER OFDM ψ (r) = a(ln 2)2r , (7)
We use the directional derivative Df (x̂, x) at x̂ in the ψ −1 (y) = log2 y/(a ln 2) .
direction of x for optimizing convex functions f over a convex Parameter a > 0 depends on the coding and modulation
domain C, for a definition see, e.g., [12]. The minimum scheme and the minimum acceptable bit error rate. Note that
of some convex function f is attained at x̂ if and only if the location of the minimum is independent of a.
Df (x̂, x) ≥ 0 for all x ∈ C, for a proof see [12]. The single The subsequent procedure determines water-filling solu-
user power assignment problem is embedded into the above tion (6) for rate-power functions of type (7). Let U m =
general framework by setting {j1 , . . . , jm } denote the set of indices corresponding to the
m largest SNRs uj1 ≥ · · · ≥ ujm and um = (uj1 , . . . , ujm ).
R = r = (r1 , . . . , rN ) | ri ≥ 0, N
i=1 ri = R , gMean(um ) and hMean(um ) denote the geometric and har-
the admissible rate region. The allocation problem then reads monic mean, respectively, of the components of um . Let
m̂
ujm
as be the largest m ≤ N such that log2 gMean(um ) 2R/m is
N
ψ(ri ) positive. Then m̂ represents the number of positive rates from
min . (2) the optimum solution (6), which is given as
r∈R ui
i=1
ui R/m̂
Since rate-power function ψ : R+ → R+ is assumed to log2 gMean(u m̂ ) 2 , if i ∈ U m̂
ri = ,
be nonnegative, monotone
N ψ(rincreasing and convex on R+ , the 0, otherwise
i)
(8)
function f (r) = i=1 ui is convex as well. Hence, the a ln(2) R/m̂
directional derivative of f exists, and for differentiable ψ it is λ= 2
gMean(um̂ )
easily determined as
with minimal power
N
ψ (r̂i ) ψ(ri )
Df (r̂, r) = (ri − r̂i ). (3) 1 R 1
ui = am̂ 2 m̂ − . (9)
i=1 m̂
ui gMean(um̂ ) hMean(um̂ )
i∈U
Now, some rate allocation r̂ ∈ R is optimal if and only
if Df (r̂, r) ≥ 0 for all r ∈ R. Applying this condi- IV. A S UCCESSIVE U SER I NTEGRATION A LGORITHM
tion to (3) yields that r̂ ∈ R is optimal if and only if (SUSI)
N ψ (r̂i )
minr∈R i=1 ui ri is attained at r̂. The minimum Once subcarriers are assigned to users, the optimum rate
amounts to R · min1≤j≤N ψ (r̂j )/uj such that r̂ ∈ R is and power allocation is easily determined by applying the
optimal if and only if results of Section III. Solution (6), with special case (9), is
N now used as a building block for a heuristic algorithm which
ψ (r̂i ) ψ (r̂j )
r̂i = R min . (4) first affiliates users into the system and then locally exchanges
ui 1≤j≤N uj user subcarriers to improve power consumption.
i=1
Authorized licensed use limited to: VELLORE INSTITUTE OF TECHNOLOGY. Downloaded on August 4, 2009 at 06:47 from IEEE Xplore. Restrictions apply.
62 IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, VOL. 7, NO. 1, JANUARY 2008
TABLE I TABLE II
PARAMETERS FOR CHANNEL SIMULATIONS AND NUMERICAL P ERCENTAGE VALUES BY WHICH THE HEURISTICS EXCEED THE
EVALUATIONS . SOLUTION BY BB.
0.1
by the authors and led to significant improvements.
0.09 RC−3
SUSI
0.08 R EFERENCES
0.07
[1] C. Dubuc, D. Starks, T. Creasy, and Y. Hou, “A MIMO-OFDM prototype
for next-generation wireless WANs,” IEEE Commun. Mag., vol. 42, pp.
Exceed Minimum
0.06
82–87, Dec. 2004.
0.05 [2] A. Jamalipour, T. Wada, and T. Yamazato, “A tutorial on multiple
access technologies beyond 3G mobile networks,” IEEE Commun. Mag.,
0.04 vol. 43, pp. 110–117, Feb. 2005.
[3] Y. Zhang and K. Letaief, “An efficient resource-allocation scheme
0.03 for spatial multiuser access in MIMO/OFDM systems,” IEEE Trans.
Commun., vol. 53, pp. 107–116, Jan. 2005.
0.02 [4] A. Fasano, “On the optimal discrete bit loading for multicarrier systems
with constraints,” in Proc. IEEE VTC’03, April 2003, pp. 915–919.
0.01
[5] D. Kivanc, G. Li, and H. Liu, “Computationally efficient bandwidth
0 allocation and power control for OFDMA,” IEEE Trans. Wireless
0 200 400 600 800 1000 Commun., vol. 2, no. 6, pp. 1150–1158, Nov. 2003.
Number [6] C. Mohanram and S. Bhashyam, “A sub-optimal joint subcarrier and
power allocation algorithm for multiuser OFDM,” IEEE Commun. Lett.,
vol. 9, no. 8, pp. 685–687, Aug. 2005.
Fig. 1. Scenario 3/20: ordered values of the relative deviation from the [7] H. Rohling, K. Brüninghaus, and R. Grünheid, “Comparison of multiple
solution by BB of algorithms RC-3 and SUSI. access schemes for an OFDM downlink system,” in Multi-Carrier
Spread Spectrum, K. Fazel and G. Fettweis, Eds. Norwell, MA: Kluwer,
1997, pp. 23–30.
is about 1.4% worse. It can be seen that SUSI roughly halves [8] L. Wang and Z. Niu, “An efficient rate and power allocation algorithm
these values over the whole range, and in approximately 400 for multiuser OFDM systems,” IEICE Trans. Commun., vol. E88-B,
no. 12, pp. 4686–4689, Dec. 2005.
cases nearly meets the conditional optimum. [9] Z. Mao, X. Wang, and J. Lin, “Fast optimal radio resource allocation
To summarize the results of the benchmarking tests, we note in OFDMA system based on branch-and-bound method,” in Proc. IEEE
that the new heuristic SUSI remarkably outperforms RC-3 Pac. Rim Conf. on Commun., Comput.and Signal Process., Aug. 2005,
in cases where there are only a few users competing for pp. 348–351.
subcarriers. Algorithm SUSI behaves moderately worse than [10] T. Cover and J. Thomas, Elements of Information Theory. New York:
Wiley, 1991.
RC-3 if the number of users is increased. The computational [11] C. Wong, R. Cheng, K. Letaief, and R. Murch, “Multiuser OFDM with
complexity of SUSI is slightly less than RC-3. The low adaptive subcarrier, bit, and power allocation,” IEEE J. Select. Areas
linear complexity algorithm ACG yields results of low quality Commun., vol. 17, no. 10, pp. 1747–1758, Oct. 1999.
[12] P. Whittle, “Some general points in the theory of optimal experimental
throughout the whole range of examples. design,” J. Roy. Statist. Soc. B, vol. 35, pp. 123–130, 1973.
It should be mentioned that different heuristics for resource [13] A. Saleh and R. Valenzuela, “A statistical model for indoor multipath
and subcarrier allocation may be combined and the minimum propagation,” IEEE J. Select. Areas Commun., vol. SAC-5, no. 2, pp.
result may be taken as the optimum. This has been carried out 128–136, Feb. 1987.
Authorized licensed use limited to: VELLORE INSTITUTE OF TECHNOLOGY. Downloaded on August 4, 2009 at 06:47 from IEEE Xplore. Restrictions apply.