Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userCapacity Comparison between MIMO-NOMA and MIMO-OMA with Multiple Users in a Cluster
53
0
0.0
(
0
)
Added by
Ming Zeng
Publication date
2017
fields
Informatics Engineering
and research's language is
English
Ask ChatGPT about the research
No Arabic abstract
In this paper, the performance of multiple-input multiple-output non-orthogonal multiple access (MIMO-NOMA) is investigated when multiple users are grouped into a cluster. The superiority of MIMO-NOMA over MIMO orthogonal multiple access (MIMO-OMA) in terms of both sum channel capacity and ergodic sum capacity is proved analytically. Furthermore, it is demonstrated that the more users are admitted to a cluster, the lower is the achieved sum rate, which illustrates the tradeoff between the sum rate and maximum number of admitted users. On this basis, a user admission scheme is proposed, which is optimal in terms of both sum rate and number of admitted users when the signal-to-interference-plus-noise ratio thresholds of the users are equal. When these thresholds are different, the proposed scheme still achieves good performance in balancing both criteria. Moreover, under certain conditions,it maximizes the number of admitted users. In addition, the complexity of the proposed scheme is linear to the number of users per cluster. Simulation results verify the superiority of MIMO-NOMA over MIMO-OMA in terms of both sum rate and user fairness, as well as the effectiveness of the proposed user admission scheme.
rate research
Read More
Non-Orthogonal Multiple Access (NOMA) has been proposed to enhance the Spectrum Efficiency (SE) and cell-edge capacity. This paper considers the massive Multi-Input Multi-Output (MIMO) with Non-Orthogonal Multiple Access (NOMA) encoding. The close-form expression of capacity of the massive MIMO with NOMA is given here. Apart from the previous Successive Interference Cancellation (SIC) method, the Power Hard Limiter (PHD) is introduced here for better reality implement.
This paper studies the capacity of a general multiple-input multiple-output (MIMO) free-space optical intensity channel under a per-input-antenna peak-power constraint and a total average-power constraint over all input antennas. The focus is on the scenario with more transmit than receive antennas. In this scenario, different input vectors can yield identical distributions at the output, when they result in the same image vector under multiplication by the channel matrix. We first determine the most energy-efficient input vectors that attain each of these image vectors. Based on this, we derive an equivalent capacity expression in terms of the image vector, and establish new lower and upper bounds on the capacity of this channel. The bounds match when the signal-to-noise ratio (SNR) tends to infinity, establishing the high-SNR asymptotic capacity. We also characterize the low-SNR slope of the capacity of this channel.
Cognitive radios have been studied recently as a means to utilize spectrum in a more efficient manner. This paper focuses on the fundamental limits of operation of a MIMO cognitive radio network with a single licensed user and a single cognitive user. The channel setting is equivalent to an interference channel with degraded message sets (with the cognitive user having access to the licensed users message). An achievable region and an outer bound is derived for such a network setting. It is shown that under certain conditions, the achievable region is optimal for a portion of the capacity region that includes sum capacity.
In the scalar dirty multiple-access channel, in addition to Gaussian noise, two additive interference signals are present, each known non-causally to a single transmitter. It was shown by Philosof et al. that for strong interferences, an i.i.d. ensemble of codes does not achieve the capacity region. Rather, a structured-codes approach was presented, that was shown to be optimal in the limit of high signal-to-noise ratios, where the sum-capacity is dictated by the minimal (bottleneck) channel gain. In this paper, we consider the multiple-input multiple-output (MIMO) variant of this setting. In order to incorporate structured codes in this case, one can utilize matrix decompositions that transform the channel into effective parallel scalar dirty multiple-access channels. This approach however suffers from a bottleneck effect for each effective scalar channel and therefore the achievable rates strongly depend on the chosen decomposition. It is shown that a recently proposed decomposition, where the diagonals of the effective channel matrices are equal up to a scaling factor, is optimal at high signal-to-noise ratios, under an equal rank assumption. This approach is then extended to any number of transmitters. Finally, an application to physical-layer network coding for the MIMO two-way relay channel is presented.
Discrete-time Rayleigh fading multiple-input multiple-output (MIMO) channels are considered, with no channel state information at the transmitter and receiver. The fading is assumed to be correlated in time and independent from antenna to antenna. Peak and average transmit power constraints are imposed, either on the sum over antennas, or on each individual antenna. In both cases, an upper bound and an asymptotic lower bound, as the signal-to-noise ratio approaches zero, on the channel capacity are presented. The limit of normalized capacity is identified under the sum power constraints, and, for a subclass of channels, for individual power constraints. These results carry over to a SISO channel with delay spread (i.e. frequency selective fading).
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
