Exact pairwise error probability analysis of space-time codes in spatially correlated fading channels, Journal of Telecommunications and Information Technology, 2006, nr 1

In this paper, we derive an analytical expression for the exact pairwise error probability (PEP) of a space-time coded system operating over a spatially correlated slow fading channel using a moment-generating function-based approach. This analytical PEP expression is more realistic than previously published exact-PEP expressions as it fully accounts for antenna spacing, antenna geometries (uniform linear array, uniform grid array, uniform circular array, etc.) and scattering models (uniform, Gaussian, Laplacian, Von-Mises, etc.). Inclusion of spatial information provides valuable insights into the physical factors determining the performance of a space-time code. We demonstrate the strength of our new analytical PEP expression by evaluating the performance of two space-time trellis codes proposed in the literature for different spatial scenarios

On the Performance of Multi-Antenna Techniques for Spatially and Temporally Correlated Wireless Channels

As the demand for advanced wireless services continues to grow, system designers must employ innovative signal processing techniques to increase data throughput and maintain reliablity under adverse channel conditions. Multi-antenna techniques, such as space-time coding and beamforming, have shown promise in realizing these goals. As these and other techniques are introduced, understanding their performance in realistic scattering environments is of paramount importance. This thesis contributes to the field of wireless communications by determining the performance of multi-antenna techniques for spatially and temporally correlated wireless channels. First, we propose a general space-time covariance model that is applicable to arbitrary scatterer geometry, arbitrary array geometry at the base station and the mobile, and includes Doppler effects due to mobile motion. We then apply this model, in conjunction with a two-dimensional Gaussian scatterer model based on recent field measurements, to evaluate the exact pairwise error probability for arbitrary space-time block codes and determine an upper bound on the probability of a block error. In addition, we derive exact closed-form expressions for the symbol error probability for orthogonal space-time block coding, maximum ratio transmission, and beamsteering for spatially correlated quasi-static wireless channels. Finally, we present extensive numerical results that illustrate the performance of these techniques for varying degrees of spatial and temporal correlation. We also provide a comparative performance assessment of beamforming and orthogonal space-time block coding and determine the channel conditions for which one technique is favored over the other

Performance of high rate space-time trellis coded modulation in fading channels.

Thesis (M.Sc.Eng.)-University of KwaZulu-Natal, Durban, 2005.Future wireless communication systems promise to offer a variety of multimedia services which require reliable transmission at high data rates over wireless links. Multiple input multiple output (MIMO) systems have received a great deal of attention because they provide very high data rates for such links. Theoretical studies have shown that the quality provided by MIMO systems can be increased by using space-time codes. Space-time codes combine both space (antenna) and time diversity in the transmitter to increase the efficiency of MIMO system. The three primary approaches, layered spacetime architecture, space-time trellis coding (STTC) and space-time block coding (STBC) represent a way to investigate transmitter-based signal processing for diversity exploitation and interference suppression. The advantages of STBC (i.e. low decoding complexity) and STTC (i.e. TCM encoder structure) can be used to design a high rate space-time trellis coded modulation (HR-STTCM). Most space-time codes designs are based on the assumption of perfect channel state information at the receiver so as to make coherent decoding possible. However, accurate channel estimation requires a long training sequence that lowers spectral efficiency. Part of this dissertation focuses on the performance of HR-STTCM under non-coherent detection where there is imperfect channel state information and also in environment where the channel experiences rapid fading. Prior work on space-time codes with particular reference to STBC systems in multiuser environment has not adequately addressed the performance of the decoupled user signalto-noise ratio. Part of this thesis enumerates from a signal-to-noise ratio point of view the performance of the STBC systems in multiuser environment and also the performance of the HR-STTCM in such environment. The bit/frame error performance of space-time codes in fading channels can be evaluated using different approaches. The Chemoff upper-bound combined with the pair state generalized transfer function bound approach or the modified state transition diagram transfer function bound approach has been widely used in literature. However, although readily detennined, this bound can be too loose over nonnal signal-to-noise ranges of interest. Other approaches, based on the exact calculation of the pairwise error probabilities, are often too cumbersome. A simple exact numerical technique, for calculating, within any desired degree of accuracy, of the pairwise error probability of the HR-STTCM scheme over Rayleigh fading channel is proposed in this dissertation

Space-Time Coding and Space-Time Channel Modelling for Wireless Communications

In this thesis we investigate the effects of the physical constraints such as antenna aperture size, antenna geometry and non-isotropic scattering distribution parameters (angle of arrival/departure and angular spread) on the performance of coherent and non-coherent space-time coded wireless communication systems. First, we derive analytical expressions for the exact pairwise error probability (PEP) and PEP upper-bound of coherent and non-coherent space-time coded systems operating over spatially correlated fading channels using a moment-generating function-based approach. These analytical expressions account for antenna spacing, antenna geometries and scattering distribution models. Using these new PEP expressions, the degree of the effect of antenna spacing, antenna geometry and angular spread is quantified on the diversity advantage (robustness) given by a space-time code. It is shown that the number of antennas that can be employed in a fixed antenna aperture without diminishing the diversity advantage of a space-time code is determined by the size of the antenna aperture, antenna geometry and the richness of the scattering environment. ¶ In realistic channel environments the performance of space-time coded multiple-input multiple output (MIMO) systems is significantly reduced due to non-ideal antenna placement and non-isotropic scattering. In this thesis, by exploiting the spatial dimension of a MIMO channel we introduce the novel use of linear spatial precoding (or power-loading) based on fixed and known parameters of MIMO channels to ameliorate the effects of non-ideal antenna placement on the performance of coherent and non-coherent space-time codes. ..

Space-time coding techniques with bit-interleaved coded modulations for MIMO block-fading channels

The space-time bit-interleaved coded modulation (ST-BICM) is an efficient technique to obtain high diversity and coding gain on a block-fading MIMO channel. Its maximum-likelihood (ML) performance is computed under ideal interleaving conditions, which enables a global optimization taking into account channel coding. Thanks to a diversity upperbound derived from the Singleton bound, an appropriate choice of the time dimension of the space-time coding is possible, which maximizes diversity while minimizing complexity. Based on the analysis, an optimized interleaver and a set of linear precoders, called dispersive nucleo algebraic (DNA) precoders are proposed. The proposed precoders have good performance with respect to the state of the art and exist for any number of transmit antennas and any time dimension. With turbo codes, they exhibit a frame error rate which does not increase with frame length.Comment: Submitted to IEEE Trans. on Information Theory, Submission: January 2006 - First review: June 200

Distributed Space-Time Coding Based on Adjustable Code Matrices for Cooperative MIMO Relaying Systems

An adaptive distributed space-time coding (DSTC) scheme is proposed for two-hop cooperative MIMO networks. Linear minimum mean square error (MMSE) receive filters and adjustable code matrices are considered subject to a power constraint with an amplify-and-forward (AF) cooperation strategy. In the proposed adaptive DSTC scheme, an adjustable code matrix obtained by a feedback channel is employed to transform the space-time coded matrix at the relay node. The effects of the limited feedback and the feedback errors are assessed. Linear MMSE expressions are devised to compute the parameters of the adjustable code matrix and the linear receive filters. Stochastic gradient (SG) and least-squares (LS) algorithms are also developed with reduced computational complexity. An upper bound on the pairwise error probability analysis is derived and indicates the advantage of employing the adjustable code matrices at the relay nodes. An alternative optimization algorithm for the adaptive DSTC scheme is also derived in order to eliminate the need for the feedback. The algorithm provides a fully distributed scheme for the adaptive DSTC at the relay node based on the minimization of the error probability. Simulation results show that the proposed algorithms obtain significant performance gains as compared to existing DSTC schemes.Comment: 6 figure

Adaptive Randomized Distributed Space-Time Coding in Cooperative MIMO Relay Systems

An adaptive randomized distributed space-time coding (DSTC) scheme and algorithms are proposed for two-hop cooperative MIMO networks. Linear minimum mean square error (MMSE) receivers and an amplify-and-forward (AF) cooperation strategy are considered. In the proposed DSTC scheme, a randomized matrix obtained by a feedback channel is employed to transform the space-time coded matrix at the relay node. Linear MMSE expressions are devised to compute the parameters of the adaptive randomized matrix and the linear receive filter. A stochastic gradient algorithm is also developed to compute the parameters of the adaptive randomized matrix with reduced computational complexity. We also derive the upper bound of the error probability of a cooperative MIMO system employing the randomized space-time coding scheme first. The simulation results show that the proposed algorithms obtain significant performance gains as compared to existing DSTC schemes.Comment: 4 figure