We investigate the capacity scaling of MIMO systems with the system dimensions. To that end, we quantify how the mutual information varies when the number of antennas (at either the receiver or transmitter side) is altered. For a system comprising $R$ receive and $T$ transmit antennas with $R>T$, we find the following: By removing as many receive antennas as needed to obtain a square system (provided the channel matrices before and after the removal have full rank) the maximum resulting loss of mutual information over all signal-to-noise ratios (SNRs) depends only on $R$, $T$ and the matrix of left-singular vectors of the initial channel matrix, but not on its singular values. In particular, if the latter matrix is Haar distributed the ergodic rate loss is given by $\sum_{t=1}^{T}\sum_{r=T+1}^{R}\frac{1}{r-t}$ nats. Under the same assumption, if $T,R\to \infty$ with the ratio $ϕ\triangleq T/R$ fixed, the rate loss normalized by $R$ converges almost surely to $H(ϕ)$ bits with $H(\cdot)$ denoting the binary entropy function. We also quantify and study how the mutual information as a function of the system dimensions deviates from the traditionally assumed linear growth in the minimum of the system dimensions at high SNR.
City University of Hong Kong（香港城市大学）；Japan Institute of Science and Technology (JAIST)（日本北陆先端科学技术大学院大学）；Huawei Technologies Co., Ltd.（华为技术有限公司）
This paper investigates a large unitarily invariant system (LUIS) involving a unitarily invariant sensing matrix, an arbitrary fixed signal distribution, and forward error control (FEC) coding. Several area properties are established based on the state evolution of orthogonal approximate message passing (OAMP) in an un-coded LUIS. Under the assumptions that the state evolution for joint OAMP and FEC decoding is correct and the replica method is reliable, we analyze the achievable rate of OAMP. We prove that OAMP reaches the constrained capacity predicted by the replica method of the LUIS with …
In this work we study the secrecy capacity of Gaussian multiple-input multiple-output (MIMO) wiretap channels (WTCs) with a finite memory, subject to a per-symbol average power constraint on the MIMO channel input. MIMO channels with finite memory are very common in wireless communications as well as in wireline communications (e.g., in communications over power lines). To derive the secrecy capacity of the Gaussian MIMO WTC with finite memory we first construct an asymptotically-equivalent block-memoryless MIMO WTC, which is then transformed into a set of parallel, independent, memoryless MIM…
In this paper, we consider the transceiver and relay design for multiple-input multiple-output (MIMO) cellular two-way relay channel (cTWRC), where a multi-antenna base station (BS) exchanges information with multiple multi-antenna mobile stations via a multi-antenna relay station (RS). We propose a novel two-way relaying scheme to approach the sum capacity of the MIMO cTWRC.
The capacity region of a multiple-input-multiple-output interference channel (MIMO IC) where the channel matrices are square and invertible is studied. The capacity region for strong interference is established where the definition of strong interference parallels that of scalar channels. Moreover, the sum-rate capacity for Z interference, noisy interference, and mixed interference is established. These results generalize known results for the scalar Gaussian IC.
In this paper, we have investigated the application of non-binary LDPC codes to spatial multiplexing MIMO systems with a large number of low power antennas. We demonstrate that such large MIMO systems incorporating with low-complexity MMSE detector and non-binary LDPC codes can achieve low probability of bit error at near MIMO capacity. The new proposed non-binary LDPC coded system also performs better than other coded large MIMO systems known in the present literature. For instance, non-binary LDPC coded BPSK-MIMO system with 600 transmit/receive antennas performs within 3.4 dB from the capac…
We propose an iterative mode-dropping algorithm that optimizes input signals to achieve the sum capacity of the MIMO-MAC with per-antenna power constraint. The algorithm successively optimizes each user's input covariance matrix by applying mode-dropping to the equivalent single-user MIMO rate maximization problem. Both analysis and simulation show fast convergence. We then use the algorithm to briefly highlight the difference in MIMO-MAC capacities under sum and per-antenna power constraints.
A Gaussian multiple-input multiple-output (MIMO) wiretap channel model is considered. The input is a two-antenna transmitter, while the outputs are the legitimate receiver and an eavesdropper, both equipped with multiple antennas. All channels are assumed to be known. The problem of obtaining the optimal input covariance matrix that achieves secrecy capacity subject to a power constraint is addressed, and a closed-form expression for the secrecy capacity is obtained.
The capacity region of the 2-user multi-input multi-output (MIMO) Gaussian interference channel (IC) is characterized to within a constant gap that is independent of the channel matrices for the general case of the MIMO IC with an arbitrary number of antennas at each node. An achievable rate region and an outer bound to the capacity region of a class of interference channels were obtained in previous work by Telatar and Tse as unions over all possible input distributions. In contrast to that previous work on the MIMO IC, a simple and an explicit achievable coding scheme are obtained here and s…
In this paper, we propose a new multiple-input multiple-output (MIMO) communication system with movable antennas (MAs) to exploit the antenna position optimization for enhancing the capacity. Different from conventional MIMO systems with fixed-position antennas (FPAs), the proposed system can flexibly change the positions of transmit/receive MAs, such that the MIMO channel between them is reconfigured to achieve higher capacity. We aim to characterize the capacity of MA-enabled point-to-point MIMO communication systems, by jointly optimizing the positions of transmit and receive MAs as well as…
The capacity regions of multiple-input multiple-output Gaussian Z-interference channels are established for the very strong interference and aligned strong interference cases. The sum-rate capacity of such channels is established under noisy interference. These results generalize known results for scalar Gaussian Z-interference channels.
In this paper, we study the effect of feedback on two-user MIMO interference channels. The capacity region of MIMO interference channels with feedback is characterized within a constant number of bits, where this constant is independent of the channel matrices. Further, it is shown that the capacity region of a MIMO interference channel with feedback and its reciprocal interference channel are within a constant number of bits. Finally, the generalized degrees of freedom region for the MIMO interference channel with feedback is characterized.
In this paper, we investigated the capacity and bit error rate (BER) performance of Multiple Input Multiple Output (MIMO) satellite systems with single and multiple dual polarized satellites in geostationary orbit and a mobile ground receiving station with multiple antennas. We evaluated the effects of both system parameters such as number of satellites, number of receive antennas, and SNR and environmental factors including atmospheric signal attenuations and signal phase disturbances on the overall system performance using both analytical and spatial models for MIMO satellite systems.
The capacity of ideal MIMO channels has a high-SNR slope that equals the minimum of the number of transmit and receive antennas. This letter analyzes if this result holds when there are distortions from physical transceiver impairments. We prove analytically that such physical MIMO channels have a finite upper capacity limit, for any channel distribution and SNR. The high-SNR slope thus collapses to zero. This appears discouraging, but we prove the encouraging result that the relative capacity gain of employing MIMO is at least as large as with ideal transceivers.
The deterministic capacity of a relay network is the capacity of a network when relays are restricted to transmitting \emph{reliable} information, that is, (asymptotically) deterministic function of the source message. In this paper it is shown that the deterministic capacity of a number of MIMO relay networks can be found in the low power regime where $\SNR\to0$. This is accomplished through deriving single letter upper bounds and finding the limit of these as $\SNR\to0$. The advantage of this technique is that it overcomes the difficulty of finding optimum distributions for mutual informatio…
This paper considers a iterative Linear Minimum Mean Square Error (LMMSE) detection for the uplink Multiuser Multiple-Input and Multiple-Output (MU-MIMO) systems with Non-Orthogonal Multiple Access (NOMA). The iterative LMMSE detection greatly reduces the system computational complexity by departing the overall processing into many low-complexity distributed calculations. However, it is generally considered to be sub-optimal and achieves relatively poor performance. In this paper, we firstly present the matching conditions and area theorems for the iterative detection of the MIMO-NOMA systems.…
Pilot contamination has been regarded as a main limiting factor of time division duplexing (TDD) massive multiple-input-multiple-output (Massive MIMO) systems, as it will make the signal-to-interference-plus-noise ratio (SINR) saturated. However, how pilot contamination will limit the user capacity of downlink Massive MIMO, i.e., the maximum number of admissible users, has not been addressed. This paper provides an explicit expression of the Massive MIMO user capacity in the pilot-contaminated regime where the number of users is larger than the pilot sequence length. Furthermore, the scheme fo…
This study investigates the mean capacity of multiple-input multiple-output (MIMO) systems for spatially semi-correlated flat fading channels. In reality, the capacity degrades dramatic due to the channel covariance (CC) when correlations exist at the transmitter or receiver or on both sides. Most existing works have so far considered the traditional channel covariance matrices that have not been entirely constructed. Thus, we propose an iterative channel covariance (ICC) matrix using a matrix splitting (MS) technique with a guaranteed zero correlations coefficient in the case of the downlink …
One key metric for physical layer security is the secrecy capacity. This is the maximum rate that a system can transmit with perfect secrecy. For a Multiple Input Multiple Output (MIMO) system (a newer technology for 5G, 6G and beyond) the secrecy capacity is not fully understood. For a Gaussian MIMO channel, the secrecy capacity is a non-convex optimisation problem for which a general solution is not available. Previous work by the authors showed that the secrecy capacity of a MIMO system with a single eavesdrop antenna is concave to a cut off point. In this work, which extends the previous p…
Similar to the energy flowing process in traditional heat engines, information could be considered to flow in the communication systems with the form of energy and entropy. Combining the thermodynamic Carnot machine and the classical Shannon information theory, a generalized thermodynamic MIMO (multiple input multiple outputs) communication system is established to analyze the channel capacity using forward error correction codes. Based on the concepts of freedom and entropy in the communication system, the generalized channel capacity is proposed under the thermodynamic theory. Furthermore, t…
We investigate the problem of message transmission over time-varying single-user multiple-input multiple-output (MIMO) Rayleigh fading channels with average power constraint and with complete channel state information available at the receiver side (CSIR). To describe the channel variations over the time, we consider a first-order Gauss-Markov model. We completely solve the problem by giving a single-letter characterization of the channel capacity in closed form and by providing a rigorous proof of it.
Multiple cluster scattering MIMO channel is a useful model for pico-cellular MIMO networks. In this paper, orthogonal space-time block coded transmission over such a channel is considered, where the effective channel equals the product of n complex Gaussian matrices. A simple and accurate closed-form approximation to the channel outage capacity has been derived in this setting. The result is valid for an arbitrary number of clusters n-1 of scatterers and an arbitrary antenna configuration. Numerical results are provided to study the relative outage performance between the multi-cluster and the…
In this paper, the application of non-binary low-density parity-check (NBLDPC) codes to MIMO systems which employ hundreds of antennas at both the transmitter and the receiver has been proposed. Together with the well-known low-complexity MMSE detection, the moderate length NBLDPC codes can operate closer to the MIMO capacity, e.g., capacity-gap about 3.5 dB (the best known gap is more than 7 dB). To further reduce the complexity of MMSE detection, a novel soft output detection that can provide an excellent coded performance in low SNR region with 99% complexity reduction is also proposed. The…
We consider the broadcast phase of a three-node network, where a relay node establishes a bidirectional communication between two nodes using a spectrally efficient two-phase decode-and-forward protocol. In the first phase the two nodes transmit their messages to the relay node. Then the relay node decodes the messages and broadcasts a re-encoded composition of them in the second phase. We consider Gaussian MIMO channels and determine the capacity region for the second phase which we call the Gaussian MIMO bidirectional broadcast channel.
We find the secrecy capacity of the 2-2-1 Gaussian MIMO wire-tap channel, which consists of a transmitter and a receiver with two antennas each, and an eavesdropper with a single antenna. We determine the secrecy capacity of this channel by proposing an achievable scheme and then developing a tight upper bound that meets the proposed achievable secrecy rate. We show that, for this channel, Gaussian signalling in the form of beam-forming is optimal, and no pre-processing of information is necessary.
This paper considers a Iterative Linear Minimum Mean Square Error (LMMSE) detection for the uplink Multiuser Multiple-Input and Multiple-Output (MU-MIMO) systems with Non-Orthogonal Multiple Access (NOMA), in which all the users interfere with each other both in the time domain and frequency domain. It is well known that the Iterative LMMSE detection greatly reduces the system computational complexity by departing the overall processing into many low-complexity distributed calculations that can be executed in parallel. However, it is generally considered to be suboptimal and achieves relativel…
In this paper, we analyze the capacity of multiple-input multiple-output (MIMO) Rayleigh-fading channels in the presence of spatial fading correlation at both the transmitter and the receiver, assuming that the channel is unknown at the transmitter and perfectly known at the receiver. We first derive the determinant representation for the exact characteristic function of the capacity, which is then used to determine the trace representations for the mean, variance, skewness, kurtosis, and other higher-order statistics (HOS). These results allow us to exactly evaluate two relevant information-t…
In this paper, the performance of multiple-input multiple-output non-orthogonal multiple access (MIMO-NOMA) is investigated when multiple users are grouped into a cluster. The superiority of MIMO-NOMA over MIMO orthogonal multiple access (MIMO-OMA) in terms of both sum channel capacity and ergodic sum capacity is proved analytically. Furthermore, it is demonstrated that the more users are admitted to a cluster, the lower is the achieved sum rate, which illustrates the tradeoff between the sum rate and maximum number of admitted users. On this basis, a user admission scheme is proposed, which i…
This paper characterizes the capacity region of Gaussian MIMO broadcast channels (BCs) with per-antenna power constraint (PAPC). While the capacity region of MIMO BCs with a sum power constraint (SPC) was extensively studied, that under PAPC has received less attention. A reason is that efficient solutions for this problem are hard to find. The goal of this paper is to devise an efficient algorithm for determining the capacity region of Gaussian MIMO BCs subject to PAPC, which is scalable to the problem size. To this end, we first transform the weighted sum capacity maximization problem, which…
In this paper it is shown that the nonfeedback capacity of multiple-input multiple-output (MIMO) additive Gaussian noise (AGN) channels, when the noise is nonstationary and unstable, is characterized by an asymptotic optimization problem that involves, a generalized matrix algebraic Riccati equation (ARE) of filtering theory, and a matrix Lyapunov equation of stability theory of Gaussian systems. Furthermore, conditions are identified such that, the characterization of nonfeedback capacity corresponds to the uniform asymptotic per unit time limit, over all initial distributions, of the charact…
In this paper, we present an analytical lower bound on the ergodic capacity of optical multiple-input multiple-output (MIMO) channels. It turns out that the optical MIMO channel matrix which couples the mt inputs (modes/cores) into mr outputs (modes/cores) can be modeled as a sub-matrix of a m x m Haar-distributed unitary matrix where m > mt,mr. Using the fact that the probability density of the eigenvalues of a random matrix from unitary ensemble can be expressed in terms of the Christoffel-Darboux kernel. We provide a new analytical expression of the ergodic capacity as function of signal-to…
A multiple input multiple output (MIMO) two-way relay channel is considered, where two sources want to exchange messages with each other using multiple relay nodes, and both the sources and relay nodes are equipped with multiple antennas. Both the sources are assumed to have equal number of antennas and have perfect channel state information (CSI) for all the channels of the MIMO two-way relay channel, whereas, each relay node is either assumed to have CSI for its transmit and receive channel (the coherent case) or no CSI for any of the channels (the non-coherent case). The main results in thi…
Under the conditions where performance in a massive MIMO network is limited by pilot contamination, the reverse link signal-to-interference ratio (SIR) exhibits different distributions when using different pilot allocation schemes. By utilising different sets of orthogonal pilot sequences, as opposed to reused sequences amongst adjacent cells, the resulting SIR distribution is more favourable with respect to maximising the number of users on the network while maintaining a given quality of service (QoS) for all users. This paper provides a simple expression for uplink user capacity on such net…
We consider Vertical Bell Laboratories Layered Space-Time (V-BLAST) systems in correlated multiple-input multiple-output (MIMO) Nakagami-m fading channels with equal power allocated to each transmit antenna and also we consider that the channel state information (CSI) is available only at the receiver. Now for practical application, study of the VBLAST MIMO system in correlated environment is necessary. In this paper, we present a detailed study of the channel capacity in correlated and uncorrelated channel condition and also validated the result with appropriate mathematical relation.
In this paper, we consider secure transmissions in ergodic Rayleigh fast-faded multiple-input multiple-output multiple-antenna-eavesdropper (MIMOME) wiretap channels with only statistical channel state information at the transmitter (CSIT). When the legitimate receiver has more (or equal) antennas than the eavesdropper, we prove the first MIMOME secrecy capacity with partial CSIT by establishing a new secrecy capacity upper-bound. The key step is to form an MIMOME degraded channel by dividing the legitimate receiver's channel matrix into two submatrices, and setting one of the submatrices to b…
We investigate the problem of message transmission and the problem of common randomness (CR) generation over single-user multiple-input multiple-output (MIMO) slow fading channels with average input power constraint, additive white Gaussian noise (AWGN), arbitrary state distribution and with complete channel state information available at the receiver side (CSIR). First, we derive a lower and an upper bound on the outage transmission capacity of MIMO slow fading channels for arbitrary state distribution and show that the bounds coincide except possibly at the points of discontinuity of the out…
This paper considers reliable communications over a multiple-input multiple-output (MIMO) Gaussian channel, where the channel matrix is within a bounded channel uncertainty region around a nominal channel matrix, i.e., an instance of the compound MIMO Gaussian channel. We study the optimal transmit covariance matrix design to achieve the capacity of compound MIMO Gaussian channels, where the channel uncertainty region is characterized by the spectral norm. This design problem is a challenging non-convex optimization problem. However, in this paper, we reveal that this problem has a hidden conv…
With the complication of future communication scenarios, most conventional signal processing technologies of multi-user multiple-input multiple-output (MU-MIMO) become unreliable, which are designed based on ideal assumptions, such as Gaussian signaling and independent identically distributed (IID) channel matrices. As a result, this paper considers a generalized MU-MIMO (GMU-MIMO) system with more general assumptions, i.e., arbitrarily fixed input distributions, and general unitarily-invariant channel matrices. However, there is still no accurate capacity analysis and capacity optimal transce…
MIMO-NOMA combines Multiple-Input Multiple-Output (MIMO) and Non-Orthogonal Multiple Access (NOMA), which can address heterogeneous challenges, such as massive connectivity, low latency, and high reliability. In this paper, a practical coded MIMO-NOMA system with capacityapproaching performance as well as low implementation complexity is proposed. Specifically, the employed receiver consists of a multi-user Linear Minimum Mean-Square Error (LMMSE) detector and a bank of single-user message-passing decoders, which decompose the overall signal recovery into distributed low-complexity calculation…
We characterize the capacity of Rayleigh block-fading multiple-input multiple-output (MIMO) channels in the noncoherent setting where transmitter and receiver have no a priori knowledge of the realizations of the fading channel. We prove that unitary space-time modulation (USTM) is not capacity-achieving in the high signal-to-noise ratio (SNR) regime when the total number of antennas exceeds the coherence time of the fading channel (expressed in multiples of the symbol duration), a situation that is relevant for MIMO systems with large antenna arrays (large-MIMO systems). This result settles a…
This paper presents an analytical characterization of the ergodic capacity of amplify-and-forward (AF) MIMO dual-hop relay channels, assuming that the channel state information is available at the destination terminal only. In contrast to prior results, our expressions apply for arbitrary numbers of antennas and arbitrary relay configurations. We derive an expression for the exact ergodic capacity, simplified closed-form expressions for the high SNR regime, and tight closed-form upper and lower bounds. These results are made possible to employing recent tools from finite-dimensional random mat…
With bandwidths on the order of a gigahertz in emerging wireless systems, high-resolution analog-to-digital convertors (ADCs) become a power consumption bottleneck. One solution is to employ low resolution one-bit ADCs. In this paper, we analyze the flat fading multiple-input multiple-output (MIMO) channel with one-bit ADCs. Channel state information is assumed to be known at both the transmitter and receiver. For the multiple-input single-output channel, we derive the exact channel capacity. For the single-input multiple-output and MIMO channel, the capacity at infinite signal-to-noise ratio …
The capacity and optimal signaling over a fixed Gaussian MIMO channel are considered under the joint total and per-antenna power constraints (TPC and PAC). While the general case remains an open problem, a closed-form full-rank solution is obtained along with its sufficient and necessary conditions. The conditions for each constraint to be inactive are established. The high and low-SNR regimes are studied. Isotropic signaling is shown to be optimal in the former case while rank-1 signaling (beamforming) is not necessarily optimal in the latter case. Unusual properties of optimal covariance und…
This paper considers a low-complexity iterative Linear Minimum Mean Square Error (LMMSE) multi-user detector for the Multiple-Input and Multiple-Output system with Non-Orthogonal Multiple Access (MIMO-NOMA), where multiple single-antenna users simultaneously communicate with a multiple-antenna base station (BS). While LMMSE being a linear detector has a low complexity, it has suboptimal performance in multi-user detection scenario due to the mismatch between LMMSE detection and multi-user decoding. Therefore, in this paper, we provide the matching conditions between the detector and decoders f…
In this paper, delay constrained performance of a multiple-input multiple-output (MIMO) communication system in a dense environment with co-channel interference is investigated. We apply orthogonal space-time block coding (OSTBC) at the transmitter, and for alleviating the high complexity and cost of the MIMO system, receive antenna selection (RAS) scheme is employed in the downlink. Here, for simple and cheap mobile handsets, one antenna is chosen at the receiver in each utilization of the channel. Under these assumptions, a maximum constant arrival rate with the delay quality-of-service (QoS…
Discrete-time Rayleigh fading multiple-input multiple-output (MIMO) channels are considered, with no channel state information at the transmitter and receiver. The fading is assumed to be correlated in time and independent from antenna to antenna. Peak and average transmit power constraints are imposed, either on the sum over antennas, or on each individual antenna. In both cases, an upper bound and an asymptotic lower bound, as the signal-to-noise ratio approaches zero, on the channel capacity are presented. The limit of normalized capacity is identified under the sum power constraints, and, …
We study the high-SNR capacity of MIMO Rayleigh block-fading channels in the noncoherent setting where neither transmitter nor receiver has a priori channel state information. We show that when the number of receive antennas is sufficiently large and the temporal correlation within each block is "generic" (in the sense used in the interference-alignment literature), the capacity pre-log is given by T(1-1/N) for T<N, where T denotes the number of transmit antennas and N denotes the block length. A comparison with the widely used constant block-fading channel (where the fading is constant within…
We provide an alternative proof for the capacity region of the degraded Gaussian multiple-input multiple-output (MIMO) broadcast channel. Our proof does not use the channel enhancement technique as opposed to the original proof of Weingertan {\it et. al.} and the alternative proof of Liu {\it et. al}. Our proof starts with the single-letter description of the capacity region of the degraded broadcast channel, and directly evaluates it for the degraded Gaussian MIMO broadcast channel by using two main technical tools. The first one is the generalized de Bruijn identity due to Palomar \emph{et. …
Cognitive radios have been studied recently as a means to utilize spectrum in a more efficient manner. This paper focuses on the fundamental limits of operation of a MIMO cognitive radio network with a single licensed user and a single cognitive user. The channel setting is equivalent to an interference channel with degraded message sets (with the cognitive user having access to the licensed user's message). An achievable region and an outer bound is derived for such a network setting. It is shown that under certain conditions, the achievable region is optimal for a portion of the capacity reg…
This paper addresses cooperation in a multicell environment where base stations (BSs) wish to jointly serve multiple users, under a constrained-capacity backhaul. We point out that for finite backhaul capacity a trade-off between sharing user data, which allows for full MIMO cooperation, and not doing so, which reduces the setup to an interference channel but also requires less overhead, emerges. We optimize this trade-off by formulating a rate splitting approach in which non-shared data (private to each transmitter) and shared data are superposed. We derive the corresponding achievable rate r…
In this paper, we first propose an universal polar coding scheme for parallel Gaussian channels with non-binary inputs. It is assumed that the encoder knows only the sum capacity of M parallel channels instead of the capacity of any single channel. By decomposing each parallel channel into T = [log2r] sub channels, we therefore obtain MT binary sub-channels. A super polar coding scheme that across all sub-channels is then proposed. This scheme can achieve the sum capacity when the block length is sufficiently large. We have also discussed the applications of parallel polar coding design for bo…
The problem of sending a secret message over the Gaussian multiple-input multiple-output (MIMO) wiretap channel is studied. While the capacity of this channel is known, it is not clear how to construct optimal coding schemes that achieve this capacity. In this work, we use linear operations along with successive interference cancellation to attain effective parallel single-antenna wiretap channels. By using independent scalar Gaussian wiretap codebooks over the resulting parallel channels, the capacity of the MIMO wiretap channel is achieved. The derivation of the schemes is based upon joint t…
Radio-frequency (RF) impairments in the transceiver hardware of communication systems (e.g., phase noise (PN), high power amplifier (HPA) nonlinearities, or in-phase/quadrature-phase (I/Q) imbalance) can severely degrade the performance of traditional multiple-input multiple-output (MIMO) systems. Although calibration algorithms can partially compensate these impairments, the remaining distortion still has substantial impact. Despite this, most prior works have not analyzed this type of distortion. In this paper, we investigate the impact of residual transceiver hardware impairments on the MIM…
The capacity of a fixed Gaussian multiple-input multiple-output (MIMO) channel and the optimal transmission strategy under the total power (TP) constraint and full channel state information are well-known. This problem remains open in the general case under individual per-antenna (PA) power constraints, while some special cases have been solved. These include a full-rank solution for the MIMO channel and a general solution for the multiple-input single-output (MISO) channel. In this paper, the fixed Gaussian MISO channel is considered and its capacity as well as optimal transmission strategies…
This paper investigates the limits of information transfer over a fast Rayleigh fading MIMO channel, where neither the transmitter nor the receiver has the knowledge of the channel state information (CSI) except the fading statistics. We develop a scalar channel model due to absence of the phase information in non-coherent Rayleigh fading and derive a capacity supremum with the number of receive antennas at any signal to noise ratio (SNR) using Lagrange optimisation. Also, we conceptualise the discrete nature of the optimal input distribution by posing the optimisation on the channel mutual in…
In this Paper, the effective capacity of a multiple-input multiple-output (MIMO) system in two different cases with receive antenna selection (RAS) and transmit antenna selection (TAS) schemes is investigated. A closed-form solution for the maximum constant arrival rate of this network with statistical delay quality of service (QoS) constraint is extracted in the quasi-static fading channel. This study is conducted in two different cases. When channel state information (CSI) is not available at the MIMO transmitter, implementation of TAS is difficult. Therefore, RAS scheme is employed and one …
Capacity bounds are studied for the multiple-antenna complex Gaussian relay channel with t1 transmitting antennas at the sender, r2 receiving and t2 transmitting antennas at the relay, and r3 receiving antennas at the receiver. It is shown that the partial decode-forward coding scheme achieves within min(t1,r2) bits from the cutset bound and at least one half of the cutset bound, establishing a good approximate expression of the capacity. A similar additive gap of min(t1 + t2, r3) + r2 bits is shown to be achieved by the compress-forward coding scheme.
This paper studies the capacity of the multi-antenna or multiple-input multiple-output (MIMO) secrecy channels with multiple eavesdroppers having single/multiple antennas. It is known that the MIMO secrecy capacity is achievable with the optimal transmit covariance matrix that maximizes the minimum difference between the channel mutual information of the secrecy user and those of the eavesdroppers. The MIMO secrecy capacity computation can thus be formulated as a non-convex max-min problem, which cannot be solved efficiently by standard convex optimization techniques. To handle this difficulty…
