Journal of Computer Networks and Communications

Volume 2017, Article ID 1837210, 8 pages

https://doi.org/10.1155/2017/1837210

## Grassmannian Constellation Based on Antipodal Points and Orthogonal Design and Its Simplified Detecting Algorithm

^{1}School of Electronic Information and Communications, Huazhong University of Science and Technology, Wuhan National Laboratory for Optoelectronics, Wuhan, Hubei 430074, China^{2}Department of Electronics and Information, Research Institute of Huazhong University of Science and Technology in Shenzhen, Shenzhen, Guangdong 518057, China^{3}School of Electronic Information and Communications, Huazhong University of Science and Technology, Wuhan, Hubei 430074, China

Correspondence should be addressed to Li Peng; nc.ude.tsuh@ilgnep

Received 29 September 2016; Revised 13 December 2016; Accepted 15 February 2017; Published 3 April 2017

Academic Editor: Lixin Gao

Copyright © 2017 Li Peng et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

#### Abstract

This study presents a framework of the unitary space time modulation (USTM) constellation based on antipodal points over Grassmannian manifold. The antipodal constellation enables an intrinsic simplified ML detecting algorithm. The algebraic orthogonal USTM constellation is also an antipodal constellation which, apart from being adaptive to the antipodal simplified ML detector, also has another simplified ML detector based on its self-indexing features, and the latter is simpler because of getting rid of the matrix operation. A searching orthogonal USTM constellation based on the grid search algorithm is obtained under the presented framework and its minimum Frobenius chordal distance and simulation performance are be superior to those of the algebraic orthogonal USTM constellation.

#### 1. Introduction

Grassmannian constellation is a set of unitary space time modulation (USTM) signal matrices defined on Gassmann manifold presented by Hochwald and Marzetta [1] and Zheng and Tse [2] for robustness against very fast fading in high speed mobile channels in which learning the channel fade coefficients becomes increasingly difficult for both transmitter and receiver. There are many methods about how to construct the USTM constellation, mainly including derivative-based optimization searching schemes [3] and algebraic structural schemes [4–8]. This study concentrated on the random and algebraic orthogonal [4] USTM constellation having the feature of antipodal point on Grassmannian manifold and their simplified maximum likelihood (ML) detecting algorithm.

The content of the paper including its main contributions is organized as follows. In Section 2, the preliminary knowledge which will be used throughout this paper is described, including the system model, the noncoherent maximum likelihood (ML) detector, and the chordal Frobenius distance measure. In Section 3, we build a framework of USTM constellation based on the antipodal points. The optimal packing method of searching the orthogonal unitary matrices over Grassmannian manifold and the corresponding searching algorithm are investigated. Under the constraint of the framework and by using the grid searching algorithm, we obtain a set of the orthogonal unitary matrices which contains many constellations of satisfying antipodal feature and orthogonality. Among them, an orthogonal USTM constellation with the optimum distribution of chordal Frobenius distance is determined by two explicit expressions. In Section 4, a simplified ML detecting algorithm based on antipodal points is derived and discussed. In Section 5, we demonstrate the antipodal feature of the algebraic orthogonal USTM constellation from [4] and derive its simplified ML detecting algorithm based on antipodal points. Furthermore, we deduce the indexing simplified ML detector of the algebraic orthogonal USTM constellation which only needs to operate several complex-values and get rid of the matrix operation. In Section 6, we show the simulation testing results between the searching and algebraic orthogonal USTM constellations which indicate that the searching constellation is superior to the algebraic that in both chordal Frobenius distance spectrum and performance with regard to symbol error probability and signal noise ratio. We conclude with some remarks in Section 7.

#### 2. Preliminary and System Model

Consider a system with transmit and receive antennas. The channels between antenna pairs are Rayleigh flat fading and independent of each other. The channel fading coefficients are constant in a coherence interval and change to a new realization in the next interval. A system model [2] is given as follows:where and are, respectively the transmitted and received signal matrices, is a fading coefficient matrix and is an additive noise matrix, of which the elements of both are drawn from the i.i.d. standard complex Gaussian distribution , and is the expected signal-to-noise ratio (SNR) at each receiver antenna.

The capacity-achieving space time modulation signal distribution at high SNR is modelled as a set of unitary matrices [1]: in which each matrix satisfies and all ’s are points on a Stiefel manifold, or the subspace spanned by column vectors of matrix is uniformly distribution in Grassmann manifold ; that is, [2]. Let a set denote a USTM constellation which contains complex unitary matrices .

As the coefficients of are unknown to both receiver and transmitter, the noncoherent ML detector [1] is introduced: where is the trace operation of a matrix and is the complex conjugate transpose.

Let vector sets and be two principal vectors corresponding to two -planes . The principal angles between and are defined as for , subject to , , [9]. The chordal Frobenius distance measure is defined as follows ([3] and references therein):where denotes a diagonal matrix formed by the singular values of the matrix .

#### 3. A Framework of Grassmannian Constellation Based on Antipodal Point

##### 3.1. A Framework of USTM Constellation

A pair of antipodal points are defined as two points with the furthest distance on a sphere. Since the capacity-achieving USTM signal distribution at high SNR is isotropic on the Grassmannian manifold and each signal point is denoted as a unitary matrix , is defined as an antipodal point of if is the orthogonal complement of on . Then how can one decide whether the two matrices on are the antipodal matrix? This can be done with the following lemma.

Lemma 1. *Let be two unitary matrix on . and become a pair of antipodal matrices if and only if either or and , where is a identity matrix and is a full-zero matrix.*

*Proof. * implies that each of column vectors of is orthogonal to each of column vectors of ; that is, and are orthogonal and complement each other. Since are two unitary matrices, they are used to construct a matrix . indicates that column vectors of and span a basis of Euclid space , so and are orthogonal and complement each other.

*Construction 1 (a framework of USTM). *Let denote a constellation and . Let denote a complex element at the th row and the th column of for and . If for any positive integer , each code word of has the structure and satisfies the following constraints:(1)For all ,, where is a identity matrix;(2)All points of are partitioned into two parts and in such a way that there exist one-to-one antipodal points between and but there is no antipodal point in each of and ;(3)The degree of freedom of elements in each is [2];(4)All are unknown for and .Then the constellation set is called a framework of the full diversity USTM constellation based on antipodal points on .

##### 3.2. The Construction of Antipodal Constellation with Orthogonality

According to the analysis on how to choose and [1, 2], the simplest case of was considered. A framework of the unitary matrix on was built similar to (4), and the degree of freedom of its elements was . Therefore, let , be four independent complex elements of , where is an imaginary unit. Then a unitary matrix with uncertain eight values , , , is formed as follows:

The expression (5) defines a function ; that is, four complex numbers are mapped into a unitary matrix similar to (5) which is a point of the USTM constellation, or , where and .

The optimal packing method stated was used to determine with all points like (5). That is, for the fixed and , design a packing in of cardinality so that its minimum distance similar to (3) is as large as possible. In fact, a complex number set of needs to be obtained in order to form a constellation on so that the minimum Frobenius chordal distance of (3) is maximized. The optimal packings of points on require the solution of the following optimization problem:

If the complex elements of each unitary matrix (a constellation point) are referred as to the parameter of the model for the underlying system, such as USTM, then the parameters can be thought of the hyperparameter of the same system. The so-called hyperparameter optimization, also called model selection, is the problem of choosing a set of hyperparameters . Thus we need to solve the problem of hyperparameter optimization. The traditional way of performing hyperparameter optimization has been grid search algorithm, or a parameter sweep, which is simply an exhaustive searching through a manually specified subset of the hyperparameter space. From the above, we need to consider the following factors.

A grid search algorithm must be guided by some performance metric. Here the performance metric space is to maximize the minimum chordal Frobenius distance.

Since the parameter space may include real-valued or unbounded value spaces for our parameters , our searching scheme needs to be tuned for good performance on an unknown data set; then manually set bounds and discretization may be necessary before applying grid search.

Since grid search suffers from the curse of dimensionality and doing a complete grid search may also be time-consuming, we considered using a coarse grid first. If the searched constellation cannot satisfy the some predetermined threshold of Frobenius chordal distance, we will use the fine grid.

In fact, there are several optimal methods used by [3] which can obtain the constellations with the better distribution of the minimum Frobenius chordal distance. However, there are several motivations why we prefer the simple grid search approach. One is that we want to know whether there exists the other orthogonal structural constellation whose performance is superior to the performance of the algebraic structural orthogonal constellation [4]. Hence, let which means that an orthogonal constraint is imposed on each point of the constellation and which also means that the parameter is discretized into a coarse grid. Thus it is natural to introduce the grid searching algorithm. Another is that we expect that the value distribution of has some regular pattern so that all points of the constellation can be denoted by the expression like the orthogonal design of [4] rather than by the way of enumeration.

Let be initialized into an empty set, be the size of , and be the total of the constellation points. Our searching scheme is described as follows:(a) Select an initial point. Due to , and is stipulated for . Place the initial point and its antipodal point into .(b) Determine a step length. Let be a step length of increasing and be a step length of increasing , where and are positive integers. For orthogonal scheme, let ; then which implies that all principal angles between any two points are orthotropic each other; equivalently, . We selected the amplitude value of by fixed . So two step lengths of and provide a coarse grid, which can avoid the curse of dimensionality and reduce time- consuming of the grid search.(c) Select the distance threshold in accordance with the practical cases. The choice of was given by considering the Frobenius chordal distance distribution of the orthogonal design [4], such as shown in Figure 1.(d) Searching method: find , with and modified by and in order to generate a like (5). Calculate . If , then place into ; otherwise, discard . If is placed into , then its antipodal point is also placed into . Repeat until .