اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدA Novel Power Allocation Scheme for Two-User GMAC with Finite Input Constellations
150
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Constellation Constrained (CC) capacity regions of two-user Gaussian Multiple Access Channels (GMAC) have been recently reported, wherein an appropriate angle of rotation between the constellations of the two users is shown to enlarge the CC capacity region. We refer to such a scheme as the Constellation Rotation (CR) scheme. In this paper, we propose a novel scheme called the Constellation Power Allocation (CPA) scheme, wherein the instantaneous transmit power of the two users are varied by maintaining their average power constraints. We show that the CPA scheme offers CC sum capacities equal (at low SNR values) or close (at high SNR values) to those offered by the CR scheme with reduced decoding complexity for QAM constellations. We study the robustness of the CPA scheme for random phase offsets in the channel and unequal average power constraints for the two users. With random phase offsets in the channel, we show that the CC sum capacity offered by the CPA scheme is more than the CR scheme at high SNR values. With unequal average power constraints, we show that the CPA scheme provides maximum gain when the power levels are close, and the advantage diminishes with the increase in the power difference.
قيم البحث
اقرأ أيضاً
A scalable framework is developed to allocate radio resources across a large number of densely deployed small cells with given traffic statistics on a slow timescale. Joint user association and spectrum allocation is first formulated as a convex opti
mization problem by dividing the spectrum among all possible transmission patterns of active access points (APs). To improve scalability with the number of APs, the problem is reformulated using local patterns of interfering APs. To maintain global consistency among local patterns, inter-cluster interaction is characterized as hyper-edges in a hyper-graph with nodes corresponding to neighborhoods of APs. A scalable solution is obtained by iteratively solving a convex optimization problem for bandwidth allocation with reduced complexity and constructing a global spectrum allocation using hyper-graph coloring. Numerical results demonstrate the proposed solution for a network with 100 APs and several hundred user equipments. For a given quality of service (QoS), the proposed scheme can increase the network capacity several fold compared to assigning each user to the strongest AP with full-spectrum reuse.
In this paper, we consider the power allocation (PA) problem in cognitive radio networks (CRNs) employing nonorthogonal multiple access (NOMA) technique. Specifically, we aim to maximize the number of admitted secondary users (SUs) and their throughp
ut, without violating the interference tolerance threshold of the primary users (PUs). This problem is divided into a two-phase PA process: a) maximizing the number of admitted SUs; b) maximizing the minimum throughput among the admitted SUs. To address the first phase, we apply a sequential and iterative PA algorithm, which fully exploits the characteristics of the NOMA-based system. Following this, the second phase is shown to be quasiconvex and is optimally solved via the bisection method. Furthermore, we prove the existence of a unique solution for the second phase and propose another PA algorithm, which is also optimal and significantly reduces the complexity in contrast with the bisection method. Simulation results verify the effectiveness of the proposed two-phase PA scheme.
In this paper, we investigate the performance of a dual-hop block fading cognitive radio network with underlay spectrum sharing over independent but not necessarily identically distributed (i.n.i.d.) Nakagami-$m$ fading channels. The primary network
consists of a source and a destination. Depending on whether the secondary network which consists of two source nodes have a single relay for cooperation or multiple relays thereby employs opportunistic relay selection for cooperation and whether the two source nodes suffer from the primary users (PU) interference, two cases are considered in this paper, which are referred to as Scenario (a) and Scenario (b), respectively. For the considered underlay spectrum sharing, the transmit power constraint of the proposed system is adjusted by interference limit on the primary network and the interference imposed by primary user (PU). The developed new analysis obtains new analytical results for the outage capacity (OC) and average symbol error probability (ASEP). In particular, for Scenario (a), tight lower bounds on the OC and ASEP of the secondary network are derived in closed-form. In addition, a closed from expression for the end-to-end OC of Scenario (a) is achieved. With regards to Scenario (b), a tight lower bound on the OC of the secondary network is derived in closed-form. All analytical results are corroborated using Monte Carlo simulation method.
Flexible numerologies are being considered as part of designs for 5G systems to support vertical services with diverse requirements such as enhanced mobile broadband, ultra-reliable low-latency communications, and massive machine type communication.
Different vertical services can be multiplexed in either frequency domain, time domain, or both. In this paper, we investigate the use of spatial multiplexing of services using MU-MIMO where the numerologies for different users may be different. The users are grouped according to the chosen numerology and a separate pre-coder and FFT size is used per numerology at the transmitter. The pre-coded signals for the multiple numerologies are added in the time domain before transmission. We analyze the performance gains of this approach using capacity analysis and link level simulations using conjugate beamforming and signal-to-leakage noise ratio maximization techniques. We show that the MU interference between users with different numerologies can be suppressed efficiently with reasonable number of antennas at the base-station. This feature enables MU-MIMO techniques to be applied for 5G across different numerologies.
It is known that interference alignment (IA) plays an important role in improving the degree of freedom (DoF) of multi-input and multi-output (MIMO) systems. However, most of the traditional IA schemes suffer from the high computational complexity an
d require the global and instantaneous channel state information (CSI), both of which make them difficult to be extended to cellular MIMO systems. To handle these issues, two new interference alignment schemes, i.e., the retrospective interference regeneration (RIR) scheme and the beamforming based distributed retrospective interference alignment (B-DRIA) scheme, are proposed for cellular K-user MIMO downlink networks. For the RIR scheme, it adopts interference elimination algorithm to erase redundant symbols in inter-cell interference (ICI) signals, and then uses interference regeneration algorithm to avoid secondary interference. The RIR scheme obtains greater DoF gain than the retrospective interference alignment (RIA) scheme, but incurs performance degradation when the transceiver antennas ratio (TAR) approaches 1. Therefore, the B-DRIA scheme is further proposed. For the B-DRIA scheme, the cellular beamforming matrix is introduced to eliminate the ICI, and meanwhile distributed retrospective interference alignment algorithm is adopted to align inter-user interference (IUI). The simulation results show that the B-DRIA scheme obtains larger DoF than the RIR scheme locally. Specifically, when TAR approaches 1, two schemes obtain the same DoF. While TAR approaches 2, the DoF of the B-DRIA scheme is superior than the RIR scheme.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
