Search

Radio Frequency IDentification (RFID) is intended to supplant legacy (optical) bar code scanning technology found in many logistic and retail applications. RFID is distinguished by inexpensive, low power and compact form factor tags, whose longevity and efficacy are predicated on using passive communication techniques and on-tag power harvesting. Such tags employ backscatter modulation, which does not require any active RF components. As a result, backscatter has become an attractive design choice for short-range communications in power constrained wireless sensor networking scenarios. The purpose of this work is two-fold. First, it aims to expose backscatter communication as an emerging topic to a communication systems-theoretic audience. Since backscatter modulation and on-tag power harvesting efficiency are coupled, it is necessary to re-examine notions of power and spectral efficiency from an energy-constraint perspective; this leads to novel coded modulation schemes for future RFID systems. Further, we investigate RFID MIMO systems where the channel fading encountered has different statistics than the classical Rayleigh fading model. In turn,the trade off between diversity order and spatial multiplexing gains are distinct from wide-area MIMO. [ABSTRACT FROM PUBLISHER]

This paper introduces a novel approach of utilizing the reconfigurable intelligent surface (RIS) for joint data modulation and signal beamforming in a multi-user downlink cellular network by leveraging the idea of backscatter communication. We present a general framework in which the RIS, referred to as modulating intelligent surface (MIS) in this paper, is used to: $i$) beamform the signals for a set of users whose data modulation is already performed by the base station (BS), and at the same time, $ii$) embed the data of a different set of users by passively modulating the deliberately sent carrier signals from the BS to the RIS. To maximize each user’s spectral efficiency, a joint non-convex optimization problem is formulated under the sum minimum mean-square error (MMSE) criterion. Alternating optimization is used to divide the original joint problem into two tasks of: $i$) separately optimizing the MIS phase-shifts for passive beamforming along with data embedding for the BS- and MIS-served users, respectively, and $ii$) jointly optimizing the active precoder and the receive scaling factor for the BS- and MIS-served users, respectively. While the solution to the latter joint problem is found in closed-form using traditional optimization techniques, the optimal phase-shifts at the MIS are obtained by deriving the appropriate optimization-oriented vector approximate message passing (OOVAMP) algorithm. Moreover, the original joint problem is solved under both ideal and practical constraints on the MIS phase shifts, namely, the unimodular constraint and assuming each MIS element to be terminated by a variable reactive load. The proposed MIS-assisted scheme is compared against state-of-the-art RIS-assisted wireless communication schemes and simulation results reveal that it brings substantial improvements in terms of system throughput while supporting a much higher number of users. [ABSTRACT FROM AUTHOR]

In conventional multi-user multiple-input multiple-output (MU-MIMO) systems with frequency division duplexing (FDD), channel acquisition and precoder optimization processes have been designed separately although they are highly coupled. This paper studies an end-to-end design of downlink MU-MIMO systems which include pilot sequences, limited feedback, and precoding. To address this problem, we propose a novel deep learning (DL) framework which jointly optimizes the feedback information generation at users and the precoder design at a base station (BS). Each procedure in the MU-MIMO systems is replaced by intelligently designed multiple deep neural networks (DNN) units. At the BS, a neural network generates pilot sequences and helps the users obtain accurate channel state information. At each user, the channel feedback operation is carried out in a distributed manner by an individual user DNN. Then, another BS DNN collects feedback information from the users and determines the MIMO precoding matrices. A joint training algorithm is proposed to optimize all DNN units in an end-to-end manner. In addition, a training strategy which can avoid retraining for different network sizes for a scalable design is proposed. Numerical results demonstrate the effectiveness of the proposed DL framework compared to classical optimization techniques and other conventional DNN schemes. [ABSTRACT FROM AUTHOR]

This paper tackles the problem of joint active and passive beamforming optimization for an intelligent reflective surface (IRS)-assisted multi-user downlink multiple-input multiple-output (MIMO) communication system under both ideal and practical IRS phase shifts. We aim to maximize the spectral efficiency of the users by minimizing the sum mean square error (MSE) of the users’ received symbols. For this, a joint non-convex optimization problem is formulated under the sum minimum mean square error (MMSE) criterion. Alternating minimization is used to break the original joint optimization problem into the separate optimization of the active precoding matrix for the base station (BS) and the matrix of phase shifts for the IRS. While the MMSE active precoder is obtained in closed-form, the IRS phase shifts are optimized iteratively using a modified version (developed in this paper) of the vector approximate message passing (VAMP) algorithm. Moreover, the underlying joint optimization problem is solved under two different models for the IRS phase shifts, namely by assuming $i$) a unimodular (i.e., ideal) constraint on the reflection coefficients and $ii$) a more practical reflection elements termination by a variable reactive load (which inherently introduces the phase-dependent amplitude attenuation in the IRS phase shifts). Simulation results are presented to illustrate the performance of the proposed method under both perfect and imperfect channel state information (CSI) and to show the effect of the practical constraint on the system throughput. The results validate the superiority of the proposed method over the state-of-the-art techniques both in terms of throughput and computational complexity. [ABSTRACT FROM AUTHOR]

Owing to the factors such as controllable mobility, ready-to-use technology, low cost, easy implementation, and so on, unmanned aerial vehicle (UAV) possesses tremendous potential to be one of the primary candidates for next-generation (6G) wireless networks. This paper presents a UAV-assisted multiuser communication network where a multiple antenna UAV base station (BS) serves multiple single antenna ground users (GUs). UAV-BS uses a laser source-based charging mechanism to fulfill its power requirement and applies simultaneous wireless information and power transfer (SWIPT) in the downlink in order to provide desired power to energy-constrained GUs. Also, a clustering-based hybrid multiple access technique is used that combines both orthogonal multiple access (OMA) and non-orthogonal multiple access (NOMA) signaling to transmit the information to all GUs, simultaneously. Due to the involved analytical complexity corresponding to the multiple antennas and users, we use a hybrid beamforming method for efficient communication. Next, we analyze the performance of the proposed framework in terms of user outage probabilities, their respective throughput, and average power harvested considering non-linear energy harvesting and derive expressions of these performance metrics. Moreover, we formulate an optimization problem where the throughput of one GU is maximized by optimally choosing the power allocation parameter while ensuring the desired target throughput at other GU in each cluster. We also illustrate how crucial is the optimal selection of the target rates to maximize the network performance. Simulation results are provided to validate the accuracy of derived expressions and to highlight the dominance of hybrid beamforming and hybrid NOMA compared to conventional methods on the performance of the considered network. [ABSTRACT FROM AUTHOR]

In this paper, we consider precoding and receiving matrices optimization for a two-hop amplify-and-forward (AF) multiple-input multiple-output (MIMO) relay system with a decision feedback equalizer (DFE) at the destination node in the presence of the direct source-destination link. By adopting the minimum mean-squared error (MMSE) criterion, we develop two new transceiver design algorithms for such a system. The first one employs an iterative procedure to design the source, relay, feed-forward, and feedback matrices. The second algorithm is a non-iterative suboptimal approach which decomposes the optimization problem into two tractable subproblems and obtains the source and relay precoding matrices by solving the two subproblems sequentially. Simulation results validate the better MSE and bit-error-rate (BER) performance of the proposed algorithms and show that the non-iterative suboptimal method has a negligible performance loss when the ratio of the source node transmission power to the relay node transmission power is small. In addition, the computational complexity analysis suggests that the second algorithm and one iteration of the first algorithm have the same order of complexity. As the first algorithm typically converges within a few iterations, both proposed algorithms exhibit a low complexity order. [ABSTRACT FROM AUTHOR]

The incorporation of intelligent reflecting surface (IRS) into wireless communication systems can extend the coverage and enhance the data transmission rate. This paper studies the joint transceiver and IRS designs in IRS-assisted multi-input multi-output (MIMO) systems under both perfect channel state information (CSI) and imperfect CSI. Specifically, the transmit precoder, reflection coefficients at the IRS, and receive equalizer are jointly optimized to minimize the data detection mean square error (MSE), subject to the transmission power constraint and the modulus constraints for IRS reflection coefficients. The design problems, non-convex and challenging, are tackled under the framework of alternating optimization. For the design with perfect CSI, we successively optimize the IRS reflection coefficients given the precoder and present the closed-form optimal angle of one reflection coefficient given the others. For the robust design with imperfect CSI, we first average the detection MSE over channel uncertainties by using a generalized statistical CSI error model. Then, the averaged MSE is approximated by a more tractable upper bound. Subsequently, the robust design problem is elaborately transformed into a form similar to the problem with perfect CSI. Numerical results demonstrate the effectiveness of the proposed designs as compared to various benchmark schemes. [ABSTRACT FROM AUTHOR]

Intelligent reflecting surface (IRS) is an emerging cost-efficient technology to enhance communication performance by implementing a large number of passive reflecting elements with tunable phases in wireless systems. In this paper, we propose a general framework for the IRS-aided MIMO system designs under both single-user and multi-user setups, in which the diverse performance metrics including weighted mutual information and weighted MSE, and the realistic multiple weighted power constraint are taken into consideration. Leveraging the alternating optimization approach, the optimal IRS phase shifts are obtained in semi-closed forms. Specifically, based on the matrix-monotonic optimization theory, it is found that optimizing IRS phase shifts is essentially equivalent to tuning the eigenvalues and the corresponding eigenvectors of the MSE matrix. Then the proposed general framework is extended to a multi-user system by introducing a majorization-minimization (MM)-based method for IRS phase shift optimization. Simulation results show that our proposed optimal design brings significant enhancement on the chosen performance metric compared to the traditional MIMO systems without the IRS, and also significantly outperforms various benchmark designs in both single-user and multi-user systems. [ABSTRACT FROM AUTHOR]

Achieving high channel estimation accuracy and reducing hardware cost as well as power dissipation constitute substantial challenges in the design of massive multiple-input multiple-output (MIMO) systems. To resolve these difficulties, sophisticated pilot designs have been conceived for the family of energy-efficient hybrid analog-digital (HAD) beamforming architecture relying on adaptive-resolution analog-to-digital converters (RADCs). In this paper, we jointly optimize the pilot sequences, the number of RADC quantization bits and the hybrid receiver combiner in the uplink of multiuser massive MIMO systems. We solve the associated mean square error (MSE) minimization problem of channel estimation in the context of correlated Rayleigh fading channels subject to practical constraints. The associated mixed-integer problem is quite challenging due to the nonconvex nature of the objective function and of the constraints. By relying on advanced fractional programming (FP) techniques, we first recast the original problem into a more tractable yet equivalent form, which allows the decoupling of the fractional objective function. We then conceive a pair of novel algorithms for solving the resultant problems for codebook-based and codebook-free pilot schemes, respectively. To reduce the design complexity, we also propose a simplified algorithm for the codebook-based pilot scheme. Our simulation results confirm the superiority of the proposed algorithms over the relevant state-of-the-art benchmark schemes. [ABSTRACT FROM AUTHOR]

Reconfigurable intelligent surfaces (RISs) are capable of enhancing the capacity of wireless networks at a low cost. In practical RIS-assisted communication systems, the acquisition of channel state information (CSI) and RIS reflection optimization constitute a pair of challenges. In this paper, a low-complexity channel estimation and passive beamforming design is proposed. First of all, we conceive a low-complexity framework for maximizing the achievable rate of RIS-assisted multiple-input multiple-output (MIMO) systems having discrete phase shifts at each RIS element. In contrast to existing solutions, the proposed arrangement partitions the channel training stage into several phases, where the RIS reflection coefficients are pre-designed and the effective superposed channel is estimated instead of separately training the source-destination and source-RIS-destination links. Based on this, the active beamformer can be designed at low complexity and the RIS reflection optimization is performed by selecting that one from the pre-designed training set which maximizes the achievable rate. Secondly, we propose novel techniques for generating the training set of RIS reflection coefficients. The theoretical performance of the proposed scheme is analyzed and compared to the optimal RIS configuration. Finally, our simulation results demonstrate that the proposed framework is more competitive than its existing counterparts when relying on imperfect CSI, especially for rapidly time-varying channels having short channel coherence time. [ABSTRACT FROM AUTHOR]

Reconfigurable intelligent surface (RIS) stands out as a promising technology by enhancing the electromagnetic wave propagation environment with its passive reflecting elements. In this paper, we focus on the ergodic sum-rate analysis and maximization of the RIS-assisted uplink multiuser multiple-input multiple-output (MIMO) multiple-access channel (MAC) under Rician fading by exploiting full statistical channel state information (CSI). The spatial correlations at the base station, the users, and the RIS are also considered. By using the replica method originated in statistical physics, the closed-form asymptotic ergodic sum-rate of the system is first derived in the large-system regime on the account of the unique channel structure of the RIS-assisted MIMO-MAC system. Then, based on the derived asymptotic ergodic sum-rate, we propose an alternating optimization (AO) algorithm to jointly design the transmit covariance matrix of users and the phase-shifting matrix of RIS with full statistical CSI. Simulation results are also demonstrated to verify the accuracy of the derived asymptotic ergodic sum-rate and the superiority of the proposed AO algorithm. The results reveal that the derived closed-form asymptotic ergodic sum-rate matches very well with the Monte Carlo results even for a small number of antennas, and the proposed AO algorithm can achieve up to 10 bps/Hz gain at high signal-to-noise (SNR) regime, which is therefore valuable for future RIS-assisted MIMO-MAC system designs. [ABSTRACT FROM AUTHOR]

This paper proposes to deploy multiple reconfigurable intelligent surfaces (RISs) in device-to-device (D2D)-underlaid cellular systems. The uplink sum-rate of the system is maximized by jointly optimizing the transmit powers of the users, the pairing of the cellular users (CUs) and D2D links, the receive beamforming of the base station (BS), and the configuration of the RISs, subject to the power limits and quality-of-service (QoS) of the users. To address the non-convexity of this problem, we develop a new block coordinate descent (BCD) framework which decouples the D2D-CU pairing, power allocation and receive beamforming, from the configuration of the RISs. Specifically, we derive closed-form expressions for the power allocation and receive beamforming under any D2D-CU pairing, which facilitates interpreting the D2D-CU pairing as a bipartite graph matching solved using the Hungarian algorithm. We transform the configuration of the RISs into a quadratically constrained quadratic program (QCQP) with multiple quadratic constraints. A low-complexity algorithm, named Riemannian manifold-based alternating direction method of multipliers (RM-ADMM), is developed to decompose the QCQP into simpler QCQPs with a single constraint each, and solve them efficiently in a decentralized manner. Simulations show that the proposed algorithm can significantly improve the sum-rate of the D2D-underlaid system with a reduced complexity, as compared to its alternative based on semidefinite relaxation (SDR). [ABSTRACT FROM AUTHOR]

Non-cooperative cellular massive MIMO, combined with power control, is known to lead to significant improvements in per-user throughput compared with conventional LTE technology. In this paper, we investigate further refinements to massive MIMO, first, in the form of three-fold sectorization, and second, coordinated multi-point operation (with and without sectorization), in which the three base stations cooperate in the joint service of their users. For these scenarios, we analyze the downlink performance for both maximum-ratio and zero-forcing precoding and derive closed-form lower-bound expressions on the achievable rate of the users. These expressions are then used to formulate power optimization problems with two throughput fairness criteria: ${i}$) network-wide max-min fairness, and ii) per-cell max-min fairness. Furthermore, we provide centralized and decentralized power control strategies to optimize the transmit powers in the network. We demonstrate that employing sectorized antenna elements mitigates the detrimental effects of pilot contamination by rejecting a portion of interfering pilots in the spatial domain during channel estimation phase. Simulation results with practical sectorized antennas reveal that sectorization and multi-point coordination combined with sectorization lead to more than $1.7\times $ and $2.6\times $ improvements in the 95%-likely per-user throughput, respectively. [ABSTRACT FROM AUTHOR]

A popular technique of designing multiple-input multiple-output (MIMO) communication systems relies on optimizing the positive semidefinite covariance matrix at the source. In this paper, a unified MIMO optimization framework based on the Karush-Kuhn-Tucker (KKT) conditions is proposed. In this framework, with the aid of matrix optimization theory, presents a generic optimal transmit covariance matrix for MIMO systems with diverse objective functions subject to various power constraints and different levels of channel state information (CSI). Specifically, fundamentally reveals that for a diverse family of MIMO systems, the optimal transmit covariance matrices associated with different objective functions under various power constraints can be derived in a unified generic water-filling-like form. When applying to the case of multiple general power constraints, we firstly equivalently transform multiple power constraints into a single counterpart by introducing multiple weighting factors based on Pareto optimization theory. The optimal weighting factors can be found by the proposed modified subgradient method. On the other hand, for the imperfect MIMO system with statistical CSI errors, we firstly address the non-convexity of the robust optimization problem by following the idea of alternating optimization. Finally, our numerical results verify the optimal solution structure in and the global optimality of the proposed modified subgradient method, as well as demonstrate the performance advantages of the proposed alternating optimization algorithm. [ABSTRACT FROM AUTHOR]

This paper considers an angle-domain intelligent reflecting surface (IRS) system. We derive maximum likelihood (ML) estimators for the effective angles from the base station (BS) to the user and the effective angles of propagation from the IRS to the user. It is demonstrated that the accuracy of the estimated angles improves with the number of BS antennas. Also, deploying the IRS closer to the BS increases the accuracy of the estimated angle from the IRS to the user. Then, based on the estimated angles, we propose a joint optimization of BS beamforming and IRS beamforming, which achieves similar performance to two benchmark algorithms based on full CSI and the multiple signal classification (MUSIC) method respectively. Simulation results show that the optimized BS beam becomes more focused towards the IRS direction as the number of reflecting elements increases. Furthermore, we derive a closed-form approximation, upper bound and lower bound for the achievable rate. The analytical findings indicate that the achievable rate can be improved by increasing the number of BS antennas or reflecting elements. Specifically, the BS-user link and the BS-IRS-user link can obtain power gains of order N and NM2, respectively, where N is the antenna number and M is the number of reflecting elements. [ABSTRACT FROM AUTHOR]

Developing resource allocation algorithms for the uplink sparse code multiple access (SCMA) scheme to satisfy multiple objectives is challenging, especially where users are randomly distributed. In this paper, we aim to address this challenge by developing a joint resource allocation method as a multi-objective optimization (MO) problem to maximize the average sum rate and fairness among users as key and sub-key objectives, respectively. For this purpose, the exact analytical expressions for the average sum rate and users’ individual rate are extracted based on an adaptive weighted graph matrix (AWGM). An AWGM matrix beneficially replaces the factor graph and the power allocation matrices to simplify the MO problem based on the asymmetric modified bipartite matching (AMBM) algorithm. The power allocation strategy is utilized during the optimal resource assignment process using the AMBM algorithm. After the AMBM process, we propose a low-complexity four-step algorithm to obtain the AWGM. The simulation results show that our proposed method can compromise and improve the multiple objectives’ performance and guarantees a stable range of network performance at different times. [ABSTRACT FROM AUTHOR]

Cell-free (CF) massive Multiple-Input Multiple-Output (MIMO) with large number of distributed access points (APs) has emerged as a new paradigm allowing higher macro diversity for randomly distributed users. However, the fronthaul traffic bandwidth between central processing unit and the APs can explode in particular in the uplink, requiring expensive star-topology with point-to-point fronthaul links. To achieve a scalable CF massive MIMO architecture and a cost-effective fronthauling solution, we consider, in this paper, a point-to-multipoint fronthaul topology where (a subset of) the APs share a serial fronthaul link offering a per-user limited fronthaul bandwidth. We develop a novel unified optimization framework for iterative power control and AP scheduling that provides a systematic user-centric solution towards scalable uplink CF massive MIMO. Experimental results show that power control is not sufficient to guarantee the best objective and, therefore, the appropriate association of the users to the APs is required to improve the overall system signal-to-noise ratio. Under the stringent fronthaul bandwidth, the proposed joint optimization framework results in i) significant 5% outage data rate increase ii) near uniform distribution of the served users per APs and, hence, an increased diversity and iii) fast convergence of the algorithm within a few iterations. [ABSTRACT FROM AUTHOR]

Technically, the security performance of generalized spatial modulation (GenSM) networks can be enhanced by dynamically adjusting the precoder allocated to the legitimate signal as communication channel varies. For this purpose, our paper proposes a secure transmission strategy upon designing both digital and analog precoders for hybrid GenSM systems, where an eavesdropper is taken into account. The concept of the hybrid GenSM system has arose to improve the spatial multiplexing (SMX) gain for remedying the shortcoming of the limited number of radio frequency chains in traditional GenSM systems. However, this may lead to a great deal of security degradation since the SMX gain of the unintended receiver will be also improved. To this end, we develop a secrecy enhancement scheme by devising both analog and digital precoders for hybrid GenSM networks. Specifically, we derive an efficiently closed-form alternative to the original secrecy rate (SR) expression for reducing the excessive computational complexity of the joint optimization problem over the hybrid precoder. Then, by using this alternative as our cost function, an iterative algorithm is proposed. In particular, we elaborately conceive a pair of concave maximization problems in order to optimize the digital and analog precoders, respectively. Our proposed strategy not only utilizes semi-positive definite relaxing technique over the analog precoder but also invokes a lower bound of the alternative to further simplify the optimization over the vectored digital precoder. Subsequently, both the convergence and computational complexity of the proposed alternating iteration algorithm are analyzed. Compared to existing designs, our proposed strategy strikes a compelling role in balancing the SR performance and complexity. Finally, our simulation results confirm the efficiency of the proposed algorithm in terms of the SR performance achieved. [ABSTRACT FROM AUTHOR]

This paper proposes a joint iterative optimization based hybrid beamforming technique for massive MU-MIMO systems. The proposed technique jointly and iteratively optimizes the transmitter precoders and combiners, aiming to approach the global optimum solution for the system sum-rate maximization problem. The proposed technique develops an adaptive algorithm exploiting the stochastic gradients (SG) of the local beamformers and provides low-complexity closed-form solutions. Furthermore, an efficient adaptive scheme is developed based on the proposed adaptive algorithm and the closed-form solutions. The proposed algorithm requires the signal-to-interference-plus-noise ratio (SINR) feedback from each user and a limited size transition vector to be exchanged between the transmitter and receivers at each step to update beamformers locally. Analytic result shows that the proposed adaptive algorithm achieves low-complexity when the array size is large and is able to converge within a small number of iterations. Simulation result shows that the proposed technique is able to achieve superior performance comparing to the existing state-of-art techniques. In addition, the knowledge of instantaneous channel state information (CSI) is not required as the channels are also adaptively estimated with each coherence time which is a practical assumption since the CSI is usually unavailable or have time-varying nature in real-time applications. [ABSTRACT FROM AUTHOR]

In this paper, we consider the weighted sum-power minimization under quality-of-service (QoS) constraints in the multi-user multi-input-single-output (MISO) uplink wireless network assisted by intelligent reflecting surface (IRS). We perform a comprehensive investigation on various aspects of this problem. First, when users have sufficient transmit powers, we present a new sufficient condition guaranteeing arbitrary information rate constraints. This result strengthens the feasibility condition in existing literature. Then, we design novel penalty dual decomposition (PDD) based and nonlinear equality constrained alternative direction method of multipliers (neADMM) based solutions to tackle the IRS-dependent-QoS-constraints, which effectively solve the feasibility check and power minimization problems. Besides, we further extend our proposals to the cases where channel status information (CSI) is imperfect and develop an online stochastic algorithm that satisfy QoS constraints stochastically without requiring prior knowledge of CSI errors. Extensive numerical results are presented to verify the effectiveness of our proposed algorithms. [ABSTRACT FROM AUTHOR]

In this paper, we investigate optimal downlink power allocation in massive multiple-input multiple-output (MIMO) networks with distributed antenna arrays (DAAs) under correlated and uncorrelated channel fading. In DAA massive MIMO, a base station (BS) consists of multiple antenna sub-arrays. Notably, the antenna sub-arrays are deployed in arbitrary locations within a DAA massive MIMO cell. Consequently, the distance-dependent large-scale propagation coefficients are different from a user to these different antenna sub-arrays, which makes power control a challenging problem. We assume that the network operates in time-division duplex mode, where each BS obtains the channel estimates via uplink pilots. Based on the channel estimates, the BSs perform maximum-ratio transmission in the downlink. We then derive a closed-form signal-to-interference-plus-noise ratio (SINR) expression, where the channels are subject to correlated fading. Based on the SINR expression, we propose a network-wide max-min power control algorithm to ensure that each user in the network receives a uniform quality of service. Numerical results demonstrate the performance advantages offered by DAA massive MIMO. For some specific scenarios, DAA massive MIMO can improve the average per-user throughput up to 55%. Furthermore, we demonstrate that channel fading covariance is an important factor in determining the performance of DAA massive MIMO. [ABSTRACT FROM AUTHOR]

Pilot contamination is a limiting factor in multicell massive multiple-input multiple-output (MIMO) systems because it can severely impair channel estimation. Prior works have suggested coordinating pilot design across cells in order to reduce the channel estimation error caused by pilot contamination. In this paper, we propose a method for coordinated pilot design using fractional programming to minimize the weighted mean squared-error (MSE) in channel estimation. In particular, we apply the recently proposed quadratic transform to the MSE expression which allows the effect of pilot contamination to be decoupled. The resulting problem reformulation enables the pilots to be optimized in closed form if they can be designed arbitrarily. When the pilots are restricted to a given set of orthogonal sequences, pilot optimization reduces to an assignment problem which can be solved by weighted bipartite matching. Furthermore, we consider the max-min fairness of data rates with orthogonal pilots and obtain an extension of the proposed method to correlated Rayleigh fading. Finally, simulations demonstrate the advantage of the proposed (orthogonal and nonorthogonal) pilot designs as compared with state-of-the-art methods in combating pilot contamination. [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]

Precoder optimization with full channel state information for finite alphabet signals over multiple-input multiple-output random channels is investigated in this paper. The precoder is represented by a product of power allocation matrix and constellation-forming matrix. There was an optimal algorithm introduced in the literature to globally maximize the channel mutual information by iteratively optimizing these two matrices. However, the computational complexity of the optimal algorithm is painfully high, especially when it is used with the high-order modulation and the high-data stream number. In this paper, we propose a novel sub-optimal low-complexity precoding algorithm and compare it with the optimal one. The new algorithm proceeds in two steps. First, the constellation-forming matrix is fixed in order to maximize the minimum Euclidean distance between the received symbols, which ensures high channel mutual information. Then, given the constellation-forming matrix, an iterative algorithm searches for the power allocation matrix that maximizes the channel mutual information. Since optimizing only one matrix instead of two, the new algorithm not only achieves a lower computational complexity but also avoids the use of initial values, which must be carefully selected for each channel and signal-to-noise ratio for fast convergence. Another advantage of the new algorithm is that the resulting precoder has a fixed form of received constellation thanks to the fixed constellation-forming matrix. This allows us to optimize the symbol mapping on the received constellation. Simulation results show that the proposed low-complexity precoder achieves error-rate performance that is close to performance of the optimal one when the conventional mapping is used. In addition, the new precoder used with optimized mapping at received constellation shows significant error-rate performance improvement. [ABSTRACT FROM AUTHOR]

In this paper, we propose a novel hybrid user pairing (HUP) scheme in multiuser multiple-input single-output non-orthogonal multiple access networks with simultaneous wireless information and power transfer. In this system, two information users with distinct channel conditions are optimally paired while energy users perform energy harvesting (EH) under non-linearity of the EH circuits. We consider the problem of jointly optimizing user pairing and power allocation to maximize the overall spectral efficiency (SE) and energy efficiency (EE) subject to user-specific quality-of-service and harvested power requirements. A new paradigm for the EE-EH trade-off is then proposed to achieve a good balance of network power consumption. Such design problems are formulated as the maximization of non-concave functions subject to the class of mixed-integer non-convex constraints, which are very challenging to solve optimally. To address these challenges, we first relax binary pairing variables to be continuous and transform the design problems into equivalent non-convex ones, but with more tractable forms. We then develop low-complexity iterative algorithms to improve the objectives and converge to a local optimum by means of the inner approximation framework. Simulation results show the convergence of proposed algorithms and the SE and EE improvements of the proposed HUP scheme over state-of-the-art designs. In addition, the effects of key parameters such as the number of antennas and dynamic power at the BS, target data rates, and energy threshold, on the system performance are evaluated to show the effectiveness of the proposed schemes in balancing resource utilization. [ABSTRACT FROM AUTHOR]

A common model for transmission over wireless links is that of a multiantenna system affected by an additive interfering signal. In some scenarios of interest, such as when the interferer is located close to the transmitter and performs retransmission, interference may be learned by the transmitter, but remain unknown at the receiver. In this case, it is well known that, if transmitter and receiver have perfect channel state information (CSI), then a technique called Dirty Paper Coding (DPC) is able to fully mitigate the interference. This paper studies the impact of imperfect CSI on a multiple-input multiple-output (MIMO) system with interference and compares the performance of DPC with that of a scheme where interference is decoded at the receiver, which we refer to as beamforming with joint decoding (BF-JD). Unlike DPC, which models the interference as an "unstructured" random process, BF-JD exploits the fact that the interfering signal is a codeword of the interferer's codebook. It is demonstrated by analysis and numerical results that BF-JD provides advantages over DPC when CSI is imperfect at the transmitter but perfect at the receiver, whereas this is not true for the case of imperfect CSI at both transmitter and receiver. [ABSTRACT FROM AUTHOR]

The optimization of joint source and channel coding for a sequence of numerous progressive packets has been a challenging problem. Further, the problem becomes more complicated if the space-time coding is also involved with the optimization in a multiple-input multiple-output (MIMO) system. This is because the number of ways of jointly assigning channel codes and space-time codes to progressive packets is much larger than that of solely assigning channel codes to the packets. To our knowledge, there is no complete and feasible solution for the optimization of joint source, channel, and space-time coding of progressive packets. This paper applies a parametric approach to address such a highly nonlinear optimization problem in MIMO systems. We use the parametric methodology and derive some relevant properties, which are exploited to propose an efficient optimization method where the joint assignment of channel codes and space-time codes to the packets can be optimized in a packet-by-packet manner. As a result, the computational complexity of the proposed method linearly increases in the number of packets, whereas that of the exhaustive search exponentially increases in the number of packets. The numerical results show that the proposed method significantly improves the peak-signal-to-noise ratio performance of the conventional rate-based optimal solution in a MIMO system. [ABSTRACT FROM AUTHOR]

In this paper, we propose a novel low-complexity, near-optimal soft-input soft-output detector for $\text {N}\times \text {M}$ multiple-input multiple-output (MIMO) systems. Our algorithm is based on the combination of minimum mean square error decision feedback equalization (MMSE-DFE) and conditional optimization. In a round-robin fashion, one symbol is detected using exhaustive search in such a way that all $\text {N}\times (\text {M}-1)$ submatrices of the baseband channel matrix are considered and the one with the best metric is chosen. This search over all columns of the channel matrix, which can be performed in parallel, has the advantages of improving the performance of the hard-output version of the detector, and refining the list of candidates for efficient implementation of the soft-output detector for MIMO systems with error correcting codes. In particular, it is shown that the error performance of the soft-output system is comparable to that of the list sphere decoder (LSD) but with much smaller list size, and hence smaller complexity than the latter. We also analyze the performance and complexity of the proposed algorithm and discuss different techniques to further reduce its complexity without affecting the performance. Finally, the obtained theoretical results are validated via simulations. [ABSTRACT FROM AUTHOR]

In this paper, we study the problem of downlink (DL) sum rate maximization in codebook based multiuser (MU) multiple input multiple output (MIMO) systems. The user equipments (UEs) estimate the DL channels using pilot symbols sent by the access point (AP) and feedback the estimates to the AP over a control channel. We present a closed form expression for the achievable sum rate of the MU-MIMO broadcast system with codebook constrained precoding based on the estimated channels, where multiple data streams are simultaneously transmitted to all users. Next, we present novel, computationally efficient, minorization-maximization (MM) based algorithms to determine the selection of beamforming vectors and power allocation to each beam that maximizes the achievable sum rate. Our solution involves multiple uses of MM in a nested fashion. Based on this approach, we propose and contrast two algorithms, which we call the square-root-MM (SMM) and inverse-MM (IMM) algorithms. The algorithms are iterative and converge to a locally optimal beamforming vector selection and power allocation solution from any initialization. We evaluate the performance and complexity of the algorithms for various values of the system parameters, compare them with existing solutions, and provide further insights into how they can be used in system design. [ABSTRACT FROM AUTHOR]

Communications in high-mobility environments have received a lot of attention recently. In this paper, fast time-varying channels for massive multiple-input multiple-output (MIMO) systems are addressed. We derive the exact channel power spectrum density (PSD) for the uplink from a high-speed railway (HSR) to a base station (BS) and propose to further reduce the channel time variation via beamforming network optimization. A large-scale uniform linear array (ULA) is equipped at the HSR to separate multiple Doppler shifts in the angle domain through high-resolution transmit beamforming. Each branch comprises a dominant Doppler shift, which can be compensated to suppress the channel time variation, and we derive the channel PSD and the Doppler spread to assess the residual channel time variation. Interestingly, the channel PSD can be exactly expressed as the product of a pattern function and a beam-distortion function. The former reflects the impact of array aperture and is the converted radiation pattern of ULA, while the latter depends on the configuration of the beamforming directions. Inspired by the PSD analysis, we introduce a common configurable amplitudes and phases (CCAP) parameter to optimize the beamforming network, by partly removing the constant modulus quantized phase constraints of matched filter (MF) beamformers. In this way, the residual Doppler shifts can be ulteriorly suppressed, further reducing the residual channel time variation. The optimal CCAP parameter minimizing the Doppler spread is derived in a closed form. Numerical results are provided to corroborate both the channel PSD analysis and the superiority of the beamforming network optimization technique. [ABSTRACT FROM AUTHOR]

In this paper, we investigate the offloading energy and latency trade-off in a multiuser full-duplex (FD) system. We consider a multi-user FD system where a FD base station (BS), equipped with a mobile-edge computing (MEC) server, carries out data transmission in the downlink while at the same time receiving computational tasks from mobile devices in the uplink. Our main aim is to study the trade-off between the offloading energy and latency, which are known to be very important and desirable system objectives for both the system operator and users. In practice, there always exists a trade-off between these two objectives. Toward this aim, we formulate two weighted multi-objective optimization problems (MOOPs), one where the multi-user interference (MUI) is suppressed and the other where MUI is rather exploited. As a result, our proposed MOOPs allow for a scalable trade-off between the two objectives. To tackle the non-convexity of the formulations, we design an iterative algorithm through Lagrangian method. We also address the scenario of imperfect channel state information (CSI) at the FD BS. For the imperfect CSI case, we apply convex relaxations and transformation using the S-procedure to tackle the non-convexity of the formulations. Simulation results show the effectiveness of the proposed FD schemes compared with the existing baseline half duplex schemes and the superiority of MUI exploitation over suppression. [ABSTRACT FROM AUTHOR]

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]

In wireless communication systems, channel state feedback (CSF) is widely used to improve link performance. However, CSF consumes extra system resources and results in transmission overhead. In this paper, we evaluate such resource consumption in terms of bit rate and provide an explicit expression for the lower bound of the CSF overhead. We propose an overhead optimization mechanism under the constraint of channel state reconstruction accuracy. The numerical simulations show that our paper is beneficial to select the optimum CSF parameters, including the average bit number and channel state feedback period. It is also shown that the proposed overhead optimization scheme is able to reduce the system resource consumption with a guaranteed reconstruction accuracy. [ABSTRACT FROM AUTHOR]

Multiple-input multiple-output (MIMO) technology equips the transmitters with the multiple antennas. It can combine with energy harvesting (EH) to lift the spectrum efficiency and make use of a greener energy resource. A power grid is added to serve as a supplementary source to regulate the not-so-stable harvested energy supply of the system. Besides the MIMO technology being used, the power allocated to the user provided by both EH and the power grid is subject to the epoch power upper bound constraints. The background of these constraints comes from field requirements, such as avoiding the saturation of power allocated to the user(s), avoiding system-level out-of-band power leakage, and reducing interference with other transmitter(s) due to the non-linearity generated via the transmitting mechanisms to the user(s). The epoch power upper bound constraints make this problem more challenging, with the controllable power grid energy budget and its allocation. This paper applies our recently proposed geometric water-filling with group upper bounded power constraints and recursion machinery to form the proposed algorithm for solving the proposed throughput maximization problem. Our algorithm is precisely defined, and further provides the exact solution via the lower degree polynomial complexity. This point is very suitable for the massive MIMO system. To the best of our knowledge, no prior algorithm has been reported in the open literature to solve the targeted problem in this paper. [ABSTRACT FROM PUBLISHER]

This paper considers the sum-rate (SR) maximization problem in downlink multi-user multiple input simgle output (MU-MISO) systems under imperfect channel state information at the transmitter (CSIT). Contrary to existing works, we consider a rather unorthodox transmission scheme. In particular, the message intended to one of the users is split into two parts: a common part which can be recovered by all users, and a private part recovered by the corresponding user. On the other hand, the rest of users receive their information through private messages. This rate-splitting (RS) approach was shown to boost the achievable degrees of freedom when CSIT errors decay with increased SNR. In this paper, the RS strategy is married with linear precoder design and optimization techniques to achieve a maximized ergodic SR (ESR) performance over the entire range of SNRs. Precoders are designed based on partial CSIT knowledge by solving a stochastic rate optimization problem using means of sample average approximation coupled with the weighted minimum mean square error approach. Numerical results show that in addition to the ESR gains, the benefits of RS also include relaxed CSIT quality requirements and enhanced achievable rate regions compared with conventional transmission with no rate-splitting. [ABSTRACT FROM PUBLISHER]

The explosive data traffic and connections in 5G networks require the use of non-orthogonal multiple access (NOMA) to accommodate more users. Unmanned aerial vehicle (UAV) can be exploited with NOMA to improve the situation further. In this paper, we propose a UAV-assisted NOMA network, in which the UAV and base station (BS) cooperate with each other to serve ground users simultaneously. The sum rate is maximized by jointly optimizing the UAV trajectory and the NOMA precoding. To solve the optimization, we decompose it into two steps. First, the sum rate of the UAV-served users is maximized via alternate user scheduling and UAV trajectory with its interference to the BS-served users below a threshold. Then, the optimal NOMA precoding vectors are obtained using two schemes with different constraints. The first scheme intends to cancel the interference from the BS to the UAV-served user, while the second one restricts the interference to a given threshold. In both schemes, the non-convex optimization problems are converted into tractable ones. An iterative algorithm is designed. Numerical results are provided to evaluate the effectiveness of the proposed algorithms for the hybrid NOMA and UAV network. [ABSTRACT FROM AUTHOR]

Hybrid analog and digital beamforming (HBF) has recently emerged as an attractive technique for millimeter-wave (mmWave) communication systems. It well balances the demand for sufficient beamforming gains to overcome the propagation loss and the desire to reduce the hardware cost and power consumption. In this paper, the mean square error (MSE) is chosen as the performance metric to characterize the transmission reliability. Using the minimum sum-MSE criterion, we investigate the HBF design for broadband mmWave transmissions. To overcome the difficulty of solving the multi-variable design problem, the alternating minimization method is adopted to optimize the hybrid transmit and receive beamformers alternatively. Specifically, a manifold optimization-based HBF algorithm is first proposed, which directly handles the constant modulus constraint of the analog component. Its convergence is then proved. To reduce the computational complexity, we then propose a low-complexity general eigenvalue decomposition-based HBF algorithm in the narrowband scenario and three algorithms via the eigenvalue decomposition and orthogonal matching pursuit methods in the broadband scenario. A particular innovation in our proposed alternating minimization algorithms is a carefully designed initialization method, which leads to a faster convergence. Furthermore, we extend the sum-MSE-based design to that with weighted sum-MSE, which is then connected to the spectral efficiency-based design. Simulation results show that the proposed HBF algorithms achieve a significant performance improvement over existing ones and perform close to full-digital beamforming. [ABSTRACT FROM AUTHOR]

Aimed at providing high data rate in wireless local area networks (WLANs), the IEEE 802.11ac standard has been developed with key enhancements, including increasing the transmission rate and enlarging the packet payload length. The improvement in the sum rate performance, nevertheless, could become marginal or even disappear when nodes of legacy 802.11a/n standards coexist. It is, therefore, of paramount importance to study how to optimize the network sum rate of a multi-standard WLAN. In this paper, a multi-group model is proposed to analyze the data rate performance of a multi-standard WLAN where nodes with different standards have distinct transmission rates and packet payload lengths. It is shown that the packet payload length is a key system parameter that has a crucial impact on both the network sum rate and the ratio of node data rates. The enhancement proposed in the latest 802.11ac standard on enlarging the packet payload length can improve the data rate performance of its own nodes, but it may lead to the starvation of the legacy 802.11a/n nodes, and even impair the sum rate performance. To maximize the network sum rate with given target ratios of node data rates, the optimal packet payload lengths with or without joint tuning of the initial backoff window sizes are further obtained, which shed important light on the optimal network design of WLANs. [ABSTRACT FROM AUTHOR]

In this paper, we design the precoding matrix with broad coverage for massive multi-input multi-output public channels. In order to guarantee the efficient use of power amplifiers and improve the achievable ergodic rate, equal transmit power per-antenna and semi-unitary constraints on the precoding matrix are considered simultaneously. Within the framework of manifold optimization, the precoding matrix design under the above two constraints becomes an optimization problem over the intersection of the oblique manifold and the Stiefel manifold. We propose to use the steepest descent method on the intersection of these two manifolds to obtain the optimal solution. By using the alternating projections method, the search direction of the steepest descent method is derived. Meanwhile, the convergence analysis for the proposed approach is also provided. The proposed approach can be used for both omnidirectional and sector-shaped power pattern design. Simulation results show that the power pattern of our designed precoder has less variation in different spatial directions within the cell coverage compared with the existing Zadoff–Chu scheme. [ABSTRACT FROM AUTHOR]

In this paper, we analyze the performance degradation of a multi-hop decode-and-forward full-duplex relaying system caused by the residual self-interference (RSI) and hardware distortions (HWD) imposed by the FDR operation and imperfect hardware, respectively. In addition, we study the benefits of employing improper Gaussian signaling (IGS) in the MH-FDR system. Different from the traditional symmetric signaling scheme, i.e., proper Gaussian signaling (PGS), IGS has non-zero pseudo-variance that can limit the impact of RSI and HWD in the MH-FDR system. To evaluate the system performance gain using IGS, first we express the end-to-end achievable rate of the MH system as the minimum rate supported by all participating links. Then, we optimize the pseudo-variance of all participating transmitters, including source and relays to compensate the interference impact and improve the end-to-end achievable rate. We propose two network optimization schemes based on the system characteristics, i.e., joint optimization framework and distributed optimization scenario. Interestingly, IGS-based scheme outperforms its counterpart PGS-based scheme, especially at higher interference-to-noise ratio. Our findings reveal that using IGS in single-user detection systems that suffer from both RSI and HWD can effectively mitigate the degradation in the achievable rate performance. [ABSTRACT FROM AUTHOR]

Orthogonal frequency-division multiplexing (OFDM) and single-carrier frequency-domain equalization (SC-FDE) are the two commonly adopted modulation schemes for frequency-selective channels. Compared to SC-FDE, OFDM generally achieves higher data rates but at the cost of higher transmit signal peak-to-average power ratio (PAPR), which leads to lower power-amplifier efficiency. This paper studies a multi-group single carrier modulation scheme, termed flexible multi-group single carrier (FMG-SC), which encapsulates both OFDM and SC-FDE as special cases, thus achieving more flexible rate-PAPR tradeoffs between them. Specifically, in FMG-SC, the total bandwidth is divided into a set of orthogonal subcarriers that, based on the channel gains, are flexibly mapped to multiple non-overlapping groups, and SC-FDE is applied over each group independently to send multiple data streams in parallel. We investigate the joint subcarrier grouping and power allocation optimization problem to maximize the achievable rate of our proposed FMG-SC scheme for both the cases with Gaussian signaling and with practical modulation constellation (e.g., quadrature amplitude modulation), respectively. For both cases, the optimization problem is non-convex in general, for which we propose a two-step approach for finding a high-quality approximate solution efficiently. First, with any given subcarrier grouping, we show that the optimal power allocation can be obtained via convex optimization techniques. Second, with fixed power allocation, we propose low-complexity algorithms for the subcarrier grouping design catering to the SC-FDE receiver. Numerical results show that our proposed algorithms perform close to the optimal solution obtained via exhaustive search over all subcarrier groupings yet with substantially reduced complexity. Moreover, the achievable rate of our proposed FMG-SC scheme with Gaussian signaling approaches the OFDM channel capacity and significantly outperforms that of SC-FDE. Furthermore, with practical modulation constellation, numerical results show that our proposed FMG-SC scheme greatly outperforms the existing single carrier frequency-division multiple access in terms of achievable rate but with moderately increased PAPR. [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, a high-rate and diversity-achieving spatial modulation transmission scheme is proposed, which uses the stacked Alamouti code as the transmitted signal matrix and then is named as stacked Alamouti based spatial modulation (SA-SM) scheme. In this scheme, the spatial constellation (SC) is composed of all the possible activated antennas combinations. According to a specific SC codeword, the corresponding symbols in the stacked Alamouti code are simultaneously activated. Owing to the structure of stacked Alamouti code, the SA-SM scheme can work with arbitrary even number of transmit antennas $n_{T}$ , and any number of activated antennas from 1 to $n_{T}$. With the same number of activated antennas $n_{A}$ , the SA-SM scheme carries more symbols than the spatially modulated orthogonal space-time block codes (SM-OSTBC) scheme, thus SA-SM can achieve higher spectral efficiency. Without the need of any parameter or matrix optimization, the SA-SM scheme enjoys the non-vanishing determinants property. Moreover, owing to possessing the block-orthogonal structure, SA-SM enables faster metric computations in the QR decomposition-M detection, and then it achieves significant decoding complexity reduction without performance loss. Under various system configurations, the performance advantages of SA-SM over several existing diversity-achieving SM schemes such as GSTSK and SM-OSTBC, are shown by simulation results for various spectral efficiencies. [ABSTRACT FROM AUTHOR]

Channel asymmetry and channel correlation are frequently encountered in wireless communication systems. Orthogonal transmission schemes are usually inefficient in dealing with these problems. In this paper, in order to boost the throughput performance for multiple-input multiple-output broadcast communications in the presence of channel asymmetry and/or channel correlation, we study optimization algorithms for multi-user superposition coding beamforming (SCBF). Starting with solving the minimum power optimization problem for the two-user case, we derive the optimal solution structure of the problem and two types of dedicated algorithms that could efficiently find the optimal solutions with all parameter setups. Extensions are then made to the same problem with the signals of more than two users multiplexed in the power domain as well as to the rate region computation problem. Finally, to adapt our algorithms to more general cases, novel hybrid precoding schemes are proposed, where certain user grouping strategy is used to combine zero-forcing beamforming and SCBF. Numerical simulations are provided to show that with our algorithms, a considerable performance gain is achieved by SCBF compared to the other orthogonal transmission methods. [ABSTRACT FROM AUTHOR]

This paper focuses on distributed linear precoding when users transmit correlated information over a fading multiple-input and multiple-output multiple access channel. The precoders are optimized in order to minimize the sum-mean square error (MSE) between the source and the estimated symbols. When sources are correlated, minimizing the sum-MSE results in a non-convex optimization problem. The precoders for an arbitrary number of users and transmit and receive antennas are thus obtained via a projected steepest-descent algorithm and a low-complexity heuristic approach. For the more restrictive case of two single-antenna users, a closed-form expression for the minimum sum-MSE precoders is derived. Moreover, for the scenario with a single receive antenna and any number of users, a solution is obtained by means of a semi-definite relaxation. Finally, we also consider precoding schemes where the precoders are decomposed into complex scalars and unit norm vectors. Simulation results show a significant improvement when source correlation is exploited at precoding, especially for low signal-to-noise ratios and when the number of receive antennas is lower than the number of transmitting nodes. [ABSTRACT FROM AUTHOR]

This paper considers the uplink of multiuser multiple-input multiple-output systems, where several mobile stations (MSs) cooperatively transmit hybrid messages, including common messages and private messages, to a single base station (BS). We aim to jointly design transmit precoding at the MSs’ side and antenna selection at the BS side to maximize the achievable system throughput while reducing implementation complexity. The problem at hand is nonconvex and difficult to solve due to the antenna selection constraint. By exploiting the problem structure and linear relaxation, we propose using the Frank–Wolfe method and the well-known weighted mean-square error minimization approach to tackle the problem, leading to an efficient iterative algorithm. Moreover, due to the large number of antennas, the sparsity of antenna selection is also taken into account by introducing an $l_{0}$ -norm penalty function into the objective function. To tackle this nonconvex and discontinuous problem, we resort to quadratic approximation with smooth optimization and extend our proposed algorithm to the sparse optimization problem. The convergence of the proposed algorithms is analyzed and its effectiveness is verified by numerical examples in terms of the achieved system throughput. [ABSTRACT FROM AUTHOR]

This paper studies transmission strategies for the downlink of a cloud radio access network, in which the base stations are connected to a centralized cloud computing-based processor with digital fronthaul or backhaul links. We provide a system-level performance comparison of two fundamentally different strategies, namely, the data-sharing strategy and the compression strategy, which differ in the way the fronthaul/backhaul is utilized. It is observed that the performance of both strategies depends crucially on the available fronthaul or backhaul capacity. When the fronthaul/backhaul capacity is low, the data-sharing strategy performs better, while under moderate-to-high fronthaul/backhaul capacity, the compression strategy is superior. Using insights from such a comparison, we propose a novel hybrid strategy, combining the data-sharing and compression strategies, which allows for better control over the fronthaul/backhaul capacity utilization. An optimization framework for the hybrid strategy is proposed. Numerical evidence demonstrates the performance gain of the hybrid strategy. [ABSTRACT FROM AUTHOR]

This paper studies the security aspect of a recently introduced “cell-free massive MIMO” network under a pilot spoofing attack. First, a simple method to recognize the presence of this type of an active eavesdropping attack to a particular user is shown. In order to deal with this attack, we consider the problem of maximizing the achievable data rate of the attacked user or its achievable secrecy rate. The corresponding problems of minimizing the power consumption subject to security constraints are also considered in parallel. Path-following algorithms are developed to solve the posed optimization problems under different power allocation to access points (APs). Under equip-power allocation to APs, these optimization problems admit closed-form solutions. Numerical results show their efficiency. [ABSTRACT FROM AUTHOR]

In this paper, an optimization problem to maximize the energy efficiency of a hybrid automatic repeat request with incremental redundancy (HARQ-IR) is considered for massive multiple-input multiple-output (MIMO) systems. Because a sum rate for multiple HARQ-IR rounds is approximated by a Gaussian distribution, a problem maximizing energy efficiency becomes tractable. In particular, a simplified form of energy efficiency for massive MIMO transmissions with an HARQ-IR protocol is derived using an outage probability, which is given by a tail probability of the Gaussian distribution. By exploiting the proposed simplified form, we show that the energy efficiency of the system is approximated by a piecewise quasi-concave function. Using these properties, an algorithm finding the optimal transmission power and number of transmission rounds for maximizing energy efficiency is proposed. Moreover, we show that the optimal number of HARQ transmission rounds can be less than the maximum allowable retransmissions when considering the constant power consumption of the massive MIMO system with an HARQ-IR protocol. Simulation results verify the theoretical analysis and show the performance of the proposed algorithm. [ABSTRACT FROM AUTHOR]

Social and communication networks interact with each other in multifaceted ways, yet these interactions are often considered to be secondary in throughput, privacy and security analysis for communication networks. In this paper, full-duplex (FD) and half-duplex (HD) multi-antenna cooperative communication systems are studied by taking both physical links and social connections into account. An optimal beamformer for maximizing communication rate in the proposed socio-technological setting aims to balance between the direct link and the cooperating link as well as respecting the trust degree between the users. The resulting optimization problems are nontrivial to solve, even numerically, as they are not convex. The complexity of the problems is significantly reduced by showing that a linear combination of the direct and cooperating links’ channel vectors maximizes the achievable rate. Then, a computationally efficient numerical solution is used to maximize the rates both in the FD and HD modes. Numerical results demonstrate that significant gains in communication rates can be obtained with the proposed optimal beamforming design. [ABSTRACT FROM AUTHOR]