In this paper, we consider a particular class of selective fading channel corresponding to a channel that is selective either in time or in frequency. For this class of channel, we propose a systematic way to achieve the optimal DMT derived in Coronel and Bölcskei, IEEE ISIT, 2007 by extending the non-vanishing determinant (NVD) criterion to the selective channel case. A new code construction based on split NVD parallel codes is then proposed to satisfy the NVD parallel criterion. This result is of significant interest not only in its own right, but also because it settles a long-standing debate in the literature related to the optimal DMT of selective fading channels.
In this paper we investigate the criteria proposed by Coronel et al. for constructing MIMO MAC-DMT optimal codes over several classes of fading channels. We first give a counterexample showing their DMT result is not correct when the channel is frequency-selective. For the case of symmetric MIMO-MAC flat fading channels, their DMT result reduces to exactly the same as that derived by Tse et al., and we therefore focus on their criteria for constructing MAC-DMT optimal codes, especially when the number of receive antennas is sufficiently large. In such case, we show their criterion is equivalen…
We analyze two-user single-antenna fading interference channels with perfect receive channel state information (CSI) and no transmit CSI. We compute the diversity-multiplexing tradeoff (DMT) region of a fixed-power-split Han and Kobayashi (HK)-type superposition coding scheme and provide design criteria for the corresponding superposition codes. We demonstrate that this scheme is DMT-optimal under moderate, strong, and very strong interference by showing that it achieves a DMT outer bound that we derive. Further, under very strong interference, we show that a joint decoder is DMT-optimal and "…
The diversity-multiplexing tradeoff (DMT) provides a fundamental performance metric for different multiple-input multiple-output (MIMO) schemes in wireless communications. In this paper, we explore the block fading optical wireless communication (OWC) channels and characterize the DMT in the presence of both optical peak- and average-power constraints. Three different fading distributions are considered, which reflect different channel conditions. In each channel condition, we obtain the optimal DMT when the block length is sufficiently large, and we also derive the lower and upper bounds of t…
For any $n_t$ transmit, $n_r$ receive antenna ($n_t\times n_r$) MIMO system in a quasi-static Rayleigh fading environment, it was shown by Elia et al. that linear space-time block code-schemes (LSTBC-schemes) which have the non-vanishing determinant (NVD) property are diversity-multiplexing gain tradeoff (DMT)-optimal for arbitrary values of $n_r$ if they have a code-rate of $n_t$ complex dimensions per channel use. However, for asymmetric MIMO systems (where $n_r < n_t$), with the exception of a few LSTBC-schemes, it is unknown whether general LSTBC-schemes with NVD and a code-rate of $n_r$ c…
We consider the sequential transmission of a stream of messages over a block-fading multi-input-multi-output (MIMO) channel. A new message arrives at the beginning of each coherence block, and the decoder is required to output each message sequentially, after a delay of $T$ coherence blocks. In the special case when $T=1$, the setup reduces to the quasi-static fading channel. We establish the optimal diversity-multiplexing tradeoff (DMT) in the high signal-to-noise-ratio (SNR) regime, and show that it equals $T$ times the DMT of the quasi-static channel. The converse is based on utilizing the …
A multi-hop relay channel with multiple antenna terminals in a quasi-static slow fading environment is considered. For both full-duplex and half-duplex relays the fundamental diversity-multiplexing tradeoff (DMT) is analyzed. It is shown that, while decode-and-forward (DF) relaying achieves the optimal DMT in the full-duplex relay scenario, the dynamic decode-and-forward (DDF) protocol is needed to achieve the optimal DMT if the relay is constrained to half-duplex operation. For the latter case, static protocols are considered as well, and the corresponding achievable DMT performance is charac…
In this work, we investigate the diversity-multiplexing tradeoff (DMT) of the multiple-antenna (MIMO) static half-duplex relay channel. A general expression is derived for the DMT upper bound, which can be achieved by a compress-and-forward protocol at the relay, under certain assumptions. The DMT expression is given as the solution of a minimization problem in general, and an explicit expression is found when the relay channel is symmetric in terms of number of antennas, i.e. the source and the destination have n antennas each, and the relay has m antennas. It is observed that the static half…
This paper investigates the Diversity Multiplexing Tradeoff (DMT) of the generalized quantize-and-forward (GQF) relaying scheme over the slow fading half-duplex multiple-access relay channel (HD-MARC). The compress-and-forward (CF) scheme has been shown to achieve the optimal DMT when the channel state information (CSI) of the relay-destination link is available at the relay. However, having the CSI of relay-destination link at relay is not always possible due to the practical considerations of the wireless system. In contrast, in this work, the DMT of the GQF scheme is derived without relay-d…
The work identifies the first general, explicit, and non-random MIMO encoder-decoder structures that guarantee optimality with respect to the diversity-multiplexing tradeoff (DMT), without employing a computationally expensive maximum-likelihood (ML) receiver. Specifically, the work establishes the DMT optimality of a class of regularized lattice decoders, and more importantly the DMT optimality of their lattice-reduction (LR)-aided linear counterparts. The results hold for all channel statistics, for all channel dimensions, and most interestingly, irrespective of the particular lattice-code a…
Diversity-multiplexing tradeoff (DMT) was characterized asymptotically (SNR-> infinity) for i.i.d. Rayleigh fading channel by Zheng and Tse [1]. The SNR-asymptotic DMT overestimates the finite-SNR one [2]. This paper outlines a number of additional limitations and difficulties of the DMT framework and discusses their implications. Using the recent results on the size-asymptotic (in the number of antennas) outage capacity distribution, the finite-SNR, size-asymptotic DMT is derived for a broad class of fading distributions. The SNR range over which the finite-SNR DMT is accurately approximated …
It is well known that the presence of double scattering degrades the performance of a MIMO channel, in terms of both the multiplexing gain and the diversity gain. In this paper, a closed-form expression of the diversity-multiplexing tradeoff (DMT) of double scattering MIMO channels is obtained. It is shown that, for a channel with nT transmit antennas, nR receive antennas and nS scatterers, the DMT only depends on the ordered version of the triple (nT,nS,nR), for arbitrary nT, nS and nR. The condition under which the double scattering channel has the same DMT as the single scattering channel i…
Diversity-Multiplexing tradeoff (DMT) is a coarse high SNR approximation of the fundamental tradeoff between data rate and reliability in a slow fading channel. In this paper, we characterize the fundamental DMT of the two user single antenna Gaussian interference channel. We show that the class of multilevel superposition coding schemes universally achieves (for all fading statistics) the DMT for the two-user interference channel. For the special case of symmetric DMT, when the two users have identical rate and diversity gain requirements, we characterize the DMT achieved by the Han-Kobayashi…
This paper investigates the diversity order of the minimum mean squared error (MMSE) based optimal transceivers in multiple-input multiple-output (MIMO) amplify-and-forward (AF) relaying systems. While the diversity-multiplexing tradeoff (DMT) analysis accurately predicts the behavior of the MMSE receiver for the positive multiplexing gain, it turned out that the performance is very unpredictable via DMT for the case of fixed rates, because MMSE strategies exhibit a complicated rate dependent behavior. In this paper, we establish the diversity-rate tradeoff performance of MIMO AF relaying syst…
In this paper, the asymptotic performance of the lattice sequential decoder for LAttice Space-Time (LAST) coded MIMO channel is analyzed. We determine the rates achievable by lattice coding and sequential decoding applied to such a channel. The diversity-multiplexing tradeoff (DMT) under lattice sequential decoding is derived as a function of its parameter---the bias term, which is critical for controlling the amount of computations required at the decoding stage. Achieving low decoding complexity requires increasing the value of the bias term. However, this is done at the expense of losing th…
The fundamental diversity-multiplexing tradeoff (DMT) of the quasi-static fading, symmetric $2$-user MIMO interference channel (IC) with channel state information at the transmitters (CSIT) and a short term average power constraint is obtained. The general case is considered where the interference-to-noise ratio (INR) at each receiver scales differently from the signal-to-noise ratio (SNR) at the receivers. The achievability of the DMT is proved by showing that a simple Han-Kobayashi coding scheme can achieve a rate region which is within a constant (independent of SNR) number of bits from a s…
Linear transceiving schemes between the relay and the destination have recently attracted much interest in MIMO amplify-and-forward (AF) relaying systems due to low implementation complexity. In this paper, we provide comprehensive analysis on the diversity order of the linear zero-forcing (ZF) and minimum mean squared error (MMSE) transceivers. Firstly, we obtain a compact closed-form expression for the diversity-multiplexing tradeoff (DMT) through tight upper and lower bounds. While our DMT analysis accurately predicts the performance of the ZF transceivers, it is observed that the MMSE tran…
Diversity-multiplexing tradeoff (DMT) presents a compact framework to compare various MIMO systems and channels in terms of the two main advantages they provide (i.e. high data rate and/or low error rate). This tradeoff was characterized asymptotically (SNR-> infinity) for i.i.d. Rayleigh fading channel by Zheng and Tse [1]. The asymptotic DMT overestimates the finite-SNR one [2]. In this paper, using the recent results on the asymptotic (in the number of antennas) outage capacity distribution, we derive and analyze the finite-SNR DMT for a broad class of channels (not necessarily Rayleigh fad…
A multi-hop two-way relay channel is considered in which all the terminals are equipped with multiple antennas. Assuming independent quasi-static Rayleigh fading channels and channel state information available at the receivers, we characterize the optimal diversity-multiplexing gain tradeoff (DMT) curve for a full-duplex relay terminal. It is shown that the optimal DMT can be achieved by a compress-and-forward type relaying strategy in which the relay quantizes its received signal and transmits the corresponding channel codeword. It is noteworthy that, with this transmission protocol, the two…
Intelligent reflecting surfaces (IRSs) are promising enablers for high-capacity wireless communication systems by constructing favorable channels between the transmitter and receiver. However, general, accurate, and tractable outage analysis for IRS-aided multiple-input-multiple-output (MIMO) systems is not available in the literature. In this paper, we first characterize the mutual information (MI) of IRS-aided MIMO systems by capitalizing on large random matrix theory (RMT). Based on this result, a closed-form approximation for the outage probability is derived and a gradient-based algorithm…
We consider a multi-input multi-output (MIMO) block-fading channel with a general model for channel state information at the transmitter (CSIT). The model covers systems with causal CSIT, where only CSIT of past fading blocks is available, and predictive CSIT, where CSIT of some future fading blocks is available. The optimal diversity-multiplexing tradeoff (DMT) and rate-diversity tradeoff (RDT) of the channel are studied under long-term power constraints. The impact of imperfect (mismatched) CSIT on the optimal DMT and RDT is also investigated. Our results show the outage diversity gain obtai…
We study the diversity-multiplexing tradeoff (DMT) for the slow fading interference channel with a relay (ICR). We derive four inner bounds on the DMT region: the first is based on the compress-and-forward (CF) relaying scheme, the second is based on the decode-and-forward (DF) relaying scheme, and the last two bounds are based on the half-duplex (HD) and full-duplex (FD) amplify-and-forward (AF) schemes. For the CF and DF schemes, we find conditions on the channel parameters and the multiplexing gains, under which the corresponding inner bound achieves the optimal DMT region. We also identify…
In this work, a new static relaying protocol is introduced for half duplex single-relay networks, and its performance is studied in the context of communications over slow fading wireless channels. The proposed protocol is based on a Decode or Quantize and Forward (DoQF) approach. In slow fading scenarios, two performance metrics are relevant and complementary, namely the outage probability gain and the Diversity-Multiplexing Tradeoff (DMT). First, we analyze the behavior of the outage probability P_o associated with the proposed protocol as the SNR tends to infinity. In this case, we prove th…
Currently for the nt x nr MIMO channel, any explicitly constructed space-time (ST) designs that achieve optimality with respect to the diversity multiplexing tradeoff (DMT) are known to do so only when decoded using maximum likelihood (ML) decoding, which may incur prohibitive decoding complexity. In this paper we prove that MMSE regularized lattice decoding, as well as the computationally efficient lattice reduction (LR) aided MMSE decoder, allows for efficient and DMT optimal decoding of any approximately universal lattice-based code. The result identifies for the first time an explicitly co…
In this paper the performance limits and design principles of rateless codes over fading channels are studied. The diversity-multiplexing tradeoff (DMT) is used to analyze the system performance for all possible transmission rates. It is revealed from the analysis that the design of such rateless codes follows the design principle of approximately universal codes for parallel multiple-input multiple-output (MIMO) channels, in which each sub-channel is a MIMO channel. More specifically, it is shown that for a single-input single-output (SISO) channel, the previously developed permutation codes …
Fading MIMO relay channels are studied analytically, when the source and destination are equipped with multiple antennas and the relays have a single one. Compact closed-form expressions are obtained for the outage probability under i.i.d. and correlated Rayleigh-fading links. Low-outage approximations are derived, which reveal a number of insights, including the impact of correlation, of the number of antennas, of relay noise and of relaying protocol. The effect of correlation is shown to be negligible, unless the channel becomes almost fully correlated. The SNR loss of relay fading channels …
In this two-part paper, we consider the multiantenna multihop relay channels in which the source signal arrives at the destination through N independent relaying hops in series. The main concern of this work is to design relaying strategies that utilize efficiently the relays in such a way that the diversity is maximized. In part I, we focus on the amplify-and-forward (AF) strategy with which the relays simply scale the received signal and retransmit it. More specifically, we characterize the diversity-multiplexing tradeoff (DMT) of the AF scheme in a general multihop channel with arbitrary nu…
In a broadcast channel with random packet arrival and transmission queues, the stability of the system is achieved by maximizing a weighted sum rate capacity with suitable weights that depend on the queue size. The weighted sum rate capacity using Dirty Paper Coding (DPC) and Zero Forcing (ZF) is asymptotically equivalent to the weighted sum capacity over parallel single-channels. In this paper, we study the Diversity Multiplexing Tradeoff (DMT) of the fading broadcast channel under a fixed weighted sum rate capacity constraint. The DMT of both identical and different parallel weighted MISO ch…
In this paper, we analyze the fundamental tradeoff of diversity and multiplexing in multi-input multi-output (MIMO) channels with imperfect channel state information at the transmitter (CSIT). We show that with imperfect CSIT, a higher diversity gain as well as a more efficient diversity-multiplexing tradeoff (DMT) can be achieved. In the case of multi-input single-output (MISO)/single-input multi-output (SIMO) channels with K transmit/receive antennas, one can achieve a diversity gain of d(r)=K(1-r+Kα) at spatial multiplexing gain r, where αis the CSIT quality defined in this paper. For gener…
We consider interference alignment (IA) over K-user Gaussian MIMO interference channel (MIMO-IC) when the SNR is not asymptotically high. We introduce a generalization of IA which enables receive diversity inside the interference-free subspace. We generalize the existence criterion of an IA solution proposed by Yetis et al. to this case, thereby establishing a multi-user diversity-multiplexing trade-off (DMT) for the interference channel. Furthermore, we derive a closed-form tight lower-bound for the ergodic mutual information achievable using IA over a Gaussian MIMO-IC with Gaussian i.i.d. ch…
In this paper, the ergodic sum-rate and outage probability of a downlink single-antenna channel with K users are analyzed in the presence of Rayleigh flat fading, where limited channel state information (CSI) feedback is assumed. Specifically, only 1-bit feedback per fading block per user is available at the base station. We first study the ergodic sum-rate of the 1-bit feedback scheme, and consider the impact of feedback delay on the system. A closed-form expression for the achievable ergodic sum-rate is presented as a function of the fading temporal correlation coefficient. It is proved that…
The Dynamic Decode-and-Forward (DDF) protocol and the Hybrid DDF and Amplified-and-Forward (HDAF) protocol for the multiple-access relay channel (MARC) with quasi static fading are evaluated using the Zheng-Tse diversity-multiplexing tradeoff (DMT). We assume that there are two users, one half-duplex relay, and a common destination, each equipped with single antenna. For the Rayleigh fading, the DDF protocol is well known and has been analyzed in terms of the DMT with infinite block length. By carefully dealing with properties specific to finite block length, we characterize the finite block l…
In this correspondence, we analyze the ergodic capacity of a large uplink multi-user multiple-input multiple-output (MU-MIMO) system over generalized-$K$ fading channels. In the considered scenario, multiple users transmit their information to a base station equipped with a very large number of antennas. Since the effect of fast fading asymptotically disappears in massive MIMO systems, large-scale fading becomes the most dominant factor for the ergodic capacity of massive MIMO systems. Regarding this fact, in our work we concentrate our attention on the effects of large-scale fading for massiv…
In this contribution, the evaluation of the diversity of the MIMO MMSE receiver is addressed for finite rates in both flat fading channels and frequency selective fading channels with cyclic prefix. It has been observed recently that in contrast with the other MIMO receivers, the MMSE receiver has a diversity depending on the aimed finite rate, and that for sufficiently low rates the MMSE receiver reaches the full diversity - that is, the diversity of the ML receiver. This behavior has so far only been partially explained. The purpose of this paper is to provide complete proofs for flat fading…
Orthogonal time frequency space (OTFS) modulation is a recently introduced multiplexing technique designed in the 2-dimensional (2D) delay-Doppler domain suited for high-Doppler fading channels. OTFS converts a doubly-dispersive channel into an almost non-fading channel in the delay-Doppler domain through a series of 2D transformations. In this paper, we focus on MIMO-OTFS which brings in the high spectral and energy efficiency benefits of MIMO and the robustness of OTFS in high-Doppler fading channels. The OTFS channel-symbol coupling and the sparse delay-Doppler channel impulse response enab…
We establish the optimal diversity-multiplexing (DM) tradeoff of coherent time, frequency and time-frequency selective-fading MIMO channels and provide a code design criterion for DM-tradeoff optimality. Our results are based on the analysis of the "Jensen channel" associated to a given selective-fading MIMO channel. While the original problem seems analytically intractable due to the mutual information being a sum of correlated random variables, the Jensen channel is equivalent to the original channel in the sense of the DM-tradeoff and lends itself nicely to analytical treatment. Finally, as…
Linear receivers are an attractive low-complexity alternative to optimal processing for multi-antenna MIMO communications. In this paper we characterize the information-theoretic performance of MIMO linear receivers in two different asymptotic regimes. For fixed number of antennas, we investigate the limit of error probability in the high-SNR regime in terms of the Diversity-Multiplexing Tradeoff (DMT). Following this, we characterize the error probability for fixed SNR in the regime of large (but finite) number of antennas. As far as the DMT is concerned, we report a negative result: we show …
We analyze two-user single-antenna fading interference channels with perfect receive channel state information (CSI) and no transmit CSI. For the case of very strong interference, we prove that decoding interference while treating the intended signal as noise, subtracting the result out, and then decoding the desired signal, a process known as "stripping", achieves the diversity-multiplexing tradeoff (DMT) outer bound derived in Akuiyibo and Leveque, Int. Zurich Seminar on Commun., 2008. The proof is constructive in the sense that it provides corresponding code design criteria for DMT optimali…
The Golden space-time trellis coded modulation (GST-TCM) scheme was proposed in \cite{Hong06} for a high rate $2\times 2$ multiple-input multiple-output (MIMO) system over slow fading channels. In this letter, we present the performance analysis of GST-TCM over block fading channels, where the channel matrix is constant over a fraction of the codeword length and varies from one fraction to another, independently. In practice, it is not useful to design such codes for specific block fading channel parameters and a robust solution is preferable. We then show both analytically and by simulation t…
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…
We propose iterative detection and decoding (IDD) algorithms with Low-Density Parity-Check (LDPC) codes for Multiple Input Multiple Output (MIMO) systems operating in block-fading and fast Rayleigh fading channels. Soft-input soft-output minimum mean-square error receivers with successive interference cancellation are considered. In particular, we devise a novel strategy to improve the bit error rate (BER) performance of IDD schemes, which takes into account the soft \textit{a posteriori} output of the decoder in a block-fading channel when Root-Check LDPC codes are used. A MIMO IDD receiver w…
We propose an Iterative Detection and Decoding (IDD) scheme with Low Density Parity Check (LDPC) codes for Multiple Input Multiple Output (MIMO) systems for block-fading $F = 2$ and fast fading Rayleigh channels. An IDD receiver with soft information processing that exploits the code structure and the behaviour of the log likelihood ratios (LLR)'s is developed. Minimum Mean Square Error (MMSE) with Successive Interference Cancellation (SIC) and with Parallel Interference Cancellation (PIC) schemes are considered. The soft \textit{a posteriori} output of the decoder in a block-fading channel wi…
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.
We describe the structure of optimal Input covariance matrices for single user multiple-input/multiple-output (MIMO) communication system with covariance feedback and for general correlated fading. Our approach is based on the novel concept of right commutant and recovers previously derived results for the Kronecker product models. Conditions are derived which allow a significant simplification of the optimization problem.
We studynthe high-SNR capacity of generic MIMO Rayleigh block-fading channels in the noncoherent setting where neither transmitter nor receiver has a priori channel state information but both are aware of the channel statistics. In contrast to the well-established constant block-fading model, we allow the fading to vary within each block with a temporal correlation that is "generic" (in the sense used in the interference-alignment literature). We show that the number of degrees of freedom of a generic MIMO Rayleigh block-fading channel with $T$ transmit antennas and block length $N$ is given b…
This paper addresses point-to-point communication over block-fading channels with independent fading blocks. When both channel state information at the transmitter (CSIT) and receiver (CSIR) are available, most achievable schemes use separable coding, i.e., coding independently and in parallel over different fading states. Unfortunately, separable coding has drawbacks including large memory requirements at both communication ends. In this paper a lattice coding and decoding scheme is proposed that achieves the ergodic capacity without separable coding, with lattice codebooks and decoding decis…
In this paper the fading multiple antenna (MIMO) wire-tap channel is investigated under short term power constraints. The secret diversity gain and the secret multiplexing gain are defined. Using these definitions, the secret diversitymultiplexing tradeoff (DMT) is calculated analytically for no transmitter side channel state information (CSI) and for full CSI. When there is no CSI at the transmitter, under the assumption of Gaussian codebooks, it is shown that the eavesdropper steals both transmitter and receiver antennas, and the secret DMT depends on the remaining degrees of freedom. When C…
In this work the optimal diversity-multiplexing tradeoff (DMT) is investigated for the multiple-input multiple-output fading multiple-access channels with no power constraints (infinite constellations). For K users (K>1), M transmit antennas for each user, and N receive antennas, infinite constellations in general and lattices in particular are shown to attain the optimal DMT of finite constellations for the case N equals or greater than (K+1)M-1, i.e., user limited regime. On the other hand for N<(K+1)M-1 it is shown that infinite constellations can not attain the optimal DMT. This is in cont…
A fading broadcast channel is considered where the transmitter employs two antennas and each of the two receivers employs a single receive antenna. It is demonstrated that even if the realization of the fading is precisely known to the receivers, the high signal-to-noise (SNR) throughput is greatly reduced if, rather than knowing the fading realization \emph{precisely}, the trasmitter only knows the fading realization \emph{approximately}. The results are general and are not limited to memoryless Gaussian fading.
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, …
In this paper, we consider an automatic-repeat-request (ARQ) retransmission protocol signaling over a block-fading multiple-input, multiple-output (MIMO) channel. Unlike previous work, we allow for multiple fading blocks within each transmission (ARQ round), and we constrain the transmitter to fixed rate codes constructed over complex signal constellations. In particular, we examine the general case of average input-power-constrained constellations as well as the practically important case of finite discrete constellations. This scenario is a suitable model for practical wireless communication…
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.
This paper presents a novel unified performance analysis of Space-Time Block Codes (STBCs) operating in the Multiple Input Multiple Output (MIMO) network and subjected to generalized shadowed fading and noise scenarios. Specifically, we derive novel, simple and accurate average bit error rates (ABER) expressions for coherent modulation schemes in the generalized η-μ and shadowed κ-μ fading channels. The noise in the network is assumed to be modeled by the additive white generalized Gaussian noise (AWGGN), which encompasses the Laplacian and the Gaussian noise environments as special cases. The…
We establish the optimal diversity-multiplexing (DM) tradeoff of coherent time, frequency, and time-frequency selective-fading multiple-input multiple-output (MIMO) channels and provide a code design criterion for DM tradeoff optimality. Our results are based on the new concept of the "Jensen channel" associated to a given selective-fading MIMO channel. While the original problem seems analytically intractable due to the mutual information between channel input and output being a sum of correlated random variables, the Jensen channel is equivalent to the original channel in the sense of the DM…
The high-SNR capacity of the noncoherent MIMO channel has been derived for the case of independent and identically distributed (IID) Rayleigh block fading by exploiting the Gaussianity of the channel matrix. This implies the optimal degrees of freedom (DoF), i.e., the capacity pre-log factor. Nevertheless, as far as the optimal DoF is concerned, IID Rayleigh fading is apparently a sufficient but not necessary condition. In this paper, we show that the optimal DoF for the IID Rayleigh block fading channel is also the optimal DoF for a more general class of generic block fading channels, in whic…
Secret sharing over the fast-fading MIMO wiretap channel is considered. A source and a destination try to share secret information over a fast-fading MIMO channel in the presence of a wiretapper who also makes channel observations that are different from but correlated to those made by the destination. An interactive authenticated unrestricted public channel is also available for use by the source and destination in the secret sharing process. This falls under the "channel-type model with wiretapper" considered by Ahlswede and Csiszar. A minor extension of their result (to continuous channel a…
The analytic expression of CRLB and the maximum likelihood estimator for spatial correlation matrices in time-varying multipath fading channels for MIMO OFDM systems are reported in this paper. The analytical and numerical results reveal that the amount of samples and the order of frequency selectivity have dominant impact on the CRLB. Moreover, the number of pilot tones, SNR as well as the normalized maximum Doppler spread together influence the effective order of frequency selectivity.
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.
We present novel exact expressions and accurate closed-form approximations for the level crossing rate (LCR) and the average fade duration (AFD) of the double Nakagami-m random process. These results are then used to study the second order statistics of multiple input multiple output (MIMO) keyhole fading channels with space-time block coding. Numerical and computer simulation examples validate the accuracy of the presented mathematical analysis and show the tightness of the proposed approximations.
We consider cooperative relay communication in a fading channel environment under the Orthogonal Amplify and Forward (OAF) and Orthogonal and Non-Orthogonal Selection Decode and Forward (OSDF and NSDF) protocols. For all these protocols, we compute the Diversity-Multiplexing Gain Tradeoff (DMT). We construct DMT optimal codes for the protocols which are sphere decodable and, in certain cases, incur minimum possible delay. Our results establish that the DMT of the OAF protocol is identical to the DMT of the Non-Orthogonal Amplify and Forward (NAF) protocol. Two variants of the NSDF protocol are…
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…
