Search

Cellular networks are increasingly densified to deal with the fast growing wireless traffic. Interference mitigation plays a key role for the dense cellular networks. Successive interference cancellation (SIC) and fractional frequency reuse (FFR) are two representative inter-cell interference (ICI) mitigation techniques. In this paper, we study the application of both SIC and FFR for LTE uplink networks, and develop an analytical model to investigate their interactions and impact on network performance. The performance gains with FFR and SIC are related to key system functionalities and variables, such as SIC parameters, FFR bandwidth partition, uplink power control and sector antennas. The ICIs from individual cell sectors are approximated by log-normal random variables, which enables low complexity computation of the aggregate ICI with FFR and SIC. Then, network performance of site throughput and outage probability is computed. The model is fast and has small modeling deviation, which is validated by simulations. Numerical results show that both SIC and FFR can largely improve network performance, but SIC has a stronger impact than FFR. In addition, most of the network performance gains with SIC could be obtained with a small number of SIC stages applied to a few sectors. [ABSTRACT FROM AUTHOR]

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

The fifth generation communication systems aim to achieve higher capacity and more user access. Full-duplex (FD) communication can achieve twice the spectral efficiency of the conventional half-duplex systems under ideal conditions, and FD relay is a common application of FD technology. In this paper, we propose a modified signal-to-leakage-and-noise ratio (SLNR) precoding scheme for the FD multiuser MIMO relay system, in which the self-interference (SI) of the relay is considered. In contrast to block diagonalization (BD) precoding and zero-forcing (ZF) precoding, SLNR precoding does not have an antenna dimension limitation, which enables it to support more antennas and users. In addition, SLNR precoding balances the interference and noise of a system, whereas BD precoding and ZF precoding only consider the interference. The numerical results show that the proposed SLNR precoding scheme can achieve better performance with low SI. With a reasonable sum capacity loss, the SLNR precoding scheme provides more user access despite a limited number of transmit antennas. [ABSTRACT FROM AUTHOR]

Achieving a good tradeoff between spectral efficiency (SE) and energy efficiency (EE) is important for the emerging wireless communication systems. Motivated by this, we study multiuser downlink beamforming in massive multiple-input multiple-output systems for maximizing a new metric of resource efficiency (RE), which is defined as a weighted combination of EE and SE. The new measure has more flexibility in striking the balance between SE and EE, but brings enormous difficulties in solving the resulting problem. To this end, we first investigate an uplink–downlink duality for the RE maximization. The conventional uplink–downlink duality only applies in the SE or the capacity region, and has yet not been explicitly established for the EE or the RE. In this paper, we prove with rigorous derivation that the duality has a more general form, which can be directly used to tackle the EE or RE beamforming optimization problem. Based on the duality, we then develop an optimization algorithm to realize spectral and energy efficient multiuser beamforming with either instantaneous or statistical channel state information (CSI). Numerical results finally verify that the design based on statistical CSI is able to asymptotically achieve the performance obtained with instantaneous CSI, but with much lower complexity. [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 a massive multiple-input multiple-output (MIMO) system, the serious pilot contamination problem severely restricts its ability to boost the spectrum utilization. To tackle this problem, the conventional concept of softly reusing the spectrum resources for the inner regions of the neighboring cells has been extended to reuse the pilot resources so as to accommodate more users. Alternatively, properly selecting the users to reuse the pilots among the neighboring cells can alleviate the pilot contamination problem as well. In this paper, we delicately integrate these two concepts to properly reuse the pilots allocated to the outer regions of the cells. By well designing the hazard- and secure-edge regions to manage the pilot reuse, the increment of interference can be effectively suppressed, and, consequently, the more accommodated users can contribute to the remarkably higher sum data rates. Furthermore, via some adaptive power adjustment for the users within different regions, the user data rates can further be significantly enhanced. [ABSTRACT FROM AUTHOR]

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

Two-stage beamforming is a transmit strategy that uses two types of beamformers to reduce the feedback overhead of frequency-division-duplexing massive multiple-input multiple-output systems that are spatially correlated. In this paper, we present large system analysis of two-stage beamforming when a transmitter has limited channel information from feedback and when regularized-zero-forcing (RZF) is used as a second-stage beamformer. We consider two random-vector-quantization-based feedback schemes that can be respectively applied when users have perfect channel information or perfect effective channel information. For each feedback method, we analyze both expected signal-to-interference-plus-noise ratio (SINR) and expected rate loss and then characterize their bounds as a function of the number of feedback bits. From the characterization, we reveal that the sum rate of two-stage beamforming is very sensitive to the regularization parameter of RZF, especially when the number of feedback bits is limited. Motivated by this, we derive the optimal regularization parameter that maximizes the SINR of two-stage beamforming with limited feedback. Using simulations, we verify the tightness of the characterized bounds and quantify how the use of the optimal regularization parameter improves the sum rate of two-stage beamforming. [ABSTRACT FROM AUTHOR]

This paper considers a novel virtual pilot-assisted channel estimation algorithm for multiple input multiple output single carrier frequency domain equalization (MIMO-SCFDE) systems over fast time-varying multipath channels. Given that the fast time-varying channels can no longer support the assumption that the channel frequency-domain response remains invariant for the duration of one SC-FDE symbol, most of the channel estimation methods cannot be directly applied to MIMO-SCFDE systems. We put forward an iterative interfrequency interference cancellation method for the time-varying multipath channels over one SC-FDE symbol. The proposed method utilizes the virtual pilot-assisted channel estimation and partial minimum-mean-square-error equalization to improve the accuracy of the estimation. Simulation results validate the improved performance of the proposed method for MIMO-SCFDE systems over fast time-varying multipath channels. [ABSTRACT FROM AUTHOR]

Nonorthogonal multiple access (NOMA) can improve the spectrum efficiency through reusing the power-level space by different users. Although NOMA in single-input single-output channels has been thoroughly explored, it is still underexploited in multiple-input multiple-output (MIMO) channels. Precoding design in multiuser MIMO channels with nonorthogonal transmission is a multidimensional nesting problem, it is hard to compare two matrix channels if only their power levels are considered. In this paper, we first propose a method to compare the covariance matrices of two channel matrices, and then derive a channel condition under which the linear precoding scheme can achieve the sum capacity. Considering arbitrary realizations of multiuser channels, we provide a nested precoding algorithm that can work well in highly correlated multiuser channels. Based on this idea, a specialized superposition transmission scheme between signaling and data information is proposed, where plenty of resources beneath the signaling signal are utilized to transmit data information for dedicated users, and a large amount of extra rates are achieved. In addition, space-time coding is used for signaling information and spatial-division multiplexing is used for multiuser data information. Under the constraint that signaling information should be correctly decoded at any position in the cell, we seek to maximize the sum rate of the underneath multiuser data streams. To this end, the optimal and a low-complexity simplified precoding algorithms are developed. Finally, simulation results verify the throughput improvement and the correct decoding probability of the signaling information. [ABSTRACT FROM AUTHOR]

This paper investigates an outage-constrained secrecy rate maximization (OC-SRM) problem based on the statistical channel uncertainty assumption in an underlay multiple-input multiple-output (MIMO) cognitive radio network, where the secondary transmitter provides simultaneous wireless information and power transfer to receivers. Our objective is to design the transmit covariance matrix and artificial noise aided covariance matrix through maximizing the secrecy rate of the secondary user while satisfying the given outage probability requirements. The designed problem is nonconvex and challenging. We employ the existing theory to reformulate the original problem into two equivalent subproblems by introducing auxiliary variables in order to overcome the difficulty arising from the Shannon capacity expression. The Bernstein-type inequality approach is resorted to conservatively approximate the probabilistic constraints. The merit of the transformation and conversion is that the tractable solutions of the original OC-SRM problem can be easily obtained through solving two convex conic subproblems alternately. Furthermore, we extend the proposed algorithm to solve full uncertainty model design. Numerical results demonstrate the efficacy of the proposed designs. [ABSTRACT FROM AUTHOR]

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

In this paper, the performance of an underlay multiple-input multiple-output (MIMO) cognitive radio system is analytically studied. In particular, the secondary transmitter operates in a spatial multiplexing transmission mode, while a zero-forcing detector is employed at the secondary receiver. Additionally, the secondary system is interfered by multiple randomly distributed single-antenna primary users (PUs). To enhance the performance of secondary transmission, optimal power allocation is performed at the secondary transmitter with a constraint on the interference temperature (IT) specified by the PUs. The outage probability of the secondary receiver is explicitly derived in an exact closed-form expression. Also, some special cases of practical interest, including colocated PUs and massive MIMO, are discussed. Further, to mitigate instantaneous excessive interference onto PUs caused by the time-average IT, an iterative antenna reduction algorithm is developed for the secondary transmitter and, accordingly, the average number of transmit antennas is analytically computed. Extensive numerical and simulation results corroborate the effectiveness of our analysis. [ABSTRACT FROM PUBLISHER]

Multicell dynamic time division duplexing (TDD) systems make it possible to adapt the number of uplink and downlink time slots in each cell to the prevailing cell-wide traffic demand. Although dynamic TDD systems can be advantageously deployed in scenarios in which the uplink and downlink traffic demands are asymmetric and time varying, dynamic TDD systems give rise to base station to base station (BS-to-BS) interference and user equipment to user equipment (UE-to-UE) interference that negatively impact the system performance. In this paper, we propose employing a distributed beamforming scheme to mitigate the BS-to-BS interference and thereby to improve the uplink performance. Specifically, the proposed scheme uses interference pricing to find the appropriate precoder vectors at the BSs, which also improves the signal-to-interference-plus-noise ratio (SINR) performance in the downlink. We compare the performance of the pricing-based (PB) beamforming scheme with that of zero-forcing beamforming in an outdoor picocell environment specified by the 3rd Generation Partnership Project using a realistic system simulator. We find that the proposed PB scheme boosts the SINR in the uplink at the expense of a small degradation of the downlink SINR compared with the zero-forcing scheme. On the other hand, the PB beamforming approach can significantly reduce the downlink transmit power levels and thereby improve the overall energy efficiency of the system. [ABSTRACT FROM PUBLISHER]

In this paper, the feasibility of a new downlink transmission mode in massive multi-input multi-output (MIMO) systems is investigated with two types of users, i.e., the users with only statistical channel state information (CSI) and the users with imperfect instantaneous CSI. The problem of downlink precoding design with mixed utilization of statistical and imperfect instantaneous CSI is addressed. We first theoretically analyze the impact of the mutual interference between the two types of users on their achievable rate. Then, considering the mutual interference suppression, we propose an extended zero forcing and an extended maximum ratio transmission precoding methods to minimize the total transmit power of base station and to maximize the received signal power of users, respectively. Thanks to the exploitation of statistical CSI, pilot-based channel estimation is avoided enabling more active users, higher system sum rate, and shorter transmission delay. Finally, simulations are performed to validate the accuracy of the theoretical analysis and the advantages of the proposed precoding methods. [ABSTRACT FROM PUBLISHER]

This paper investigates simultaneous wireless information and power transfer (SWIPT) in the ad hoc network, where access points (APs) with multiple antennas can transfer energy as well as information using a common spectrum resource. The receiving nodes decode the incoming information data (information decoding, ID) and/or harvest the RF energy (energy harvesting, EH), where two different receiving node architectures—time switching (TS) and power splitting (PS)—are considered. By using a stochastic geometry approach, we aim to analyze the transmission capacity and the harvested energy per unit area as performance measures of the SWIPT in the ad hoc network. From the analytical results, we can derive the optimal node densities of ID nodes and EH nodes for TS architectures and, furthermore, optimize the power splitting ratio jointly with the node density for the PS architectures such that the harvested energy per unit area is maximized when the target transmission capacity is given. The proposed node density optimization gives us a useful insight into the design of SWIPT-based ad hoc network, where we can show how densely the APs/nodes can be deployed in a given area and furthermore, find that the ad hoc network with PS receiving nodes outperforms that with TS receiving nodes for a large target transmission capacity, and vice versa. [ABSTRACT FROM AUTHOR]

Due to the use of an appropriately designed pulse shaping prototype filter, filter bank multicarrier (FBMC) system can achieve low out of band (OoB) emissions and is also robust to the channel and synchronization errors. However, it comes at a cost of long filter tails, which may reduce the spectral efficiency significantly when the block size is small. Filter output truncation (FOT) can reduce the overhead by discarding the filter tails but may also significantly destroy the orthogonality of FBMC system, by introducing intercarrier interference (ICI) and intersymbol interference (ISI) terms in the received signal. As a result, the signal-to-interference ratio (SIR) is degraded. In addition, the presence of intrinsic interference terms in FBMC also proves to be an obstacle in combining multiple-input multiple-output (MIMO) with FBMC. In this paper, we present a theoretical analysis on the effect of FOT in an MIMO-FBMC system. First, we derive the matrix model of MIMO-FBMC system, which is subsequently used to analyze the impact of finite filter length and FOT on the system performance. The analysis reveals that FOT can avoid the overhead in the time domain but also introduces extra interference in the received symbols. To combat the interference terms, we then propose a compensation algorithm that considers odd and even overlapping factors as two separate cases, where the signals are interfered by the truncation in different ways. The general form of the compensation algorithm can compensate all the symbols in a MIMO-FBMC block and can improve the SIR values of each symbol for better detection at the receiver. It is also shown that the proposed algorithm requires no overhead and can still achieve a comparable bit error rate (BER) performance to the case with no filter truncation. [ABSTRACT FROM AUTHOR]

This paper presents optimal sum-rate precoding and beamforming strategies, to enable serving multiple and single data streams per user, respectively, for multi-user MIMO-OFDM based interweave cognitive radio (CR) networks. The proposed schemes maximize the rate of the CR users subject to spatial interference constraints. Initially, a beamforming scheme is derived for a multiuser CR scenario. A framework is also presented for regularized secondary user (SU) beamforming followed by an iterative procedure to compute the optimal value of the regularization parameter based on decomposition into convex subproblems. For a multiuser CR scenario with multiple receive antennas at each user, a scheme is proposed for the downlink interference limited block diagonalization and power allocation considering both the absence and presence of channel state information (CSI) of the primary user. SU rate maximization for MIMO-OFDM scenarios is also considered with CSI uncertainty, for both stochastic and worst case CSI uncertainty models. Finally, in order to multiplex several CR users with a limited number of base-station antennas, a paradigm is also introduced for coordinated secondary user beamforming. Simulation results demonstrate the improved performance of the various proposed multiuser MIMO-OFDM CR transmission schemes. [ABSTRACT FROM AUTHOR]

This paper presents a generalized closed-form beamforming technique that can achieve the maximum degrees of freedom in compounded multiple-input multiple-output (MIMO) broadcast channels with mixed classes of multiple-antenna users. The contribution is first described within the context of a three-cell network and later extended to the general multicell scenario where we also show how to determine the conditions required to align the interference in a subspace that is orthogonal to the one reserved for the desired signals. This is then followed by an analysis of the impact of antenna correlation for different channel state information acquisition models. The proposed scheme is examined under both conventional and large-scale MIMO systems. It will be shown that the proposed technique enables networks with any combination of user classes to achieve superior performance even under significant antenna correlation, particularly in the case of the large-scale MIMO systems. [ABSTRACT FROM AUTHOR]

The nested array, implemented by nonuniform antenna placement, is an effective approach to achieve $O(N^2)$ degrees of freedom (DOF) with an antenna array of $N$ antennas. Such DOF refers to the number of directions of incoming signals that can be resolved. With the increased number of DOF, an important application of nested array is to nullify interference signals from multiple directions. In this paper, we apply nested array in a massive multiple input multiple output (MIMO) heterogeneous network (HetNet) for interference management. With a nested array, a base station (BS) can nullify a certain number of interference signals based on their directions. Then, a key design issue is how to select the set of interference sources to be nullified at each BS. As the DOF of each BS is used to resolve both desired signals and interference, the number of interference signals that can be nullified depends on the number of users served by the BS. Thus, user association is another factor that impacts the system performance and should be jointly considered with interference nulling. We formulate the joint interference nulling scheduling and user association problem as an integer programming problem, aiming to maximize the sum rate of all users subject to BS DOF constraints. We first investigate the case of interference nulling with a given user association, and propose a scheme to solve a relaxed problem as well as derive a performance upper bound. Then, we propose a distributed joint interference nulling and user association scheme based on a poly matching between users and BSs. Simulation results show that the proposed schemes effectively improve the sum rate and achieves a near optimal performance. [ABSTRACT FROM PUBLISHER]

Combined with N-continuous (NC) precoding, the spatial modulation (SM) orthogonal frequency division multiplexing (OFDM) system offers considerable sidelobe suppression for the downlink transmission, at the cost of additional interference to the transmit signal. Therefore, this paper focuses on investigating the impact of the NC precoder on the bit error rate (BER) performance of the SM-OFDM system. The BER performance is analyzed over the frequency-selective Rayleigh fading channel under two distinct scenarios, i.e., perfect channel estimation and interference suppression based minimum mean square error (MMSE) channel estimation. First, we propose an approximate system model for the NC precoded SM-OFDM system along with an analysis on the introduced interference, and then derive the average BER performance of the system with perfect channel estimation. Based on the above proposed approximate system model, we further analyze the interference based upon MMSE channel estimation, and investigate the characteristics of channel estimation errors. Furthermore, we derive the average BER performance of the NC precoded SM-OFDM system with imperfect channel estimation. The numerical results show that the analytical BER closely matches its simulated counterpart under different system configurations, and demonstrate that the proposed approximate system model is in good agreement with the precise one. [ABSTRACT FROM PUBLISHER]

In this paper, we investigate the resource allocation problem in two-tier heterogenous networks (HetNets) with massive MIMO, where two frequency bands, cellular frequency band and millimeter wave frequency band, are used for wireless backhaul links. To coordinate the interference among small cells (SCs), SCs are grouped into multiple SC clusters (SCCs), where SC users are jointly served by SC base stations (BSs) (SBSs) belonging to the same SCC. To eliminate the multi-user and inter-tier interference, we propose a block diagonalization based precoding scheme at macro-BS and each SCC, where the transmit precoding matrix for users is projected onto the null space of interference channels. Following this, we formulate a power allocation optimization problem to maximize the downlink sum rate of the system subject to per-SCC power and users’ quality of service requirements. Since the formulated problem is nonconvex, we transform it into a convex one by appropriate approximation, and a constrained concave convex procedure based iterative algorithm is proposed to obtain the solution. Furthermore, we prove that the obtained solution converges to the local optimum. Meanwhile, according to the structure of the original formulated problem, we divide it into multiple subproblems and propose an optimal iterative water-filling algorithm. Next, we extend the original problem with per-SBS power constraint, which results in that the precoding of each SCC has to be redesigned. On this basis, we propose an iterative water-filling algorithm to obtain the optimal power allocation and precoding. Numerical results are presented to verify the performance of our proposed algorithms. [ABSTRACT FROM PUBLISHER]

In this paper, we propose an optimal channel training method in the sense of linear minimum mean square error for multiple-input multiple-output amplify-and-forward relay systems in the presence of interference. By using a relay processing matrix, the received interference is cancelled or mitigated. To make the problem tractable, we first derive the optimal structure of the training signal and the relay processing matrix. Then, we propose an optimal channel training method. In order to reduce the complexity, we also propose an asymptotically optimal channel training method. Simulation results demonstrate that the two proposed methods outperform the conventional training signal design methods in terms of both the mean square error and in the bit error rate. [ABSTRACT FROM PUBLISHER]

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

Interrelay interference (IRI) is known to limit the performance of virtual full-duplex (VFD) relaying schemes. Available interference cancelation schemes are unable to simultaneously improve the diversity and maintain the multiplexing gain of VFD relaying schemes in multiple antennas scenarios. In this paper, we propose a technique to improve the reliability of multiantenna VFD relaying scheme, while maintaining the multiplexing gain in the presence of IRI. In the proposed scheme, the source and interrelay channels are concatenated and their signals are jointly decoded at the relay. A superposition of the decoded messages is forwarded to the destination. To reduce the effect of IRI on the receiving relay, two suboptimal relay transmit antenna selection schemes, namely, random antenna selection and maximum capacity antenna selection, are investigated. The system capacity and outage probability bounds of the proposed scheme are derived in closed form. The diversity and multiplexing tradeoff is also characterized. The analytical and numerical results show that the proposed scheme can achieve full diversity and maintain the multiplexing gain of the full-duplex relaying scheme. Also, the proposed scheme can outperform conventional VFD relaying scheme in terms of reliability even in the presence of IRI. [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]

Full-duplex (FD) multiple-input multiple-output relaying has been considered an effective scheme to increase the spectral efficiency for wireless communications. As known, the main problem for the FD system is the cancellation of loop interference (LI). In this paper, we propose using the joint source/relay precoding to reduce the influence of LI. Therein, linear precoders are used at the source and relay, while the minimum mean-squared-error receiver is adopted at the destination. The joint precoder design is complicated when spatial multiplexing is exploited for signal transmission. To solve the problem, we propose an iterative method in which the original problem is split into two subproblems. With some matrix properties, we then show that each subproblem can be formulated as a convex optimization. Finally, a closed-form solution can be obtained with the Karush–Kuhn–Tucker conditions. Using a mean-squared-error upper bound, we also propose a low-complexity method to reduce the computational complexity. The proposed precoders have closed-form expressions, which is a great advantage in real-world implementation. Simulation results show that the proposed methods significantly outperform existing ones. [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]

In this paper, we study the uplink in a single-cell massive multiple-input–multiple-output system. The base station (BS) is equipped with three antenna arrays, each covering one third of the cell area. Each antenna array comprises a large yet finite number of antennas. The single-antenna users are randomly and uniformly distributed in the cell, transmitting to the BS utilizing full channel inversion power control. All users experience Rician fading. Receiver maximum-ratio-combining is performed at the BS. Under such a setting, we focus on one cell sector and analyze the intrasector interference in a realistic situation where the number of BS antennas is not extremely large compared with the user number. In particular, we show that, due to the line-of-sight (LoS) component of the channel, the interference is partially determined by the angles of arrival of the signals. We approximate the LoS component interference by a Beta mixture. The interference in Rician fading is then modeled as a noncentral chi-square distribution with a random noncentrality parameter, corresponding to the LoS component. The approximate interference distribution can be used to compute signal-to-interference-ratio-dependent metrics such as outage probability and average throughput. [ABSTRACT FROM AUTHOR]

This paper considers a multipair two-way amplify-and-forward (AF) relaying system, where multiple pairs of full-duplex users are served via a full-duplex relay with massive antennas, and the relay adopts maximum-ratio combining/maximum-ratio transmission (MRC/MRT) processing. The orthogonal pilot scheme and the least square method are first exploited to estimate the channel state information (CSI). When the number of relay antennas is finite, we derive an approximate sum rate expression which is shown to be a good predictor of the ergodic sum rate, especially with a large number of antennas. Then, the corresponding achievable rate expression is obtained by adopting another pilot scheme which estimates the composite CSI for each user pair to reduce the pilot overhead of channel estimation. We analyze the achievable rates of the two pilot schemes and then show the relative advantages of the two methods. Furthermore, power allocation strategies for users and the relay are proposed based on sum rate maximization and max-min fairness criterion, respectively. Finally, numerical results verify the accuracy of the analytical results and show the performance gains achieved by the proposed power allocation. [ABSTRACT FROM AUTHOR]

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

In this paper, we investigate the application of simultaneous wireless information and power transfer (SWIPT) in a full-duplex relay network, where the relay node is wirelessly powered by harvesting a portion of the received signal power from the source node. Different from existing work that has employed time-switching-SWIPT, we propose to use power-splitting-SWIPT. As a result, our proposed approach gives rise to a truly full-duplex relay network, where the information reception and transmission take place simultaneously at the relay node all the time. This more thorough exploitation of the full-duplex feature consequently leads to a significant capacity improvement, compared with existing alternatives in the literature. [ABSTRACT FROM AUTHOR]

In this paper, we propose an iterative structure for channel estimation and data detection for multiple-input–multiple-output orthogonal frequency-division multiplexing systems (MIMO-OFDM) with insufficient cyclic prefix (CP) and a limited number of pilot subcarriers. Insufficient CP leads to increased intersymbol interference (ISI) and intercarrier interference (ICI). The interference corrupts pilot subcarriers used for channel estimation and affects the detection process. We propose a multistep channel estimation process, which is assisted by a small number of pilot subcarriers. First, the channel covariance matrix and the number of channel paths are acquired from the channel least square estimates at the pilot subcarriers. We then formulate a maximum likelihood process to approximate the time-domain channel. For data detection, a high-performance bidirectional M-algorithm (BDMA) is proposed for trellis-based equalization. Simulation results show that the channel estimate mean square error converges to the Cramer–Rao bound (CRB) after a few iterations. In addition, the achieved bit error rate (BER) can reach that of the sufficient CP case, even when the delay spread is much longer than the CP.1 [ABSTRACT FROM AUTHOR]

A multicell massive multiple-input multiple-output (MIMO) system, which utilizes a large number of base-station antennas to simultaneously serve a set of users, suffers from pilot contamination (PC) due to unavoidable reuse of pilots in adjacent cells. In this paper, a weighted-graph-coloring-based pilot decontamination (WGC-PD) scheme is proposed to mitigate PC for multicell massive MIMO systems. Specifically, based on limited cooperation among cells, an edge-weighted interference graph (EWIG) is first constructed to depict the potential PC relationship among users, whereby two users in different cells are connected by a weighted edge, indicating the strength of potential PC when they reuse the same pilot. Then, inspired by classical graph coloring algorithms, we develop the WGC-PD scheme by denoting each color as a pilot and each vertex as a user in the EWIG, which is able to mitigate PC by assigning different pilots to connected users with a large weight in a greedy way with insufficient pilot resource. Compared with exhaustive search among numerous pilot assignment solutions, the proposed WGC-PD scheme is able to mitigate PC with significantly reduced complexity, which is verified by numerical results. [ABSTRACT FROM PUBLISHER]

In this paper, we investigate the performance of a dual-hop multiple-input–multiple-output (MIMO) amplify-and-forward (AF) relay network, where the source, relay, and destination are all equipped with multiple antennas. By using maximum ratio transmission (MRT) at the transmitter and maximum ratio combining (MRC) at the receiver, we first obtain the output signal-to-interference-plus-noise ratio (SINR) of the dual-hop AF relay system, considering multiple cochannel interferences (CCIs), as well as noise at the relay. Then, we derive an exact closed-form expression for the outage probability (OP), and the asymptotic result of OP at high SNR, which can be used to calculate the array gain and diversity order. Finally, computer simulations are conducted to validate the performance analysis. Our new analytical expressions not only provide a fast and efficient method to evaluate the system performance but enable us to gain valuable insights into the effects of key parameters on the MIMO AF relaying network performance that benefits from implementing multiple antennas at each of the three nodes as well. [ABSTRACT FROM PUBLISHER]

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]

Due to the unique physical-layer characteristics associated with multiple-input multiple-output (MIMO) and cognitive radio (CR), the network performance is tightly coupled with mechanisms at the physical, link, network, and transport layers. In this paper, we consider an energy-efficient cross-layer optimization problem in multihop MIMO CR networks (CRNs) and provide a new formulation to balance the weighted network utility and the weighted power consumption of secondary users (SUs), with the minimum transmission rate constraint of primary users (PUs) and the SU power consumption constraint. However, this formulation is highly challenging due to the nonconvexity of the PU rate constraint. We propose a solution that features a linearization-based alternative optimization method and a heuristic primal recovery method. We further develop a distributed algorithm to jointly optimize the covariance matrix of the transmitted signal vector at each SU node, bandwidth allocation at each SU link, rate control at each session source, and multihop/multipath routing. Extensive simulation results demonstrate that the performance of the proposed distributed algorithm is very close to that of the centralized algorithm, and the proposed formulation provides an efficient way to save power consumption significantly, while achieving the network utility very close to that achieved with full power consumption. [ABSTRACT FROM PUBLISHER]

In this paper, resilient transmission in a multicell multiple-input multiple-output (MIMO) interference wiretap channel model is studied. Each base station (BS) transmits confidential messages to its intended legitimate user with multiple antennas in the presence of eavesdroppers that can overhear the transmission. We study the problem of finding the optimal transmit covariance matrices at the BSs to maximize the secrecy sum rate, which is typically nonconvex and intractable to obtain a globally optimal solution. A distributed iterative optimization algorithm based on a novel decomposition framework across all users is proposed. The decomposition framework preserves the convexity of the objective function and linearizes the nonconvex part. At each iteration, the BSs simultaneously solve a sequence of problems that are decoupled convex approximations of the original secrecy sum-rate function. Moreover, the complexity of the algorithm is analyzed. Numerical results are presented to validate the effectiveness of the proposed distributed algorithm. [ABSTRACT FROM PUBLISHER]

This paper studies the impact of a multiple-input–multiple-output (MIMO) relay on the $K$- user multiple-input–single-output (MISO) interference channel (IC) when the relay has delayed feedback (i.e., delayed channel state information (CSI) or delayed channel output feedback) from each receiver, yet each transmitter has no knowledge about CSI. We first develop a new relay-aided retrospective interference alignment (r-RIA) and characterize the optimal sum degrees of freedom (DoFs) for the $K$- user MISO IC with a MIMO relay by providing a new matching outer bound. It is shown that the sum DoF does not decrease, even in the absence of direct links between transmitters and receivers, as long as $K$ is sufficiently large. We next show that a MIMO relay can provide a sum-DoF gain in the $K$- user MISO IC with delayed feedback to the relay in the absence of CSI at transmitter (CSIT), whereas relaying is shown to be not useful with instantaneous CSIT from the DoF perspective. [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]

Massive multiple-input multiple-output (MIMO) is a key technology in fifth-generation (5G) networks. By using a large number of antenna elements placed in a 2-D array, an evolved Node B (eNB) can form multiple vertical beams in the elevation domain and adaptively track moving vehicles. Thus, the throughput and spatial multiplexing efficiency in vehicle-to-infrastructure (V2I) access can be significantly increased. However, multipath spatial propagation in wireless channels results in the angular spread of the power arrival profile, which causes intersector interference in massive-MIMO beamforming and becomes a limiting factor for the system capacity. In this paper, we investigate the channel propagation characteristics and the intervehicle interference in the elevation-domain spatial multiplexing for V2I mobile access and develop a packet-level channel model that can be used for system design and network protocol simulations. First, a measurement campaign for the urban macrocell street uplink channels was performed using a 3-D MIMO channel sounder, and the elevation power spectra (EPSs) on the eNB side were measured. Then, the intersector interference in the vertical beamforming is evaluated based on the antenna array pattern and channel EPS. Finally, a packet-level channel model in the form of a finite-state Markov chain (FSMC) is proposed for the V2I elevation multiplexing uplinks. The model describes the received signal-to-interference ratio (SIR) variation when a vehicle is moving toward an eNB. The steady-state distribution of the FSMC is analytically derived and verified by simulations. Based on the stochastic process of the SIR, the concepts of “large/small-scale multiplexing fading” are proposed. The field measurement results in this work have revealed the spatial power arrival profiles of the V2I street channels that are critical for the MIMO system design, and the proposed packet-level channel model provides an enabling tool for the analysis and simulation of the V2I elevation multiplexing links in the 5G networks. [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]

In this paper, we investigate the interference alignment (IA) for the multiple-input–multiple-output (MIMO) multicell downlink networks in the context of a square channel matrix. We propose a novel joint user grouping and base station (BS) association algorithm. Furthermore, we design the transmit and receive beamforming matrices in closed forms by using a generalized eigenvalue decomposition (GEVD)-based IA scheme, which can exploit the special structure of a square channel matrix against the existing algorithm. Moreover, we provide three theorems to characterize the maximum achievable degrees of freedom (DoF) of the proposed GEVD-based IA scheme. Compared with the existing IA scheme, the proposed GEVD-based IA scheme can reduce the dimension of subspace occupied by the intercell interference (ICI) more efficiently, hence providing achievable DoF higher than or equal to that of the existing IA scheme. [ABSTRACT FROM AUTHOR]

In this paper, we analyze the spectral efficiency of multicell massive multiple-input–multiple-output (MIMO) systems with downlink training and a new pilot contamination precoding (PCP) scheme. First, we analyze the spectral efficiency of the beamforming training (BT) scheme with maximum-ratio transmission (MRT) precoding. Then, we derive an approximate closed-form expression of the spectral efficiency to find the optimal lengths of uplink and downlink pilots. Simulation results show that the achieved spectral efficiency can be improved due to channel estimation at the user side, but in comparison with a single-cell scenario, the spectral efficiency per cell in multicell scenario degrades because of pilot contamination. We focus on the practical case where the number of base station (BS) antennas is large but still finite and propose the BT and PCP (BT-PCP) transmission scheme to mitigate the pilot contamination with limited cooperation between BSs. We confirm the effectiveness of the proposed BT-PCP scheme with simulation, and we show that the proposed BT-PCP scheme achieves higher spectral efficiency than the conventional PCP method and that the performance gap from the perfect channel state information (CSI) scenario without pilot contamination is small. [ABSTRACT FROM AUTHOR]

This paper studies the power allocation problem for a cognitive radio (CR) multiple-input–multiple-output (MIMO) system under spectrum sharing with an existing primary radio network. In particular, the ergodic capacity maximization problem is studied in the Rayleigh fading cognitive MIMO channel under both the total transmit power constraint and a set of interference power constraints where each is applied at one of the primary receivers (PRs). This paper considers that the channel from primary transmitter (PT) to secondary receiver (SR), and the channel from secondary transmitter (ST) to SR are both in short-term fading due to the mobility of SR, whereas the channels from ST to PRs are in long-term fading. By using the Lagrangian dual method, the optimal transmit precoding matrix is derived, and some nearly optimal power allocation algorithms are proposed to maximize the bounds of secondary user ergodic capacity. Performance analysis and simulation results show that the proposed schemes can approach the comparative capacity of the optimal power allocation algorithm, which has perfect instant channel state information (CSI), particularly when the antenna number of the ST exceeds the total antenna number of PRs. [ABSTRACT FROM PUBLISHER]

In this paper, we study the performance of space-shift keying (SSK) modulation for multiple-input–multiple-output (MIMO) wireless systems in the presence of multiple-access interference. More specifically, a synchronous multiuser scenario is considered. The main technical contributions of this paper are given as follows: Two receiver structures based on the maximum-likelihood (ML) criterion of optimality are developed and analytically studied, i.e., single- and multiuser detectors. Accurate frameworks for computing the average bit error probability (ABEP) over independent identically distributed (i.i.d.) Rayleigh fading channels are proposed. Furthermore, simple and easy-to-use lower and upper bounds for performance analysis and system design are introduced. The frameworks account for the near–far effect, which significantly affects the achievable performance in multiple-access environments. In addition, we extend the analysis to generalized SSK (GSSK) modulation, which foresees multiple active antennas at the transmitter. With respect to SSK modulation, GSSK modulation achieves higher data rates at the cost of increased complexity at the transmitter. The performance of SSK and GSSK modulations is compared with that of conventional phase-shift keying (PSK) and quadrature amplitude modulation (QAM) schemes, and it is shown that SSK and GSSK modulations can outperform conventional schemes for various system setups and channel conditions. In particular, the performance gain of SSK and GSSK modulations increases for increasing values of the target bit rate and of the number of antennas at the receiver. Finally, we put forth the concept of coordinated multipoint (or network MIMO) SSK (CoMP-SSK) modulation as a way of exploiting network cooperation and the spatial-constellation diagram to achieve high data rates. Analytical derivations and theoretical findings are substantiated through extensive Monte Carlo simulations for many setups. [ABSTRACT FROM PUBLISHER]

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]

Multiple-input multiple-output (MIMO) relays can improve cell coverage and data throughput for wireless networks. The key challenge for the success of MIMO relay networks is effectively managing the intersymbol interference (ISI) and multiantenna interference (MAI) in multipath channels. In this paper, equalize-and-forward (EF) relaying strategies are employed to mitigate the interference by jointly optimizing equalizer weights and power allocation for dual-hop MIMO relay networks. Two scenarios with different channel state information (CSI) knowledge are investigated: 1) full CSI at the relays and 2) only backward CSI at the relays and the destination. By considering CSI availability and using the minimum-mean-square-error (MMSE) criterion, iterative algorithms are proposed for the joint design of equalizer weights and power allocation to resolve the interference problem. We then extend the design to a more general case, in which the direct link between the source and the destination is taken into account. Furthermore, two relay selection algorithms based on allocated power and MSE performance are investigated for the two scenarios, which attain a performance that is comparable to that of cases with brute-force search or without relay selection. The design framework can capture the impact of the available CSI at the relays and the destination on the performance of MIMO multirelay networks with multipath receptions. [ABSTRACT FROM AUTHOR]