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]

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 independent identically distributed 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. [ABSTRACT FROM AUTHOR]

As the number of antennas increases, the massive multiple-input multiple-output (MIMO) system can precisely point to user equipments (UEs) with narrow beams. Accurate and timely channel state information (CSI) feedback is crucial to keep UEs in service. Mobile UEs, however, may suffer from the narrow beam nature of the massive MIMO system since UEs can move out of the beam coverage. When intelligent reflecting surface (IRS) is applied to the massive MIMO system, the adjustment of the IRS cannot be frequent as the IRS is controlled remotely by the base station (BS). Limiting the number of CSI feedback and the number of both BS and IRS adjustments significantly reduces the overhead of transmission and computation to the system. In this paper, we consider the UEs’ mobility adaptation problem in an IRS assisted multiuser massive MIMO downlink system with infrequent CSI feedback. We propose a beam control method that adapts to UEs’ mobility. The problem is constructed as a sum rate problem where both the BS and IRS are taken into account to jointly optimize the beamforming matrices. Simulation results show that our proposed algorithm can converge quickly and provide satisfactory performance for mobile UEs. At the same time, our proposed algorithm reduces the frequency of updating the beamforming matrices effectively both at the BS and at the IRS. [ABSTRACT FROM AUTHOR]

It is known that superposition signaling in Gaussian interference networks is capable of improving the achievable rate region. However, the problem of maximizing the rate gain offered by superposition signaling is computationally prohibitive, even in the simplest case of two-user single-input single-output interference networks. This paper examines superposition signaling for the general multiple-input multiple-output broadcast Gaussian interference networks. The problem of maximizing either the sum rate or the minimal user’s rate under superposition signaling and dirty paper coding is solved by a computationally efficient path-following procedure, which requires only a convex quadratic program for each iteration but ensures convergence at least to a locally optimal solution. Numerical results demonstrate the substantial performance advantage of the proposed approach. [ABSTRACT FROM AUTHOR]

This paper considers a reconfigurable intelligent surface (RIS)-aided millimeter wave (mmWave) downlink communication system where hybrid analog-digital beamforming is employed at the base station (BS). We formulate a power minimization problem by jointly optimizing hybrid beamforming at the BS and the response matrix at the RIS, under the signal-to-interference-plus-noise ratio (SINR) constraints at all users. The problem is highly challenging to solve due to the non-convex SINR constraints as well as the unit-modulus phase shift constraints for both the RIS reflection coefficients and the analog beamformer. A two-layer penalty-based algorithm is proposed to decouple variables in SINR constraints, and manifold optimization is adopted to handle the non-convex unit-modulus constraints. We also propose a low-complexity sequential optimization method, which optimizes the RIS reflection coefficients, the analog beamformer, and the digital beamformer sequentially without iteration. Furthermore, the relationship between the power minimization problem and the max-min fairness (MMF) problem is discussed. Simulation results show that the proposed penalty-based algorithm outperforms the state-of-the-art semidefinite relaxation (SDR)-based algorithm. Results also demonstrate that the RIS plays an important role in the power reduction. [ABSTRACT FROM AUTHOR]

Characterizing the fundamental energy efficiency (EE) performance of multiple-input–multiple-output interfering broadcast channels (MIMO-IFBC) is important for the design of green wireless system. In this paper, we propose a new network architecture proposition based on EE maximization for Multi-Cell MIMO-IFBC within the context of interference alignment (IA). Particularly, EE is maximized subject to maximum power and minimum throughput constraints. We propose two schemes to optimize EE for different signal-to-noise ratio (SNR) regions. For high-SNR operating regions, we employ a grouping-based IA scheme to jointly cancel intra- and inter-cell interferences and thus transform the MIMO-IFBC to a single-cell MIMO scenario. A gradient-based power adaptation scheme is proposed based on water-filling power adaptation and singular value decomposition to maximize EE for each cell. For moderate SNR cases, we propose an approach using dirty paper coding (DPC) with the principle of multiple access channel and broadcast channel duality to perform IA while maximizing EE in each cell. The algorithm in its dual form is solved using a subgradient method and a bisection searching scheme. Simulation results demonstrate the superior performance of the proposed schemes over several existing approaches. It also shows that interference-nulling-based IA approaches outperform hybrid DPC-IA approach in high-SNR region, and the opposite occurs in low-SNR region. [ABSTRACT FROM PUBLISHER]

While the performance analysis of linear zero-forcing (ZF) and minimum mean-square error (MMSE) receivers has received much attention, there has been no exact closed-form distribution of signal-to-interference-plus-noise ratio (SINR) for MMSE multiple-input multiple-output (MIMO) systems in the arbitrary fading environments for over the past 20 years. In this paper, an exact and general distribution of SINR for MMSE MIMO systems is presented under uncorrelated Rayleigh fading environments. We start our analysis by finding regular patterns from the probability density function (PDF) of SINR for small dimensions, and using the regular patterns, we extend the PDF to arbitrary dimensions. From the exact and general PDF of SINR for MMSE MIMO systems, the cumulative distribution function and the moment-generating function are derived in terms of the incomplete gamma function and the confluent hypergeometric function of the second kind, respectively. As applications, the error probability, outage probability, and achievable sum rate are investigated by using the distribution of SINR for MMSE MIMO systems. Most notably, the achievable sum rates for ZF and MMSE MIMO systems are defined by using the Meijer $G$ -function, which are the first closed-form expressions in the literature. [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]

A fractional frequency reuse (FFR) system is an inter-cell interference coordination scheme used in cellular networks. In FFR systems, the available bandwidth is partitioned into orthogonal subbands such that the users near the cell center adopt subbands of a frequency reuse (FR) factor equal to one (i.e., Full FR), and the users near the cell edge adopt the subbands of an FR factor greater than one (i.e., Partial FR). The proper design of Full FR coverage, which is used to distinguish Full FR regions from Partial FR regions, plays a critical role in FFR system performance. This paper studies the optimal Full FR coverage that maximizes system throughput in the downlink in multiple-input multiple-output (MIMO) cellular networks. For MIMO systems, orthogonal space–time block codes are considered. We analytically compare the outage probabilities of Full FR and Partial FR for a given user’s location, where the outage probability is evaluated through small-scale multipath fading. By doing so, subject to the constraint that a given target outage probability (quality-of-service) is satisfied, the optimal Full FR coverage is analyzed as a function of base station (BS) power. We prove that the optimal Full FR coverage is a non-increasing function of BS power when the powers of all BSs in the network are scaled up or down at the same rate. This result offers insight into the design of Full FR coverage in relation to BS power; we gain insight into the complicated relationship between crucial FFR design parameters. [ABSTRACT FROM AUTHOR]

In this paper, we develop an innovative approach to quantitatively characterize the performance of ultra-dense wireless networks in a plethora of propagation environments. The proposed framework has the potential of simplifying the cumbersome procedure of analyzing the coverage probability and allowing the unification of single- and multi-antenna networks through compact analytical representations. By harnessing this key feature, we develop a novel statistical machinery to study the scaling laws of wireless networks densification considering general channel power distributions including small-scale fading and shadowing as well as associated beamforming and array gains due to the use of multiple antenna. We further formulate the relationship between network density, antenna height, antenna array seize and carrier frequency showing how the coverage probability can be maintained with ultra-densification. From a system design perspective, we show that, if multiple antenna base stations are deployed at higher frequencies, monotonically increasing the coverage probability by means of ultra-densification is possible, and this without lowering the antenna height. Simulation results substantiate performance trends leveraging network densification and antenna deployment and configuration against path loss models and signal-to-noise plus interference thresholds. [ABSTRACT FROM AUTHOR]

Current and future mobile network access technologies increasingly rely on multiantenna transmission techniques and on cell miniaturization to achieve orders-of-magnitude gains in capacity. In this paper, we propose and evaluate the idea of multiuser multiple-input–multiple-input-based (MU-MIMO) cell reassignments. Dense small-cell deployments make it possible to pair user equipment units (UEs), which were originally assigned to different cells, enabling multiuser MIMO (MU-MIMO) and resulting in performance improvements to both UEs. We discuss how such pairings can be accomplished, and we assess the potential gains in the resulting spectral efficiency and MU-MIMO usage. These are assessed through both discussion of performance bounds and detailed system-level simulation in a realistic outdoor small-cell scenario. [ABSTRACT FROM PUBLISHER]

Multicell coordinated beamforming (CB) can mitigate intercell interference (ICI). However, existing work on CB focuses on systems that maximize overall throughput. This paper considers CB for systems with multiple receive antennas and further extends the CB to multiuser and multistream transmission. We consider fairness and pay close attention to cell-edge users. CB that maximizes the harmonic sum of signal-to-interference-plus-noise ratio (SINR) can be derived into a low-complexity algorithm that favors cell-edge users. Two iterative algorithms are developed. From the simulation results, the proposed algorithms can provide a better fifth-percentile user throughput compared with the CB algorithms minimizing mean square error, maximizing uplink SINR, and maximizing weighted sum rate. Furthermore, the computational complexity of the proposed algorithms is significantly lower than that maximizing the minimum SINR of users. [ABSTRACT FROM AUTHOR]

We consider optimal linear precoder and decoder designs in a multi-cell multiple-input multiple-output system, where base stations and mobile users are both operating in full-duplex (FD) mode. Existing works on FD cellular systems focus on the maximization of overall throughput, which can result in unfairness between uplink and downlink channels depending on the self-interference power and inter-user interference levels. Therefore, to introduce fairness, in this paper, we consider the transmit and receive beamforming designs that maximize the harmonic-sum of signal-to-interference-plus-noise ratios (SINRs) in the uplink and downlink channels. We propose a low-complexity alternating optimization algorithm which converges to a stationary point. Moreover, in order to address practical system design aspects, we consider the transceiver design that enforces robustness against imperfect channel state information (CSI) while providing fair performance among the users. To this end, we formulate an optimization problem that maximizes the worst case SINR among all users under norm-bounded CSI errors. We devise a low-complexity iterative algorithm based on alternating optimization and semidefinite relaxation techniques. Numerical results verify the advantages of incorporating FD mode into cellular systems, and practical issues, such as CSI uncertainty and fairness performance. [ABSTRACT FROM PUBLISHER]

The non-regenerative massive multi-input-multi-output (MIMO) non-orthogonal multiple access (NOMA) relay systems are introduced in this paper. The NOMA is invoked with a superposition coding technique at the transmitter and successive interference cancellation (SIC) technique at the receiver. In addition, a maximum mean square error-SIC receiver design is adopted. With the aid of deterministic equivalent and matrix analysis tools, a closed-form expression of the signal to interference plus noise ratio (SINR) is derived. To characterize the performance of the considered systems, closed-form expressions of the capacity and sum rate are further obtained based on the derived SINR expression. Insights from the derived analytical results demonstrate that the ratio between the transmitter antenna number and the relay number is a dominate factor of the system performance. Afterward, the correctness of the derived expressions are verified by the Monte Carlo simulations with numerical results. Simulation results also illustrate that: 1) the transmitter antenna, averaged power value, and user number display the positive correlations on the capacity and sum rate performances, whereas the relay number displays a negative correlation on the performance and 2) the combined massive-MIMO-NOMA scheme is capable of achieving higher capacity performance compared with the conventional MIMO-NOMA, relay-assisted NOMA, and massive-MIMO orthogonal multiple access (OMA) scheme. [ABSTRACT FROM AUTHOR]

Multi-numerology transmission is a promising multiple access scheme for flexible communication systems, which can simultaneously support users with different service requirements. To this end, both inter- and intra-numerology interference (inter-NI and intra-NI) should be suppressed, which is not straightforward. This paper proposes a novel zero-forcing (ZF) precoding design, which perfectly eliminates all the interference, for massive multiple-input multiple-output (MIMO) systems with multi-numerology. First of all, we express the signal-to-interference-plus-noise ratio (SINR) of the multi-numerology system with spectrum sharing. From the SINR representation, we identify the channels that precoders must nullify to suppress inter-NI. After that, we propose a ZF precoder suppressing both inter-NI and intra-NI perfectly. The lower bound of ergodic achievable rate with perfect channel state information at the transmitter (CSIT) is analyzed. Based on the lower bound of ergodic achievable rate, we present the feasible rate region. Also, we propose two power allocation schemes: user fairness and the ergodic sum rate maximization. The simulation results demonstrate the advantage of the proposed precoding design and verify our analysis results. [ABSTRACT FROM AUTHOR]

The degrees of freedom (DoF) of the 3-user multiple-input multiple-output (MIMO) interference channel (IC) with full channel state information and constant channel coefficients are investigated when $(p,p+1)$ antennas are deployed at the transmitters and receivers, respectively. The point of departure of this paper is the work of Wang et al., which conjectured but did not prove the DoF for the antenna settings with $p>1$. Here the achievability of the DoF outer bound is formally proved using linear methods, thereby avoiding the use of the rational dimensions framework. The proposed transmission scheme exploits asymmetric complex signaling together with symbol extensions in time and space interference alignment concepts. While the paper deals with the $p=2,3,\ldots,6$ cases, providing the specific transmit and receive filters, there are also provided the tools needed for proving the achievability of the optimal DoF for $p>6$, whose DoF characterization is conjectured. [ABSTRACT FROM PUBLISHER]

Recently, model-free power control approaches have been developed to achieve the near-optimal performance of cell-free (CF) massive multiple-input multiple-output (MIMO) with affordable computational complexity. In particular, deep reinforcement learning (DRL) is one of such promising techniques for realizing effective power control. In this paper, we propose a model-free method adopting the deep deterministic policy gradient algorithm (DDPG) with feedforward neural networks (NNs) to solve the downlink max-min power control problem in CF massive MIMO systems. Our result shows that compared with the conventional convex optimization algorithm, the proposed DDPG method can effectively strike a performance-complexity trade-off obtaining 1,000 times faster implementation speed and approximately the same achievable user rate as the optimal solution produced by conventional numerical convex optimization solvers, thereby offering effective power control implementations for large-scale systems. Finally, we extend the DDPG algorithm to both the max-sum and the max-product power control problems, while achieving better performance than that achieved by the conventional deep learning algorithm. [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]

Channel reciprocity in time-division duplexing (TDD) massive multiple-input multiple-output (MIMO) systems can be exploited to reduce the overhead required for the acquisition of channel state information (CSI). However, perfect reciprocity is unrealistic in practical systems due to random radio-frequency (RF) circuit mismatches in uplink and downlink channels. This can result in a significant degradation in the performance of linear precoding schemes, which are sensitive to the accuracy of the CSI. In this paper, we model and analyse the impact of RF mismatches on the performance of linear precoding in a TDD multi-user massive MIMO system, by taking the channel estimation error into considerations. We use the truncated Gaussian distribution to model the RF mismatch, and derive closed-form expressions of the output signal-to-interference-plus-noise ratio for maximum ratio transmission and zero forcing precoders. We further investigate the asymptotic performance of the derived expressions, to provide valuable insights into the practical system designs, including useful guidelines for the selection of the effective precoding schemes. Simulation results are presented to demonstrate the validity and accuracy of the proposed analytical results. [ABSTRACT FROM AUTHOR]

Convergence and density evolution of a low-complexity iterative multiple-input multiple-output detection based on belief propagation over a ring-type pairwise graph are presented for binary data. The detection algorithm to be considered is effectively a forward–backward recursion and was originally proposed by Yoon and Chae in a work published in 2014, in which link-level performance, computational complexity, and convergence for Gaussian input were analyzed in detail. This paper presents the convergence proof and the density evolution framework for binary input to give an asymptotic performance in terms of average signal-to-interference-plus-noise ratio and bit error rate (BER) without channel coding. The BER curve obtained via density evolution shows a good match with the simulation results for uncoded BER in the paper by Yoon and Chae verifying the effectiveness of the analysis provided and the performance of the detection algorithm. [ABSTRACT FROM AUTHOR]

In this paper, we study amplify-and-forward (AF) schemes in two-hop one-way relay networks. In particular, we consider multigroup multicast transmission between long-distance users. Assuming that perfect channel state information is perceived, our goal is to design the AF process so that the max-min-fair signal-to-interference-plus-noise ratio (SINR) is optimized while generalized power constraints are satisfied. We propose a beamformed Alamouti (BFA) AF scheme and formulate the corresponding AF design problem as a two-block fractional quadratically constrained quadratic program (QCQP). We then tackle the two-block fractional QCQP using the semidefinite relaxation (SDR) technique and analyze the approximation accuracy of the proposed SDR. From a theoretical perspective, our results are fundamentally new and reveal that the proposed BFA AF scheme can outperform the traditional BF AF scheme, especially when there are many users in the system or many generalized power constraints in the problem formulation. From a practical perspective, our proposed BFA AF scheme improves the receivers’ SINR by offering two degrees of freedom (DoFs) in beamformer design, as opposed to only one DoF offered by the BF AF scheme. In the latter part of this paper, we demonstrate how this extra DoF leads to provable performance gain by considering two special relay scenarios, in which the AF process is shown to possess a special structure. Numerical simulations further confirm that the proposed BFA AF scheme outperforms the BF AF scheme and works well for large-scale relay systems. [ABSTRACT FROM PUBLISHER]

This paper analyzes the performance of energy-constrained dual-hop amplify-and-forward relaying systems with multi-antenna nodes in the presence of multiple co-channel interferers at the destination. To maximize the overall signal-to-interference-plus-noise ratio, as well as the harvested energy so as to mitigate the severe effects of fading and enable long-distance wireless power transfer, hop-by-hop information and energy beamforming is proposed where the transmitted signal is steered along the strongest eigenmode of each hop. The wirelessly powered relay scavenges energy from the source information radio frequency signal through energy beamforming, where both the time-switching receiver and power-splitting receiver are considered, and then uses the harvested energy to forward the source message to the destination. To this end, tight lower and upper bound expressions for the outage probability and ergodic capacity are presented in closed form. These are employed to investigate the throughput of the delay-constrained and delay-tolerant transmission modes. In addition, the asymptotic high signal-to-noise ratio outage probability and ergodic capacity approximations are derived, where the achievable diversity order is also presented. Numerical results sustained by Monte Carlo simulations show the tightness of the proposed analytical expressions. The impact of various parameters, such as energy harvesting time, power-splitting ratio, source transmit power, and the number of antennas on the system throughput, is also considered. [ABSTRACT FROM PUBLISHER]

This paper addresses the optimal design of limited-feedback downlink multiuser spatial multiplexing systems. A multiple-antenna base-station is assumed to serve multiple single-antenna users, who quantize and feed back their channel state information (CSI) through a shared rate-limited feedback channel. The optimization problem is cast in the form of minimizing the average transmission power at the base-station subject to users' target signal-to-interference-plus-noise ratios (SINR) and outage probability constraints. The goal is to derive the feedback bit allocations among the users and the corresponding channel magnitude and direction quantization codebooks in a high-resolution quantization regime. Toward this end, this paper develops an optimization framework using approximate analytical closed-form solutions, the accuracy of which is then verified by numerical results. The results show that, for channels in the real space, the number of channel direction quantization bits should be (M-1) times the number of channel magnitude quantization bits, where M is the number of base-station antennas. Moreover, users with higher requested quality-of-service (QoS), i.e., lower target outage probabilities, and higher requested downlink rates, i.e., higher target SINR's, should use larger shares of the feedback rate. It is also shown that, for the target QoS parameters to be feasible, the total feedback bandwidth should scale logarithmically with the geometric mean of the target SINR values and the geometric mean of the inverse target outage probabilities. In particular, the minimum required feedback rate is shown to increase if the users' target parameters deviate from the corresponding geometric means. Finally, the paper shows that, as the total number of feedback bits B increases, the performance of the limited-feedback system approaches the perfect-CSI system as 2-B/M2. [ABSTRACT FROM PUBLISHER]

Combining cache and heterogeneous cellular networks (HetNets) together is proposed to satisfy the increasing capacity requirements in 5G networks. In this paper, we consider the analysis and optimization of random caching in the $K$ -tier multi-antenna multi-user HetNets. We derive the expressions of the cache hit probability and the potential throughput, using tools from stochastic geometry. Limiting to the fully loaded interference-limited scenario, we obtain the closed-form exact expressions and the upper bounds of the metrics. The linear asymptotic expression of the cache hit probability in the high signal to interference and noise ratio (SINR) threshold region is also obtained. Based on analytical results, we consider the potential throughput maximization problem via optimizing the caching distribution. For a general scenario, we obtain a local optimal solution and a simple approximate asymptotic optimal solution in the high SINR threshold region. For a special case where each BS serves the largest number of users per resource block, we numerically solve a non-convex problem and propose a sub-optimal caching strategy by approximation, where a closed-form result is obtained in each iteration. Numerical simulations show that our proposed caching schemes outperform existing caching schemes. Analysis and optimization results provide insightful design guidelines for the cache-enabled multi-antenna HetNets. [ABSTRACT FROM AUTHOR]

Optimal power allocation (PA) strategies can make a significant rate improvement in secure spatial modulation (SM). Due to the lack of secrecy rate (SR) closed-form expression in secure SM networks, it is hard to optimize the PA factor. In this paper, two PA strategies are proposed: gradient descent (GD), and maximum product of signal-to-interference-plus-noise ratio (SINR) and artificial-noise-to-signal-plus-noise ratio (ANSNR) (Max-P-SINR-ANSNR). The former is an iterative method and the latter is a closed-form solution. Compared to the former, the latter is of low-complexity. Simulation results show that the proposed two PA methods can approximately achieve the same SR performance as the exhaustive search method and perform far better than three fixed PA ones. With extremely low complexity, the SR performance of the proposed Max-P-SINR-ANSNR performs slightly better and worse than that of the proposed GD in the low to medium, and high signal-to-noise ratio regions, respectively. [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]

Coordinated multipoint transmission (CoMP) and soft frequency reuse (SFR) techniques are two common mechanisms that are often combined with the aim of reducing the deleterious effects caused by inter-cell interference in current and envisaged cellular networks (4G/5G). The performance of this combined mechanism has been shown to be strongly influenced by the specific choice of the parameters determining the frequency reuse settings. So far, their optimization has relied on time-consuming simulations that make the CoMP-SFR optimization a challenging issue. In an attempt to revert this situation, this paper introduces a novel analytical framework that, for a specific set of SFR parameters, allows the computation of closed-form approximations to relevant performance metrics such as average total capacity, worst-users rate, and backhaul requirements. Remarkably, these approximations exhibit a dependence on the SFR parameters that match that of the true metrics, hence allowing the optimization of the SFR-related parameters based on the proposed analytical expressions. Furthermore, and very important from a practical perspective, the availability of these closed-form expressions allows the efficient application of multi-objective optimization techniques to realistic scenarios with irregularly deployed base stations that serve to evaluate the various tradeoffs the designer is facing when optimizing multiple, and often conflictive, performance metrics. [ABSTRACT FROM AUTHOR]

In this paper, spatial modulation (SM) is introduced to layered division multiplexing (LDM) systems for enlarging the spectral efficiency (SE) over broadcasting transmission. First, the SM aided LDM (SM-LDM) system is proposed, in which different layered services utilize SM for terrestrial broadcasting transmission with different power levels. Then a SE analysis framework for SM-LDM systems is proposed, which is suitable for the SM-LDM systems with linear combining. Moreover, the closed-form SE lower bound of SM-LDM systems with maximum ratio combining (MRC) is derived, which is based on this framework. Since the theoretical SE analysis of single transmit antenna (TA) LDM systems with MRC and spatial multiplexing (SMX) aided LDM systems with MRC lacks a closed-form expression, the closed-form SE is also derived for these systems. Monte Carlo simulations are provided to verify the tightness of our proposed SE lower bound. Furthermore, it can be shown via simulations that our proposed SM-LDM systems always have a better SE performance than single-TA LDM systems, which can even outperform the SE of SMX aided LDM (SMX-LDM) systems. [ABSTRACT FROM AUTHOR]

Visible light communication (VLC) has emerged as a promising supplement to existing radio frequency-based communication systems. Recently, the use of massive light emitting diodes (LED) and photodetector (PD) arrays have been proposed to increase the capacity of the overall VLC link. At the receiver, the signals received by the PD arrays are combined to enhance the achievable data rates. However, successful combining and subsequent detection depends on accurate channel estimation. In this paper, we consider a typical massive multiple input multiple output VLC scenario with maximal ratio combining, and derive an asymptotic analytical expression for the probability density function (p.d.f) of the residual additive distortion for mobile users. Since the minimum error entropy (MEE)-based learning paradigm outperforms the traditional Bussgang approaches due to the incorporation of order statistics, we derive an MEE-based channel estimator using the analytical expression for the p.d.f of the additive distortion. Simulations are carried out for various LED array-sizes, and under various LED transmit half angles. Furthermore, using the analytically derived p.d.f, the proposed MEE-criterion-based channel estimator achieves lower bit error rate, and faster convergence, as compared to existing minimum mean square error based channel estimator. [ABSTRACT FROM AUTHOR]

In this paper, a comprehensive design and analysis of multiple-input multiple-output (MIMO) full-duplex (FD) relaying systems in a multi-cell environment is investigated, where a multi-antenna amplify-and-forward FD relay station serves multiple half-duplex (HD) multi-antenna users. The pivotal obstacles of loopback self-interference (LI) and multiple co-channel interferers (CCI) at the relay and destination when employing FD relaying in cellular networks are addressed. In contrast to the HD relaying mode, the CCI in the FD relaying mode is predicted to double since the uplink and downlink communications are simultaneously scheduled via the same channel. In this paper, the optimal layout of transmit (receive) precoding (decoding) weight vectors which maximizes the overall signal-to-interference-plus-noise ratio is constructed by a suitable optimization problem, and then a closed-form sub-optimal formula based on null space projection is presented. The proposed hop-by-hop rank-1 zero-forcing (ZF) beamforming vectors are based on added ZF constraints used to suppress the LI and CCI channels at the relay and destination, i.e., the source and relay perform transmit ZF beamforming, while the relay and destination employ receive ZF combining. To this end, unified accurate expressions for the outage probability and ergodic capacity are derived in closed form. In addition, simpler tight lower bound formulas for the outage probability and ergodic capacity are presented. Moreover, the asymptotic approximations for outage probability are considered to gain insights into system behavior in terms of the diversity order and array gain. Numerical and simulation results show the accuracy of the presented exact analytical expressions and the tightness of the lower bound expressions. The case of hop-by-hop maximum-ratio transmission/maximal-ratio combining beamforming is included for comparison purposes. Furthermore, our results show that while multi-antenna terminals improve the system performance, the detrimental effect of CCI on FD relaying is clearly seen. Therefore, our findings unveil that MIMO FD relaying could significantly improve the system performance compared to its conventional MIMO HD relaying counterpart. [ABSTRACT FROM AUTHOR]

Low-complexity linear precoders are known to be close to optimal for massive multiple-input multiple-output (M-MIMO) systems. However, the large number of antennas at the transmitter imposes a high computational burden and high hardware overloads. In line with this, in this paper, we propose a low-complexity antenna selection (AS) scheme that selects the antennas that maximize constructive interference between the users. Our analyses show that the proposed AS algorithm, in combination with a simple matched-filter (MF) precoder at the transmitter, is able to achieve better performances than systems equipped with a more complex channel inversion (CI) precoder and computationally expensive AS techniques. First, we give an analytical definition of constructive and destructive interference, based on the phase of the received signals from phase-shift-keying-modulated transmissions. Then, we introduce the proposed AS algorithm, which identifies the antenna subset with the highest constructive interference, maximizing the power received by the user. In our study, we derive the computational burden of the proposed technique with a rigorous and thorough analysis, and we identify a closed-form expression of the upper bound received power at the user side. In addition, we evaluate in detail the power benefits of the proposed transmission scheme by defining an efficiency metric based on the achieved throughput. The results presented in this paper prove that AS and green radio concepts can be jointly used for power-efficient M-MIMO, as they lead to significant power savings and complexity reductions. [ABSTRACT FROM AUTHOR]

In this paper, we consider time-domain vector perturbation (TDVP) in a large-system limit when channel state information (CSI) is imperfect due to pilot contamination, and we derive the system's achievable sum rate per cell. We use random matrix methods to avoid time-consuming Monte Carlo simulations. Numerical results show that, in general, linear precoding ensures a higher sum rate than TDVP in the massive multiple-input–multiple-output (MIMO) regime. [ABSTRACT FROM AUTHOR]

This paper considers a two-cell uplink cochannel multiple-input–multiple-output (MIMO) network with users sequentially arriving at the network. We study the problem of sequential base-station (BS) selection for the users, with the selection criterion based on the degrees of freedom (DoFs) available for the new arriving user. We find that different sequential BS selections affect individual and network performance in terms of the individual and network sum DoF, as well as the number of admissible users in the network. We propose a method to build the tree structure for sequential BS selection, which carries trellis information for individual and system-wide selections. The properties of the tree are analytically studied. It turns out that by adopting an interference coordination strategy based on the concept of interference alignment (IA), better individual and network performance can be achieved. Simulation compares the proposed DoF-based BS selection and traditional BS selection schemes and highlights the advantages of the proposed scheme. [ABSTRACT FROM PUBLISHER]

Precoding schemes in the framework of vector perturbation (VP) for the multiple-input multiple-output (MIMO) Gaussian broadcast channel (GBC) are investigated. The VP scheme, originally a “one-shot” technique, is generalized to encompass processing over multiple time instances. Using lattice-based extended alphabets (“perturbations”), and considering the infinite time-span extension limit, a lower bound on the achievable sum-rate using the generalized VP scheme is analytically obtained. The lower bound is shown to asymptotically achieve the optimum sum-rate in the high signal-to-noise ratio (SNR) regime (both in terms of degrees-of-freedom and power offset), for any number of users and transmit antennas. For the two-user cases, it is shown that the lower bound coincides with the sum-capacity for low SNR. The above lower bound is constructively obtained by means of an efficient practically oriented suboptimal transmit energy minimization algorithm, which exhibits a polynomial complexity in the number of users. The proposed precoding scheme demonstrates that the “shaping gain” is achievable for VP schemes, when employing “good” multidimensional lattices. It is also shown that the suboptimum algorithm has its merits, even when processing over multiple time instances is not employed. For the $2\times 2$ MIMO GBC, the VP scheme is generalized further, and an inner bound for the entire achievable rate region is obtained, by which an interesting correspondence is identified with the ultimate capacity region, as obtained by “dirty paper coding”. [ABSTRACT FROM PUBLISHER]

This paper presents a non-orthogonal multiple access (NOMA) scheme with group detection for uplink multiple-input multiple-output (MIMO) systems, for which an effective precoder design is developed. In the scheme, users are divided into groups in accordance with their locations for detection at the base station. The inter- and intra-group interferences are mitigated by successive interference cancellation (SIC) and transceivers, respectively. Based on a derived approximate signal-to-interference-plus-noise ratio (SINR) for using zero-forcing detection, an iterative power and beamforming update procedure is developed for obtaining the user precoders. The precoder design effectively mitigates the intra-group-inter-user correlation making the adopted approximate SINR represent the original SINR accurately. The proposed multi-group MIMO-NOMA scheme can work under more practical transmit-receive antenna configurations and is shown to outperform upon existing cluster-based MIMO-NOMA schemes in terms of total transmit power for various system configurations. The impact of SIC residuals on the multi-group MIMO-NOMA scheme is investigated. Feasibility conditions for the design under imperfect SIC based on the fractional cancellation error model are developed. [ABSTRACT FROM AUTHOR]

For large-scale antenna array multiple-input multiple-output (MIMO) systems, a typical solution often put forward for uplink detection consists in applying low-complexity linear receivers such as zero-forcing (ZF) and minimum mean-square error (MMSE) combiners. In this paper, the performance of uplink MMSE detection has been analyzed in the context of a multi-cell multiuser MIMO system. An approximate expression for the signal-to-interference-plus-noise ratio (SINR) is proposed, which is in simple form and becomes exact in the low SNR regime. This approximate SINR applies to systems where the base station (BS) has the statistical information of the out-of-cell interfering signals, and systems where the BS ignores the presence of such interfering signals. This approximate SINR is tight for arbitrary user powers, arbitrary number of antennas at the base station, and arbitrary channel correlation matrix associated with any particular user. Approximate expressions for capacity and bit-error rate/symbol-error rate have also been derived. Particularly, it can be proven that, when the MMSE receiver ignores the presence of out-of-cell interfering signals, the performance gap between ZF and MMSE vanishes in the high SNR regime. [ABSTRACT FROM AUTHOR]

This paper proposes a flexible pilot assignment method to jointly optimize the uplink and downlink data transmission in multi-cell Massive multiple input multiple output (MIMO) systems with correlated Rayleigh fading channels. By utilizing a closed-form expression of the ergodic spectral efficiency (SE) achieved with maximum ratio processing, we formulate an optimization problem for maximizing the minimum weighted sum of the uplink and downlink SEs subject to the transmit powers and pilot assignment sets. This combinatiorial optimization problem is solved by two sequential algorithms: a heuristic pilot assignment is first proposed to obtain a good pilot reuse set and the data power control is then implemented. Numerical results manifest that the proposed algorithm converges fast to a better minimum sum SE per user than the algorithms in previous works. [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]

Linear decoding of space–frequency block codes (SFBCs) based on the Alamouti structure with orthogonal frequency-division multiplexing (OFDM) requires the channel to be constant across two consecutive tones. However, time-dispersive multipath fading channels exhibit frequency-selective behavior wherein the channel across two tones will vary. This paper provides analytical tools for evaluating the performance of SFBCs with OFDM in frequency-selective channels. The analysis uses the average signal-to-interference-plus-noise ratio (SINR) as a sufficient statistic to describe the performance of SFBCs in frequency-selective channels. A unified formula is derived to characterize the channel correlation between two consecutive tones for various frequency-selective channels. A closed-form solution of the average SINR is obtained, which takes into account imperfect channel estimation and frequency selectivity. An interpolation method of the channel estimate is proposed, which is shown to improve the bit-error-rate performance by 3 dB at a high SNR. The accuracy of the theoretical analyses is verified by numerical simulations under multipath channels such as the International Telecommunications Union (ITU) pedestrian and vehicular models. [ABSTRACT FROM PUBLISHER]

This paper addresses achievable rates and related link adaptation for precoded Multiple-Input Multiple-Output transmission in an orthogonal frequency division multiple access system with uncompensated frequency flat transceiver I/Q imbalance. Precoder selection on the mirror subcarrier induces variations of the signal quality on the subcarrier of interest and causes outage. We consider link adaptation strategies with infinite rate granularity for block and ergodic fading models where the transmitter knows the statistics of the induced interference and has perfect channel state information of the wanted link. An optimal I/Q aware transmission method is used for these fading models. Performance of I/Q aware methods is compared with blind back-off selection. [ABSTRACT FROM PUBLISHER]

We consider the uplink transmission in multiuser wireless systems with multiple single-antenna transmitting users and a multiantenna receiver. We address two problems in this paper. The first problem is user admission, i.e., given a large number of users, how to admit the maximum number of users that can simultaneously satisfy quality of service (QoS) and power constraints. The second problem is how to distribute the data among the users when they are allowed to share data before transmission. The aim is to minimize the total data exchange cost. Such a problem is called user clustering. We formulate those problems into sparsity-maximization problems, which are NP-hard. Inspired by compressive sensing techniques, we propose a common framework to tackle those problems by first applying the \ell1 -norm relaxation and then solving them with convex optimization methods. Simulations show that the proposed algorithms achieve excellent performance. For user admission, the numbers of admitted users by the proposed algorithms are close to the optimum numbers of admitted users obtained by exhaustive search (ES) . For user clustering, the total data exchange cost is reduced by more than 10% after only a few iterations. When the QoS requirement is low, the user data exchange can be avoided using the proposed method, which achieves the optimum result obtained by ES. [ABSTRACT FROM PUBLISHER]

This paper proposes a semianalytical performance prediction method for an iterative receiver that processes signals arriving through a frequency-selective multiple-input multiple-output radio channel. Earlier results provide a distribution of the signal-to-interference-plus-noise ratio at the output of a frequency domain soft interference cancellation minimum mean square error equalizer, which is used to approximate the distribution of the log-likelihood ratios (LLRs) of the demapped bits. Mutual information transfer charts establish a bijective relationship between the variance of the LLRs and the mutual information. We assume a 3rd Generation Partnership Project compliant turbo code, whose transfer charts are simulated in advance. By approximating the LLR variance distribution of the demapped equalizer output, we can evaluate the probability of an intersection between an equalizer chart associated with a random channel realization and a fixed decoder chart. This probability provides the frame error rate. Our proposed prediction method allows horizontally and vertically encoded spatial multiplexing schemes. The vertically encoded scheme is complemented by the inclusion of the Chase combining hybrid automatic repeat request protocol. The proposed method allows reasonable receive antenna correlation. [ABSTRACT FROM AUTHOR]

Physical layer security has drawn significant attention in recent years because of its advancement in preventing confidential information leakage to eavesdroppers. In this paper, we focus on secure beamformer designs in multiuser multi-input multi-output (MU-MIMO) systems with a multi-antenna eavesdropper attempting to overhear the confidential information of a particular user. Unlike the existing work, we aim to exploit the inherent multi-user interference to disrupt the reception of the eavesdropper and enhance the security of wireless communications. Particularly, utilizing practical signal-to-interference-noise metrics, the objective of the secure beamformer design is to minimize the eavesdropper's SINR, while providing legitimate users with required prespecified SINRs to guarantee the qualify of service. We propose secure beamformer designs for both downlink and uplink transmissions, under the conditions of known and unknown eavesdropper's channels, respectively. With the proposed secure beamformers, the multiuser signal behaves like the artificial noise or distributed friendly jamming, which can further degrade the reception of the eavesdropper. Extensive simulation studies confirm our analytical performance predictions and illustrate the advantages of proposed beamformer designs for secure MU-MIMO transmissions. [ABSTRACT FROM AUTHOR]

This paper is concerned with the sum-rate maximization problem in multiple-input multiple-output interference channels. We design the transmit covariance matrix, associated with each transmitter to maximize the sum-rate of the network when the number of data symbols is unknown. The design problem is nonconvex and then hard to be solved. We devise a semidistributed design methodology according to majorization–minimization technique to deal with the optimization problem. This leads us to a convex quadratically constrained quadratic program at each iteration with a semiclosed form solution. The proposed method is computationally efficient and converges to stationary points of the problem. The fact that the method is based on a distributed processing framework along with relatively low computational burden ( $\mathcal{O}(\max \lbrace M,N\rbrace ^{2.3})$ per iteration with $M$ and $N$ being the number of antennas at the transmitter and receiver, respectively) for the user terminals can make it a potential candidate for practical implementations. Finally, we extend the proposed method for the case with channel estimation errors. Simulation results verify the efficiency of the proposed method, and in a typical scenario we have around 60 times lower run-time when compared to the counterparts of the method. [ABSTRACT FROM AUTHOR]

We investigate the performance of multiuser multiple-input-single-output (MU-MISO) downlink in the presence of the mutual coupling effect at the transmitter. Contrary to traditional approaches that aim at eliminating this effect, in this paper we propose a joint analog–digital (AD) beamforming scheme that exploits this effect to further improve the system performance. A jointly optimal AD beamformer is first obtained by iteratively maximizing the minimum received signal-to-interference-plus-noise ratio in the digital domain, followed by an optimization on the load impedance of each antenna element in the analog domain. We further introduce a decoupled low-complexity approach, with which existing closed-form beamforming schemes can also be efficiently applied. For the consideration of hardware imperfections in practice, we study the case where the analog load values are quantized, and propose a sequential search scheme based on greedy algorithm to efficiently obtain the desired quantized load values. Moreover, we also investigate the imperfect channel state information (CSI) scenarios, where we prove the optimality for closed-form beamformers, and further propose the robust schemes for two typical CSI error models. Simulation results show that with the proposed schemes the mutual coupling effect can be exploited to further improve the performance for both perfect CSI and imperfect CSI. [ABSTRACT FROM PUBLISHER]

This paper analyzes the performance of hybrid control-access schemes for small cells (such as femtocells) in the context of two-tier overlaid cellular networks. The proposed hybrid access schemes allow for sharing the same downlink resources between the small-cell network and the original macrocell network, and their mode of operations are characterized considering post-processed signal-to-interference-plus-noise ratios (SINRs) or preprocessed interference-aware operation. This paper presents a detailed treatment of achieved performance of a desired user that benefits from MIMO arrays configuration through the use of transmit antenna selection (TAS) and maximal ratio combining (MRC) in the presence of Poisson field interference processes on spatial links. Furthermore, based on the interference awareness at the desired user, two TAS approaches are treated, which are the signal-to-noise-based selection and SINR-based selection. The analysis is generalized to address the cases of highly-correlated and un-correlated aggregated interference on different transmit channels. In addition, the effect of delayed TAS due to imperfect feedback and the impact of arbitrary TAS processing are investigated. The analytical results are validated by simulations, to clarify some of the main outcomes herein. [ABSTRACT FROM AUTHOR]

This paper investigates full-duplex (FD) secure transmissions with simultaneous wireless information and power transfer (SWIPT) on downlink (DL), where an FD base station, with multiple transmit antennas and multiple receive antennas, serves a group of single-antenna users on both DL and uplink (UL). An optimization problem with non-convex form is formulated for minimizing the system power under constraints on energy harvesting (EH) and security rates. In order to efficiently solve it, the original non-convex problem is first approximated to a convex one and then casted into a form of second-order cone programming (SOCP). Iterative solving algorithms are presented with the computational complexity analysis. Simulation results show that the proposed FD secure scheme is more power-efficient than conventional one, and the SOCP formulation is more computationally efficient than its semi-definite programming alternative. Compared with half-duplex schemes, the FD scheme is also advantageous in power performance especially under high DL and low UL security rate requirements. [ABSTRACT FROM AUTHOR]

In this paper, we consider a system where full-duplex (FD) base-stations (BSs) communicate with half-duplex (HD) downlink (DL) and uplink (UL) users in a multi-user multi-cell network, where all nodes are equipped with multiple antennas. The introduction of FD BSs offers potential to increase spectral efficiency, however, it also causes a surge in the number of interference links compared with the HD network counterpart. Here, we apply linear interference alignment (IA) to manage interference in this network under imperfect channel state information (CSI). First, we characterize the performance losses incurred with respect to the achievable sum rate and degrees of freedom (DoFs). Results show that the general trend in performance loss is mainly determined by how the error scales with the signal-to-noise ratio (SNR). In particular, full UL and DL DoF can be achieved even under imperfect CSI when the channel error is at least inversely proportional to SNR. Moreover, in such cases the sum rate loss is always finite, and either goes to zero or is upper bounded by a derived value. Second, we design two linear IA algorithms applicable to the system under consideration. These are based on minimizing the mean square error (MMSE) and maximizing the signal-to-interference-plus-noise ratio, and consider statistical knowledge of the CSI error for added robustness. The proposed algorithms follow specific design principles that distribute the different interference components amongst the various beamformers and result in unitary receivers and precoders. In addition, we show that under certain conditions both designs result in identical beamforming solutions, even though the MMSE algorithm has lower computational complexity. Finally, we also derive the proper condition for IA feasibility in the multi-cell system under consideration. [ABSTRACT FROM PUBLISHER]

The evaluation of the coverage probability of multistream multiple-input multiple-output (MIMO) communications in HetNets subject to noise, fading, and intercell interference is undoubtedly intricate. Unfortunately, the current literature misses its comprehensive evaluation, as the effects of noise and cross-stream correlation are often overlooked. Furthermore, computationally friendly expressions of the coverage probability allowing engineering insights and adaptive system design are lacking. For multistream MIMO zero-forcing beamforming, in this paper we tackle these issues by considering scenarios where a receiver is in the coverage if all of its data-streams are successfully decoded. Assuming the max signal-to-interference-plus-noise ratio (SINR) cell association (CA), we adopt the stochastic geometry tools to provide an upper bound and an easy-to-compute closed-form lower bound on the coverage probability, while their accuracies are confirmed against extensive simulations. Our contributions are as follows. We prove that full correlation of data streams of a given link slightly reduces the coverage performance. We show that from a coverage probability perspective, the single stream communication is preferable. We exploit our analysis to explore several pertinent design issues, which have not fully discussed in the literature. Our results demonstrate tradeoffs between densification and multiplexing gains. We, further, see that by appropriately designating feedback channel with modest capacity 8 bits per frame per user, the spatial throughput grows by nearly 180 $\%$ over the conventional 1-bit feedback scenario. Finally, We present important extensions of our analysis to underlay spectrum sharing, practical aspects of the max-SINR CA, and a nonhomogeneous path loss environment. [ABSTRACT FROM PUBLISHER]

In this paper, we propose a novel low-complexity beamforming algorithm for multiuser successive maximum ratio transmission (MS-MRT) toward space-division multiplexing to achieve video quality maximization in the downlink of a multiuser (MU) multiple-input–multiple-output (MIMO) orthogonal frequency-division multiple-access (OFDMA)-based fourth-generation (4G) wireless network. We compare the performance of this algorithm in terms of system throughput and video quality with the two popular precoding techniques, namely, block diagonalization (BD) and successive optimization (SO). We also compare its performance with the generalized versions of these two algorithms termed coordinated transmit–receive processing (CTR)-BD and CTR-SO algorithms, respectively. Further, we propose an extension of the MS-MRT scheme to broadcast scenarios, termed broadcast successive maximum ratio transmission (BS-MRT), which computes the optimal broadcast beamforming vector to maximize the video quality at each of the broadcast group members while maintaining orthogonality to the previously scheduled user groups. We also demonstrate that the proposed MS-MRT and BS-MRT schemes can be naturally adapted to the context of various MU OFDMA scheduling algorithms such as proportional fairness (PF) and round robin (RR), to name a few, to maximize video quality through optimal scheduling in the presence of a large number of users. We discuss implementations of the proposed MS-MRT scheme in association with these scheduling algorithms for MU unicast and broadcast video transmission scenarios. The simulation results presented in this work rely on the rate models derived using the Joint Scalable Video Model (JSVM) software developed by the Joint Video Team (JVT) and are, thus, readily applicable in practice. The presented results clearly demonstrate the ability of the proposed algorithm to maximize the video quality in comparison with the other competing MU MIMO precoding techniques. Further, employing the proportional fair scheduling algorithm in conjunction with the MS-MRT results in an overall enhancement in the received video quality compared with the RR and max-rate algorithms. [ABSTRACT FROM PUBLISHER]