Low Complexity Precoded Greedy Power Allocation Algorithms for OFDM Communication Systems

In this paper, an enhanced greedy bit and power allocation algorithms for orthogonal frequency division multiplexing (OFDM) communication systems are introduced. These algorithms combine low complexity greedy power allocation algorithms with a simplified maximum ratio combining (MRC) precoding technique at the transmitter for maximizing the average data throughput of OFDM communication systems. Results of computer simulations show that precoding is an effective technique for improving the throughput performance of the proposed bit and power allocation algorithms.


Introduction
Multicarrier modulation (MCM) is a powerful transmission technique that provides improved performance in various communication fields; it introduces important benefits as efficient bandwidth optimization, enhanced spectrum utilization, low equalization complexity, and multiuser potentiality.Moreover, it is widely used in new application fields, such as power line communications (PLC) [1][2][3], and wireless local area networks (WLANs) [4][5][6] due to its recognized value to confront various channel impairments, including frequency selectivity, intersymbol interference (ISI), and impulse noise.
Two important MCM techniques that have wide spread use are OFDM [6] mainly employed in wireless applications, and discrete multitone (DMT) [7] used in wireline systems.In conventional wireless OFDM systems, all subcarriers employ the same signal constellation.However, the overall error probability is dominated by the subcarriers with the worst performance.To improve system performance and throughput, adaptive bit and power allocation algorithms can be employed, where the signal constellation size and power distribution vary according to the measured signal-to-noise ratio (SNR) values across the subcarriers [8].
The bit and power allocation is a constraint optimization problem, and generally two cases are of practical interest; rate maximization (RM) and margin maximization (MM), where the objective is the maximization of the achievable data rate or the achievable system margin, respectively.A rate-optimal algorithm known as the greedy power allocation (GPA) algorithm [9,10], of which a num-ber of different variations have emerged constraining either the average bit error rate (BER) [8] or the total power [11].For a good review of greedy algorithms, please refer to [1].Suboptimal GPA algorithms, whereby the bit and power re-allocation are performed in groups of subcarriers are proposed in [12], resulting in low complexity algorithms compared with the GPA algorithm.
An MRC precoding technique is proposed to enhance the low complexity GPA algorithms proposed in [12] for OFDM signal transmission in hostile environments and to simplify receiver complexity by transferring the signal processing to the transmitter.For high speed communications, the channel is changing faster than it can be estimated and fed back to the transmitter.So adaptive bit and power allocation algorithms perform poorly.Other means for mitigating the effect of fading should be used [13].In this paper, enhanced adaptive bit and power allocation algorithms for OFDM communication systems are introduced.These algorithms combine low complexity bit and power allocation algorithms and a simplified precoding technique at the OFDM transmitter for data throughput enhancement.The proposed system operates in time division duplex (TDD) mode in which the channel reciprocity between alterative uplink and downlink transmissions is exploited to feed the channel state information (CSI) back to the transmitter side.
The rest of this paper is organized as follows.In Section 2, the problem of bit and power allocation for OFDM system is overviewed.The proposed bit and power allocation algorithms are described in Section 3. Simulation results are given in Section 4. Finally, con-

Bit and Power Allocation for OFDM System
OFDM is a promising technique for achieving the high data rate transmission required for wireless multimedia services over time dispersive multipath channels [14].To improve the OFDM system throughput, adaptive bit and power allocations are employed.

Problem Definition
The problem of the maximization of the transmission rate over the OFDM wireless system is considered, where the multipath channel characterized by a finite impulse response (FIR) vector of order L is converted to an N-subcarriers system with different gains , 1,2,3, , n g n  N. The n th subcarrier experiencing the gain n g will be used to transmit n bits per symbol.The following constrained optimization problem must be solved to determine the optimum bit and power allocations to maximize the OFDM system throughput where n and n are the bit and power allocated to the n th subcarrier to achieve a bit error rate (BER) of , e n , t is the total power budget, and is the maximum number of permissible allocated bits per subcarrier .The n th subcarrier power to noise ratio can be defined as follows: where 0 is the noise power at the receiver, and the SNR of this subcarrier is Symbols of k b -bits, 2 k can be loaded to the subcarrier with the minimum required SNR [12,15] of where k M is the maximum permissible QAM constellation by the transmission system and is the inverse of a well-known Q function that is the tail probability of the standard normal distribution [15].The solution of the constrained optimization problem in (1) can be divided into two steps, uniform power allocation (UPA) initialization step and the GPA algorithm.Both of them are described below. 1 Q 

Uniform Power Allocation (UPA) Algorithm
The steps of UPA algorithm can be summarized as follows [12]: 1) Calculate for all and the target BER using (4).
2) Allocate the total power budget between all subcarriers, equally, as follows 3) Redistribute subcarriers according to their SNRs bounded by QAM levels and with and 4) Load subcarriers within each G k group with QAM constellation M k such that the total allocated bits of this group is with UPA 0 0 B  and the total excess power for this group 5) The total number of the system allocated bits and the used power for the UPA algorithm are The total excess power produced by the UPA algorithm is well exploited by a number of algorithms, and this represents a useful indication about the efficient utilization of the total transmit power .

Full Greedy Power Allocation (GPA) Algorithm
The GPA algorithm [1,9,10,12] is based on the initialization step described above.This algorithm performs an iterative re-distribution of the excess power of the UPA algorithm.Applying the steps described in Table 1, resulting in an overall system allocated bits and used power given, respectively, by and For each subcarrier n do the following: 3) Calculate the min.required upgrade power: GPA up min and min

The Proposed Pre-Coded Bit and Power Allocation Algorithms
Bit and power allocation algorithms for OFDM systems with equalization at the receiver have been studied in the literature.However, applying bit and power allocation algorithms with pre-coding techniques is still new, and there are a lot of open issues.In this paper, hybrid algorithms comprising the low complexity bit and power allocation algorithms in [12] and a pre-coding technique [16] will be proposed and studied.

MRC Pre-Coding Technique
A MRC pre-coding is proposed for enhancing the bit and power allocation of OFDM system as shown in Figure 1, where it is based on correcting the phase and weighting the amplitude of each subcarrier [16].The signal model of MRC Pre-coded OFDM system is described as follows .Based on the new pre-coded channel coefficients described above, UPA algorithm is re-applied to determine new subcarriers bit allocation pre-UPA k and new total excess power for each QAM level group as defined in ( 6) and (7), respectively.Three enhanced low-complexity greedy algorithms are proposed and studied to efficiently utilize the new total excess power of the Pre-UPA algorithm.These algorithms are Pre-coded QAM-Level GPA (Pre-LGPA) algorithm, Pre-coded Power Moving up GPA (Pre-MuGPA) algorithm, and Precoded Power Moving down GPA (Pre-MdGPA) algorithm.

Pre-LGPA Algorithm
The direct application of the GPA algorithm is computationally very complex, because at each iteration, exhaustive sorting and searching algorithms of all subcarriers are required as shown in Table 1.A simplified technique of the GPA algorithm can be obtained if the subcarriers are firstly divided into QAM groups , according to their SNRs.The GPA algorithm is therefore independently applied to each group k .The Pre-LGPA algorithm is well described in Table 2 where it permits upgrading to the next QAM level only and therefore may leave some left-over power , resulting in a total left-over power of The Pre-LGPA algorithm has to be executed K times, once for each QAM group resulting in an overall system that allocates bits and power according to each QAM group.This residual power can be exploited by a second stage, whereby it is proposed to move this power upwards starting from the lowest QAM group.This modifies the Pre-LGPA algorithm by considering the left-over power 0 LO P of the QAM group 0 after running the Pre-LGPA algorithm on that group, and assigning this power for redistribution to group 1 .Any left-over power after running Pre-LGPA algorithm on 1 is then passed further upwards to 2 G , and so forth.At the algorithmic iteration, the Pre-MuGPA algorithm is work-ing with k and tries to allocate the sum of the excess power missed by the Pre-UPA algorithm of that group as well as the left-over power resulting from the application of the Pre-LGPA algorithm to the previous group G  is added to the excess power of the th K QAM group to end up with a final left-over power given by: excess K P P The overall number of the system allocated bits and the used power of this algorithm are, respectively, given by: pre

Pre-Md GPA Algorithm
LO k P The residual power resulting from the Pre-LGPA algorithm can be exploited by a second algorithm called pre-coded moving down GPA (Pre-MdGPA) algorithm, whereby it is proposed to move the residual power downwards starting from the highest QAM group 1 K G  to the lowest QAM group 0 , at the k th stage this algorithm applies the Pre-LGPA algorithm for the available power that comprises both the excess power missed by the Pre-UPA algorithm of the previous QAM group The overall system allocated data bits and the used power of this algorithm are, respectively, given by:

Simulation and Discussions
In this section, computer simulations are carried out to evaluate the performance of the proposed pre-coded bit and power allocation algorithms.For comparison purpose, the non precoded bit and power allocation algorithms are also simulated.Simulation parameters are listed in Table 3. Channel coefficients are obtained from complex Gaus- sian process with zero mean and unit variance through ensemble averages across 1000 channel realizations for various levels of SNRs using QAM modulation schemes, with the maximum permissible QAM level of constellation size which is equivalent to 8 bits per data symbol The total average system throughput is studied and shown in Figures 2 and  3 for the recent (non pre-coded) [12] and proposed (precoded) bit and power allocation algorithms with 6 and 12-tabs FIR filters, respectively.
Figure 2 shows that the optimum throughput is achieved by the GPA algorithm in each of the recent and proposed algorithms.However, because of its very large computational complexity, low complexity algorithms are proposed to efficiently use the power budget.These are pre-LGPA, Pre-MuGPA and Pre-MdGPA algorithms.The two proposed MuGPA and MdGPA with and without the MRC pre-coding approach the optimum power allocation GPA algorithm in two distinct SNR regions.MuGPA performs better at low SNRs, while MdGPA performs better at higher SNRs.The proposed precoded algorithms satisfy about 250 bits per symbol throughput enhancement over the non precoded algorithms.Figure 3 shows that the throughput is improved by about 50 bits per symbol for 12-taps FIR over 6-taps FIR filters due to the multipath diversity of the MRC precoding.
Figure 4 shows the average system throughput versus target BER at SNR = 30 dB.Intuitively, throughput is   increasing with the increase of target BER.The pre-coded algorithms outperform the non precoded algorithms.The pre-MdGPA achieves about 210 bits/symbol throughput enhancement over pre-MuGPA at target BER = 10 -7 and 180 bits/symbol at BER = 10 -3 .This can be attributed to low variation with target BER for pre-coded algorithms compared with the non pre-coded algorithms.Also the pre-MdGPA is better than pre-MuGPA at all target BERs.
Figure 5 shows the used power by all algorithms as a function of the power budget at target BER 10 -3 .The UPA with and without precoding exhibits the worst performance.The other algorithms are better than UPA in utilizing the transmit power.At low SNRs, all algorithms use approximately all power budget for bit and power allocations with different throughput performance as shown in Figure 2. At high SNRs, LGPA and MuGPA algorithms with and without pre-coding approaches the UPA algorithm due to the increase of highest QAM level excess power, which is missed by both of them, and therefore deteriorates their performances.Since Figure 5 is crowded; it is subdivided into two figures; Figures 6  and 7 for the recent and the proposed algorithms, respectively.

Conclusions
The optimum solution of the discrete bit and power allocation problem is provided by the greedy algorithm, which operates across all subcarriers but it is computationally very expensive.Therefore, in this paper suboptimal low complexity alternatives have been explored in a manner in which the greedy algorithm is applied through subsets of subcarriers, which are grouped according to the QAM levels assigned to them in the uniform power allocation stage.MRC precoding is proposed to enhance the throughput performance of these low complexity    algorithms, the proposed precoded bit and power allocation algorithms outperform the non-pre-equalized algorithms and introduce less variation with target BER.Pre-MuGPA approaches GPA algorithm at low SNRs whereas Pre-MdGPA approaches GPA algorithm and outperforms Pre-MuGPA at high SNRs.
and the left-over power of the previous stage.This will finally result in a left-over power of excess 0

Figure 5 .
Figure 5.The power used (watt) with target SNR (dB) variation at target BER = 10 -3 for all algorithms.

Figure 6 .
Figure 6.The power used (watt) with target SNR (dB) variation at target BER = 10 -3 for the recent algorithms.

Figure 7 .
Figure 7.The Power used (watt) with target SNR (dB) variation at target BER = 10 -3 for the proposed algorithms.
Low Complexity Precoded Greedy Power Allocation Algorithms for OFDM Communication Systems 186 clusions are given in Section 5.