1,272 research outputs found
Bound-intersection detection for multiple-symbol differential unitary space-time modulation
This paper considers multiple-symbol differential detection (MSD) of differential unitary space-time modulation (DUSTM) over multiple-antenna systems. We derive a novel exact maximum-likelihood (ML) detector, called the bound-intersection detector (BID), using the extended Euclidean algorithm for single-symbol detection of diagonal constellations. While the ML search complexity is exponential in the number of transmit antennas and the data rate, our algorithm, particularly in high signal-to-noise ratio, achieves significant computational savings over the naive ML algorithm and the previous detector based on lattice reduction. We also develop four BID variants for MSD. The first two are ML and use branch-and-bound, the third one is suboptimal, which first uses BID to generate a candidate subset and then exhaustively searches over the reduced space, and the last one generalizes decision-feedback differential detection. Simulation results show that the BID and its MSD variants perform nearly ML, but do so with significantly reduced complexity
Representation theory for high-rate multiple-antenna code design
Multiple antennas can greatly increase the data rate and reliability of a wireless communication link in a fading environment, but the practical success of using multiple antennas depends crucially on our ability to design high-rate space-time constellations with low encoding and decoding complexity. It has been shown that full transmitter diversity, where the constellation is a set of unitary matrices whose differences have nonzero determinant, is a desirable property for good performance. We use the powerful theory of fixed-point-free groups and their representations to design high-rate constellations with full diversity. Furthermore, we thereby classify all full-diversity constellations that form a group, for all rates and numbers of transmitter antennas. The group structure makes the constellations especially suitable for differential modulation and low-complexity decoding algorithms. The classification also reveals that the number of different group structures with full diversity is very limited when the number of transmitter antennas is large and odd. We, therefore, also consider extensions of the constellation designs to nongroups. We conclude by showing that many of our designed constellations perform excellently on both simulated and real wireless channels
Generalized PSK in Space Time Coding
A wireless communication system using multiple antennas promises reliable
transmission under Rayleigh flat fading assumptions. Design criteria and
practical schemes have been presented for both coherent and non-coherent
communication channels. In this paper we generalize one dimensional phase shift
keying (PSK) signals and introduce space time constellations from generalized
phase shift keying (GPSK) signals based on the complex and real orthogonal
designs. The resulting space time constellations reallocate the energy for each
transmitting antenna and feature good diversity products, consequently their
performances are better than some of the existing comparable codes. Moreover
since the maximum likelihood (ML) decoding of our proposed codes can be
decomposed to one dimensional PSK signal demodulation, the ML decoding of our
codes can be implemented in a very efficient way.Comment: 22 pages, 3 figures, submitted to IEEE transactions on communicaton
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
Three-transmit-antenna space-time codes based on SU(3)
Fully diverse constellations, i.e., a set of unitary matrices whose pairwise differences are nonsingular, are useful in multiantenna communications especially in multiantenna 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 design methods of space-time codes which are appropriate for three-transmit-antenna differential modulation. The structures of the codes are motivated by the special unitary Lie group SU(3). One of the codes, which is called the AB code, has a fast maximum-likelihood (ML) decoding algorithm using complex sphere decoding. Diversity products of the codes can be easily calculated, and simulated performance shows that they are better than group-based codes, especially at high rates and as good as the elaborately designed nongroup code
A Numerical Approach for Designing Unitary Space Time Codes with Large Diversity
A numerical approach to design unitary constellation for any dimension and
any transmission rate under non-coherent Rayleigh flat fading channel.Comment: 32 pages, 6 figure
Unitary space-time modulation via Cayley transform
A prevoiusly proposed method for communicating with multiple antennas over block fading channels is unitary space-time modulation (USTM). In this method, the signals transmitted from the antennas, viewed as a matrix with spatial and temporal dimensions, form a unitary matrix, i.e., one with orthonormal columns. Since channel knowledge is not required at the receiver, USTM schemes are suitable for use on wireless links where channel tracking is undesirable or infeasible, either because of rapid changes in the channel characteristics or because of limited system resources. Previous results have shown that if suitably designed, USTM schemes can achieve full channel capacity at high SNR and, moreover, that all this can be done over a single coherence interval, provided the coherence interval and number of transmit antennas are sufficiently large, which is a phenomenon referred to as autocoding. While all this is well recognized, what is not clear is how to generate good performing constellations of (nonsquare) unitary matrices that lend themselves to efficient encoding/decoding. The schemes proposed so far either exhibit poor performance, especially at high rates, or have no efficient decoding algorithms. We propose to use the Cayley transform to design USTM constellations. This work can be viewed as a generalization, to the nonsquare case, of the Cayley codes that have been proposed for differential USTM. The codes are designed based on an information-theoretic criterion and lend themselves to polynomial-time (often cubic) near-maximum-likelihood decoding using a sphere decoding algorithm. Simulations suggest that the resulting codes allow for effective high-rate data transmission in multiantenna communication systems without knowing the channel. However, our preliminary results do not show a substantial advantage over training-based schemes
Unitary Space Time Constellation Analysis: An Upper Bound for the Diversity
The diversity product and the diversity sum are two very important parameters
for a good-performing unitary space time constellation. A basic question is
what the maximal diversity product (or sum) is. In this paper we are going to
derive general upper bounds on the diversity sum and the diversity product for
unitary constellations of any dimension and any size using packing
techniques on the compact Lie group U(n).Comment: 15 pages, 3 figures, submitted to IEEE trans. inf
- …