Beruflich Dokumente
Kultur Dokumente
Abstract We present a new bit and power allocation algo- for maximizing the channel capacity. Krongold [3] used a
rithm for OFDM systems with low computational complexity. Lagrange multiplier bisection search to find the optimal bit
In order to reduce the computational complexity, we divide and power allocation effectively constrained by the constant
all subcarriers into groups, and the same number of bits is
allocated to the subcarriers in the same group. To minimize transmission power and a required bit error rate (BER).
the performance loss due to grouping, subcarriers are grouped However, because the conventional algorithms search the
according to the channel gains. Based on this scheme, the bit and number of bits and the power level allocated to every single
power allocation problem is redefined and the algorithm for the subcarrier, very large computational load is required. In this
optimal solution is proposed. Simulation results verify that the paper, in order to reduce the computational load, all subcarriers
proposed algorithm shows comparable throughput performance
in comparison to an ideal allocation algorithm while computa- are divided into subcarrier groups, and the same number of bits
tional load is significantly reduced. are allocated to the subcarriers in the same group. Under this
assumption, a bit and power allocation problem is reformulated
I. I NTRODUCTION and the algorithms for the optimal solution of the reformulated
Orthogonal frequency division multiplexing (OFDM) is a problem is proposed. Also we propose the scheme to divide
kind of a multicarrier transmission technique, which has been subcarriers in order to minimize the performance loss due to
regarded as a solution to provide broadband, high-speed data subcarrier grouping.
transmission over wireless channels. In OFDM system, the The organization of this paper is as follows. In Section II,
channel is divided into K narrowband subchannels that can we first give the system model and formulate a bit and power
be considered as parallel independent additive white Gaussian allocation problem. The optimal bit and power allocation
noise (AWGN) channels provided K is sufficiently large. So algorithm is described in Section III. In Section IV, we propose
a high-rate data stream can be obtained by means of multiple a new bit and power allocation algorithm based on subcarrier
parallel low-rate data streams, which are then simultaneously grouping and subchannel sorting. In Section V, our results are
transmitted on a number of orthogonal subcarriers. Owing to verified through Monte Carlo simulations. Finally, conclusion
this merit, OFDM systems have aroused great interest in recent is followed in Section VI.
years as potential solution to the problem of transmitting data
over wireless channels with large delay spread. II. S YSTEM M ODEL
Assuming that the transmitter knows the instantaneous chan- We consider an adaptive multi-carrier transmission sys-
nel state information, adaptive modulation can improve the tem in which the transmitter uses combined bit and power
performance significantly. In particular, subcarriers with large allocation algorithms based on the channel information. A
channel gains employ higher order modulation to carry more modulation mode for each subcarrier is selected corresponding
bits/symbol, while subcarriers in deep fade carry one or even to the number of bits allocated to the subcarrier and the symbol
zero bits/symbol. As different subcarriers experience different modulated by the selected mode is then scaled to the allocated
fades and transmit different numbers of bits, the transmit power. We define c(k) and p(k) as the number of allocated
power levels must be changed accordingly. Researchers have bits and the transmission power level of the kth subcarrier,
developed many bit and power allocation algorithms [1]-[8]. respectively.
Hughes-Hartogs algorithm [1] can be applied to minimize We denote f (c) as the required received power per a symbol
the total transmission power with the constraint of the fixed in the kth subcarrier to satisfy a given BER requirement in a
channel capacity or to maximize the channel capacity with the c bits/symbol modulation scheme. Assuming that the channel
total transmission power constraint. Chows algorithm [2] is a state information is known, the transmission power of the kth
computationally efficient bit and power allocation algorithm subcarrier can be given by
The work in this paper was supported by Korea Research Foundation(KRF). p(k) = f (c(k))/|H(k)|2 , (1)
where H(k) is the channel gain of the kth subcarrier. Thus Repeat the following RT times:
the combined bit and power allocation algorithm should find k = arg mink p(k)
the optimal assignment of c(k) so that the total transmission c(k) = c(k) + 1
power is minimized satisfying the transmission rate and BER p(k) = (f (c(k) + 1) f (c(k)))/|H(k)|2
requirements. The optimization problem can be mathemati-
cally formulated as following: Finish:
Bit allocation: c(k), k
K Power allocation: p(k) = f (c(k))/|H(k)|2 , k
min PT = f (c(k))/|H(k)|2
c(k)D
k=1
(2)
K
subject to c(k) = RT , IV. P ROPOSED A LLOCATION A LGORITHM
k=1
where D is the set of all possible values for c(k), and c(k) = The conventional greedy algorithm converges to the optimal
0 means that no information is transmitted through the kth solution, but requires very high computational complexity.
subcarrier. To reduce this complexity, we divide all subcarriers into N
groups and allocate bits to each group, not to each subcarrier.
III. O PTIMAL A LLOCATION A LGORITHM The same number of bits is allocated to all the subcarriers
As the power needed to transmit a certain number of bits in in the same group although they have different channel gain.
a subcarrier is independent of the numbers of bits allocated to However, the difference of the channel gains in a group may
other subcarriers, it turns out that a greedy approach is optimal. cause the performance loss.
A greedy algorithm assigns bits to the subcarriers one bit at a To minimize this performance loss, all subcarriers are
time, and in each assignment, the subcarrier that requires the sorted by their channel gains in ascending order. The sorted
least additional power is selected. The bit allocation process subcarriers index set is denoted as {a1 , a2 , , aK }
will be completed when all bits are assigned. The basic with elements satisfying |H(a1 )| |H(a2 )|
structure of the greedy algorithm can be described as follows: |H(aK )|. Then all subcarriers are grouped into N groups
Initialization: according to their indices. The index set of the nth group
c(k) = 0, k is {a(n1)M +1 , a(n1)M +2 , , anM }, where M = K/N ,
p(k) = (f (1) f (0))/|H(k)|2 , k and M is assumed to be an integer.
The group-based allocation problem is formulated from (2)
Sorting M=32
3
100 150 200 250 300
10 Data rate (bits/OFDM frame)
4
10
100 150 200 250 300
Data rate (bits/OFDM frame)
2
10
M=1
Sorting, M=4
1 Sorting, M=16
10
Sorting, M=32 25
0
CPU time
10
Transmit power (dB)
20
1
10
2 15
10
3 M=1
10 10
100 150 200 250 300 M=4
Data rate (bits/OFDM frame) M=16
M=32
Fig. 3. Data rate vs. CPU time
100 150 200 250 300
Data rate (bits/OFDM frame)