Distributed Resource Allocation Assisted by Intercell Interference Mitigation in Downlink Multicell MC DS-CDMA Systems

This paper investigates the allocation of resources, including subcarriers and spreading codes, as well as intercell interference (ICI) mitigation for multicell downlink multicarrier direct-sequence code division multiple-access systems, which aim to maximize the system's spectral efficiency (SE). The analytical benchmark scheme for resource allocation and ICI mitigation is derived by solving or closely solving a series of mixed integer non-convex optimization problems. Based on the optimization objectives the same as the benchmark scheme, we propose a novel distributed resource allocation assisted by ICI mitigation scheme referred to as resource allocation assisted by ICI mitigation (RAIM), which requires very low implementation complexity and demands little backhaul resource. Our RAIM algorithm is a fully distributed algorithm, which consists of the subcarrier allocation (SA) algorithm named RAIM-SA, spreading code allocation (CA) algorithm called RAIM-CA and the ICI mitigation algorithm termed RAIM-IM. The advantages of the RAIM are that its CA only requires limited binary ICI information of intracell channels, and it is able to make mitigation decisions without any knowledge of ICI information. Our simulation results show that the proposed RAIM scheme, with very low complexity required, achieves significantly better SE performance than other existing schemes, and its performance is very close to that obtained by the benchmark scheme

Distributed Resource Allocation Assisted by Intercell Interference Mitigation in Downlink Multicell MC DS-CDMA Systems

This paper investigates the allocation of resources, including subcarriers and spreading codes, as well as intercell interference (ICI) mitigation for multicell downlink multicarrier direct-sequence code division multiple-access systems, which aim to maximize the system's spectral efficiency (SE). The analytical benchmark scheme for resource allocation and ICI mitigation is derived by solving or closely solving a series of mixed integer non-convex optimization problems. Based on the optimization objectives the same as the benchmark scheme, we propose a novel distributed resource allocation assisted by ICI mitigation scheme referred to as resource allocation assisted by ICI mitigation (RAIM), which requires very low implementation complexity and demands little backhaul resource. Our RAIM algorithm is a fully distributed algorithm, which consists of the subcarrier allocation (SA) algorithm named RAIM-SA, spreading code allocation (CA) algorithm called RAIM-CA and the ICI mitigation algorithm termed RAIM-IM. The advantages of the RAIM are that its CA only requires limited binary ICI information of intracell channels, and it is able to make mitigation decisions without any knowledge of ICI information. Our simulation results show that the proposed RAIM scheme, with very low complexity required, achieves significantly better SE performance than other existing schemes, and its performance is very close to that obtained by the benchmark scheme

Novel subcarrier-allocation schemes for downlink MC DS-CDMA systems

This paper addresses the subcarrier allocation in downlink multicarrier direct-sequence code-division multiple access (MC DS-CDMA) systems, where one subcarrier may be assigned to several users who are then distinguished from each other by their unique direct-sequence spreading codes. We first analyze the advantages and shortcomings of some existing subcarrier-allocation algorithms in the context of the MC DS-CDMA. Then, we generalize the worst subcarrier avoiding (WSA) algorithm to a so-called worst case avoiding (WCA) algorithm, which achieves better performance than the WSA algorithm. Then, the WCA algorithm is further improved to a proposed worst case first (WCF) algorithm. Furthermore, we propose an iterative worst excluding (IWE) algorithm, which can be employed in conjunction with the WSA, WCA, and the WCF algorithms, forming the IWE-WSA, IWE-WCA, and the IWE-WCF subcarrier-allocation algorithms. The complexities of these algorithms are analyzed, showing that they are all low-complexity subcarrier-allocation algorithms. The error performance is investigated and compared, demonstrating that we can now be very close to the optimum performance attained by the high-complexity Hungarian algorithm

Timing and Carrier Synchronization in Wireless Communication Systems: A Survey and Classification of Research in the Last 5 Years

Timing and carrier synchronization is a fundamental requirement for any wireless communication system to work properly. Timing synchronization is the process by which a receiver node determines the correct instants of time at which to sample the incoming signal. Carrier synchronization is the process by which a receiver adapts the frequency and phase of its local carrier oscillator with those of the received signal. In this paper, we survey the literature over the last 5 years (2010–2014) and present a comprehensive literature review and classification of the recent research progress in achieving timing and carrier synchronization in single-input single-output (SISO), multiple-input multiple-output (MIMO), cooperative relaying, and multiuser/multicell interference networks. Considering both single-carrier and multi-carrier communication systems, we survey and categorize the timing and carrier synchronization techniques proposed for the different communication systems focusing on the system model assumptions for synchronization, the synchronization challenges, and the state-of-the-art synchronization solutions and their limitations. Finally, we envision some future research directions