Search

This correspondence paper studies the impact of nonidentically distributed channel estimation error on performance of a scheduled space-time block coding with mean-value power allocation in cognitive-radio multiple-input multiple-output system. Using the derived probability density function, the exact closed-form expressions of the proposed system for outage probability, ergodic capacity, and symbol-error rate (SER) with both $\rm M$ -ary quadrature amplitude modulation and phase shift keying modulation are derived. Using asymptotic analysis, this paper quantifies the diversity order for both outage probability and SER in the presence of nonidentically distributed error. From the analysis results, this paper shows that the diversity order is enhanced by the multiuser diversity as the number of user terminals increases regardless of outage probability and SER, while the spatial diversity is eliminated. [ABSTRACT FROM AUTHOR]

This paper focuses on the meta distributions of the signal-to-interference-plus-noise ratio (SINR) and user-perceived rate in heterogeneous cellular networks (HCNs) with multiple tiers of base stations. On the one hand, it is desirable to offload users to small cells to alleviate the congestion in macrocells; on the other hand, such offloading would in turn cause an SINR degradation of the offloaded users, which needs to be mitigated through interference avoidance based on resource partitioning. Thus, in consideration of both aspects, we provide a general framework for modeling and analyzing joint spectrum allocation and offloading in an HCN using the $K$ -tier homogeneous-independent Poisson model. With it, we derive the per-tier and overall moments of the conditional SINR and rate distribution given the point process, based on which the exact meta distributions are given. We show that the conventional SINR or rate performance evaluated at the typical user (averaging over all tiers and links in the HCN), by itself, is insufficient, and a much sharper version provided by the meta distribution is required in conjunction with the expected value to give a thorough assessment of the benefits of joint resource partitioning and offloading in HCNs. [ABSTRACT FROM AUTHOR]

In this paper, we study the problem of the optimal dissemination of channel state information (CSI) among $K$ spatially distributed transmitters (TXs) jointly cooperating to serve $K$ receivers. One of the particularities of this paper lies in the fact that the CSI is distributed in the sense that each TX obtains its own estimate of the global multiuser MIMO channel with no further exchange of information being allowed between the TXs. Although this is well suited to model the cooperation between noncolocated TXs, e.g., in cellular coordinated multipoint schemes, this type of setting has received little attention so far in the information theoretic society. We study in this paper what are the CSI requirements at every TX, as a function of the network geometry, to ensure that the maximal number of degrees-of-freedom (DoF) is achieved, i.e., the same DoF as obtained under perfect CSI at all TXs. We advocate the use of the generalized DoF to take into account the geometry of the network in the analysis. Consistent with the intuition, the derived generalized DoF maximizing CSI allocation policy suggests that TX cooperation should be limited to a specific finite neighborhood around each TX. This is in sharp contrast with the conventional (uniform) CSI dissemination policy, which induces CSI requirements that grow unbounded with the network size. The proposed CSI allocation policy suggests an alternative to clustering, which overcomes fundamental limitations, such as: 1) edge interference and 2) unbounded increase of the CSIT requirements with the cluster size. Finally, we show how finite neighborhood CSIT exchange translates into finite neighborhood message exchange so that finally global interference management is possible at finite SNR with only local cooperation. [ABSTRACT FROM AUTHOR]

In this paper, antenna diversity is used to improve the outage performance of downlink non-orthogonal multiple access (NOMA) systems combined with single-user multiple-input multiple-output (SU-MIMO) due to the statistical channel state information (CSI), that the transmitter only knows the statistical characteristic associated with each user's channel matrix. We design the precoding and detection vectors, which makes the proposed MIMO-NOMA system reduce to a single-antenna NOMA system with statistical CSI. Next, a dynamic power allocation scheme is proposed to maximize the ergodic sum rate of the considered NOMA group with the minimum ergodic rate constraints of the weaker users. Under this power allocation, we analyze the impact of user clustering and then develop a novel user clustering algorithm. Also, the outage analysis indicates that the proposed system only obtains receive diversity and under the proposed power allocation, the users’ diversity gains are linear with their successive interference cancellation decoding orders. Simulation results confirm our proposed analysis. [ABSTRACT FROM AUTHOR]

In this paper, we study the codebook size design strategies in the multiple-input–multiple-output (MIMO) broadcast channel (BC) systems. We adopt the nonlinear Tomlinson–Harashima precoder (THP), which is designed by the imperfect channel direction information (CDI) acquired from the random vector quantization (RVQ) feedback mechanism. Under the limitation of the total feedback rate, we flexibly allocate the size of each user's codebook so that the overall channel capacity is maximized. Since the design problem is not convex, directly finding out the optimum allocation of codebook size is not attainable. However, by sophisticatedly using the discrete majorization theory, we can derive the codebook size allocation strategies for the high- and the low-signal-to-noise-ratio (SNR) regions. Interestingly, the results show that the equal size codebook is preferable in the low-SNR region, whereas the codebook allocates the whole available codebook size to a single user in the high-SNR region. Simulations certify the theoretical result of our design. [ABSTRACT FROM PUBLISHER]

In this paper, system design for a multiple-input–multiple-output (MIMO) relay broadcast channel with individual signal-to-interference-plus-noise ratio (SINR) constraints at mobile stations (MSs) is considered. By exploring the structure of downlink–uplink duality at either the base station (BS) or the relay station (RS), we propose two schemes of joint power allocation and beamforming design at the BS and the RS. The problem of the existence of feasible solutions under practical power constraints at the BS and the RS with given SINR targets is considered first. Then, the problem of sum power minimization is considered. Each design problem can be efficiently solved using optimal joint power allocation and beamforming under the framework of convex optimization. We also show that with subchannel pairing at the RS, the transmission power can be further reduced. Finally, a generalization to the multihop scenario is provided to further improve power efficiency. [ABSTRACT FROM PUBLISHER]

This paper studies robust interference mitigation against the imperfectness of channel knowledge involved in the interference link of a multiple-input–multiple-output (MIMO) cognitive radio (CR) system that coexists with a primary radio (PR) system via opportunistic spectrum-sharing (OSS) scheme. The robust design leads to a seemingly complicated matrix-valued problem. Nevertheless, we show that it can be equivalently converted into two convex semidefinite programs (SDPs). One of them is identified as a null-forcing approach with closed-form power allocation, and the other can be reduced to a convex scalar power allocation subproblem by properly relaxing the interference constraint. Numerical results demonstrate significant performance gain of the robust design over previous nonrobust strategies. [ABSTRACT FROM PUBLISHER]

In multi-user downlink small cell networks, cooperative resource allocation (RA) within a small cell cluster is a key technique to enhance network capacity. However, capacity-maximizing RA in frequency-selective fading channels requires global channel state information (CSI) of users within a small cell cluster, which makes it infeasible in practical networks with limited direct link capacity. To circumvent this global CSI assumption, most of the existing studies on RA have been based on several CSI assumptions such as local CSI and local CSI at the transmitters (CSIT). Nevertheless, cost functions with local CSI or local CSIT in the literature rely on heuristic formulations, because the sum-rate cannot be computed if without global CSI. In this paper, we propose a deep reinforcement learning-based RA algorithm to maximize the sum-rate for any given limited information on instantaneous CSI or sum-rate at the previous period. The proposed scheme is not restricted to certain CSI assumptions, but attempts to find the best RA for any given information such as quantized local CSI and quantized local CSIT; thus, it is applicable to any given direct link capacity. The proposed algorithm is self-adaptive in time-varying channels, since it is not divided into training and test phases. We modify the target neural network (TNN) scheme to enhance the sum-rate and the convergence speed. Numerical simulations confirm that: i) the proposed algorithm outperforms the conventional algorithms even under the same CSI assumption such as local CSI and local CSIT; ii) a flexible trade-off between the amount of CSI and the sum-rate is realizable in practical systems. [ABSTRACT FROM AUTHOR]

In this paper, we investigate a novel relaying technique employing scheduling, precoding, beamforming, and power allocation for a multiuser multiple-input–multiple-output (MU-MIMO) relay network. In the proposed scheme, the interference is canceled by using a combination of transmit–receive weights and Tomlinson–Harashima precoding (THP). To achieve data rate fairness among different users and further improve the performance of MU-MIMO relay networks, we propose a low-complexity power allocation (LC-PA) to allocate power to each user. In addition, an algorithm to select a subset of users that has maximum sum rate performance is proposed. The performance of the proposed scheme is investigated by examining the sum rate of the system for different user selection algorithms and different power allocation schemes. [ABSTRACT FROM PUBLISHER]

Millimeter wave (mmWave) has been widely considered as a promising technology in the next generation wireless communication systems. Various beam-based directional transmission techniques have been proposed to compensate high pathloss caused by mmWave properties. However, mobility effect of users potentially causes severe inter-beam interferences, which has not been fully-investigated in existing studies. In this paper, we have analyzed different types of mobility-aware beam interference models. Additionally, the theoretical SINR is derived based on channel statistics and the trajectories of users. We propose a mobility-aware subband and beam resource allocation (MSBA) scheme for the mmWave subband-beam massive multi-input multi-output (SB-MMIMO) systems. The proposed MSBA benefits from reduced computation complexity for maximizing system throughput constrained by quality-of-service (QoS) demands of users. The first phase of MSBA scheme is responsible for resource block assignment; while the second phase allocates beamwidth and beam directions according to the analytical derivations. Numerical results show that the proposed MSBA scheme can effectively achieve the highest system throughput and the lowest complexity compared to existing schemes in open literatures. [ABSTRACT FROM AUTHOR]

This paper investigates pilot design and allocation in multi-cell massive multiple-input multiple-output systems with two-tier receiving. As the length of pilot is limited, the pilots cannot be orthogonal and cause interference. The sum rate as well as the signal-to-interference-plus-noise ratio (SINR) of the system are firstly analyzed. The sum rate upper bound and the asymptotic SINR are derived. The analysis shows that the pilot correlation and the spatial correlation jointly affect the sum rate. Based on this observation, the discrete Fourier transform vectors are employed in designing pilots with various correlation values. Then, with the channel correlation information and the designed pilots, the pilots are allocated to the cells in a greedy way with the object of maximizing the sum rate upper bound. Moreover, the sum rate analysis, the pilot design, and the pilot allocation are extended to the scenario with grouped correlations. Simulation results show that the proposed pilot design and allocation performs better than other pilots and the derived upper bound is effective. [ABSTRACT FROM AUTHOR]

In this paper, we propose a linear precoder for the downlink of a multi-user MIMO system with multiple users that potentially act as eavesdroppers. The proposed precoder is based on regularized channel inversion (RCI) with a regularization parameter α and power allocation vector chosen in such a way that the achievable secrecy sum-rate is maximized. We consider the worst-case scenario for the multi-user MIMO system, where the transmitter assumes users cooperate to eavesdrop on other users. We derive the achievable secrecy sum-rate and obtain the closed-form expression for the optimal regularization parameter αLS of the precoder using large-system analysis. We show that the RCI precoder with αLS outperforms several other linear precoding schemes, and it achieves a secrecy sum-rate that has same scaling factor as the sum-rate achieved by the optimum RCI precoder without secrecy requirements. We propose a power allocation algorithm to maximize the secrecy sum-rate for fixed α. We then extend our algorithm to maximize the secrecy sum-rate by jointly optimizing α and the power allocation vector. The jointly optimized precoder outperforms RCI with αLS and equal power allocation by up to 20 percent at practical values of the signal-to-noise ratio and for 4 users and 4 transmit antennas. [ABSTRACT FROM AUTHOR]

In this paper, we aim to solve the multiuser multi-input multi-output (MIMO) downlink beamforming problem where one multi-antenna base station broadcasts data to many users. Each user is assigned multiple data streams and has multiple antennas at its receiver. Efficient solutions to the joint transmit-receive beamforming and power allocation problem based on iterative methods are proposed. We adopt the group maximum signal-to-interference-plus-noise-ratio (SINR) filter bank (GSINR-FB) as our beamformer which exploits receiver diversity through cooperation between the data streams of a user. The data streams for each user are subject to an average SINR constraint, which has many important applications in wireless communication systems and serves as a good metric to measure the quality of service (QoS). The GSINR-FB also optimizes the average SINR of its output. Based on the GSINR-FB beamformer, we find an SINR balancing structure for optimal power allocation which simplifies the complicated power allocation problem to a linear one. Simulation results verify the superiority of the proposed algorithms over previous works with approximately the same complexity. [ABSTRACT FROM PUBLISHER]

Cognitive radio (CR) in conjunction with multiple-input multiple-output (MIMO) orthogonal frequency-division multiple access is a candidate technology for future mobile radio networks. The short communication range of underlay CR systems is commonly a major limiting factor. In this paper, we propose a computationally and spectrally efficient resource allocation scheme for multiuser MIMO orthogonal-frequency-division-multiplexing-based underlay CR networks to provide good spectral efficiency gain and, therefore, increased communication range. Since the formulated optimization problem defines a mixed-integer programming (combinatorial task) that is hard to solve, we propose a two-phase scheme to produce efficient solutions for both the downlink and the uplink. Particularly, the first procedure elaborates on an adaptive precoding that is characterized by spectral efficiency due to the degrees of freedom it can provide. The second procedure develops a fast subcarrier mapping algorithm, which can be worked out through optimal power distribution among the CR users. The proposed scheme is optimal for the downlink but, however, near-optimal for the uplink. Simulation results demonstrate the bandwidth and computational efficiencies of the proposed scheme compared with the state of the art. [ABSTRACT FROM AUTHOR]

Two-way relaying has demonstrated significant gain in spectral efficiency by applying network coding when a pair of source nodes exchange information via a relay node. This paper is concerned with the scenario where multiple pairs of users exchange information through a common relay node equipped with multiple antennas. We aim to design linear precoding at the relay based on amplify-and-forward strategy. The goal is to maximize the minimum achievable rate among all the users subject to a peak relay power constraint so as to achieve the max-min fairness. We first convert this nonconvex problem into a series of semidefinite programming problems using bisection search and certain transformation techniques. A quasi-optimal solution is then obtained by using semidefinite relaxation (SDR). To reduce the design complexity, we further introduce a pair-wise zero-forcing (ZF) structure that eliminates the interference among different user pairs. By applying this structure, the precoding design problem is simplified to a power allocation problem which can be optimally solved. A simplified power allocation algorithm is also proposed. Simulation results show that the proposed SDR-based precoding not only achieves high minimum user rate but also maintains good sum-rate performance when compared with existing schemes. It is also shown that the proposed pair-wise ZF precoding with simplified power allocation strikes a good balance between performance and complexity. [ABSTRACT FROM PUBLISHER]

We consider a multiuser system where a single transmitter equipped with multiple antennas (the base station) communicates with multiple users each with a single antenna. Regularized channel inversion is employed as the precoding strategy at the base station. Within this scenario we are interested in the problems of power allocation and user admission control so as to maximize the system throughput, i.e., which users should we communicate with and what power should we use for each of the admitted users so as to get the highest sum rate. This is in general a very difficult problem but we do two things to allow some progress to be made. Firstly we consider the large system regime where the number of antennas at the base station is large along with the number of users. Secondly we cluster the downlink path gains of users into a finite number of groups. By doing this we are able to show that the optimal power allocation under an average transmit power constraint follows the well-known water filling scheme. We also investigate the user admission problem which reduces in the large system regime to optimization of the user loading in the system. [ABSTRACT FROM PUBLISHER]

In this work, we investigate the power allocation needed to maximize the energy efficiency (EE) of a massive multiple-input-multiple-output (MIMO) system. We first derive a closed-form expression for the user rate with the presence of pilot contamination caused by inter-cell interference during the channel estimation phase. From the definition of system EE, we propose a maximization problem with two constraints: limited power for pilot and data signals and a minimum value for every user rate. The proposed maximization problem is a fractional programming problem and is very hard to solve directly. Therefore, we propose the first iterative algorithm to transform the original problem into subtractive form. Moreover, we propose the second iterative algorithm to solve the subtractive form maximization problem by approximating it as a convex problem. The convergence and feasibility of the two proposed algorithms are also discussed. Finally, the effectiveness of our scheme is shown by simulation results. [ABSTRACT FROM AUTHOR]

As the demand to alleviate the high cost and energy consumption problem in cellular communication systems grows, research on ways to compensate the hardware impairments for introducing low-cost devices into multi-input multi-output (MIMO) systems is becoming important. In particular, the nonlinearity of power amplifiers may severely degrade the performance of MIMO systems by distorting the precoded signals. In this work, we study the performance and precoding strategy of downlink multiuser MIMO systems with nonlinear power amplifiers. First, we analyze the signal-to-interference-plus-noise ratio (SINR) of nonlinear systems to establish the relationship between the transmit power and SINR. We find that the condition for maximizing the SINR depends on the average channel gain. Specifically, the maximum SINR is determined by the uncorrelated distortion when the average channel gain is large and by the distortion of precoding vector when the average channel gain is small. Motivated by the analysis, we propose an iterative algorithm, which alternately updates the precoding and power allocation by resolving the complicated coupling factors in the SINR expressions of nonlinear system. Furthermore, the proposed algorithm implicitly controls the total transmit power so that the desired signal, interference, and distortion are properly balanced. By the simulation results, we verify the analysis results and show that the proposed scheme outperforms the conventional schemes and achieves a near-optimal sum rate. [ABSTRACT FROM AUTHOR]

We consider a downlink multi-cell multiple-input multiple-output (MIMO) interference broadcast channel (IBC) using orthogonal frequency division multiplexing (OFDM) with multiple users contending for space-frequency resources in a given scheduling instant. The problem is to design precoders efficiently to minimize the number of backlogged packets queuing in the coordinating base stations (BSs). Conventionally, the queue weighted sum rate maximization (Q-WSRM) formulation with the number of backlogged packets as the corresponding weights is used to design the precoders. In contrast, we propose joint space-frequency resource allocation (JSFRA) formulation, in which the precoders are designed jointly across the space-frequency resources for all users by minimizing the total number of backlogged packets in each transmission instant, thereby performing user scheduling implicitly. Since the problem is nonconvex, we use the combination of successive convex approximation (SCA) and alternating optimization (AO) to handle nonconvex constraints in the JSFRA formulation. In the first method, we approximate the signal-to-interference-plus-noise ratio (SINR) by convex relaxations, while in the second approach, the equivalence between the SINR and the mean squared error (MSE) is exploited. We then discuss the distributed approaches for the centralized algorithms using primal decomposition and alternating directions method of multipliers. Finally, we propose a more practical iterative precoder design by solving the Karush–Kuhn–Tucker expressions for the MSE reformulation that requires minimal information exchange for each update. Numerical results are used to compare the proposed algorithms to the existing solutions. [ABSTRACT FROM AUTHOR]