Search

Next-generation satellite systems targeting multi-Terabit-per-second throughput require surmounting layers of design challenges. For feeder links, extremely high frequency (EHF) band is desired to overcome spectrum limitations and reduce equipment size. Multiple gateways are utilized to aggregate their bandwidths and serve as site diversity, mitigating the increased susceptibility of the EHF band to atmospheric attenuation. Toward this, multiple-input multiple-output (MIMO) technology is well suited for feeder links that share the same time, frequency, and polarization resources. This paper provides novel extension of MIMO-enabled feeder links when clustering more than two gateways and mounting more than two antennas onboard geostationary multibeam satellite, exploiting line-of-sight MIMO on uplinks and downlinks. Arsenal of countermeasures against inter-antenna interference and weather impairments is designed to maximize gains in signal-to-noise ratio, spatial multiplexing, and spatial diversity. Comparisons between offered sum rates and theoretical MIMO capacity are provided when gateway clusters form linear versus circular patterns. Methodology for gateway diversity is developed and analyzed when deploying redundant MIMO feeder links that handle rerouted traffic. Algorithms for ground-based channel state information (CSI) acquisition are designed and implemented in receiver architecture that tackles strong practical impairments. Numerical studies reveal that MIMO-enabled feeder links offer greatly enhanced overall network availability compared with state-of-the-art single-input single-output (SISO) solutions. [ABSTRACT FROM AUTHOR]

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

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

Full-duplex (FD) jamming transceivers recently have been shown to enhance the information security of wireless communication systems by simultaneously transmitting artificial noise (AN) while receiving information. In this paper, we investigate whether FD jamming can also improve the system’s secrecy energy efficiency (SEE) in terms of securely communicated bits per Joule when considering the additional power used for jamming and self-interference (SI) cancellation. Moreover, the degrading effect of the residual SI is also taken into account. In this regard, we formulate a set of SEE maximization problems for a FD multiple-input-multiple-output multiple-antenna eavesdropper (MIMOME) wiretap channel, considering both cases where exact or statistical channel state information (CSI) is available. Due to the intractable problem structure, we propose iterative solutions in each case with a proven convergence to a stationary point. Numerical simulations indicate only a marginal SEE gain, through the utilization of FD jamming, for a wide range of system conditions. However, when SI can efficiently be mitigated, the observed gain is considerable for scenarios with a small distance between the FD node and the eavesdropper, a high signal-to-noise ratio (SNR), or for a bidirectional FD communication setup. [ABSTRACT FROM AUTHOR]

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

In 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]

Generalized spatial modulation (GSM) is an extended architecture to the spatial modulation multiple antenna system. The GSM system uses multiple activated transmit antennas to further exploit the system transmission capacity. In this paper, we consider the GSM systems with channel diagonalization (CD-) transmitter pre-coder (TPC), channel inversion TPC, and without TPC. For each TPC scheme, the pairwise activated antenna detection discriminant and closed-form antenna detection pairwise error probability (PEP) of the GSM system are derived. We use the antenna detection PEP to calculate the analytical antenna detection symbol error rate union bound and the mutual information lower bound. We use asymptotic methods to analyze antenna detection diversity and coding gains of GSM system with or without TPC when the signal-to-noise ratio is high. Together with complexity analysis on the pre-coders and antenna detectors, we discover the CD-TPC trades the antenna detection performance for complexity reduction, while the CD-TPC scheme achieves a balance between the performance and complexity. This paper introduces methods to the performance evaluation of the GSM system, and provides a guideline for the GSM system design such as antenna configuration and TPC schemes selection. [ABSTRACT FROM AUTHOR]

Multi-channel (MC) optical wireless communication (OWC) systems employing wave-division multiplexing for outdoors free-space optical communications, or multi-user time-division multiple access for indoors visible-light communications, e.g., can be modeled as parallel channels. Multi-input multi-output OWC systems can also be transformed, possibly with some performance loss, to parallel channels using pre-/post-coding. Studying the performance of such MC-OWC systems requires characterizing the capacity of the underlying parallel channels. In this paper, upper and lower bounds on the capacity of constant parallel OWC channels with a total average intensity constraint are derived. Then, this paper focuses on finding intensity allocations that maximize the lower bounds given channel-state information at the transmitter (CSIT). Due to its nonconvexity, the Karush–Kuhn–Tucker conditions are used to describe a list of candidate allocations. Instead searching exhaustively for the best solution, low-complexity near-optimal algorithms are proposed. The resulting optimized lower bound nearly coincides with capacity at high signal-to-noise ratio (SNR). Under a quasi-static channel model and in the absence of CSIT, outage probability upper and lower bounds are derived. Those bounds also meet at high SNR, thus characterizing the outage capacity in this regime. Finally, the results are extended to a system with both average and peak intensity constraints. [ABSTRACT FROM PUBLISHER]

This paper considers a K-user multiple-input multiple-output (MIMO) interference channel (IC) where 1) the channel state information obtained by the transmitters (CSIT) is completely outdated and 2) the number of transmit antennas at each transmitter, i.e., M is greater than the number of receive antennas at each user, i.e., N. The usefulness of the delayed CSIT was first identified in a K-phase retrospective interference alignment (RIA) scheme proposed by Maddah-Ali and Tse for the multiple-input single-output broadcast channel, but the extension to the MIMO IC is a non-trivial step as each transmitter only has the message intended for the corresponding user. Recently, Abdoli et al. focused on a single-input single-output IC and solved such bottleneck by inventing a K-phase RIA with distributed overheard interference retransmission. In this paper, we propose two K-phase RIA schemes suitable for the MIMO IC by generalizing and integrating some key features of both Abdoli's and Maddah-Ali's works. The two schemes jointly yield the best known sum degrees-of-freedom (DoF) performance so far. For the case (M/N)≥K, the achieved sum DoF is asymptotically given by (64/15)N when K→∞. [ABSTRACT FROM PUBLISHER]

This paper investigates the multiple-input multiple-output (MIMO) non-orthogonal multiple access (NOMA) assisted unmanned aerial vehicles (UAVs) networks. By utilizing a stochastic geometry model, a new 3-D UAV framework for providing wireless service to randomly roaming NOMA users has been proposed. In an effort to evaluate the performance of the proposed framework, we derive analytical expressions for the outage probability and the ergodic rate of MIMO-NOMA enhanced UAV networks. We examine tractable upper bounds for the whole proposed framework, with deriving asymptotic results for scenarios that transmit power of interference sources being proportional or being fixed to the UAV. For obtaining more insights for the proposed framework, we investigate the diversity order and high signal-to-noise slope of MIMO-NOMA assisted UAV networks. Our results confirm that: 1) Outage probability of NOMA enhanced UAV networks is affected to a large extent by the targeted transmission rates and power allocation factors of NOMA users and 2) For the case that the interference power is proportional to the UAV power, there are error floors for the outage probabilities. [ABSTRACT FROM AUTHOR]

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

In practical massive MIMO systems, a substantial portion of system resources are consumed to acquire channel state information (CSI), leading to a drastically lower system capacity compared with the ideal case, where perfect CSI is available. In this paper, we show that the overhead for CSI acquisition can be largely compensated by the potential gain due to the sparsity of the massive MIMO channel in a certain transformed domain. To this end, we propose a novel blind detection scheme that simultaneously estimates the channel and data by factorizing the received signal matrix. We show that by exploiting the channel sparsity, our proposed scheme can achieve a degree of freedom (DoF) very close to the ideal case, provided that the channel is sufficiently sparse. Specifically, the achievable DoF has a fractional gap of only $1/T$ from the ideal DoF, where $T$ is the channel coherence time. This is a remarkable advance for understanding the performance limit of the massive MIMO system. We further show that the performance advantage of our proposed scheme in the asymptotic SNR regime carries over to the practical SNR regime. Numerical results demonstrate that our proposed scheme significantly outperforms its counterpart schemes in the practical SNR regime under various system configurations. [ABSTRACT FROM PUBLISHER]

Multi-hop relaying is well known to extend the range of wireless communications. However, the end-to-end performance of the multi-hop relaying channel degrades compared to that observed at the first hop. This performance degradation mainly arises due to: 1) half-duplex loss and 2) hopping or relaying loss. In this paper, we analyze the degradation in outage probability and ergodic capacity due to hopping loss in a multiple-input multiple-output (MIMO) dual-hop decode-and-forward relaying network over Rayleigh fading channels. In particular, we characterize analytically the performance degradation by deriving closed-form approximations of ergodic capacity and outage probability in the single-source single-relay single-user, single-source multiple-relay single-user, and single-source single-relay multiple-user topologies. These approximations also provide insights on how to overcome performance degradations due to hopping loss. Moreover, we show that cooperative relaying schemes can recover a significant portion of the hopping loss. [ABSTRACT FROM AUTHOR]

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

In this paper, we study a training design problem for multiple-input multiple-output (MIMO) orthogonal frequency division multiplexing (OFDM) amplify-and-forward (AF) two-way relay networks. Unlike the existing studies, we assume the spatially correlated fading and consider the nonreciprocal channel condition, which is a more practical assumption but makes the training problem more challenging. The equivalent channels of bidirectional relaying links, which consist of self-interfering channels and information-bearing channels, are estimated at each source node based on a linear minimum mean square error (LMMSE) approach. The total mean square error (MSE) of the channel estimation is minimized under the transmit power constraints at the source nodes and at the relay. To solve this problem, we first derive an optimal structure of the training signals, and then, convert the optimization problem into a tractable convex form, from which the optimal training scheme is designed efficiently. Furthermore, for a practical special case, the optimal training design is derived in semi-closed form, which provides useful insights. To reduce the required complexity, a low-complexity training scheme is also derived in closed-form. This scheme is shown to be asymptotically optimal in the high signal-to-noise ratio (SNR) regime and gives further insights into the optimal training. The performance of the proposed schemes is demonstrated through numerical simulations. [ABSTRACT FROM AUTHOR]

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]

Visible light communications (VLC) is a promising and uncharted new technology for the next generation of wireless communication systems. This paper proposes a novel generalized light emitting diode (LED) index modulation method for multiple-input-multiple-output (MIMO) orthogonal frequency division multiplexing (OFDM)-based VLC systems. The proposed scheme avoids the typical spectrum efficiency losses incurred by time- and frequency-domain shaping in OFDM signals. This is achieved by exploiting spatial multiplexing along with LED index modulation. Accordingly, real and imaginary components of the complex time-domain OFDM signals are separated first, then resulting bipolar signals are transmitted over a VLC channel by encoding sign information in LED indexes. As a benchmark, we demonstrate the performance analysis of our proposed system for both analytical and physical channel models. Furthermore, two novel receiver designs are proposed. Each one is suitable for frequency-flat or selective channel scenarios. It has been shown via extensive computer simulations that the proposed scheme achieves considerably better bit error ratio versus signal-to-noise-ratio performance than the existing VLC-MIMO-OFDM systems that use the same number of transmit and receive units [LEDs and photo diodes (PDs)]. Compared with the single-input single-output (SISO) DC biased optical (DCO)-OFDM system, both spectral efficiency and DC bias can be doubled and removed respectively simply by exploiting a MIMO configuration. [ABSTRACT FROM PUBLISHER]

This paper investigates the throughput-reliability tradeoff (TRT) for dual-hop amplify-and-forward relay systems with one source, one destination, and multiple relays, and its relationship with the diversity-multiplexing tradeoff (DMT). The TRT was proposed in the context of MIMO block fading channels to reveal the interplay between the signal-to-noise ratio (SNR), rate R, and outage probability that are not accessible through the DMT. The contributions of this paper include the calculation of the TRT expressions for two classes of amplify-and-forward protocols: the slotted amplify-and-forward and the non-orthogonal amplify-and-forward. Based on the derived expressions, relationships between the SNR, rate and outage probability are explored. The relationship between the TRT and the DMT is investigated. One of the goals of the TRT is to predict the slope and offset of the outage vs. SNR set of curves parameterized by different rates. We verify the accuracy of the TRT predictions in the context of amplify-and-forward relays. [ABSTRACT FROM AUTHOR]

Recently, the Degrees-of-Freedom (DoFs) region of multiple-input-single-output (MISO) networks with imperfect channel state information at the transmitter (CSIT) has attracted significant attention. An achievable scheme, known as rate-splitting (RS), integrates common-message-multicasting and private-message-unicasting. In this paper, focusing on the general $K$ -cell MISO IC with an arbitrary CSIT quality of each interfering link, we first identify the DoF region achieved by RS. Second, we introduce a novel scheme, so called topological RS (TRS), whose novelties compared with RS lie in a multi-layer structure and in transmitting multiple common messages to be decoded by groups of users rather than all users. The design of TRS is motivated by a novel interpretation of the $K$ -cell IC with imperfect CSIT as a weighted sum of a series of partially connected networks. We show that the DoF region achieved by TRS yields the best known result so far, and we find the maximal sum DoF via hypergraph fractional packing. Finally, for a realistic scenario where each user is connected to three dominant transmitters, we identify the sufficient condition where TRS strictly outperforms conventional schemes, and show that TRS is optimal for some CSIT qualities. [ABSTRACT FROM PUBLISHER]

This paper considers a Gaussian multiple-input single-output (MISO) broadcast channel with a per-antenna peak power constraint (or simply peak power constraint). It is more realistic to consider the peak power constraint on each transmit antenna because in many practical implementations each antenna is equipped with its own power amplifier. Assuming the perfect knowledge of the channel state information (CSI) at the transmitter, we propose an achievable scheme using dirty-tape coding (DTC). The ideal dirty-paper coding (DPC), which is a capacity-achieving scheme for the Gaussian multiple-input multiple-output (MIMO) broadcast channel, cannot be used for our model because its optimal input distribution is Gaussian and thus the peak power constraint is violated. On the other hand, the channel input of DTC is uniformly distributed in a fixed range, which helps to control the peak power of the transmit signal easily. We also present an algorithm that finds capacity-achieving beamforming vectors and power allocation factors under a per-antenna average power constraint and use the optimized parameters in the proposed scheme. Simulation results show that the proposed scheme provides gains of 2.7dB over a non-DTC scheme based on minimum mean square error (MMSE) beamforming at high signal-to-noise ratio (SNR) when there are three receivers and the transmitter has three antennas. [ABSTRACT FROM AUTHOR]

The aim of this paper is to investigate the recently developed mixed-analog-to-digital converter (ADC) architecture for frequency-selective channels. Multi-carrier techniques, such as orthogonal frequency division multiplexing, are employed to handle inter-symbol interference. A frequency-domain equalizer is designed for mitigating the inter-carrier interference introduced by the nonlinearity of one-bit quantization. For static single-input-multiple-output (SIMO) channels, a closed-form expression of the generalized mutual information (GMI) is derived, and based on which the linear frequency-domain equalizer is optimized. The analysis is then extended to ergodic time-varying SIMO channels with estimated channel state information, where numerically tight lower and upper bounds of the GMI are derived. The analytical framework is naturally applicable to the multi-user scenario, for both static and time-varying channels. Extensive numerical studies reveal that the mixed-ADC architecture with a small proportion of high-resolution ADCs does achieve a dominant portion of the achievable rate of ideal conventional architecture, and that it remarkably improves the performance as compared with one-bit massive multiple-input-multiple-output. [ABSTRACT FROM PUBLISHER]

Although there has been a growing interest on the study of diversity-multiplexing tradeoff (DMT), the existing works are mostly restricted to the outcomes reported for Rayleigh, Rician, and Nakagami fading channels. In this paper, we investigate the optimal tradeoff in the presence of log-normal fading, which provides an accurate model for indoor wireless, optical wireless, and ultra-wideband channels. We consider a multiple-input multiple-output (MIMO) log-normal channel, derive the outage probability expression, and then present the asymptotical DMT expression. It is shown that the asymptotical maximum diversity gain tends to infinity with logarithm of signal-to-noise ratio (SNR). To have further insight, we normalize the DMT with that of single-input single-output case and express the relative asymptotical DMT of the MIMO log-normal channel as a function of the number of transmit and receive antennas. We further study DMT for finite SNRs and demonstrate convergence to the asymptotical case. Extensive numerical results are provided to corroborate the analytical derivation. [ABSTRACT FROM AUTHOR]

In this paper, we consider the uplink of a single-cell multi-user single-input multiple-output (MU-SIMO) system with in-phase and quadrature-phase imbalance (IQI). In particular, we investigate the effect of receive (RX) IQI on the performance of MU-SIMO systems with large antenna arrays employing maximum-ratio combining receivers. In order to study how IQI affects channel estimation, we derive a new channel estimator for the IQI-impaired model and show that the higher the value of signal-to-noise ratio, the higher the impact of IQI on the spectral efficiency (SE). Moreover, a novel pilot-based joint estimator of the augmented multiple-input multiple-output (MIMO) channel matrix and IQI coefficients is described, and then, a low-complexity IQI compensation scheme is proposed, which is based on the IQI coefficients’ estimation and it is independent of the channel gain. The performance of the proposed compensation scheme is analytically evaluated by deriving a tractable approximation of the ergodic SE assuming transmission over Rayleigh fading channels with large-scale fading. Furthermore, we investigate how many mobile stations should be scheduled in massive MIMO systems with IQI and show that the highest SE loss occurs at the optimal operating point. Finally, by deriving asymptotic power scaling laws and proving that the SE loss due to IQI is asymptotically independent of the number of BS antennas, we show that massive MIMO is resilient to the effect of RX IQI. [ABSTRACT FROM AUTHOR]

Optimal data detection of data transmitted over a linear channel can always be implemented through the Viterbi algorithm (VA). However, in many cases of interest the memory of the channel prohibits direct application of the VA. A popular and conceptually simple method in this case, studied since the early 1970s, is to first filter the received signal in order to shorten the memory of the channel, and then to apply a VA that operates with the shorter memory. We shall refer to this general concept as a channel shortening (CS) receiver. Although studied for almost four decades, an information theoretic understanding of what such a simple receiver solution is actually doing is not available. In this paper, we show that an optimized CS receiver has a direct correspondance to the chain rule of mutual information. Furthermore, we show that the tools for analyzing the ensuing achievable rates from an optimized CS receiver are precisely the same as those used for analyzing the achievable rates of a minimum mean-square-error (MMSE) receiver. [ABSTRACT FROM AUTHOR]

This paper is concerned with the spatial modulation (SM), a multiple-input multiple-output (MIMO) transmission technique, that maps information bits not only into the conventional two-dimensional signal points but also into the indices of active transmit antennas. We present a two-layer coded SM scheme, in which the spatial bits carried by the antenna indices and the signal bits carried by the conventional signals are protected separately by two error correction codes. For the ease of decoding process, the code rates are allocated according to the chain rule of the mutual information. We choose block Markov superposition transmission (BMST) codes for each layer, since they are easily designed for any given code rate with a predictable performance lower bound. An iterative sliding-window decoding algorithm is also presented by exchanging messages iteratively between the two BMST decoders and the soft-in soft-out (SISO) demapper of the SM. To reduce the computational complexity, we propose to implement the SISO demapping algorithm by employing only partial soft inputs. Numerical results show that the BMST-SM system performs well over uncorrelated Rayleigh fading channels. [ABSTRACT FROM AUTHOR]

In this paper, we provide a comprehensive analytical framework on the performance of multiple-input multiple-output (MIMO) mutlihop amplify-and-forward relay network employing transmit antenna selection (TAS) with receive maximal ratio combining (MRC) in the presence of randomly located interferers. The channel fading models per hop are assumed to be independent and follow exponential random distribution, and the interference is distributed according to the spatial Poisson point process PPP, which is further known as symmetric alpha stable distribution. The impact of spatial dependence across multiple antennas is facilitated by considering three different network interference models: 1) the isotropic model, where all receive antennas see interference belonging to the same Poisson point process (PPP); 2) the independent model, where each receive antenna sees interference belonging to a different independent PPP; and 3) the mixture model, where each receive antenna sees the superposition of the two previous models. The end-to-end transmission is performed using two TAS modes, which includes signal-to-noise ratio (SNR)-based selection, and signal-to-interference noise ratio (SINR)-based selection. The analysis provides new analytical results for the outage probability and symbol error rates (SER). In addition, the impact of feedback delay on the performance of the proposed system for SNR-based selection is investigated. We further study the optimum resource allocation strategies including power allocation, position allocation, and joint allocation for power and position. The obtained results are clarified through selected numerical and simulated examples. [ABSTRACT FROM AUTHOR]

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 investigates the achievable sum-rate of massive multiple-input multiple-output (MIMO) systems in the presence of channel aging. For the uplink, by assuming that the base station (BS) deploys maximum ratio combining (MRC) or zero-forcing (ZF) receivers, we present tight closed-form lower bounds on the achievable sum-rate for both receivers with aged channel state information (CSI). In addition, the benefit of implementing channel prediction methods on the sum-rate is examined, and closed-form sum-rate lower bounds are derived. Moreover, the impact of channel aging and channel prediction on the power scaling law is characterized. Extension to the downlink scenario and multicell scenario is also considered. It is found that, for a system with/without channel prediction, the transmit power of each user can be scaled down at most by 1/\sqrtM (where $M$ is the number of BS antennas), which indicates that aged CSI does not degrade the power scaling law, and channel prediction does not enhance the power scaling law; instead, these phenomena affect the achievable sum-rate by degrading or enhancing the effective signal to interference and noise ratio, respectively. [ABSTRACT FROM AUTHOR]

The influence of nonlinear power amplifiers (PAs) on the performance of multiple-input multiple-output (MIMO) orthogonal frequency-division multiplexing (OFDM) systems is investigated. A “full” MIMO scheme with transmitters (TX) precoding and receivers (RX) decoding is considered. It is shown, under assumption of high order OFDM and frequency selective channel, that the ratio between the useful signal and the nonlinear distortions is proportional to the number of TX antennas, i.e., the influence of the nonlinear distortions decreases as the number of TX antennas increases. The distortion reduction factor (DRF) is proposed as a performance metric for MIMO–OFDM systems with nonlinear PAs. A general formula for signal to distortion and noise ratio is obtained for the nonlinear PA with memory, described by the Wiener–Hammerstein (WH) model. Special cases of MIMO, such as maximum ratio transmission (MRT) and maximum ratio combining (MRC), are considered. A full agreement between the theoretical and simulation results is obtained. The main contribution of this paper is in a statement that TX processing reduces the effect of nonlinear distortions. This is obtained by novel approach for analysis of the MIMO–OFDM systems with nonlinear PAs with memory. [ABSTRACT FROM AUTHOR]

Recently, a transmission strategy was designed for the K\text-user interference channel (IC) without CSI at the transmitters (CSIT) but aided by a relay which knows the global CSI, where it was shown that $K-1$ relay antennas are required to attain the maximum network DoF. In this paper, we derive general IA feasibility conditions for a single relay-aided IC with CSI at both the relay and the transmitters. Our result shows that except for the special case of $K=3$ users, providing CSI to the transmitters still requires $K-1$ relay antennas to achieve the maximum network DoF. Next, we design the minimum-sum-mean-square-error (MSMSE) and weighted-sum-rate (WSR) maximizing precoders for the relay-aided IC network without CSIT which show higher sum-rate in the finite-SNR region compared to the IA precoding. Further, a so-called scaled-IA initialization is proposed for the MSMSE and the WSR algorithms which not only preserves the network DoF but also saves the power at the relay considerably compared to the MSMSE and the WSR schemes with random initializations. Extensive simulation results in both symmetric and asymmetric networks show that the MSMSE precoder shows better BER performance than both the IA and the WSR algorithms for low-to-moderate data rates. [ABSTRACT FROM AUTHOR]

In this paper, we study the problem of per-stream maximum sum-rate joint precoder and minimum mean-squared error equalizer design for the multi-input multi-output interference channel. We consider the general case of more than three users with more than one stream per user. We propose a generalized iterative algorithm which directly maximizes the sum-rate without assuming the signal-to-noise ratio to be infinite. To reduce complexity, which can become prohibitive for large network size, we examine the performance-complexity tradeoffs involved in a sparse equalizer design. Joint precoder and equalizer optimization requires alternation between the forward and reverse links and assumes perfect synchronization between the transmitters and receivers at each network node, resulting in extensive overhead and spectral efficiency loss. To overcome this serious drawback, we propose a new design approach based on weighted-sum-rate maximization assuming a virtual equalizer type at the transmitter to limit the optimization process to the transmitter side. In addition, we quantify the sum-rate loss due to mismatched equalizer types and demonstrate the robustness of our proposed sum-rate weighting strategy to such mismatches with perfect or imperfect channel knowledge. Finally, we derive asymptotic performance expressions and verify their accuracy numerically even for a moderate number of users. [ABSTRACT FROM PUBLISHER]

This paper studies the linear transceiver design for multi-stream multiple-input-multiple-output (MIMO) interference channels with imperfect channel state information (CSI). Two CSI error models are considered. The same coding and modulation scheme is assumed for all users and data streams. In the first model, where the CSI error is statistical, we minimize the average maximum per-stream mean square error (MSE). In the second model, where the CSI error is norm bounded, the worst-case maximum per-stream MSE is optimized. Since the problems are not jointly convex, the alternate optimization approach is adopted to obtain suboptimal transceivers. For the statistical CSI error, a low-complexity algorithm utilizing Lagrangian duality is proposed, which has a semi-closed form solution and can be implemented distributively. Compared with the classical algorithm using the second-order-cone programming, the proposed algorithm significantly reduces the computational complexity without sacrificing the performance. For the bounded CSI error, we present two approaches. One uses S-procedure to obtain an equivalent problem and the other one solves an approximated problem. Simulation results demonstrate the robustness of the proposed algorithms and their improved performance over the sum-MSE and the maximum per-user MSE based methods. The lower complexity of the Lagrangian duality based algorithm is also verified numerically. [ABSTRACT FROM PUBLISHER]

Power line communications (PLC) is the central communications technology for the realization of smart power grids. As the designated band for smart grid communications is the narrowband (NB) power line channel, NB-PLC has been receiving substantial attention in recent years. Narrowband power line channels are characterized by cyclic short-term variations of the channel transfer function (CTF) and strong noise with periodic statistics. In this paper, modeling the CTF as a linear periodically time-varying filter and the noise as an additive cyclostationary Gaussian process, we derive the capacity of discrete-time NB-PLC channels. As part of the capacity derivation, we characterize the capacity achieving transmission scheme, which leads to a practical code construction that approaches capacity. The capacity derived in this work is numerically evaluated for several NB-PLC channel configurations taken from previous works, and the results show that the optimal scheme achieves a substantial rate gain over a previously proposed ad-hoc scheme. This gain is due to optimally accounting for the periodic properties of the channel and the noise. [ABSTRACT FROM PUBLISHER]

In this paper, a novel channel estimation (CE) method is proposed for spatial modulation (SM), a unique single-stream multiple-input–multiple-output transmission technique. In SM, there is only one transmit antenna being active at any time instance. While this property completely avoids inter-channel interference, it results in a challenge to estimate the channel information. In conventional CE (CCE) methods for SM, all transmit antennas have to be sequentially activated for sending pilots. Therefore, the time consumed in CE is proportional to the number of transmit antennas, which significantly compromises the throughput. By exploiting channel correlation, the proposed method, named transmission cross CE (TCCE), has the following characteristics: i) the entire channel is estimated by sending pilots through one transmit antenna; ii) it requires no overhead or feedback; and iii) it achieves a low computational complexity at the receiver. In addition, we propose an analytical framework to compute the distribution of the CE errors over time-varying fading channels. The corresponding average bit error probability (ABEP) bound of SM is also derived for the proposed method. Results show that the proposed ABEP bound matches with the simulations very well. When compared with CCE, the new method obtains a signal-to-noise ratio gain of up to 7.5 dB for medium and high correlations between the transmit antennas. Moreover, an adaptive CE technique can be readily implemented for SM via switching between CCE and TCCE. [ABSTRACT FROM AUTHOR]

In this paper, we propose a novel Virtual Multiple-Input–Multiple-Output (VMIMO) architecture based on the concept of Spatial Modulation (SM). Using a dual-hop and Decode-and-Forward protocol, we form a distributed system, called Dual-Hop Hybrid SM (DH-HSM). DH-HSM conveys information from a Source Node (SN) to a Destination Node (DN) via multiple Relay Nodes (RNs). The spatial position of the RNs is exploited for transferring information in addition to, or even without, a conventional symbol. In order to increase the performance of our architecture, while keeping the complexity of the RNs and DN low, we employ linear precoding using Channel State Information (CSI) at the SN. In this way, we form a Receive-Spatial Modulation (R-SM) pattern from the SN to the RNs, which is able to employ a centralized coordinated or a distributed uncoordinated detection algorithm at the RNs. In addition, we focus on the SN and propose two regularized linear precoding methods that employ realistic Imperfect Channel State Information at the Transmitter. The power of each precoder is analyzed theoretically. Using the Bit Error Rate (BER) metric, we evaluate our architecture against the following benchmark systems: 1) single relay; 2) best relay selection; 3) distributed Space Time Block Coding (STBC) VMIMO scheme; and 4) the direct communication link. We show that DH-HSM is able to achieve significant Signal-to-Noise Ratio (SNR) gains, which can be as high as 10.5 dB for a very large scale system setup. In order to verify our simulation results, we provide an analytical framework for the evaluation of the Average Bit Error Probability (ABEP). [ABSTRACT FROM AUTHOR]

In this paper, we propose a new beamforming technique that maximizes the end-to-end signal-to-noise ratio (SNR) foramplify-and-forward multiple-input–multiple-output cooperative relaying systems with direct link between thesource and the destination. Instead of conventional schemes resorting to an iterative method, such as a gradient ascentalgorithm, our scheme provides a simple closed-form solution for source-relay joint beamformer designs. To this end, wefirst derive a new expression of the end-to-end SNR for the cooperative relaying systems and its lower bound, which isgiven as the harmonic mean of two individual SNRs. Then, a new beamforming scheme, which adaptively optimizes one of thetwo SNRs depending on the channel condition, is proposed. In addition, we perform a diversity order analysis of theproposed scheme and show that our scheme achieves a full diversity order of relaying systems with direct link. It isconfirmed by simulation results that the proposed technique obtains almost identical performance to the gradient ascentalgorithm with much reduced complexity, and our analytical work accurately predicts the numerical results. [ABSTRACT FROM AUTHOR]

This paper analyzes the performance of an optimal single stream beamforming scheme for a multiple-input multiple-output (MIMO) relay network with dual-hop fixed-gain amplify-and-forward (AF) relaying. The source-relay and relay-destination channels undergo Rayleigh and Rician fading respectively. Different Rician fading scenarios are considered for relay-destination channel, depending on the rank of the Rician channel matrix. The channel state information is only available at the destination, and the destination computes the optimal transmit and receive beamforming vectors to maximize the instantaneous signal-to-noise ratio (SNR). The optimal transmit beamforming vector is sent back to the transmitter via a dedicated feedback link. We derive new analytical expressions for the cumulative distribution function, probability density function, and moments to statistically characterize the properties of the instantaneous SNR. These statistical properties are used to analyze the system performance in terms of the outage probability, average bit error rate, and the ergodic capacity. The performance analysis investigates the effects of the Rician factor, rank of the line-of-sight component, and number of antennas at the nodes on the system performance. The results reveal that the optimal single stream beamforming system provides better performance than an orthogonal space-time block coded based AF MIMO system. [ABSTRACT FROM PUBLISHER]

In this paper, we analyze a multiple-input multiple-output (MIMO) interference channel where nodes are randomly distributed on a plane as a spatial Poisson cluster point process. A Poisson cluster point process consists of clusters with fixed number of points randomly distributed as with the cluster centers distributed randomly on the plane. The nodes in each cluster use interference alignment (IA) to suppress intra-cluster interference but unlike most work on IA, we do not neglect inter-cluster interference. We also connect the accuracy of channel state information to the distance between the nodes, i.e., the quality of CSI degrades with increasing distance. Accounting for the training and feedback overhead, we derive the transmission capacity of this MIMO IA ad hoc network and then compare it to open-loop (interference-blind) spatial multiplexing. Finally, we present exemplary system setups where spatial multiplexing outperforms IA due to the imperfect channel state information or the non-aligned inter-cluster interference. [ABSTRACT FROM PUBLISHER]

This paper investigates the linear precoder design for K-user interference channels of multiple-input multiple-output (MIMO) transceivers under finite alphabet inputs. We first obtain general explicit expressions of the achievable rate for users in the MIMO interference channel systems. We study optimal transmission strategies in both low and high signal-to-noise ratio (SNR) regions. Given finite alphabet inputs, we show that a simple power allocation design achieves optimal performance at high SNR whereas the well-known interference alignment technique for Gaussian inputs only utilizes a partial interference-free signal space for transmission and leads to a constant rate loss when applied naively to finite-alphabet inputs. Moreover, we establish necessary conditions for the linear precoder design to achieve weighted sum-rate maximization. We also present an efficient iterative algorithm for determining precoding matrices of all the users. Our numerical results demonstrate that the proposed iterative algorithm achieves considerably higher sum-rate under practical QAM inputs than other known methods. [ABSTRACT FROM AUTHOR]

In this paper, we start by investigating the impact of joint transmit-receive I/Q imbalance on the performance of direct-conversion beamforming OFDM transceivers. We derive a new analytical expression for the average subcarrier SINR of the I/Q imbalance-ignorant beamformer in terms of the I/Q imbalance level at both the transmit and receive sides, the size of the beamforming array, and the input SNR level. This expression motivates the need for I/Q imbalance compensation and provides valuable design insights when examining several special and limiting cases. Next, we derive the throughput-maximizing multiple beamforming transmit/receive coefficients under a general system model with an asymmetric frequency-dependent (FD) joint transmit-receive I/Q imbalance. In addition, we propose a low-complexity pilot-aided scheme for the estimation of the channel and I/Q imbalance parameters. Our simulation results demonstrate that the proposed generalized multiple beamforming scheme is highly effective in mitigating I/Q imbalance effects at practical complexity levels. [ABSTRACT FROM AUTHOR]

In this paper, we analytically investigate Gallager's exponent for space-time block codes over multiple-input multiple-output block-fading channels with Gaussian input distribution. As a suitable metric of the fundamental tradeoff between communication reliability and information rate, Gallager's exponent can be used to determine the required codeword length to achieve a prescribed error probability at a given rate below the channel capacity. We assume that the receiver has full channel state information (CSI), while the transmitter has no CSI and performs equal power allocation across all transmit antennas. In the following, novel exact expressions for Gallager's exponent are derived for two well-known channel fading models, namely η-μ and κ-μ fading models. More importantly, the implications of fading parameters and channel coherence time on Gallager's exponent are investigated. In addition, we present new expressions for the Shannon capacity, cutoff rate and expurgated exponent for the above mentioned fading models, while in the high signal-to-noise ratio regime, simplified closed-form expressions are also derived. Finally, we highlight the fact that the presented analysis encompasses all previously known results on Nakagami-m, Rician, Rayleigh and Hoyt fading channels, as special cases. [ABSTRACT FROM AUTHOR]

Interference alignment (IA) is known to significantly increase sum-throughput at high SNR in the presence of multiple interfering nodes, however, the reliability of IA is little known, which is the subject of this paper. We study the error performance of IA and compare it with conventional orthogonal transmission schemes. Since most IA algorithms require extensive channel state information (CSI), we also investigate the impact of CSI imperfection (uncertainty) on the error performance. Our results show that under identical rates, IA attains a better error performance than the orthogonal scheme for practical signal to noise ratio (SNR) values but is more sensitive to CSI uncertainty. We design bit loading algorithms that significantly improve error performance of the existing IA schemes. Furthermore, we propose an adaptive transmission scheme that not only considerably reduces error probability, but also produces robustness to CSI uncertainty. [ABSTRACT FROM PUBLISHER]

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]

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]

Recent works on multiuser MIMO study have shown that the linear growth of capacity in single user MIMO system can be translated to the multiuser MIMO scenario as well. In this paper, we propose a method pursuing performance gain of vector perturbation in multiuser downlink systems. Instead of employing the maximum number of mobile users for communication, we use small part of them as virtual users for improving reliability of users participating communication. By controlling parameters of the virtual users including information and perturbation vector, we obtain considerable improvement in the effective SNR. Simulation results on the realistic multiuser MISO and MIMO downlink systems show that the proposed method brings substantial performance gain over the standard vector perturbation with marginal overhead in computations. [ABSTRACT FROM AUTHOR]

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]

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]

In a cellular-like system, the multiple-input multiple-output (MIMO) mode used by a base station (BS) can be adaptively varied among several candidate MIMO modes, including space-time block coding (STBC), open-loop spatial multiplexing (OLSM), closed-loop spatial multiplexing (CLSM), MIMO beamforming (MBF), and maximal ratio transmission (MRT). In practice, during any one given period of time, when the desired BS performs downlink transmission with a specific MIMO mode, each co-channel interfering BS will use a MIMO mode the same as or different from that used in the desired link and any two co-channel interfering BSs may use different MIMO modes, so that the interference scenario becomes quite complicated. In this paper, considering realistic propagation conditions including both path-loss and Rayleigh fading and considering the existence of unequal-power interferers, the statistical distributions of the post-processing signal-to-interference ratios (SIRs) for either MBF or STBC downlink transmissions are analyzed when co-channel interfering BSs employ arbitrary MIMO modes. In particular, closed-form expressions for the probability density function (PDF) of the interference terms in the post-processing SIRs are derived. Further, the statistical distributions of the post-processing SIRs are analyzed. Simulation results verify the validity of the theoretical analyses. [ABSTRACT FROM PUBLISHER]

The front-end is a crucial component in modern wireless communication systems. For SISO systems minimizing the front-end noise factor is optimal, and this also applies to MIMO systems with i.i.d. noise. However, for compact MIMO receivers that may exhibit spatially correlated noise, e.g., through antenna mutual coupling, the optimal design procedure is not clear. In this paper we develop MIMO low-noise design principles from a communication theory perspective by deriving generalizations of SNR and noise factor from various MIMO communication schemes. As one result, we are able to derive optimal matching networks for a bank of uncoupled amplifiers. [ABSTRACT FROM PUBLISHER]