In this paper, we present a new design of constructing full diversity unitary constellations using differential space-time modulation for any number of transmitter and receiver antennas. These constellations are constructed from a Bruhat decomposition which allows us to choose disjoint nonoverlapping cosets of a unitary diagonal subgroup in such a way that… (More)
— This paper proposes new unitary space-time constellation designs with high diversity products for any number of antennas and any rate based on Slepian's group codes. Many of our Hamiltonian and product constellations have the best known diversity products in the literature, and outperform all other constellation designs.
— Full diversity signal constellations for any numbers of transmitter antennas and for any orders which are constructed from 2 × 2 Hamiltonian matrices are investigated in this paper. The diversity product of a 2 × 2 Hamiltonian constellation equals one half of the Euclidean distance between two points in C 2. By considering the transformation from R 4 to C… (More)
Space-time coding was developed for use in multiple-antenna wireless communications to achieve high data rate and low error probability. The design of a full diversity space-time code with high coding gain and simple encoding-decoding algorithm poses a particularly challenging problem. In this paper, we present new full diversity unitary constellations,… (More)
This paper presents a design for full diversity unitary space-time constellations for two transmitter antennas. Our proposed constellations are based on finite reflection group codes. They have excellent diversity products compared to several unitary constellation designs in the literature.
In this paper, we propose new full diversity unitary space-time codes based on Hamiltonian constellation designs. Our proposed constellations can be used for any number of antennas and for any data rate. For two transmitter antennas, the constellations are constructed from cyclic group codes. For a larger number of transmitter antennas, the design employs… (More)
We present a closed form upper bound for the average pairwise error probabilities (PEP) of space-time codes for a keyhole channel. It is derived from the exact conditional PEP for given fading channel coefficients, using a moment generating function-based approach. We include simulation results for varying numbers of antennas which affirm that the proposed… (More)
This correspondence presents a construction of affine reflection group codes. The solution to the initial vector and nearest distance problem is presented for all irreducible affine reflection groups of rank n ges 2, for varying stabilizer subgroups. We use a detailed analysis of the geometry of affine reflection groups to produce a decoding algorithm which… (More)
— A full diversity constellation, that is, a set of unitary matrices whose differences have nonzero determinant, is a design criterion for codes with good performance using differential unitary space-time modulation. In this paper, we present a new Bruhat decomposition design for constructing full diversity unitary constellations for a prime number of… (More)