Design of fully-diverse multi-antenna codes based on Sp(2)

Fully-diverse constellations, i.e., a set of unitary matrices whose pairwise differences are nonsingular, are useful in multi-antenna communications, especially in multi-antenna differential modulation, since they have good pairwise error properties. Recently, group theoretic ideas, especially fixed-point-free (FPF) groups, have been used to design fully-diverse constellations of unitary matrices. Here we construct four-transmit-antenna constellations appropriate for differential modulation based on the symplectic group Sp(2) These can be regarded as extensions of S.M. Alamouti's celebrated two-transmit-antenna orthogonal design which can be constructed from the group Sp(1) (see IEEE J. Sel. Area Commun., p.1451-8, 1998). We further show that the structure of the code lends itself to efficient maximum likelihood (ML) decoding via the sphere decoding algorithm. Finally, the performance of the code is compared with existing methods including Alamouti's scheme, Cayley differential unitary space-time codes and group based codes

Fully-diverse multi-antenna space-time codes based on Sp(2)

Fully-diverse constellations, i.e., a set of unitary matrices whose pairwise differences are nonsingular, are useful in multi-antenna communications, especially in multi-antenna differential modulation, since they have good pairwise error properties. Group theoretic ideas, especially fixed-point-free (FPF) groups, have been used to design fully-diverse constellations of unitary matrices. We construct four-transmit-antenna constellations appropriate for differential modulation based on the symplectic group Sp(2). These can be regarded as extensions of Alamouti's (1998) celebrated two-transmit-antenna orthogonal design which can be constructed from the group Sp(1). We further show that the structure of the code tends itself to efficient maximum likelihood (ML) decoding via the sphere decoding algorithm. Finally, the performance of the code is compared with existing methods including Alamouti's scheme, Cayley differential unitary space-time codes and group-based codes

Design of fully-diverse multi-antenna codes based on Sp(2)

Fully-diverse constellations, i.e., a set of unitary matrices whose pairwise differences are nonsingular, are useful in multi-antenna communications, especially in multi-antenna differential modulation, since they have good pairwise error properties. Recently, group theoretic ideas, especially fixed-point-free (FPF) groups, have been used to design fully-diverse constellations of unitary matrices. Here we construct four-transmit-antenna constellations appropriate for differential modulation based on the symplectic group Sp(2) These can be regarded as extensions of S.M. Alamouti's celebrated two-transmit-antenna orthogonal design which can be constructed from the group Sp(1) (see IEEE J. Sel. Area Commun., p.1451-8, 1998). We further show that the structure of the code lends itself to efficient maximum likelihood (ML) decoding via the sphere decoding algorithm. Finally, the performance of the code is compared with existing methods including Alamouti's scheme, Cayley differential unitary space-time codes and group based codes

Design of fully diverse multiple-antenna codes based on Sp(2)

Fully diverse constellations, i.e., sets of unitary matrices whose pairwise differences are nonsingular, are useful in multiple-antenna communications, especially in multiple-antenna differential modulation, since they have good pairwise error properties. Recently, group theoretic ideas, especially fixed-point-free (fpf) groups, have been used to design fully diverse constellations of unitary matrices. Here we construct four-transmit-antenna constellations appropriate for differential modulation based on the symplectic group Sp(2). They can be regarded as extensions of Alamouti's celebrated two-transmit-antenna orthogonal design which can be constructed from the group Sp(1). We further show that the structure of Sp(2) codes lends itself to efficient maximum-likelihood (ML) decoding via the sphere decoding algorithm. Finally, the performance of Sp(2) codes is compared with that of other existing codes including Alamouti's orthogonal design, a 4/spl times/4 complex orthogonal design, Cayley differential unitary space-time codes and group-based codes

Algebraic Cayley Differential Space–Time Codes

Cayley space-time codes have been proposed as a solution for coding over noncoherent differential multiple-input multiple-output (MIMO) channels. Based on the Cayley transform that maps the space of Hermitian matrices to the manifold of unitary matrices, Cayley codes are particularly suitable for high data rate, since they have an easy encoding and can be decoded using a sphere-decoder algorithm. However, at high rate, the problem of evaluating if a Cayley code is fully diverse may become intractable, and previous work has focused instead on maximizing a mutual information criterion. The drawback of this approach is that it requires heavy optimization which depends on the number of antennas and rate. In this work, we study Cayley codes in the context of division algebras, an algebraic tool that allows to get fully diverse codes. We present an algebraic construction of fully diverse Cayley codes, and show that this approach naturally yields, without further optimization, codes that perform similarly or closely to previous unitary differential codes, including previous Cayley codes, and codes built from Lie groups

Self-concatenated coding and multi-functional MIMO aided H.264 video telephony

Abstract— Robust video transmission using iteratively detected Self-Concatenated Coding (SCC), multi-dimensional Sphere Packing (SP) modulation and Layered Steered Space-Time Coding (LSSTC) is proposed for H.264 coded video transmission over correlated Rayleigh fading channels. The self-concatenated convolutional coding (SECCC) scheme is composed of a Recursive Systematic Convolutional (RSC) code and an interleaver, which is used to randomise the extrinsic information exchanged between the self-concatenated constituent RSC codes. Additionally, a puncturer is employed for improving the achievable bandwidth efficiency. The convergence behaviour of the MIMO transceiver advocated is investigated with the aid of Extrinsic Information Transfer (EXIT) charts. The proposed system exhibits an Eb /N0 gain of about 9 dB at the PSNR degradation point of 1 dB in comparison to the identical-rate benchmarker scheme

Wireless Cellular Networks

When aiming for achieving high spectral efficiency in wireless cellular networks, cochannel interference (CCI) becomes the dominant performancelimiting factor. This article provides a survey of CCI mitigation techniques, where both active and passive approaches are discussed in the context of both open- and closed-loop designs.More explicitly, we considered both the family of flexible frequency-reuse (FFR)-aided and dynamic channel allocation (DCA)-aided interference avoidance techniques as well as smart antenna-aided interference mitigation techniques, which may be classified as active approach

High-rate space-time codes motivated by SU(3)

Fully-diverse constellations, i.e., a set of unitary matrices whose pairwise differences are nonsingular, are useful in multi-antenna communications especially in multi-antenna differential modulation, since they have good pairwise error properties. Recently,group theoretic ideas, especially fixed-point-free (fpf) groups, have been used to design fully-diverse constellations of unitary matrices. Here we give systematic methods to design space-time codes which are appropriate for three-transmit- antenna differential modulation. The structures of the codes are motivated by the Lie group SU(3). One of the codes, called the AB code, has a fast decoding algorithm using the complex sphere decoder. The diversity products of the codes can be easily calculated and simulated performances show that the codes are better than the group-based codes [1] especially at high rates and as good as the elaborately-designed non-group codes[1]

Fully-diverse Sp(2) code design

A fully-diverse code that is suitable for differential modulation for four-transmit-antenna communication systems is constructed based on the symplectic group Sp(2). The code can be regarded as an extension of Alamouti’s celebrated two-transmit-antenna orthogonal design which can be constructed from the group Sp(1). The structure of the code lends itself to efficient ML decoding via the sphere decoding algorithm