Noncoherent space-time coding: An algebraic perspective

The design of space-time signals for noncoherent block-fading channels where the channel state information is not known a priori at the transmitter and the receiver is considered. In particular, a new algebraic formulation for the diversity advantage design criterion is developed. The new criterion encompasses, as a special case, the well-known diversity advantage for unitary space-time signals and, more importantly, applies to arbitrary signaling schemes and arbitrary channel distributions. This criterion is used to establish the optimal diversity-versus-rate tradeoff for training based schemes in block-fading channels. Our results are then specialized to the class of affine space-time signals which allows for a low complexity decoder. Within this class, space-time constellations based on the threaded algebraic space-time (TAST) architecture are considered. These constellations achieve the optimal diversity-versus-rate tradeoff over noncoherent block-fading channels and outperform previously proposed codes in the considered scenarios as demonstrated by the numerical results. Using the analytical and numerical results developed in this paper, nonunitary space-time codes are argued to offer certain advantages in block-fading channels where the appropriate use of coherent space-time codes is shown to offer a very efficient solution to the noncoherent space-time communication paradigm.     

On the Distortion SNR Exponent of Some Layered Transmission Schemes

We consider the problem of joint source-channel coding for transmitting K samples of a complex Gaussian source overT bK uses of a block-fading multiple-input multiple-output (MIMO) channel with M transmit and N receive antennas. We consider the case when we are allowed to code over L blocks. The channel gain is assumed to be constant over a block and channel gains for different blocks are assumed to be independent. The performance measure of interest is the rate of decay of the expected mean-squared error with the signal-to-noise ratio (SNR), called the distortion SNR exponent. We first show that using a broadcast strategy similar to that of Gunduz and Erkip, but with a different power and rate allocation policy, the optimal distortion SNR exponent can be achieved for 0 les b les (|N - M| + 1)/ min(M,N) and for b > MNL₂. This is the first time the optimal exponent is characterized for 1/min(M, N) < b < (|N - M| + 1)/min(M, N). Then, we propose a digital layered transmission scheme that uses both time layering and superposition. The new scheme is at least as good as currently known schemes for the entire range of bandwidth expansion factors b, whereas at least for some M, N, and b, it is strictly better than the currently known schemes.     

Performance analysis of space-time block codes over keyhole Nakagami-m fading channels

In multiple-input-multiple-output (MIMO) fading environments, degenerate channel phenomena, called keyholes or pinholes, may exist under the realistic assumption that the spatial fading is uncorrelated at the transmitter and the receiver, but the channel has a rank-deficient transfer matrix. In this paper, we analyze the exact average symbol error rate (SER) of orthogonal space-time block codes (STBCs) with M-PSK and M-QAM constellations over Nakagami-m fading channels in the presence of the keyhole. We derive the moment generating function (MGF) of instantaneous signal-to-noise ratio (SNR) after space-time block decoding (signal combining) in such channels. Using a well-known MGF-based analysis approach, we express the average SER of the STBC in the form of single finite-range integrals whose integrand contains only the derived MGF. Numerical results show that the keyhole significantly degrades the SER performance of the STBC from idealistic behaviors in independent identically distributed MIMO channels.     

Capacity of AM-PSK on partially coherent fading channels

This paper presents numerical capacity curves for two discrete complex channels: (1) a slow-fading Rayleigh channel with discrete carrier tracking by a phase-locked loop (PLL), where the PLL SNR is proportional to the fading amplitude squared, and (2) a fast-fading Rician channel with carrier phase estimation for the line-of-sight path only. Both channel models assume independent fading of successively received symbols. Capacity calculations are performed for equiprobable signaling with 8-ary and 16-ary amplitude-modulated phase-shift-keyed (AM-PSK) constellations. On the Rayleigh channel, the AM-PSK constellations give gains between 2 and 9 dB over PSK, at SNRs between 5 and 40 dB. For the Rician channel, AM-PSK gives a capacity gain over PSK of up to 0.75 bit at high SNR     

Effect of keyholes on the symbol error rate of space-time block codes

In multiple-input multiple-output (MIMO) fading environments, degenerate channel phenomena, so-called keyholes or pinholes, may exist under realistic assumptions where a MIMO channel has uncorrelated spatial fading between antenna arrays but a rank-deficient transfer matrix. In this letter, we analyze the average symbol error rate (SER) of orthogonal space-time block codes (STBCs) with M-PSK and M-QAM constellations over keyhole channels.     

Throughput Analysis for Parallel ARQ over Correlated MIMO Channels

We treat the throughput analyses of parallel ARQ schemes over correlated MIMO channels with adaptive modulation and coding (AMC). To describe the packet transmission over multiple parallel logic channels, we extend the existing burst- error model for single channel to multiple parallel logic channels. Based on such a packet error model, we derive the throughput of different parallel ARQ protocols. Moreover, to describe the temporally correlated physical channel fading, we generalize the existing Markov model for single channel to multiple parallel channels for MIMO systems. Then we develop a method for calculating the packet-level model parameters from the parameters of the physical-layer model and the MIMO transceiver. Using the above hierarchical throughput analysis framework, we investigate the potential throughput gain or throughput loss of parallel ARQ over the conventional serial ARQ in MIMO systems. Our results reveal that as SNR increases, parallel ARQ can achieve higher throughput gain or less throughput loss compared to serial ARQ; parallel SW can achieve throughput gain in most of the MIMO scenarios but increasing the number of antennas does not always bring higher gain; parallel GBN with large number of antennas and independent buffers can achieve throughput gain; parallel SR incurs throughput loss.     

Cross-layer design based on RC-LDPC codes in MIMO channels with estimation errors

In this paper, we propose a cross-layer design framework combining adaptive modulation and coding (AMC) with hybrid automatic repeat request (HARQ) based on rate-compatible low-density parity-check codes (RC-LDPC) in multiple-input multiple-output (MIMO) fading channels with estimation errors. First, we propose a new puncturing pattern for RC-LDPC codes and demonstrate that the new puncturing pattern performs similar to the random puncturing but is easier to apply. Then, we apply RC-LDPC codes with the new puncturing pattern to the cross-layer design combing AMC with ARQ over MIMO fading channels and derive the expressions for the throughput of the system. The effect of channel estimation errors on the system throughput is also investigated. Numerical results show that the joint design of AMC and ARQ based on RC-LDPC codes can achieve considerable spectral efficiency gain.     

Joint Source and Channel Coding for MIMO Systems: Is it Better to be Robust or Quick?

A framework is developed for optimizing the tradeoff between diversity, multiplexing, and delay in multiple-input multiple-output (MIMO) systems to minimize end-to-end distortion. The goal is to find the optimal balance between the increased data rate provided by antenna multiplexing, the reduction in transmission errors provided by antenna diversity and automatic repeat request (ARQ), and the delay introduced by ARQ. First, closed-form analytical results are developed to minimize end-to-end distortion of a vector quantizer concatenated with a space-time MIMO channel code in the high SNR regime. The minimization determines the optimal point on the diversity-multiplexing tradeoff curve. For large but finite SNR this optimal point is found via convex optimization, which is illustrated with an example of a practical joint source-channel code design. It is then shown that for MIMO systems with ARQ retransmission, sources without a delay constraint have distortion minimized by maximizing the ARQ window size. This results in a new multiplexing-diversity tradeoff region enhanced by ARQ. However, under a source delay constraint the problem formulation changes to account for delay distortion associated with random message arrival and random ARQ completion times. In this case, the simplifications associated with a high SNR assumption break down, and a dynamic programming formulation is required to capture the channel diversity-multiplexing tradeoff as well as the random arrival and retransmission dynamics. Results based on this formulation show that a delay-sensitive system obtains significant performance gains by adapting its operating point on the diversity-multiplexing-delay region to system dynamics.     

Coded modulation in the block-fading channel: coding theorems and code construction

We consider coded modulation schemes for the block-fading channel. In the setting where a codeword spans a finite number N of fading degrees of freedom, we show that coded modulations of rate R bit per complex dimension, over a finite signal set /spl chi//spl sube//spl Copf/ of size 2/sup M/, achieve the optimal rate-diversity tradeoff given by the Singleton bound /spl delta/(N,M,R)=1+/spl lfloor/N(1-R/M)/spl rfloor/, for R/spl isin/(0,M/spl rfloor/. Furthermore, we show also that the popular bit-interleaved coded modulation achieves the same optimal rate-diversity tradeoff. We present a novel coded modulation construction based on blockwise concatenation that systematically yields Singleton-bound achieving turbo-like codes defined over an arbitrary signal set /spl chi//spl sub//spl Copf/. The proposed blockwise concatenation significantly outperforms conventional serial and parallel turbo codes in the block-fading channel. We analyze the ensemble average performance under maximum-likelihood (ML) decoding of the proposed codes by means of upper bounds and tight approximations. We show that, differently from the additive white Gaussian noise (AWGN) and fully interleaved fading cases, belief-propagation iterative decoding performs very close to ML on the block-fading channel for any signal-to-noise ratio (SNR) and even for relatively short block lengths. We also show that, at constant decoding complexity per information bit, the proposed codes perform close to the information outage probability for any block length, while standard block codes (e.g., obtained by trellis termination of convolutional codes) have a gap from outage that increases with the block length: this is a different and more subtle manifestation of the so-called "interleaving gain" of turbo codes.     

On the design of algebraic space-time codes for MIMO block-fading channels

The availability of multiple transmit antennas allows for two-dimensional channel codes that exploit the spatial transmit diversity. These codes were referred to as space-time codes by Tarokh et al. (see ibid., vol.44, p.744-765, Mar. 1998) Most prior works on space-time code design have considered quasi-static fading channels. We extend our earlier work on algebraic space-time coding to block-fading channels. First, we present baseband design criteria for space-time codes in multi-input multi-output (MIMO) block-fading channels that encompass as special cases the quasi-static and fast fading design rules. The diversity advantage baseband criterion is then translated into binary rank criteria for phase shift keying (PSK) modulated codes. Based on these binary criteria, we construct algebraic space-time codes that exploit the spatial and temporal diversity available in MIMO block-fading channels. We also introduce the notion of universal space-time codes as a generalization of the smart-greedy design rule. As a part of this work, we establish another result that is important in its own right: we generalize the full diversity space-time code constructions for quasi-static channels to allow for higher rate codes at the expense of minimal reductions in the diversity advantage. Finally, we present simulation results that demonstrate the excellent performance of the proposed codes.     

Spatial multiplexing with transmit antenna and constellation selection for correlated MIMO fading channels

We consider spatial multiplexing systems in correlated multiple-input multiple-output (MIMO) fading channels with equal power allocated to each transmit antenna. Under this constraint, the number and subset of transmit antennas together with the transmit symbol constellations are determined assuming knowledge of the channel correlation matrices. We first consider a fixed data rate system and vary the number of transmit antennas and constellation such that the minimum margin in the signal-to-noise ratio (SNR) is maximized for linear and Vertical Bell Laboratories Layered Space-Time (V-BLAST) receivers. We also derive transmit antenna and constellation selection criteria for a successive interference cancellation receiver (SCR) with a fixed detection order and a variable number of bits transmitted on each substream. Compared with a system using all available antennas, performance results show significant gains using a subset of transmit antennas, even for independent fading channels. Finally, we select a subset of transmit antennas to maximize data rate given a minimum SNR margin. A lower bound on the maximum outage data rate is derived. The maximum outage data rate of the SCR receiver is seen to be close to the outage channel capacity.     

Finite-SNR Diversity&#8211;Multiplexing Tradeoff for Correlated Rayleigh and Rician MIMO Channels

A nonasymptotic framework is presented to analyze the diversity-multiplexing tradeoff of a multiple-input-multiple-output (MIMO) wireless system at finite signal-to-noise ratios (SNRs). The target data rate at each SNR is proportional to the capacity of an additive white Gaussian noise (AWGN) channel with an array gain. The proportionality constant, which can be interpreted as a finite-SNR spatial multiplexing gain, dictates the sensitivity of the rate adaptation policy to SNR. The diversity gain as a function of SNR for a fixed multiplexing gain is defined by the negative slope of the outage probability versus SNR curve on a log-log scale. The finite-SNR diversity gain provides an estimate of the additional power required to decrease the outage probability by a target amount. For general MIMO systems, lower bounds on the outage probabilities in correlated Rayleigh fading and Rician fading are used to estimate the diversity gain as a function of multiplexing gain and SNR. In addition, exact diversity gain expressions are determined for orthogonal space-time block codes (OSTBC). Spatial correlation significantly lowers the achievable diversity gain at finite SNR when compared to high-SNR asymptotic values. The presence of line-of-sight (LOS) components in Rician fading yields diversity gains higher than high-SNR asymptotic values at some SNRs and multiplexing gains while resulting in diversity gains near zero for multiplexing gains larger than unity. Furthermore, as the multiplexing gain approaches zero, the normalized limiting diversity gain, which can be interpreted in terms of the wideband slope and the high-SNR slope of spectral efficiency, exhibits slow convergence with SNR to the high-SNR asymptotic value. This finite-SNR framework for the diversity-multiplexing tradeoff is useful in MIMO system design for realistic SNRs and propagation environments     

Optimal Constellations for the Low-SNR Noncoherent MIMO Block Rayleigh-Fading Channel

Reliable communication over the discrete-input/continuous-output noncoherent multiple-input multiple-output (MIMO) Rayleigh block-fading channel is considered when the signal-to-noise ratio (SNR) per degree of freedom is low. Two key problems are posed and solved to obtain the optimum discrete input. In both problems, the average and peak power per space–time slot of the input constellation are constrained. In the first one, the peak power to average power ratio (PPAPR) of the input constellation is held fixed, while in the second problem, the peak power is fixed independently of the average power. In the first PPAPR-constrained problem, the mutual information, which grows as $O({rm {SNR}}^{2})$, is maximized up to second order in SNR. In the second peak-constrained problem, where the mutual information behaves as $O({rm{SNR}})$, the structure of constellations that are optimal up to first order, or equivalently, that minimize energy per bit, are explicitly characterized. Furthermore, among constellations that are first-order optimal, those that maximize the mutual information up to second order, or equivalently, the wideband slope, are characterized. In both PPAPR-constrained and peak-constrained problems, the optimal constellations are obtained in closed form as solutions to nonconvex optimizations, and interestingly, they are found to be identical. Due to its special structure, the common solution is referred to as space–time orthogonal rank one modulation, or STORM. In both problems, it is seen that STORM provides a sharp characterization of the behavior of noncoherent MIMO capacity.      

On the Distortion SNR Exponent of Hybrid Digital–Analog Space–Time Coding

We consider the transmission of a real independent and identically distributed (i.i.d.) "analog" source over a quasi-static M-input N-output multiple-input multiple-output (MIMO) block-fading channel. The relevant performance criterion is end-to-end average quadratic distortion D versus channel signal-to-noise ratio (SNR), for given spectral efficiency eta, defined as the ratio of the source bandwidth over the channel bandwidth. In the limit of high SNR, we define the distortion SNR exponent a*(eta) as the largest a such that D esdot snr^-a, over all possible source-channel coding schemes of spectral efficiency eta. We find a simple upper bound on a*(eta), an achievable lower bound a_sep(eta) achievable by separated (tandem) source-channel coding, and a tighter lower bound a_hybrid(eta) achievable by new hybrid digital analog space-time coding schemes. As a corollary, we have that a*(eta) is completely determined for the scalar case M = N = 1 and for the "bandwidth compression" case eta ges 2 min{M, N}. Expiicit and simple construction of hybrid space-time codes achieving a_hybrid(eta) are also given.     

Capacity of memoryless channels and block-fading channels with designable cardinality-constrained channel state feedback

A coding theorem is proved for memoryless channels when the channel state feedback of finite cardinality can be designed. Channel state information is estimated at the receiver and a function of the estimated channel state is causally fed back to the transmitter. The feedback link is assumed to be noiseless with a finite feedback alphabet, or equivalently, finite feedback rate. It is shown that the capacity can be achieved with a memoryless deterministic feedback and with a memoryless device which select transmitted symbols from a codeword of expanded alphabet according to current feedback. To characterize the capacity, we investigate the optimization of transmission and channel state feedback strategies. The optimization is performed for both channel capacity and error exponents. We show that the design of the optimal feedback scheme is identical to the design of scalar quantizer with modified distortion measures. We illustrate the optimization using Rayleigh block-fading channels. It is shown that the optimal transmission strategy has a general form of temporal water-filling in important cases. Furthermore, while feedback enhances the forward channel capacity more effectively in low-signal-to noise ratio (SNR) region compared with that of high-SNR region, the enhancement in error exponent is significant in both high- and low-SNR regions. This indicates that significant gain due to finite-rate channel state feedback is expected in practical systems in both SNR regions.     

Embedded Rank Distance Codes for ISI Channels

Designs for transmit alphabet constrained space–time codes naturally lead to questions about the design of rank distance codes. Recently, diversity embedded multilevel space–time codes for flat-fading channels have been designed from sets of binary matrices with rank distance guarantees over the binary field by mapping them onto quadrature amplitude modulation (QAM) and phase-shift keying (PSK) constellations. In this paper, we demonstrate that diversity embedded space–time codes for fading intersymbol interference (ISI) channels can be designed with provable rank distance guarantees. As a corollary, we obtain an asymptotic characterization of the fixed transmit alphabet rate–diversity tradeoff for multiple antenna fading ISI channels. The key idea is to construct and analyze properties of binary matrices with a particular structure (Toeplitz structure) induced by ISI channels.      

平坦慢衰落信道下基于HOS的PSK调制盲信道估计

提出一种基于符号高阶统计量（HOS, high-order statistics）的MPSK调制信道衰落系数盲估计算法。针对平坦慢衰落信道模型,首先分析了MPSK调制符号高阶统计量特征,证明了MPSK调制符号的M次方符号的值是唯一的,而当1≤M′相似文献   

Gallager?s Exponent for MIMO Channels: A Reliability-Rate Tradeoff

In this paper, we derive Gallager's random coding error exponent for multiple-input multiple-output (MIMO) Rayleigh block-fading channels, assuming no channel-state information (CSI) at the transmitter and perfect CSI at the receiver. This measure gives insight into a fundamental tradeoff between the communication reliability and information rate of MIMO channels, enabling to determine the required codeword length to achieve a prescribed error probability at a given rate below the channel capacity. We quantify the effects of the number of antennas, channel coherence time, and spatial fading correlation on the MIMO exponent. In addition, the general formulae for the ergodic capacity and the cutoff rate in the presence of spatial correlation are deduced from the exponent expressions. These formulae are applicable to arbitrary structures of transmit and receive correlation, encompassing all the previously known results as special cases of our expressions.     

Gaussian codes and weighted nearest neighbor decoding in fading multiple-antenna channels

We investigate the fading multiple-antenna channel. The decoder is assumed to possess imperfect channel fading information. A modified nearest neighbor decoder with an innovative weighting factor is introduced and an expression for the generalized mutual information (GMI), the achievable rate, is obtained. We show that under certain conditions the achievable rate is equivalent to that of a fading multiple-antenna Gaussian channel where fading is known to the receiver and is equal to the channel estimation, and where noise is due to both the channel noise and the channel estimation error. We show that for our communication scheme, the minimum mean square error (MMSE) channel estimator is optimal in the sense that it achieves the highest value of GMI, and hence the highest communication rate. Additionally, a training based multiple-input multiple-output (MIMO) scheme in a block-fading channel is investigated and it is shown that the number of degrees of freedom depends on the signal-to-noise ratio (SNR).     

On the robustness of decision-feedback detection of DPSK and differential unitary space-time modulation in Rayleigh-fading channels

Decision-feedback differential detection (DFDD) of differential phase-shift keying (DPSK) and differential unitary space-time modulation (DUST) in Rayleigh-fading channels exhibits significant performance improvement over standard single-symbol maximum-likelihood detection. However, knowledge of channel fading correlation and signal-to-noise ratio (SNR) is required at the receiver to compute the feedback coefficients used in DFDD. In this letter, we investigate the robustness of the DFDD to imperfect knowledge of the feedback coefficients by modeling the mismatch between estimated feedback coefficients and ideal coefficients in terms of mismatch between the estimated values of fading correlation and SNR and the true values. Under the assumption of a block-fading channel when nondiagonal DUST constellations are used and a continuous fading channel otherwise, we derive exact and Chernoff bound expressions for pair-wise word-error probability and then use them to approximate the bit-error rate (BER), finding close agreement with simulation results. The relationships between BER performance and various system parameters, e.g., DFDD length and Doppler mismatch, are also explored. Furthermore, the existence of an error floor in the BER-vs-SNR curve is investigated for the infinite-length DFDD. For the special case of Jakes' fading model, it is shown that the error floor can be removed completely even when the Doppler spread is over-estimated.