Search

In this paper, we investigate secure transmission over the large-scale multiple-antenna wiretap channel with finite alphabet inputs. First, we investigate the case where instantaneous channel state information (CSI) of the eavesdropper is known at the transmitter. We show analytically that a generalized singular value decomposition (GSVD)-based design, which is optimal for Gaussian inputs, may exhibit a severe performance loss for finite alphabet inputs in the high signal-to-noise ratio regime. In light of this, we propose a novel Per-Group-GSVD (PG-GSVD) design, which can effectively compensate the performance loss caused by the GSVD design. More importantly, the computational complexity of the PG-GSVD design is by orders of magnitude lower than that of the existing design for finite alphabet inputs while the resulting performance loss is minimal. Then, we extend the PG-GSVD design to the case where only statistical CSI of the eavesdropper is available at the transmitter. Numerical results indicate that the proposed PG-GSVD design can be efficiently implemented in large-scale multiple-antenna systems and achieves significant performance gains compared with the GSVD design. [ABSTRACT FROM PUBLISHER]

In this paper, we investigate the quantization and the feedback of downlink spatial covariance matrix for massive multiple-input multiple-output (MIMO) systems with cascaded precoding. Massive MIMO has gained a lot of attention recently because of its ability to significantly improve the network performance. To reduce the overhead of downlink channel estimation and uplink feedback in frequency-division duplex massive MIMO systems, cascaded precoding has been used to convert high-dimensional physical channels into low-dimensional effective channels. For the cascaded precoding, the inner precoder is determined by the downlink spatial covariance matrix, which is unknown in the base station (BS). To address this issue, we propose a spatial spectrum-based approach for the quantization and the feedback of the spatial covariance matrix. In this manner, the BS can obtain partial information on the downlink spatial covariance matrix. Our result shows that the inner precoder based on the proposed approach can be viewed as modulated discrete prolate spheroidal sequences and thus achieves much smaller spatial leakage than the traditional discrete Fourier transform submatrix-based precoding. Practical issues for the application of the proposed approach are also addressed in this paper. [ABSTRACT FROM PUBLISHER]

In this paper, we characterize the total degrees of freedom (DoFs) of the full-duplex asymmetric multiple-input multiple- output (MIMO) three-way channel. Each node has a separate-antenna full-duplex MIMO transceiver with a different number of antennas, where each antenna can be configured for either signal transmission or reception. We study this system under two message configurations; the first configuration is when each node has two unicast messages to be delivered to the two other nodes, while the second configuration is when each node has two unicast messages as well as one broadcast message to be delivered to the two other nodes. For each configuration, we first derive upper bounds on the total DoF of the system. Cut-set bounds in conjunction with genie-aided bounds are derived to characterize the achievable total DoF. Afterward, we analytically derive the optimal number of transmit and receive antennas at each node to maximize the total DoF of the system, subject to the total number of antennas at each node. Finally, the achievable schemes for each configuration are constructed. The proposed schemes are mainly based on zero-forcing and null-space transmit beamforming. We show that the derived outer and inner bounds on the total DoF are tight for each message configuration. [ABSTRACT FROM PUBLISHER]

Secrecy capacity is a fundamental information-theoretic performance metric to predict the maximum data rate of reliable communication, while the intended message is not revealed to the eavesdropper. Motivated by this consideration in this paper, a unified communication-theoretic framework for the analysis of the probability of nonzero secrecy capacity, the secrecy outage probability, and the secrecy capacity of multiple-antenna systems over fading channels is proposed. Specifically, a powerful frequency-domain approach is first developed in which the integrals involved in the evaluation of the probability of nonzero secrecy capacity and secrecy outage probability are transformed into the frequency domain, by employing Parseval’s theorem. A generic approach for the evaluation of the asymptotic secrecy outage probability at high signal-to-noise ratio (SNR) region is also introduced, thus providing useful insight as to the parameters affecting the secrecy performance. Finally, a unified numerical approach for computing the average secrecy capacity of multiple-antenna systems under arbitrary fading environments is developed. The proposed framework is general enough to accommodate any well-known multiantenna transmission technique and fading model. Finally, the secrecy performance of several multiple-antenna system setups is assessed, in the presence of generalized fading conditions and arbitrary antenna correlation, while various numerical and computer simulation results are shown and compared to substantiate the proposed mathematical analysis. [ABSTRACT FROM AUTHOR]

This paper proposes an alignment based interference cancellation scheme for a multi-cell network with multiple-input multiple-output users under a Gaussian Interference compounded broadcast channel scenario. The basic idea is to split up the role of the transmit beamforming matrix according to the type of interference caused by each base station. It will be shown that, for a network of L base stations, the proposed method would result in achieving (L-1) degrees of freedom per user and convert the multi-cell multi-user MIMO channel into a set of single-cell single-user MIMO channels. Finally, we derive the relationship between all the relevant network elements as N_t=(L-d_s+1)K^\primeN_r+1, where N_t and $N_r$ are the numbers of transmit and receive antennas, respectively, L$ and d_s$ denote the number of cells and the number of data streams transmitted from each base station, and is the number of users per cell defined under the proposed system model. Hence, we show that the proposed scheme makes it possible to implement interference alignment using less antenna resources. [ABSTRACT FROM PUBLISHER]

In this paper, we propose transmit antenna selection with maximal ratio combining (TAS/MRC) in dual-hop decode-and-forward spectrum-sharing relaying networks with the primary user's interference and outdated channel state information (CSI). In this network, a single antenna that maximizes the received SNR is selected at the secondary transmitter, and the MRC is adopted at the secondary receiver. To efficiently evaluate the impact of key parameters on the system performance, we derive the exact analytical expression for the outage probability of the secondary network in a Rayleigh fading channel. Moreover, we present simple asymptotic expressions for the outage probability in a high SNR regime, which reveal practical insights on the achievable diversity order and coding gain. The findings suggest that whether the outdated CSI concerning the secondary transmission links has significant impact on the outage probability of the system depends on the interference power constraint at primary receivers. Specifically, under the proportional interference power constraint, the achievable diversity order is affected by imperfect CSI regarding the secondary transmission links, and the diversity–multiplexing tradeoff is independent of the primary network. However, under the fixed interference power constraint, the error floor is displayed, and the achievable diversity order reduces to zero regardless of the CSI concerning the secondary transmission links. [ABSTRACT FROM AUTHOR]

Modern communications systems use multiple-input multiple-output (MIMO) and high-order QAM constellations for maximizing spectral efficiency. However, as the number of antennas and the order of the constellation grow, the design of efficient and low-complexity MIMO receivers possesses big technical challenges. For example, symbol detection can no longer rely on maximum likelihood detection or sphere-decoding methods, as their complexity increases exponentially with the number of transmitters/receivers. In this paper, we propose a low-complexity high-accuracy MIMO symbol detector based on the Expectation Propagation (EP) algorithm. EP allows approximating iteratively at polynomial-time the posterior distribution of the transmitted symbols. We also show that our EP MIMO detector outperforms classic and state-of-the-art solutions reducing the symbol error rate at a reduced computational complexity. [ABSTRACT FROM PUBLISHER]

We present bounds and a closed-form high-SNR expression for the capacity of multiple-antenna systems affected by Wiener phase noise. Our results are developed for the scenario where a single oscillator drives all the radio-frequency circuitries at each transceiver (common oscillator setup), the input signal is subject to a peak-power constraint, and the channel matrix is deterministic. This scenario is relevant for line-of-sight multiple-antenna microwave backhaul links with sufficiently small antenna spacing at the transceivers. For the 2x 2 multiple-antenna case, for a Wiener phase-noise process with standard deviation equal to 6^°, and at the medium/high SNR values at which microwave backhaul links operate, the upper bound reported in the paper exhibits a 3\dB gap from a lower bound obtained using 64-QAM. Furthermore, in this SNR regime the closed-form high-SNR expression is shown to be accurate. [ABSTRACT FROM PUBLISHER]

The low-SNR asymptotic capacity of the multiple-input multiple-output (MIMO) optical intensity channel is studied under both average and peak intensity constraints. We focus on low SNR, which can be modeled as the scenario where both constraints proportionally vanish, or where the peak constraint is held constant while the average constraint vanishes. A capacity upper bound is derived and is shown to be tight at low SNR under both scenarios. The capacity achieving input distribution at low SNR is shown to be a maximally correlated vector-binary input distribution. Consequently, the low-SNR capacity of the channel is characterized. As a byproduct, it is shown that for a channel with peak intensity constraints only, or with peak intensity constraints and individual (per aperture) average intensity constraints, a simple scheme composed of coded ON–OFF keying, spatial repetition, and maximum-ratio combining is optimal at low SNR. [ABSTRACT FROM AUTHOR]

Large-scale propagation effect plays an important role in multiple-input multiple-output (MIMO) relay systems. In particular, the position of the relay (between the source and destination) determines the path-loss effects of adjacent hops, which will further affect the performance of each hop and thus the relay system. In this paper, by minimizing the outage probability of a decode-and-forward (DF) MIMO relay system with orthogonal space-time block coding, we show that relay position optimization improves the finite-SNR (signal-to-noise ratio) diversity gain of a relay system whose adjacent hops have different diversity orders (unbalanced system). Specifically, with relay position optimization, the diversity gain is no longer bounded by that of the weaker hop, i.e., the hop with a lower diversity order, but approaches the diversity order of the stronger hop. This diversity improvement provides a dramatic improvement for the end-to-end outage probability. It will also be shown that although power allocation has no effects on the achievable diversity order, it provides some SNR gains. [ABSTRACT FROM AUTHOR]

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

Opportunistic resource allocation for multiple users utilizing multiple-input multiple-output (MIMO) channel in orthogonal frequency division multiple access (OFDMA) is used to attain the spectral efficiency required in future wireless communications networks. In this paper, we express analytical outage capacity results and average capacity results with optimal rate adaptation for MIMO-OFDMA systems with limited feedback. A resource block (RB)-wise SNR quantization feedback scheme and a best-M feedback method are studied for RB allocation. Feedback based transmit antenna selection (AS) is considered in the analysis. An imperfect feedback channel has a significant impact on the performance of practical feedback based communication. The proposed analysis also considers imperfect feedback in the RB allocation and AS. [ABSTRACT FROM PUBLISHER]

This paper proposes a low complexity protocol that preserves full diversity in multiuser amplify-and-forward relay networks with NS antennas at the source, NR antennas at the relay, and ND antennas at each of the K destinations. In the proposed protocol, a two-fold diversity is guaranteed: 1) multi-antenna diversity via transmit antenna selection with maximal-ratio combining (TAS/MRC), and 2) multiuser diversity via opportunistic scheduling. Under perfect feedback with precise channel state information (CSI), we derive new exact and asymptotic symbol error rate (SER) expressions in closed-form for the general case of Nakagami-m fading. We prove that the full diversity order of NSNDKmX+ min{NSNRmY,NRNDKmZ} is guaranteed, where mX, mY, and mZ denote the fading parameters of the source-destination, source-relay, and relay-destination links, respectively. To examine the impact of delayed feedback, we next derive new exact and asymptotic SER expressions in closed-form. We prove that in the presence of delayed feedback, outdated CSI degrades the diversity order to NDmX+ min{NRmY,NDmZ}. In addition, based on our asymptotic expressions, we determine the optimal power allocation between the source and the relay such that the SER is minimized. We show that optimal power allocation offers superior performance over uniform power allocation; highlighting a pivotal design choice for maximizing network performance without investing additional resources. [ABSTRACT FROM AUTHOR]

In this paper, we consider a secrecy relaying communication scenario where all nodes are equipped with multiple antennas. An eavesdropper has the access to the global channel state information (CSI), and all the other nodes only know the CSI not associated with the eavesdropper. A new secrecy transmission protocol is proposed, where the concept of interference alignment is combined with cooperative jamming to ensure that artificial noise from transmitters can be aligned at the destination, but not at the eavesdropper due to the randomness of wireless channels. Analytical results, such as ergodic secrecy rate and outage probability, are developed, from which more insightful understanding of the proposed protocol, such as multiplexing and diversity gains, can be obtained. A few special cases, where outage probability cannot be decreased to zero regardless of SNR, are also discussed. Simulation results are provided to demonstrate the performance of the proposed secrecy transmission protocol. [ABSTRACT FROM AUTHOR]

For ergodic fading, a lattice coding and decoding strategy is proposed and its performance is analyzed for the single-input single-output (SISO) and multiple-input multiple-output (MIMO) point-to-point channel as well as the multiple-access channel (MAC), with channel state information available only at the receiver (CSIR). At the decoder a novel strategy is proposed consisting of a time-varying equalization matrix followed by decision regions that depend only on channel statistics, not individual realizations. Our encoder has a similar structure to that of Erez and Zamir. For the SISO channel, the gap to capacity is bounded by a constant under a wide range of fading distributions. For the MIMO channel under Rayleigh fading, the rate achieved is within a gap to capacity that does not depend on the signal-to-noise ratio (SNR), and diminishes with the number of receive antennas. The analysis is extended to the $K$ -user MAC where similar results hold. Achieving a small gap to capacity while limiting the use of CSIR to the equalizer highlights the scope for efficient decoder implementations, since decision regions are fixed, i.e., independent of channel realizations. [ABSTRACT FROM PUBLISHER]

This paper provides a systematic characterization of Zero-Forcing (ZF) detectors over multiple-input multiple-output (MIMO) channels that experience both small and large-scale fading. In particular, we consider the generic K distribution (Rayleigh/gamma distribution) to model the composite fading fluctuations and also assume the general case of semi-correlated small-scale fading. In the following, novel exact analytical expressions for the achievable sum rate are derived, followed by asymptotic expressions in the high and low Signal-to-Noise ratio (SNR) regimes. In these limiting cases, two common and insightful affine expansions are studied followed by new, closed-form upper and lower bounds on the sum rate that remain tight for all SNRs. In the second part of the paper, we present exact tractable expressions along with first-order expansions for the symbol error rate (SER) and outage probability; we also quantify the performance of ZF detectors in terms of diversity order and array (or coding) gain. The implications of the model parameters on the ZF detector performance are investigated via Monte-Carlo simulations which also validate the theoretical analysis. [ABSTRACT FROM AUTHOR]

The benefits of transmit antenna selection (TAS) invoked for spatial modulation (SM) aided multiple-input multiple-output (MIMO) systems are investigated. Specifically, we commence with a brief review of the existing TAS algorithms and focus on the recently proposed Euclidean distance-based TAS (ED-TAS) schemes due to their high diversity gain. Then, a pair of novel ED-TAS algorithms, termed as the improved QR decomposition (QRD)-based TAS (QRD-TAS) and the error-vector magnitude-based TAS (EVM-TAS) are proposed, which exhibit an attractive system performance at low complexity. Moreover, the proposed ED-TAS algorithms are amalgamated with the low-complexity yet efficient power allocation (PA) technique, termed as TAS-PA, for the sake of further improving the system’s performance. Our simulation results show that the proposed TAS-PA algorithms achieve signal-to-noise ratio (SNR) gains of up to 9 dB over the conventional TAS algorithms and up to 6 dB over the TAS-PA algorithm designed for spatial multiplexing systems. [ABSTRACT FROM PUBLISHER]

We derive a general and closed-form result for the success probability in downlink multiple-antenna (MIMO) heterogeneous cellular networks (HetNets), utilizing a novel Toeplitz matrix representation. This main result, which is equivalently the signal-to-interference ratio (SIR) distribution, includes multiuser MIMO, single-user MIMO and per-tier biasing for $K$ different tiers of randomly placed base stations (BSs), assuming zero-forcing precoding and perfect channel state information. The large SIR limit of this result admits a simple closed form that is accurate at moderate SIRs, e.g., above 5 dB. These results reveal that the SIR-invariance property of SISO HetNets does not hold for MIMO HetNets; instead the success probability may decrease as the network density increases. We prove that the maximum success probability is achieved by activating only one tier of BSs, while the maximum area spectral efficiency (ASE) is achieved by activating all the BSs. This reveals a unique tradeoff between the ASE and link reliability in multiuser MIMO HetNets. To achieve the maximum ASE while guaranteeing a certain link reliability, we develop efficient algorithms to find the optimal BS densities. It is shown that as the link reliability requirement increases, more BSs and more tiers should be deactivated. [ABSTRACT FROM AUTHOR]

We investigate the energy efficiency-spectral efficiency (EE-SE) trade-off of transmit antenna selection/maximum ratio combining (TAS) scheme. A realistic power consumption model (PCM) is considered, and it is shown that using TAS can provide significant energy savings when compared to multiple-input multiple-output (MIMO) in the low to medium SE region, regardless the number of antennas, as well as outperform transmit beamforming scheme (MRT) for the entire SE range. For a fixed number of receive antennas, our results also show that the EE gain of TAS over MIMO becomes even greater as the number of transmit antennas increases. The optimal value of SE that maximizes the EE is obtained analytically, and confirmed by numerical results. Moreover, the influence of receiver correlation is also evaluated and it is shown that considering a non-realistic PCM can lead to mistakes when comparing TAS and MIMO. [ABSTRACT FROM AUTHOR]

In this paper, we propose a general framework to quantify the average error probability of the minimum mean squared error based precoding schemes in amplify-and-forward relay networks where all nodes are equipped with multiple antennas. Especially, we investigate spatial multiplexing schemes which transmit multiple data streams simultaneously. Due to difficulty in finding an exact expression of the average error rate, we exploit the high signal-to-noise-ratio (SNR) based approach which allows a simple and accurate characterization of the performance. Then, we derive new closed form expressions for bit error rate performance of both the optimal source-relay joint precoding schemes and the optimal relay only precoding schemes in terms of a coding gain as well as a diversity gain. Taking a different pathloss in each hop into consideration, we evaluate the performance in a generalized environment. Through our analysis, we discuss several interesting observations and provide a helpful guideline for designing MMSE-based relaying systems. Monte-Carlo simulations show that our analytical work accurately predicts numerical results. [ABSTRACT FROM PUBLISHER]

In this paper, we address the issue of multiaccess communication through multi-hop linear non-regenerative relays, where all users, all relay nodes, and the destination node may have multiple antennas. Using a linear minimal mean-squared error (MMSE) receiver at the destination node, we demonstrate that the optimal amplifying matrix at each relay node can be viewed as a linear MMSE filter concatenated with another linear filter. As a consequence, the MSE matrix of the signal waveform estimation at the destination node is decomposed into the sum of the MSE matrices at all relay nodes. We show that at a high signal-to-noise ratio (SNR) environment, this MSE matrix decomposition significantly simplifies the solution to the problem of optimizing the source precoding matrices and relay amplifying matrices. Simulation results show that even at the low to medium SNR range, the simplified optimization algorithms have only a marginal performance degradation but a greatly reduced computational complexity and signalling overhead compared with the existing optimal iterative algorithm, and thus are of great interest for practical relay systems. [ABSTRACT FROM AUTHOR]

We propose and analyze transmit antenna selection (TAS) to enhance physical layer security in a wiretap channel with N\rm{A} antennas at the transmitter, N\rm{B} antennas at the receiver, and N\rm{E} antennas at the eavesdropper. We focus on the practical scenario where the transmitter does not have any channel state information (CSI) of the eavesdropper's channel. The transmitter selects a single antenna that maximizes the instantaneous signal-to-noise ratio (SNR) at the receiver. The receiver and the eavesdropper employ either maximal-ratio combining (MRC) or selection combining (SC) to combine the received signals. For the proposed protocols, we derive new closed-form expressions for the probability of non-zero secrecy capacity. We consider Nakagami-m fading with non-identical fading parameters of the main channel, m\rm{B}, and of the eavesdropper's channel, m\rm{E}. Next, we derive new closed-form expressions for the exact secrecy outage probability, based on which the \varepsilon-outage secrecy capacity is characterized. Based on the exact expressions, we derive the asymptotic secrecy outage probability which accurately reveals the secrecy diversity order and the secrecy array gain. We confirm that the proposed protocols achieve identical secrecy diversity orders of N\rm{A}N\rm{B}m\rm{B}. An interesting conclusion is reached that this diversity order is independent of N\rm{E} and m\rm{E}. Furthermore, we prove that under the proposed protocols, the secrecy outage probability and the \varepsilon-outage secrecy capacity improve with increasing N\rm{A}. [ABSTRACT FROM PUBLISHER]

We propose multiple antenna transmission methods for fast fading channel conditions. Proposed methods allocate alternative multiple antenna transmission modes depending on the SNR, modulation order and Doppler frequency to increase reliability, i.e., decrease bit-error-rate (BER). A major difference of our approach from previous works is to allow different transmission modes during a single frame by considering the channel variations within the frame for high mobility scenarios. First method effectively makes use of available channel knowledge by allocating beamforming (BF) as long as channel knowledge is not outdated and switches to space frequency block coding (SFBC) afterwards. Approximate BER expressions for BF and SFBC that are functions of SNR, modulation order, Doppler frequency and initial channel knowledge are derived to be used as a decision metric for mode allocation throughout the frame. Second method adapts rate and transmission mode across symbols in a frame by considering that average channel power is monotonically decreasing as a function of time within the frame when multiuser diversity is exploited. First method performs as good as the better of BF and SFBC over all SNR values. Second method provides additional performance gain over the first method due to more efficient use of better channel conditions. [ABSTRACT FROM AUTHOR]

Fading MIMO relay channels are studied analytically, when the source and destination are equipped with multiple antennas and the relays have a single one. Compact closed-form expressions are obtained for the outage probability under i.i.d. and correlated Rayleigh-fading links. Low-outage approximations are derived, which reveal a number of insights, including the impact of correlation, of the number of antennas, of relay noise and of relaying protocol. The effect of correlation is shown to be negligible, unless the channel becomes almost fully correlated. The SNR loss of relay fading channels compared to the AWGN channel is quantified. The SNR-asymptotic diversity-multiplexing tradeoff (DMT) is obtained for a broad class of fading distributions, including, as special cases, Rayleigh, Rice, Nakagami, Weibull, which may be non-identical, spatially correlated and/or non-zero mean. The DMT is shown to depend not on a particular fading distribution, but rather on its polynomial behavior near zero, and is the same for the simple "amplify-and-forward" protocol and more complicated "decode-and-forward" one with capacity achieving codes, i.e. the full processing capability at the relay does not help to improve the DMT. There is however a significant difference between the SNR-asymptotic DMT and the finite-SNR outage performance: while the former is not improved by using an extra antenna on either side, the latter can be significantly improved and, in particular, an extra antenna can be traded-off for a full processing capability at the relay. The results are extended to the multi-relay channels with selection relaying and typical outage events are identified. [ABSTRACT FROM AUTHOR]