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 presents a multiple-input–multiple-output (MIMO) precoder with a compensated QR decomposition (CQRD) combination for coordinated multipoint (CoMP) downlink transmission. Unlike conventional QR decomposition (QRD) combination, CQRD combination adopts compensated channel matrix orderings. This paper first proposes CQRD combination for CoMP scenarios. The statistics for combined spatial subchannel gains with a CQRD combination of two coordinated base stations (BSs) are derived, and these statistics show that more balanced subchannel gains are generated with a CQRD combination than with a QRD combination. Furthermore, this paper proposes a generalized CQRD combination scheme with a joint sorting strategy that can be applied to scenarios with more than two coordinated BSs. Unlike the unsorted strategy, the joint sorting strategy determines an enhanced compensated combination to further increase spatial subchannel gains; therefore, the performance can be upgraded. Because conventional Tomlinson–Harashima precoding (THP) cannot be used in the CQRD combination, interference presubtraction and vector precoding (VP) is adopted. Theoretical analysis and simulation results are both provided to demonstrate the advantages of balanced spatial subchannel gains and enhanced bit-error-rate (BER) performance in the proposed CQRD-based schemes. Compared with existing QRD-based MIMO precoders in CoMP scenarios, the proposed CQRD-based schemes have substantial signal-to-noise ratio (SNR) improvements of 2–5 dB. [ABSTRACT FROM PUBLISHER]

This paper analyzes the ratio of transmit antennas to receive antennas at the base station (BS) in full-duplex multiuser multiple-input–multiple-output (MU-MIMO) systems with large-array BS and half-duplex multiantenna users. We consider a full-duplex BS with a block diagonalization (BD) precoder for downlink transmission and a BD receive filter for uplink reception. We derive the approximated downlink sum-rate considering the inter-user interference, and the uplink sum-rate considering the self-interference (SI), for large numbers of BS antennas. Based on the analysis, we formulate an optimization problem in terms of the ratio of transmit antennas to receive antennas to maximize the sum-rate. The analysis shows that the antenna ratio for maximizing the sum rate converges to the ratio of downlink streams to uplink streams as the number of total BS antennas goes to infinity. Simulation results confirm the analysis and show that the BS using the derived antenna ratio in the full-duplex MU-MIMO system can achieve about a 10∼20 b/s/Hz performance gain compared with the BS using an equal number of transmit and receive antennas. [ABSTRACT FROM PUBLISHER]

This paper studies the electronically steerable parasitic array radiator (ESPAR) antenna as a solution for beam pattern switching to implement blind interference alignment (BIA). The ESPAR antenna uses a single radio-frequency (RF) chain, and its beamforming is achieved by simply tuning the reactance loads of parasitic elements. Furthermore, ESPAR's beam pattern can be designed to enhance the received signal-to-noise ratio (SNR), thereby improving the performance of BIA. The focus of this work is the design of the ESPAR beam pattern to realize and improve BIA. In the first approach, each receiver ESPAR antenna dynamically selects the proper beam patterns from among the sector beam patterns, which are pre-designed to access different angular sectors with constant optimal antenna efficiency. We also propose a singular value decomposition (SVD) beamforming method, by means of the available channel state information at the receiver and a dynamic matching network for a high antenna efficiency. The simulation results illustrate the improvement of BIA with proposed methods, especially in the low and moderate SNR region, due to ESPAR's beamforming capability. [ABSTRACT FROM PUBLISHER]

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]

This paper concerns the uplink of multicell multiuser multiple-input multiple-output (MIMO) systems. To tackle the effect of pilot contamination that is generally viewed as a bottleneck in previous work, this paper presents a superimposed pilot (SP)-aided uplink channel estimation scheme and mathematically characterizes the impact that an SP has on the performance of such a very large MIMO system. It is shown that there are two types of interference components that do not vanish, even when the number of antennas $M$ grows to infinity. The first type, which is referred to as cross-contamination, is due to the correlation between the SP and data among different cells. The second type, which is referred to as self-contamination, is due to the dependence between channel estimation and estimation error. Cross-contamination is, in principle, similar to pilot contamination in a conventional pilot-based multicell MIMO system, whereas self-contamination is unique for the SP-aided scheme. Both theoretical and simulation results demonstrate that the SP-aided scheme can effectively reduce the estimation contamination by increasing the data frame size and, in turn, achieve a significant improvement over the spectral efficiency, in comparison with conventional pilot-based methods. [ABSTRACT FROM AUTHOR]

In this paper, we design receivers for filter bank multicarrier-based (FBMC-based) massive MIMO considering practical aspects such as channel estimation and equalization. In particular, we propose a spectrally efficient pilot structure and a channel estimation technique in the uplink to jointly estimate all the users’ channel impulse responses. We mathematically analyze our proposed channel estimator and find the statistics of the channel estimation errors. These statistics are incorporated into our proposed equalizers to deal with the imperfect channel state information (CSI) effect. We revisit the channel equalization problem for FBMC-based massive MIMO, address the shortcomings of the existing equalizers in the literature, and make them more applicable to practical scenarios. The proposed receiver in this paper consists of two stages. In the first stage, a linear combining of the received signals at the base station (BS) antennas provides a coarse channel equalization and removes any multiuser interference. In the second stage, a per subcarrier fractionally spaced equalizer (FSE) takes care of any residual distortion of the channel for the user of interest. We propose an FSE design based on the equivalent channel at the linear combiner output. This enables the applicability of our proposed technique to small and/or distributed antenna setups such as cell-free massive MIMO. Finally, the efficacy of the proposed techniques is corroborated through numerical analysis. [ABSTRACT FROM AUTHOR]

This paper focuses on precoding design for sum-rate maximization while considering the effects of residual self-interference for multiuser multiple-input–multiple-output (MU-MIMO) full-duplex (FD) systems. The problem formulation leads to a nonconvex matrix-variable optimization problem, where we develop two efficient sum-rate maximization algorithms using sequential convex programming (SCP), namely, the difference of convex functions (DC)-based and the sequential convex approximations for matrix-variable programming (SCAMP) algorithms. In addition, we derive the achievable sum rate under the effect of residual self-interference. Simulation results show that, even in cases of high self-interference and high estimation error, the SCAMP algorithm provides approximately 20%–30% sum-rate improvements over both conventional optimized half-duplex (HD) transmission and the existing state-of-the-art FD algorithm in a wide range of scenarios. Finally, the convergence results indicate that the DC-based algorithm tends to initially give the best performance; however, at convergence, the SCAMP algorithm tends to significantly outperform the other algorithms. [ABSTRACT FROM AUTHOR]

Interference alignment (IA) is a precoding technique that aligns interfering signals at receivers. It is known that IA achieves the maximum degrees of freedom over an interference channel under ideal assumptions. The real-world performance of IA depends on a range of practical issues, such as imperfect synchronization, channel estimation, and feedback. Practical issues have been studied in simulations and prototypes, but fully distributed operation of IA network nodes has not been considered. In this paper, we present the first investigation of real-time IA performance on a fully distributed 2 $\times$ 2 multiple-input–multiple-output (MIMO) prototype system with three physically independent user pairs. Over-the-air algorithms for time and frequency synchronization, as well as analog feedback, are studied and implemented. Sum rates are illustrated as a function of complexity and accuracy of different alignment, synchronization, and feedback algorithms. Corresponding tradeoffs are evaluated using an iterative IA method, the injection of residual frequency offset into synchronization, and analog versus quantization-based limited feedback approaches. We demonstrate that, while considering all possible error sources in estimation, synchronization, and feedback, the theoretical multiplexing gain of IA can be reached in practical systems with a constant sum rate loss that remains within 5 bits/Hz/s compared with an ideal simulation. [ABSTRACT FROM PUBLISHER]

In this paper, we investigate hybrid beamforming, user scheduling, and resource allocation optimization based on spectrum coexisting forward transmission in integrated terrestrial-satellite network (ITSN) with the purpose of improving system sum rate and energy efficiency. Considering the limitation of on-board beamforming, a hybrid analog-digital beamforming scheme is designed under the scenario of millimeter wave (mmWave) coexisting in the ITSN framework. Besides, in order to further mitigate intra-beam and inter-beam interference, we propose an adaptive user scheduling scheme, which first determines the cluster center based on adaptive threshold, and then selects users with less channel correlation into a scheduling cluster. Moreover, we model system sum rate maximization problem that incorporates maximum power constrains and minimum data rate requirements. Combined with the aforementioned hybrid beamforming and user scheduling strategy, we formulate the sum rate maximizing problem to a pure power allocation issue. In view of the non-convexity and high complexity, we propose a feasible optimization method based on the minimum mean square error (MMSE) criterion and logarithmic linearization to optimize the power allocation for each user terminal (UT). Simulation results show that our proposed joint beamforming and resource allocation optimization scheduling scheme can achieve an attractive gain in system sum rate and energy efficiency compared with conservative beamforming and allocations. [ABSTRACT FROM AUTHOR]

In this paper, we propose an ergodic interference alignment (IA) method for interference elimination in spectrum sharing multiple-input multiple-output (MIMO) radar and multi-user MIMO communication systems. In existing ergodic IA methods, the channel state information (CSI) is generally assumed to be constant, but time-varying channels should be considered in practice. Differently, our proposed ergodic IA allows to time-varying and/or frequency selective channels for spectrum sharing radar-communication systems. The essence is equivalent to design a simple transmit beamforming, which helps to find a pair of desired complementary channels easily without long-time system delay, therefore, the interferences can be effectively cancelled. The proposed method is evaluated by generalized likelihood ratio test (GLRT) and signal to interference plus noise ratio (SINR) for the radar functionality, while the communication functionality is examined by bit error rate (BER) performance. Both theoretical analysis and simulation results validate that the effectiveness of the ergodic IA method for spectrum sharing radar-communication systems. [ABSTRACT FROM AUTHOR]

In multi-user multiple-input–multiple-output (MU-MIMO) systems that employ pilot-symbol aided channel estimation, the pilot-to-data power ratio (PDPR) has a large impact on the system performance. In this paper, we consider the problem of setting the PDPR in multi-cell MU-MIMO systems in the presence of channel estimation errors, intercell interference and pilot contamination. To analyze and address this problem, we first develop a model of the multi-cell MU-MIMO system and derive a closed-form expression for the mean squared error of the uplink received data symbols. Building on this result, we then propose two decentralized PDPR-setting algorithms based on game theoretic approaches that are applicable in multi-cell systems. We find that both algorithms converge to a Nash equilibrium and provide performance improvements over systems that do not properly set the PDPR, while they maintain different levels of fairness. [ABSTRACT FROM AUTHOR]

In this paper, we study the downlink resource assignment problem of maximizing the total data rate subject to minimum satisfaction guarantees in multiservice scenarios assuming the use of multiuser (MU) multiple-input–multiple-output (MIMO) techniques. With the use of MU MIMO techniques, the same frequency resource can be shared by different terminals at the same time by assigning different spatial channels to each terminal. Different from single-user (SU) access per frequency resource where the resource assignment problem consists of searching for the best association between frequency resources and terminals, with MU access per resource, we aim at finding which space-division multiple-access (SDMA) group should be associated with each frequency resource. The first contribution of this paper is the formal presentation of this generalized problem as an optimization problem. Then, after some mathematical manipulations, we managed to convert this problem from a nonlinear integer to an integer linear problem (ILP) that can be optimally solved by standard techniques instead of resorting to brute-force methods. Motivated by the high computational complexity of the optimal solution, we propose a low-complexity algorithm. By analyzing outage rate and total data rate performance metrics, we show that the proposed solution presents a good performance–complexity tradeoff compared with the method for obtaining the optimal solution. [ABSTRACT FROM PUBLISHER]

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]

In this paper, the downlink of a clustered coordinated multicell multiuser multiple-input multiple-output (MIMO) system is considered, and various low-complexity user scheduling algorithms to maximize the sum rate are proposed. The users' data signals are transmitted cooperatively via the base stations (BSs) of a cluster within the sectorized multicell heterogeneous cellular network. Exhaustive search as the optimal scheduling method is extremely complex, particularly for large numbers of users requesting service. We therefore propose suboptimal scheduling algorithms based on the lower complexity metaheuristic stochastic optimization techniques of simulated annealing (SA) and particle swarm (PS). Moreover, a hybrid algorithm combining the traits of PS and a greedy scheduler is also proposed. The performance and complexity of these algorithms are evaluated for a heterogeneous system model employing different precoding methods. Assessing the algorithms' performance via computer simulations, the effectiveness of the proposed schemes in terms of sum rate is demonstrated, yielding performance very close to that of the exhaustive search at much lower complexity. For each precoding method used in the employed system model, the best corresponding approach to scheduling from our proposed algorithms is determined. [ABSTRACT FROM AUTHOR]

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]

In this paper, we study user selection (US) strategies for a multiple-input–multiple-output (MIMO) cognitive radio (CR) downlink network, where the r-antenna underlay CR secondary users (SUs) coexist with a primary user (PU), and all terminals are equipped with multiple antennas. Two main scenarios are considered: 1) The t-antenna cognitive base station (CBS) has perfect or partial channel state information at the transmitter (CSIT) from the CBS to the PU receiver (RX), and 2) the CBS has absolutely no PU CSIT. For these scenarios, we propose and evaluate multiple SU selection schemes that are applicable to both best-effort PU interference mitigation and hard interference temperature (IT) constraints. The computational complexity of the proposed schemes can be significantly smaller than that of an exhaustive search with negligible performance degradation. For the selection of C SUs out of K, whereas an exhaustive search is on the order of \mathcal{O}(\binom{K}{C}C^4r^3). When t$ and r$ are of the same order, the computational complexity of the proposed scheme can be \binom{K}{C}C^4/K times smaller. Mathematical complexity analysis and numerical simulations are provided to show the advantage of our schemes. [ABSTRACT FROM PUBLISHER]

This paper presents a coherent scheme to optimize an in-band full-duplex multiple-input–multiple-output (MIMO) relay via beamforming and transmit power allocation in a two-hop single-input–single-output (SISO) link under full channel knowledge and perfect hardware assumptions. First, we derive in closed form the optimal pair of transmit power and receive filter for a fixed transmit filter by unifying the minimum-mean-square-error (MMSE) filtering with the SISO-equivalent power allocation, as an iterative approach is not guaranteed to converge to global optimum. Second, we propose a heuristic algorithm to approximate the optimal transmit filter for a fixed receive filter. Furthermore, we study the well-known null-space projection constraint and derive a singular value decomposition (SVD)-based solution for the arbitrary-rank self-interference channel by generalizing the optimal solution under the assumption of rank-1 self-interference channel. Finally, we combine these solutions into a partially iterative algorithm in order to address the global optimization as our observations justify that some of the aforementioned schemes converge to the optimal solution under certain criteria. The numerical analysis of the proposed iterative algorithm demonstrates close-to-optimal performance relative to the theoretical upper bound of the end-to-end link in terms of maximum achievable throughput. [ABSTRACT FROM PUBLISHER]

As an emerging technology in 5G, ultra-dense unmanned aerial vehicles (UAVs) network can significantly improve the system capacity and networks coverage. However, it is still a challenge to reduce interference and improve energy efficiency (EE) of UAVs. In this paper, we investigate a downlink power control problem to maximize the EE in an ultra-dense UAV network. Firstly, the power control problem is formulated as a discrete mean field game (MFG) to imitate the interactions among a large number of UAVs, and then the MFG framework is transformed into a Markov decision process (MDP) to obtain the equilibrium solution of the MFG due to the dense deployment of UAVs. Specifically, a deep reinforcement learning-based MFG (DRL-MFG) algorithm is proposed to suppress the interference and maximize the EE by using deep neural networks (DNN) to explore the optimal power strategy for UAVs. The numerical results show that the UAVs can effectively interact with the environment to obtain the optimal power control strategy. Compared with the benchmarks algorithms, the DRL-MFG algorithm converges faster to the solution of MFG and improves the EE of UAVs. Moreover, the impact of the transmit power on EE under the different heights of the UAVs is also analyzed. [ABSTRACT FROM AUTHOR]

The main focus of this paper is on multistream multiantenna (multiple-input multiple-output) communications in large-scale heterogeneous random networks. Previous work in this area mainly studies the outage probability from the perspective of a given stream, which is inaccurate as it generally overlooks possible interference-driven cross stream signal-to-interference correlation in each communication link. To tackle this issue, in this paper, we focus on a link-level performance evaluation by characterizing the complementary cumulative distribution function (CCDF) of random mutual information (RMI) under heterogeneous interference. We focus on the scenarios that no coordination among transmitters is persuaded, and the receivers do not attempt to cancel out part of interuser interference. Assume that channel state information is known at both the transmitter and receiver of each communication pair, Rayleigh fading, that the singular value decomposition (SVD) is applied to construct pre-coding/post-coding filters for single-user detection, and that transmitted signals of antennas are i.i.d. Gaussian. We first provide accurate expression for the achievable data rate (ADR) of each link, and show that, regardless of the interference power, when transceivers are equipped with equal number of antennas it grows sublinearly with the number of antennas. We then approximate RMI via Gaussian distribution that its mean is the ADR and its variance is derived based on network's parameters. It is seen that the Gaussian approximation is credible even when two streams of data are transmitted. This paper provides various insights regarding the impact of system parameters, including density of transmitters, path-loss exponent, and the number of antennas, on the ADR and CCDF of RMI. We finally spot tremendous benefits of the SVD scheme over other prominent multiplexing systems, including maximum ratio combining, zero-forcing, and diagonal BLAST superstructure with minimum mean square error receivers. [ABSTRACT FROM PUBLISHER]

This paper considers multicell scheduling for coordinated multiple-input multiple-output cellular networks. In a multicell scenario, intercell interference, which is the major challenge degrading system performance, can be suppressed via multicell coordination. However, when the number of users is larger than that can be served, user/multimode selection is necessary, and can significantly enhance the performance in such interference-limited environment. Nevertheless, user selection in a multicell scenario incurs high computational complexity and overhead signalling. To this end, in this paper, low complexity greedy algorithms are proposed for user selection. The algorithms are based on the concept of angle between subspaces and intersection of null spaces, and work in partially distributed fashion with limited information exchange. By these algorithms, channel feedback can be greatly reduced with reasonable computational complexity. In addition, multimode scheduling schemes are proposed for this multicell set up, where the spatial streams are adaptively selected. The proposed algorithms are analysed and compared with the optimal solution obtained by exhaustive search. Simulation results show that the algorithms achieve most of the throughput achievable by the optimal solution. [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]

This paper considers limited feedback for a two-cell interfering multiple-input–multiple-output multiple-access channel (MIMO-MAC). We propose a QR decomposition-based interference alignment (QRD-IA) scheme for efficient limited feedback and investigate the conditions for the antenna configuration. We characterize the interference leakage caused by quantization error as a function of the number of feedback bits. To minimize the interference leakage, we further propose a quantized-precoder-based IA (QP-IA) scheme by modifying the proposed QRD-IA scheme. By characterizing the interference leakage of the QP-IA scheme, we investigate the number of feedback bits to maintain the degrees of freedom (DOFs) in the two-cell interfering MIMO-MAC and a feedback bit allocation algorithm to improve the sum rate. From simulation results, we demonstrate that our proposed schemes can provide better sum-rate performance than the existing scheme using the same number of feedback bits, and our feedback bit allocation algorithm provides a higher sum rate compared with equal feedback bit allocation. [ABSTRACT FROM PUBLISHER]

To be differentiated from the literature, in this paper, we aim to alleviate the impact of pilot contamination (PC) on the massive MIMO systems by cooperatively scheduling users (rather than just assigning) among neighboring cells to share the limited orthogonal pilots. To this end, we develop the multi-cell cooperative scheduling (MCCS) algorithm together with the cooperative scheduling indexes (COSIs) for maximizing the data rate, maximizing the Jain's fairness index and reaching a better tradeoff in-between. For convenience, they are denoted by the COSIs for the CMDR, CMMF and CPF schedulers, respectively. However, its high computational complexity may somehow resists its from practical applications. Thus, a low-complexity cooperative proportional fairness (LC-CPF) algorithm is designed to well approach the MCCS algorithm using the CPF COSI; and at the meantime, the order of computational complexity can be significantly reduced. Moreover, its ability to reach a better tradeoff can still be maintained under the impact of high spectrum-sharing interference. In addition, it is interesting to find that using the proposed cooperative scheduling methods, the open-loop power control mechanism is no longer required for compensating the differences of received signal quality between users. [ABSTRACT FROM AUTHOR]

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]

This paper considers a novel algorithmic framework for the joint spectral sharing design of a colocated MIMO pulse radar and a MIMO communication system under signal direction mismatch, wherein both radar transceiver and communication transmitter designs are investigated, and the mutual information (MI) is maximized under a number of constraints to suppress the mutual interference of the coexistence system. The designed multi-variate formulation is non-convex, an iterative procedure is derived to compute a sequence of simpler sub-problems which admit a low complexity closed-form solution for each primal variable. The convergence of all devised algorithms is guaranteed. Finally, a thorough performance assessment is conducted to demonstrate the merits of the proposed solutions. [ABSTRACT FROM AUTHOR]

In multiple-input–multiple-ouput (MIMO) interference channels (IFCs), interference alignment (IA) with zero-forcing (ZF) linear detection can be used to achieve the maximum degrees of freedom (DoFs). However, ZF linear detection usually degrades the performance due to the noise enhancement in practical systems. In this paper, we propose lattice reduction (LR)-aided successive interference cancelation (SIC) in conjunction with IA over lattice for three-user (and extendable to $K$-user) MIMO IFCs in which the interfering signals aligned over the lattices are detected and canceled rather than nulled out. To complete the proposed LR-aided SIC method, the detection ordering and the precoding matrix that minimize the mean square error are also determined. [ABSTRACT FROM PUBLISHER]

In this paper, we investigate the problem of spectrum leasing in cognitive radio (CR) networks, while incorporating two advanced physical-layer technologies, i.e., multiple-input multiple-output (MIMO) and distributed interference alignment. We present a cooperative spectrum leasing scheme for primary and secondary users to balance the tension between data transmission and revenue collection/payment. A Stackelberg game is formulated, where the primary user is the leader, and secondary users are followers. With backward induction, we derive the optimal strategies for primary and secondary users that can achieve the unique Stackelberg equilibrium, where no player can gain by a unilaterally changing strategy. We find that spectrum leasing is always beneficial to enhancing the utilities of primary and secondary users. The proposed scheme outperforms a no-spectrum-leasing scheme and a cooperative scheme presented in the literature with considerable gains, which demonstrate the benefits of spectrum leasing and distributed interference alignment and validates the efficacy of the proposed scheme. [ABSTRACT FROM PUBLISHER]

The channel feedback overhead for massive multiple-input multiple-output systems with a large number of base station (BS) antennas is very high since the number of feedback bits of traditional codebooks scales linearly with the number of BS antennas. To reduce the feedback overhead, an effective codebook based on channel statistics has been designed, where the required number of feedback bits only scales linearly with the rank of the channel correlation matrix. However, this attractive conclusion was only proved under a particular channel assumption in the literature. To provide a rigorous theoretical proof under a general channel assumption, in this paper, we quantitatively analyze the performance of the channel-statistics-based codebook. Specifically, we first introduce the rate gap between the ideal case of perfect channel state information at the transmitter and the practical case of limited channel feedback, where we find that the rate gap depends on the quantization error of the codebook. Then, we derive an upper bound of the quantization error, based on which we prove that the required number of feedback bits to ensure a constant rate gap only scales linearly with the rank of the channel correlation matrix. Finally, numerical results are provided to verify this conclusion. [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]

Multiple-input–multiple-output (MIMO) full-duplex relaying (FDR) has been considered an efficient technique to provide coverage to users where their direct links from the base station (BS) are too weak for reliable signal reception. However, when multiple MIMO full-duplex relays are deployed in a network, the signal reception quality relies on the effective suppression of multiple types of interference. In this paper, the distributed beamforming is studied for the MIMO FDR network by formulating a power minimization problem with a nonstrict convex objective function (total transmit power of both the BS and all the relays in the network) under individual user rate constraints. We come up with two iterative distributed beamforming algorithms, Algorithm 1 for relays equipped with single receive antenna and Algorithm 2 with multiple receive antennas. The former can yield a global optimal solution of the power minimization problem, whereas the latter can yield only a local optimal solution due to conservative successive convex approximations (SCAs) performed at each iteration, and a rigorous analysis on the upper bounds of step sizes is proposed to guarantee their convergence. The proposed two algorithms only require local information exchange between relays and hence are scalable for different network sizes and topologies. An “early termination” strategy in the operation of the proposed two algorithms is also presented to acquire an acceptable transmit power solution with less computation time consumption and thus suitable for realistic applications. Finally, some simulation results are provided to demonstrate that the proposed two algorithms perform well and significantly better than the existing state-of-the-art scheme reported in the work of Lee and Shin. [ABSTRACT FROM PUBLISHER]

Large-scale antennas systems have been attracted significant attention to provide considerable array gains for millimeter wave (mmWave) communications systems. However, huge hardware complexity and power consumptions make the conventional precoding architectures impractical to realize. Recently, hybrid precoding structures for mmWave communications systems are widely investigated to save the cost and achieve satisfactory performance. Unfortunately, most existing precoder designs lie in the assumption of infinite or high-resolution phase shifters (PSs), which are also difficult to realize in real-world. Motivated by this fact, a low complexity hybrid precoder and combiner design for multi-user systems with two-bit resolution PSs is proposed in this paper, which provides an appropriate trade-off between energy efficiency and system sum-rate. Specifically, the candidate sets for analog beamforming are constructed by introducing the auxiliary variables, in which the number of elements is the same as that of antennas. Accordingly, the computational complexity of searching optimal beamformer is significantly reduced over proposed codebooks. Then, to avoid high complexity singular value decomposition (SVD) of channel matrix, we propose a rank-1 approximate decomposition algorithm based-on principal component analysis technique. At last, the user scheduling algorithm is presented to further improve the performance in multiuser-scenario. Simulation results verified the effectiveness of the proposed algorithms, the performance of which is close to the optimal unquantized precoder. [ABSTRACT FROM AUTHOR]

As a conventional metric, spectrum efficiency has been investigated widely in communication systems due to the limited bandwidth resources and increasing subscriber density. Beamforming technology is used in TD-LTE-A and 5G downlink to improve the spectrum efficiency and system capacity, and a proper resource allocation algorithm can also be used to improve the spectrum efficiency on the premise of satisfying user equipment (UE) requirements. In recent years, energy efficiency has attracted more and more attention as the power consumption on the communication systems increases rapidly, which lays a heavy burden on the environment. In this paper, we propose a joint resource allocation and power allocation algorithm in multi-user beamforming mode, which aims at maximizing the energy efficiency, and also takes UE requirements and spectrum efficiency into consideration. The proposed algorithm first calculates the user priorities and gives a UE grouping method to allocate resource blocks (RBs) to different UEs under the assumption that the power is equally allocated among UEs on the same RB. After that, on each RB, it calculates the power allocation among different UEs to realize the improvement of energy efficiency. In addition, the satisfaction of UE requirements is added in the algorithm as a constraint. Simulation results demonstrate that the proposed algorithm shows an excellent performance on system capacity, i.e., spectrum efficiency, and also provides higher energy efficiency than existing algorithms. Moreover, the UE requirements can be better satisfied and system fairness can also be improved. [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 correspondence paper, we analytically characterize the benefit of digital processing in uplink massive multiple-input multiple-output (MIMO) with a sub-connected hybrid architecture. By assuming that the number of radio frequency chains is equal to that of users, we characterize achievable rates of both pure analog detection and hybrid detection under the independent identically distributed Rayleigh fading channel model. From the derived expressions, we discover that the analog processing can outperform the hybrid processing using the maximal ratio combining or zero-forcing criterion in cases under some engineering assumptions. Performance comparison of the schemes are presented under tests with various number of users and number of antennas at the base station. [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, a cocktail approach is proposed to delicately integrate the two conventional countermeasures, i.e., the fractional pilot reuse and time-shifted pilots (TSP) schemes, for the pilot contamination problem in the full-duplex massive multiple-input multiple-output system. Specifically, the TSP scheme is applied to duplicate for the inner and edge regions of a cell such that the number of accommodated users can be doubled. To achieve this, the base station should operate in the full-duplex mode; also, the pilot symbols rather than the pilot sequences are used to attain the user diversity gain. The simulation results verify the accuracy of the numerical analysis and the remarkably boosted sum rate for both the downlink and uplink cases. [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]

This correspondence paper addresses linear precoding design for sum rate maximization in low-latency orthogonal frequency-division multiplexing systems. In order to mitigate the overhead of cyclic prefix (CP) originating from shortened symbol duration for low-latency communications, 5G wireless systems need to adopt short CP lengths. As channel delay spread must be less than the CP length, we first derive the effective root-mean-square (RMS) delay spread and the achievable rate using the zero-forcing assumption. We construct a sum rate optimization problem for each user subject to delay spread constraints and then convert the problem into a solvable convex problem along with a semi-definite relaxation technique. The precoding matrix is finally obtained by solving optimization problems for all users. Numerical results reveal that the proposed scheme attains superior performance to the conventional sum rate optimization, as well as small RMS delay spread. [ABSTRACT FROM AUTHOR]

In multi-user multi-cell multiple-input multiple-output (MIMO) visible light communication (VLC) systems, inter-cell interference (ICI) and inter-user interference (IUI) are the two key factors that could severely degrade the system performance. In this paper, for the first time, a novel joint precoder and equalizer design based on interference alignment is proposed to mitigate both IUI and ICI in multi-user multi-cell MIMO VLC systems under imperfect channel state information (CSI). The proposed approach aims to choose proper precoder and receiving equalizer to minimize the mean square error (MSE) under the unique optical power constraints in VLC. Furthermore, we consider optical channel estimation error in our formulated joint optimization problem when designing the joint precoder and receiving equalizer in multi-user multi-cell MIMO VLC systems. Numerical results show that the proposed design achieves a better performance under different users locations, channel estimation errors, and transmitter/receiver spacing, compared to the existing minimum mean square error (MMSE) and max-rate designs. Especially, when the transmit optical power is 12 W per light emitting diode (LED) lamp, our proposed design achieves a sum rate improvement of up to 18.2% and 28.7% as compared with the MMSE and max-rate designs, respectively. In addition, the proposed design can save about 1.4 and 4.3 W optical power per LED lamp as compared with the MMSE and max-rate designs, respectively, at a target bit error rate (BER) of 10 $^{-3}$. [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]

This paper proposes an amplify-and-forward-based massive multiple-input–multiple-output full-duplex relaying (AF-MM-FDR) protocol, where multiple source–destination pairs communicate simultaneously with a common full-duplex relay. A zero-forcing (ZF)-based relay transceiver design with semiblind gain control is presented, considering the problem of relay oscillation. The asymptotic expression of end-to-end signal-to-interference-plus-noise power (SINR) is derived under the general power scaling scheme. The scaling behaviors of echo interference (EI) and effective channel estimation error are determined. Scaling results show that the deployment of very large antenna arrays at the relay has the potential to eliminate the effect of EI due to the full-duplex operation, if the power scaling scheme is selected properly. Moreover, based on the asymptotic analysis, a low-complexity power control scheme is proposed to optimize the spectral efficiency of AF-MM-FDR. Simulation results show that the proposed power control scheme improves the spectral–energy efficiency tradeoff of AF-MM-FDR significantly. [ABSTRACT FROM AUTHOR]

In this paper, we study resource allocation for multiuser multiple-input–single-output secondary communication systems with multiple system design objectives. We consider cognitive radio (CR) networks where the secondary receivers are able to harvest energy from the radio frequency when they are idle. The secondary system provides simultaneous wireless power and secure information transfer to the secondary receivers. We propose a multiobjective optimization framework for the design of a Pareto-optimal resource allocation algorithm based on the weighted Tchebycheff approach. In particular, the algorithm design incorporates three important system design objectives: total transmit power minimization, energy harvesting efficiency maximization, and interference-power-leakage-to-transmit-power ratio minimization. The proposed framework takes into account a quality-of-service (QoS) requirement regarding communication secrecy in the secondary system and the imperfection of the channel state information (CSI) of potential eavesdroppers (idle secondary receivers and primary receivers) at the secondary transmitter. The proposed framework includes total harvested power maximization and interference power leakage minimization as special cases. The adopted multiobjective optimization problem is nonconvex and is recast as a convex optimization problem via semidefinite programming (SDP) relaxation. It is shown that the global optimal solution of the original problem can be constructed by exploiting both the primal and the dual optimal solutions of the SDP-relaxed problem. Moreover, two suboptimal resource allocation schemes for the case when the solution of the dual problem is unavailable for constructing the optimal solution are proposed. Numerical results not only demonstrate the close-to-optimal performance of the proposed suboptimal schemes but unveil an interesting tradeoff among the considered conflicting system design objectives as well. [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]

Tomlinson–Harashima precoded (THP) multiple-input–multiple-output (MIMO) systems are developed to cancel the intersymbol interference (ISI) at the transmitter. However, the THP at least requires perfect channel direction information (CDI) to completely mitigate the interference at the transmitter, which is not practical in the real world. The limited feedback systems are then practically developed to convey the quantized CDI to the transmitter. Using the quantized CDI to conduct the THP, an unavoidable interference degrades the performance at the receiver. In this paper, we investigate the performance degradation resulted from the random vector quantization (RVQ), which is a kind of CDI-based limited feedback mechanism. Here, we measure the performance degradation as the excess mean-squared error (EMSE). Since the formulation of the EMSE is a complicated function of the quantization error, we proposed using the second-order Taylor expansion to derive an analytical result. Simulation results have also verified our proposed analysis, showing that the derived analysis can match the actual EMSE. [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]

The number of commercial and civilian vehicles equipped with automotive radars is expected to rise rapidly in the forthcoming years and with that comes the problem of increased mutual interference between the radar sensors, which can result in severely reduced radar sensitivity and increased false alarm rates. The difficulty and complexity of the problem increase with MIMO radar systems and multiply even further with a growing number of vehicles present on the scene. A system of connected vehicles can efficiently address this problem by sharing information amongst themselves. In this paper, we propose an efficient waveform design algorithm that seeks to minimize a collective cross-ambiguity function. Vehicles that can talk to each other, can perform the design online in a collaborative manner, or offline, in which case the radar codes can be designed and stored in a codebook for future use. The proposed coding scheme is computationally efficient for practical use and the incorporation of such schemes requires only a slight modification of the existing systems. Our numerical examples indicate that the proposed scheme can significantly reduce the interference power level in a desired area of the radar cross-ambiguity functions. [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]

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]