Orthogonal Frequency Division Multiple Access (OFDMA) uplink systems have been adopted generally in wireless communication in recent years. By combining Orthogonal Frequency Division Multiplexing (OFDM) with Frequency Division Multiple Access (FDMA), OFDMA systems divide all subcarriers in frequency domain into several mutually exclusive subbands, and assign the subbands to different user, transmitting different kinds of data by the orthogonality between subcarriers. The users¡¦ Carrier Frequency Offsets (CFO) caused by Doppler effects and/or misadjusted local oscillators may destroy the orthogonality between subcarriers, then lead to Multiple Access Interference (MAI) for all users, the MAI may degrade the performance of bit error rate. Several MAI suppression or cancellation schemes have been investigated to mitigate the effect of MAI, however, these schemes work on the hypothesis of known CFOs. As the result, it is the crucial issue for the multiuser CFOs estimation in OFDMA uplink systems. In this paper, we propose the Minimum Mean Square Error Criterion (MMSEC) estimation scheme to achieve multiuser CFOs estimation in Additive White Gaussian Noise (AWGN) environment. By modifying the MAI suppression weighting in [9], the MMSEC scheme search desired user¡¦s true CFO with CFO trial parameter, while the CFO trial parameter is equal to true CFO, the modified MAI suppression weighting will suppress the MAI ideally and then separate the desired user¡¦s estimated signal from received signal. Thus the distribution of estimated signal is highly concentrated in each of quadrant in the signal constellation, and it will have the minimum mean square error in each of quadrant. Compare with the MUtiple SIgnal Classification (MUSIC) scheme [12] and the Estimation of Signal Parameter via Rotational Invariance Technique (ESPRIT) scheme [13], they deal with the fully loaded problem by extending cyclic prefix, that may cause the redundant power consumption or degrade data throughput, the advantage of the MMSEC scheme is that it can works on fully load without extending cyclic prefix. Because despite fully loaded, the CFO trial parameter search desired user¡¦s true CFO in reasonable range until it causes minimum mean square error. The simulation result shows that the non-fully loaded system mean square error (MSE) performance is superior to the MUSIC and ESPRIT schees at high signal to noise ratio, while system is fully loaded, the system MSE performance is also acceptable.

La mise en œuvre de systèmes basés OFDMA nécessite une synchronisation de la fréquence très fine en raison de l'extrême sensibilité de l'OFDMA aux décalages en fréquence porteuse (CFO). La synchronisation en fréquence devient plus difficile dans les systèmes OFDMA en liaison montante. Nos objectifs comprennent l'étude et l'analyse des problèmes résultant de décalages de fréquence et la proposition de solutions pour lutter contre ces problèmes. Nous examinons d'abord les interférences résultant de décalages de fréquence porteuse présents dans l'oscillateur du terminal utilisateur. Nous démontrons que l'on doit prendre en compte le préfixe cyclique tout en analysant les interférences résultant du CFO. Ensuite, nous montrons qu'il existe une contradiction entre la diversité de fréquence de canal et la robustesse contre le CFO. Nous proposons un compromis sous la forme d'une taille de bloc de seuil, afin de permettre un bon compromis entre la diversité des canaux et de robustesse pour les CFO pour le cas où aucune connaissances du canal n'est disponible. Quand le canal est connu, nous proposons une allocation optimale par bloc grâce à laquelle la robustesse aux CFO et à la diversité de fréquence de canal peut être réalisée en utilisant une petite taille de bloc petit pour des CFO de petite valeur. Nous proposons également une valeur CFO critique, en dessous de laquelle l'allocation optimal par bloc est très performant.Ensuite, nous proposons des solutions pour deux problèmes importants rencontrés dans un système OFDMA en liaison montante.Premièrement, nous proposons une méthode efficace pour l'estimation conjointe des réponses impulsionnelles des canaux et fréquences porteuses basée sur l'approximation polynomiale.Notre méthode d'estimation conjointe est plus simple que les méthodes existantes, sans aucune dégradation de performance. Ensuite, nous proposons une méthode de compensation de CFO basée sur l'annulation des interférences successives (SIC). La méthode d'annulation proposée réduit la complexité de mise en oeuvre quand le nombre de porteuses est important. / One of the most prominent issues in the design and implementation of OFDMA based systems is the need for a very fine frequency synchronization due to the fact that OFDMA, like OFDM, is extremely sensitive to carrier frequency offsets (CFO). The task of frequency synchronization becomes more challenging in the uplink OFDMA-based systems where one OFDMA symbol is generated by the contribution of many different users. Our goals include the study and analysis of problems resulting from frequency mismatches provide solution to combat these problems. We first look at the interference resulting from CFOs, resulting from user terminal oscillator mismatch. We demonstrate that one must take into account the cyclic prefix while analyzing interference resulting from CFO. A new analytical expression of the ICI that takes into account the effect of CFO on the cyclic prefix is proposed. Then we focus our attention on analysis of the trade-off between channel frequency diversity and robustness against CFO and show that there exists a contradiction between the two. We propose a trade-off in the form of a Threshold blocksize, to allow a good compromise between the channel diversity and robustness for CFO for the case when no CSI is available. For system where CSI is available, we propose an optimal block carrier allocation scheme through which both robustness to CFO and channel frequency diversity can be achieved with small blocksize for small CFO. We also propose a Critical CFO value, above which the performance of the optimal block carrier allocation loses interest.Next we propose solutions for two important issues encountered in an uplink OFDMA system. First, we propose an efficient method for joint estimation of channel impulse responses and carrier frequency at the receiver based on polynomial approximation. Our proposed joint estimation method is simpler than the existing methods without any performance degradation. Next we propose a CFO compensation method based on successive interference cancellation. The proposed cancellation method reduces the implementation complexity faced in case of large DFT matrices.

In recent years, cellular systems based on orthogonal frequency division multiple access – time division duplex (OFDMA-TDD) have gained considerable popularity. Two of the major reasons for this are, on the one hand, that OFDMA enables the receiver to effectively cope with multipath propagation while keeping the complexity low. On the other hand, TDD offers efficient support for cell-specific uplink (UL)/downlink (DL) asymmetry demands by allowing each cell to independently set its UL/DL switching point (SP). However, cell-independent SP gives rise to crossed slots. In particular, crossed slots arise when neighbouring cells use the same slot in opposing link directions, resulting in base station (BS)-to-BS interference and mobile station (MS)-to-MS interference. BS-to-BS interference, in particular, can be quite detrimental due to the exposed location of BSs, which leads to high probability of line-of-sight (LOS) conditions. The aim of this thesis is to address the BS-to-BS interference problem in OFDMA-TDDcellular networks. A simulation-based approach is used to demonstrate the severity of BS-to-BS interference and a signal-to-interference-plus-noise ratio (SINR) equation for OFDMA is formulated to aid system performance analysis. The detrimental effects of crossed slot interference in OFDMA-TDD cellular networks are highlighted by comparing methods specifically targeting the crossed slots interference problem. In particular, the interference avoidance method fixed slot allocation (FSA) is compared against state of the art interference mitigation approaches, viz: random time slot opposing (RTSO) and zone division (ZD). The comparison is done based on Monte Carlo simulations and the main comparison metric is spectral efficiency calculated using the SINR equation formulated in this thesis. The simulation results demonstrate that when LOS conditions among BSs are present, both RTSO and ZD perform worse than FSA for all considered performance metrics. It is concluded from the results that current interference mitigation techniques do not offer an effective solution to the BS-to-BS interference problem. Hence, new interference avoidance methods, which unlike FSA, do not sacrifice the advantages of TDD are open research issues addressed in this thesis. The major contribution of this thesis is a novel cooperative resource balancing technique that offers a solution to the crossed slot problem. The novel concept, termed asymmetry balancing, is targeted towards next-generation cellular systems, envisaged to have ad hoc and multi-hop capabilities. Asymmetry balancing completely avoids crossed slots by keeping the TDD SPs synchronised among BSs. At the same time, the advantages of TDD are retained, which is enabled by introducing cooperation among the entities in the network. If a cell faces resource shortage in one link direction, while having free resources in the opposite link direction, the free resources can be used to support the overloaded link direction. In particular, traffic can be offloaded to near-by mobile stations at neighbouring cells that have available resources. To model the gains attained with asymmetry balancing, a mathematical framework is developed which is verified by Monte Carlo simulations. In addition, asymmetry balancing is compared against both ZD and FSA based on simulations and the results demonstrate the superior performance of asymmetry balancing. It can be concluded that the novel interference avoidance approach is a very promising candidate to.

We are at that moment of network evolution when we have realised that our telecommunication systems should mimic features of human kind, e.g., the ability to understand the medium and take advantage of its changes. Looking towards the future, the mobile industry envisions the use of fully automatised cells able to self-organise all their parameters and procedures. A fully self-organised network is the one that is able to avoid human involvement and react to the fluctuations of network, traffic and channel through the automatic/autonomous nature of its functioning. Nowadays, the mobile community is far from this fully self-organised kind of network, but they are taken the first steps to achieve this target in the near future. This thesis hopes to contribute to the automatisation of cellular networks, providing models and tools to understand the behaviour of these networks, and algorithms and optimisation approaches to enhance their performance. This work focuses on the next generation of cellular networks, in more detail, in the DownLink (DL) of Orthogonal Frequency Division Multiple Access (OFDMA) based networks. Within this type of cellular system, attention is paid to interference mitigation in self-organising macrocell scenarios and femtocell deployments. Moreover, this thesis investigates the interference issues that arise when these two cell types are jointly deployed, complementing each other in what is currently known as a two-tier network. This thesis also provides new practical approaches to the inter-cell interference problem in both macro cell and femtocell OFDMA systems as well as in two-tier networks by means of the design of a novel framework and the use of mathematical optimisation. Special attention is paid to the formulation of optimisation problems and the development of well-performing solving methods (accurate and fast).

This thesis proposes four novel techniques to solve the problem of growing energy consumption requirements in cellular communication networks. The first and second part of this work propose a novel energy efficient scheduling mechanism and two new bandwidth management techniques, while the third part provides an algorithm to actively manage the power state of base stations (BSs) so that energy consumption is minimized throughout the day while users suffer a minimal loss in achieved data rate performance within the system. The proposed energy efficient score based scheduler (EESBS) is based on the already existing principle of score based resource allocation. Resource blocks (RBs) are given scores based on their energy efficiency for every user and then their allocation is decided based on a comparison between the scores of the different users on each RB. Two additional techniques are introduced that allow the scheduler to manage the user’s bandwidth footprint or in other words the number of RBs allocated. The first one, bandwidth expansion mode (BEM), allows users to expand their bandwidth footprint while retaining their overall transmission data rate. This allows the system to save energy due to the fact that data rate scales linearly with bandwidth and only logarithmically with transmission power. The second technique, time compression mode (TCoM), is targeted at users whose energy consumption is dominated by signalling overhead transmissions. If the assumption is made that the overhead is proportional to the number of RBs allocated, then users who find themselves having low data rate demands can release some of their allocated RBs by using a higher order modulation on the remaining ones and thus reduce their overall energy expenditure. Moreover, a system that combines all of the aforementioned scheduling techniques is also discussed. Both theoretical and simulation results on the performance of the described systems are provided. The energy efficient hardware state control (EESC) algorithm works by first collecting statistical information about the loading of each BS during the day that is due to the particular mobility patterns of users. It then uses that information to allow the BSs to turn off for parts of the day when the expected load is low and they can offload their current users to nearby cell sites. Simplified theoretical, along with complete system computer simulation, results are included. All the algorithms presented are very straightforward to implement and are not computationally intensive. They provide significant energy consumption reductions at none to minimal cost in terms of experienced user data rate.

In wireless networks, there is an ever-increasing demand for higher system throughputs, along with growing expectation for all users to be available to multimedia and Internet services. This is especially difficult to maintain at the cell-edge. Therefore, a key challenge for future orthogonal frequency division multiple access (OFDMA)-based networks is inter-cell interference coordination (ICIC). With full frequency reuse, small inter-site distances (ISDs), and heterogeneous architectures, coping with co-channel interference (CCI) in such networks has become paramount. Further, the needs for more energy efficient, or “green,” technologies is growing. In this light, Uplink Interference Protection (ULIP), a technique to combat CCI via power reduction, is investigated. By reducing the transmit power on a subset of resource blocks (RBs), the uplink interference to neighbouring cells can be controlled. Utilisation of existing reference signals limits additional signalling. Furthermore, cell-edge performance can be significantly improved through a priority class scheduler, enhancing the throughput fairness of the system. Finally, analytic derivations reveal ULIP guarantees enhanced energy efficiency for all mobile stations (MSs), with the added benefit that overall system throughput gains are also achievable. Following this, a novel scheduler that enhances both network spectral and energy efficiency is proposed. In order to facilitate the application of Pareto optimal power control (POPC) in cellular networks, a simple feasibility condition based on path gains and signal-to-noise-plus- interference ratio (SINR) targets is derived. Power Control Scheduling (PCS) maximises the number of concurrently transmitting MSs and minimises their transmit powers. In addition, cell/link removal is extended to OFDMA operation. Subsequently, an SINR variation technique, Power SINR Scheduling (PSS), is employed in femto-cell networks where full bandwidth users prohibit orthogonal resource allocation. Extensive simulation results show substantial gains in system throughput and energy efficiency over conventional power control schemes. Finally, the evolution of future systems to heterogeneous networks (HetNets), and the consequently enhanced network management difficulties necessitate the need for a distributed and autonomous ICIC approach. Using a fuzzy logic system, locally available information is utilised to allocate time-frequency resources and transmit powers such that requested rates are satisfied. An empirical investigation indicates close-to-optimal system performance at significantly reduced complexity (and signalling). Additionally, base station (BS) reference signals are appropriated to provide autonomous cell association amongst multiple co-located BSs. Detailed analytical signal modelling of the femto-cell and macro/pico-cell layouts reveal high correlation to experimentally gathered statistics. Further, superior performance to benchmarks in terms of system throughput, energy efficiency, availability and fairness indicate enormous potential for future wireless networks.

Joint channel and rate allocation with power minimization in orthogonal frequency-division multiple access (OFDMA) has attracted extensive attention. Most of the research has dealt with the development of suboptimal but low-complexity algorithms. In this paper, the contributions comprise new insights from revisiting tractability aspects of computing the optimum solution. Previous complexity analyses have been limited by assumptions of fixed power on each subcarrier or power-rate functions that locally grow arbitrarily fast. The analysis under the former assumption does not generalize to problem tractability with variable power, whereas the latter assumption prohibits the result from being applicable to well-behaved power-rate functions. As the first contribution, we overcome the previous limitations by rigorously proving the problem's NP-hardness for the representative logarithmic rate function. Next, we extend the proof to reach a much stronger result, namely, that the problem remains NP-hard, even if the channels allocated to each user are restricted to be a consecutive block with given size. We also prove that, under these restrictions, there is a special case with polynomial-time tractability. Then, we treat the problem class where the channels can be partitioned into an arbitrarily large but constant number of groups, each having uniform gain for every individual user. For this problem class, we present a polynomial-time algorithm and provide its optimality guarantee. In addition, we prove that the recognition of this class is polynomial-time solvable. / <p>Funding Agencies|Swedish Research Council||Linkoping-Lund Excellence Center in Information Technology||Center for Industrial Information Technology of Linkoping University||</p>

In multi-cell downlink OFDMA radio network system, users in one cell would suffer from the inter-cell interference caused by frequency reuse, namely co-channel interference. For a practical system, the inter-cell interference seriously decreases the quality of communication, especially for cell-edge users. Therefore, some interference management techniques, such as resources allocation, beamforming¡Ketc., will become an important issue in this system. Therefore, how to allocate resources to enhance cell-edge user performance and total system throughput is the major problem of our research. In this thesis, for management the inter-cell interference in multi-cell downlink OFDMA radio network system, a power allocation method based on the Cross-Entropy algorithm is proposed to find the sub-optimal solution and corresponding subcarriers allocation. In the system, it is considered that a sum-rate maximization problem while satisfying the target rate of both cell-edge users and cell-interior users. The simulation results show that the proposed method can effectively reduce interference between cells, and increases the transmission performance of cell-edge users and overall system throughput.

In this thesis, One of the difficulties in the orthogonal frequency division multiple access (OFDMA) systems is the multi-user interference (MUI) induced by the carrier frequency offset (CFO). In sub-band OFDMA systems, each user occupies a consecutive and non-overlapping frequency sub-band. The pilots are usually placed at the edges of a sub-band for frequency synchronization and channel estimation. However, the both frequency synchronization and channel estimation performance are influenced seriously by the multi-user interference (MUI) induced by CFO of other users. The MUI can be reduced by inserting the guard sub-carrier between adjacent users. In this paper, a novel pilot architecture is investigated, which has the same bandwidth efficiency as the conventional guard sub-carrier insertion scheme. In addition, the proposed pilot architecture provides better carrier frequency synchronization and channel estimation performance than conventional pilot assignment. Moreover, this new pilot architecture also has MUI reduction utility.

One of the major drawbacks of multi-carrier systems is the high peak-to-average power ratio (PAPR) of the transmitted signals. In this paper, the proposed novel low-complexity selective mapping (SLM) schemes are applicable to interleaved-4 orthogonal frequency division multiple access (OFDMA) uplink systems for PAPR reduction. The novel scheme just needs one inverse fast Fourier transform (IFFT) block because that the phases of the transmitted signals in frequency domain are rotated by circular convolution with conversion vectors in time domain. Moreover, a special set of conversion vectors are proposed in novel scheme, which are not only computed with low complexity but also reduce the PAPR effectively. In proposed scheme, different conversion vectors and appropriate subcarriers mapping are picked up for different users. The scheme supplies a practicable low-complexity method for PAPR reduction in interleaved-4 OFDMA uplink systems. Besides, the bit error rate (BER) performance is as good as the SLM scheme.