Printer Friendly

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

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 M transmit and N 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 T and change to a new realization in the next interval. A system model [2] is given as follows:

Y = [square root of [rho]/M] X * H + W, (1)

where X [member of] [C.sup.TxM] and Y [member of] [C.sup.TxN] are, respectively the transmitted and received signal matrices, H [member of] [c.sup.MxN] is a fading coefficient matrix and W [member of] [C.sup.TxN] is an additive noise matrix, of which the elements of both are drawn from the i.i.d. standard complex Gaussian distribution CN(0,1), and [rho] 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]: {X} = [square root of T] [{[[PHI].sub.b]}.sup.B.sub.b=1] in which each matrix satisfies [[PHI].sup.*.sub.b][[PHI].sub.b] = [I.sub.M] and all [[PHI].sub.b]'s are points on a Stiefel manifold, or the subspace [[OMEGA].sub.b] spanned by column vectors of T x M matrix is uniformly distribution in Grassmann manifold [G.sub.T,M]; that is, e [G.sub.T,M] [2]. Let a set [{[[PHI].sub.b]}.sup.B.sub.b=1] denote a USTM constellation which contains B TxM complex unitary matrices ofc.

As the coefficients of H are unknown to both receiver and transmitter, the noncoherent ML detector [1] is introduced:

[mathematical expression not reproducible], (2) where Tr(*) is the trace operation of a matrix and (*) * is the complex conjugate transpose.

Let vector sets {[u.sub.i]} and {[v.sub.i]} be two principal vectors corresponding to two M-planes U, V [member of] [G.sub.T,M]. The principal angles [[theta].sub.1], [[theta].sub.2], ..., [[theta].sub.M] [member of] [0, [pi]/2] between U and V are defined as cos [[theta].sub.i] = [max.sub.u[member of]U][max.sub.v[member of]V] u x v = [u.sub.i] x [v.sub.i] for i = 1,2, ..., M, subject to u x u = v x v = 1, [u.sub.i] x [u.sub.j] = 0, [v.sub.i] x [v.sub.j] = 0 (1 [less than or equal to] j [less than or equal to] i-1) [9]. The chordal Frobenius distance measure is defined as follows ([3] and references therein):

[mathematical expression not reproducible], (3) where [[summation].sub.[U.sup.*]V] denotes a diagonal matrix formed by the singular values of the matrix [U.sup.*]V.

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 [G.sub.T,M] and each signal point is denoted as a unitary matrix [PHI], [bar.[PHI]] is defined as an antipodal point of [PHI] if [bar.[PHI]] is the orthogonal complement of [PHI] on [G.sub.T,M]. Then how can one decide whether the two matrices on [G.sub.T,M] are the antipodal matrix? This can be done with the following lemma.

Lemma 1. Let U, V be two TxM unitary matrix on [G.sub.T,M]. U and V become a pair of antipodal matrices if and only if either [U.sup.*]V = [0.sub.M] or [UV] = [Q.sub.T] and = [Q.sup.*.sub.T][Q.sub.T], where [I.sub.T] is a T x T identity matrix and [0.sub.M] is a M x M full-zero matrix.

Proof. [U.sup.*]V = [0.sub.M] implies that each of M column vectors of U is orthogonal to each of M column vectors of V; that is, U and V are orthogonal and complement each other. Since U, V are two T x M unitary matrices, they are used to construct a T x T matrix [Q.sub.T] = [UV]. [Q.sup.*.sub.T][Q.sub.T] = [I.sub.T] indicates that T column vectors of U and V span a basis of Euclid space [C.sup.T], so U and V are orthogonal and complement each other.

Construction 1 (a framework of USTM). Let C = [{[[PHI].sub.b]}.sup.B-1.sub.b=0] denote a constellation and [[PHI].sub.b] [member of] C [subset] [G.sub.T,M]. Let [[phi].sub.ij] [member of] C denote a complex element at the ith row and the jth column of [[[PHI].sub.b] for i = 1,2, ..., T and j = 1,2, ..., M. If for any positive integer B, each code word [[PHI].sub.b] of C has the structure

[mathematical expression not reproducible] (4) and satisfies the following constraints:

(1) For all b, [[PHI].sup.*.sub.b][[PHI].sub.b] = [I.sub.M], where [I.sub.M] is a M x M identity matrix;

(2) All points of C = [{[[PHI].sub.b]}.sup.B-1.sub.b=0] = [C.sub.1] [union] [C.sub.2] are partitioned into two parts [C.sub.1] = [{[[PHI].sub.b]}.sup.B/2-1.sub.b=0] and [C.sub.2] = [{[[PHI].sub.b]}.sup.B-1.sub.b=B/2] in such a way that there exist B/2 one-to-one antipodal points between [C.sub.1] and [C.sub.2] but there is no antipodal point in each of [C.sub.1] and [C.sub.2];

(3) The degree of freedom of elements in each [[PHI].sub.b] [member of] C [subset] [G.sub.T,M] is dim([G.sub.T,M]) = M(T - M) [2];

(4) All = [[phi].sub.[alpha][beta]] [not equal to] are unknown for [alpha] = 1,2,..., T and [beta] = 1, 2, ..., M.

Then the constellation set C = [{[[PHI].sub.b]}.sup.B-1.sub.b=0] is called a framework of the full diversity USTM constellation based on antipodal points on [G.sub.T,M].

3.2. The Construction of Antipodal Constellation with Orthogonality. According to the analysis on how to choose T and M [1, 2], the simplest case of T = 2M = 4 was considered. A framework of the 4 x 2 unitary matrix [[PHI].sub.b] on [G.sub.4,2] was built similar to (4), and the degree of freedom of its elements was M(T - M) = 4. Therefore, let [mathematical expression not reproducible], k = 1, 2, 3, 4 be four independent complex elements of where j is an imaginary unit. Then a unitary matrix with uncertain eight values [A.sub.k], [[phi].sub.k], k = 1, 2, 3, 4, is formed as follows:

[mathematical expression not reproducible] (5)

The expression (5) defines a function f : {[[phi].sub.1]; [[phi].sub.2], [[phi].sub.3], [[phi].sub.4]} [right arrow] [[PHI].sub.b] that is, four complex numbers are mapped into a unitary matrix similar to (5) which is a point of the USTM constellation, or f : [{[A.sub.k], [[phi].sub.k]}.sup.4.sub.k=1] [right arrow] [[PHI].sub.b], where [[phi].sub.k] [member of] C and [A.sub.k], [[phi].sub.k] [member of] R.

The optimal packing method stated was used to determine C = [{[PHI].sub.b].sup.[B-1].sub.b=0] with all points like (5). That is, for the fixed T = 2M = 4 and B, design a packing C in [G.sub.4,2] of cardinality [absolute value of C] = B so that its minimum distance similar to (3) is as large as possible. In fact, a complex number set of [mathematical expression not reproducible] needs to be obtained in order to form a constellation C = on [G.sub.4,2] so that the minimum Frobenius chordal distance [mathematical expression not reproducible] of (3) is maximized. The optimal packings of B points on G4 2 require the solution of the following optimization problem:

[mathematical expression not reproducible]. (6)

If the complex elements [[phi].sub.k] [member of] C (k = 1,2,3,4) 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 [A.sub.k], [[phi].sub.k] [member of] R 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 [A.sub.k], [[phi].sub.k] [member of] R. 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 [A.sub.k], [[phi].sub.k] [member of] R, 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 [[phi].sub.k] = 0, [pi]/2, [pi], 3[pi]/2 which means that an orthogonal constraint is imposed on each point of the constellation C = [{[PHI].sub.b].sup.[B-1].sub.b=0] and which also means that the parameter [[phi].sub.k] 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 Ak 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 {[phi]} be initialized into an empty set, [absolute value of {[phi]}] be the size of {[phi]}, and B be the total of the constellation points. Our searching scheme is described as follows:

(a) Select an initial point. Due to [[phi].sub.[alpha][beta]] = [[phi].sub.k] [not equal to] 0, [A.sub.k] = 1 and [[phi].sub.k] = 0 is stipulated for k = 1,2,3,4. Place the initial point [[PHI].sub.b=0] = [[PHI].sub.0] and its antipodal point [[bar.[PHI]].sub.b=0] [[PHI].sub.B/2] into {[PHI]}.

(b) Determine a step length. Let [gamma] = 1/m [member of] [0,1] be a step length of increasing [A.sub.k] and [sigma] = 2[pi]/n [member of] [0, 2[pi]] be a step length of increasing [[phi].sub.k], where m and n are positive integers. For orthogonal scheme, let n = 4; then [sigma] = [pi]/2 which implies that all principal angles [[theta].sub.1], [[theta].sub.2], ..., [[theta].sub.M] between any two points [[PHI].sub.u], [[PHI].sub.v], are orthotropic each other; equivalently, [[phi].sub.k] [member of] {0, [pi]/2, [pi], 3[pi]/2}. We selected the amplitude value of [A.sub.k] by fixed m = 2,4,8. So two step lengths of [gamma] and [sigma] provide a coarse grid, which can avoid the curse of dimensionality and reduce time- consuming of the grid search.

(c) Select the distance threshold dth in accordance with the practical cases. The choice of [d.sub.th] = 0.8 was given by considering the Frobenius chordal distance distribution of the orthogonal design [4], such as [d.sub.th] = 0.7321 shown in Figure 1.

(d) Searching method: find [mathematical expression not reproducible], k = 1,2,3,4 with [A.sub.k] and [[phi].sub.k] modified by [gamma] and [sigma] in order to generate a [[PHI].sub.[beta]] [member of] C like (5). Calculate [mathematical expression not reproducible]. If d > [d.sub.th], then place [[PHI].sub.[beta]] into {[PHI]}; otherwise, discard [[PHI].sub.[beta]]. If [[PHI].sub.[beta]] is placed into {[PHI]}, then its antipodal point [bar.[PHI].sub.[beta]] is also placed into {[PHI]}. Repeat (d) until [absolute value of {[PHI]}] = B.
ALGORITHM 1: Algorithm of searching the antipodal
orthogonal constellation.

Input: B, m, n, [d.sub.th];
Output: a constellation C = [{[[PHI].sub.b]}.sup.B-1.sub.b=0]];
Point([A.sub.k](b), [[phi].sub.k](b)){
a = 1/[square root of [([A.sub.1](b)).sup.2];
[mathematical expression not reproducible] // function of
calculating points
[A.sub.k](0) = 1; [[phi].sub.k](0) = 0; // for k = 1,2,3,4
[[PHI].sub.0] = Point([A.sub.k](0), [[phi].sub.k](0));
[[PHI].sub.0] [right arrow] {[PHI]}; [[PHI].sub.B/2] [right arrow]
{[PHI]} // initial the constellation set
[gamma] = 1/m; [sigma] = 2[pi]/n;
For [A.sub.k](b) = 1, [A.sub.k](b) = [A.sub.k](b) + [gamma],
[A.sub.k](b) [less than or equal to] 2 {{{{
  // four for-cycle to calculate [[phi].sub.1], [[phi].sub.2],
  [[phi].sub.3], [[phi].sub.4]
   [[PHI].sub.b] = Point([A.sub.k](b), [[phi].sub.k](b));
   For l = 0,l ++, l < [absolute value of {[PHI]}]{
       If d([[PHI].sub.b], [[PHI].sub.l]) > [d.sub.th];
          [[PHI].sub.b] [right arrow]
          C = [{[[PHI].sub.b]}.sup.B-1].sub.b=0]; [[PHI].sub.b]
          [right arrow] C = [{[[PHI].sub.b]}.sup.B-1].sub.b=0]}
If [absolute value of {[PHI]}] < B
   b = b + 1 }}}}}}}}
[absolute value of {[PHI]}] = B
Return C = [{[[PHI].sub.b]}.sup.B-1].sub.b=0]


About the solution of the above optimization problem, there are [P.sub.mn] = (mn)!/(mn - 4)! candidate matrices like (5). Hence the calculating complexity of the search algorithm is determined by m and n.

We used the grid search technique to do the following tests. For m = 2,4,8 and n = 4, let [d.sub.th] = 0.8, we obtained the same results. There are 24 matrix points of satisfying the orthogonal condition within the range of (mn)!/(mn - 4)! unitary matrix points, and they constitute a set [THETA] of [C.sup.16] = 735471 constellations in which each constellation contains 16 matrix points with the minimum distance [d.sub.min] = 0.8. By observing these 24 matrix points, we find out the following orthogonal constellation with the minimum Frobenius chordal distance [d.sub.min] = 0.8376.

[mathematical expression not reproducible] (7)

for k = 0,1,2,3, {[[OMEGA].sub.k] contains eight points and its antipodal points set, denoted as {[[bar.OMEGA]].sub.k]}, has the following form:

[mathematical expression not reproducible] (8)

for k = 0,1,2,3; {[[bar.[OMEGA]].sub.k]} also contains eight points. So the searching orthogonal constellation is

[{[[PHI].sub.b]}.sup.15.sub.b=0] = {[[OMEGA].sub.b]} [union] {[[bar.[OMEGA]].sub.k]}. (9)

When [d.sub.th] [greater than or equal to] 0.8376, we cannot search any constellation by using the presented algorithm. Note that when [d.sub.th] = 0.8376, the grid searching algorithm cannot obtain the constellation of (9), because this constellation does not contain the initial point of searching process (see Algorithm 1).

4. Simplified Maximum Likelihood Detecting Algorithm Based on Antipodal Point

The antipodal constellation has the following feature.

Lemma 2. Let C = [C.sub.1] [union] [C.sub.2] = [{[X.sub.b]}.sup.B/2.sub.b=1] [union] [{[[bar.X].sub.b]}.sup.B/2.sub.b=1+B/2] be an antipodal constellation defined on [G.sub.T,M], x [epsilon] [C.sub.1] = [{[X.sub.b]}.sup.B/2.sub.b=1] be a T x M transmitted signal matrix, and [bar.X] [member of] [C.sub.2] = [{[bar.X].sub.b]}.sup.B.sub.b=1+B/2] be an antipodal point of X. If Y is a T x N received signal matrix, then X, [bar.X] and Y satisfy

Tr ([Y.sup.*]X[X.sup.*]Y) + Tr ([Y.sup.*]X[X.sup.*]Y) = Tr ([Y.sup.*]Y). (10)

Proof. As X, [bar.X] [member of] C [subset] [G.sub.T,M] are a pair of antipodal points, according to Lemma 1, there are [X[bar.X]] = [Q.sub.T] and [[X.sup.*][[bar.X].sup.*]] * = [Q.sup.*.sub.T], where [Q.sub.T] is a T x T unitary matrix. Thus [mathematical expression not reproducible] is obtained. From here, (10) is deduced from the left to the right as follows:

[mathematical expression not reproducible] (11)

This completes the proof.

It can be observed from (10) that the matrix [X.sub.i] [member of] [C.sub.1] determined by the maximum value of Tr([Y.sup.*][X.sub.i][X.sup.*.sub.i] Y) matches with the matrix [[bar.X].sub.i] [member of] [C.sub.2] determined by the minimum value of Tr([Y.sup.*] [[bar.X].sub.i] [[bar.X].sup.*.sub.i] Y). Therefore, the following two lemmas are self-evident.

Lemma 3. Let a = Tr([Y.sup.*]Y) and [b.sub.i] = Tr([Y.sup.*][X.sub.i][X.sup.*.sub.i]Y) which forms a set {[b.sub.i]}. [b.sub.max] = max{[b.sub.i] | i = 1, ..., B/2} and [b.sub.min] = min{[b.sub.i] | i = 1, ..., B/2} is calculated. By Lemma 2, [[bar.b].sub.max] = a - [b.sub.min] and [[bar.b].sub.min] = a - [b.sub.max] are obtained.

For the sake of obtaining the signal matrices in the subset [C.sub.1] = [{[X.sub.b]}.sup.B/2.sub.b=1] corresponding to [b.sub.max] and [b.sub.min] of the set {[b.sub.i]}, let [s.sub.max] and [s.sub.min] denote the indexing indicator of max{[b.sub.i]} and min{[b.sub.i]}, respectively. ID denotes taking the index of each of all elements for the set {[b.sub.i]}.

Lemma 4. [s.sub.max] = ID max{[b.sub.i]} indicates that [s.sub.max] is an index of the maximum value [b.sub.max] in the set }. Similarly, we have [s.sub.min] = ID min{[b.sub.i]}, [[bar.s].sub.max] = ID max{[bar.[b.sub.i]]}, and [[bar.s].sub.min] = ID min{[b.sub.i]}. By Lemmas 2 and 3, [s.sub.max] = [s.sub.min] and [s.sub.min] = [s.sub.max] are obtained.

The simplified ML detecting criterion is as follows.

Theorem 5. Let [mathematical expression not reproducible] be the transmitted signal constellation and Y be the received signal matrix. Calculate a = Tr ([Y.sup.*]Y) and {[b.sub.i]} = {Tr([Y.sup.*][X.sub.i][X.sup.*.sub.i]Y)} for i = 1, 2, ..., B/2. According to Lemmas 3 and 4, we obtain [b.sub.max], [s.sub.max], [b.sub.min], [s.sub.min], and [[bar.b].sub.max] = a - [b.sub.min]. If [b.sub.max] > [[bar.b].sub.max], the detector outputs [mathematical expression not reproducible] as an estimate of the transmitted signal

X [member of] C;If [b.sub.max] < [bar.x].sub.max] then X = XSmin e [C.sub.2] is given as a.n estimate of X e C.

Proof. The result is obtained from Lemmas 2, 3, and 4 at once.

The complexity analysis of the simplified scheme: the ML detector of (2) requires B points (matrices) to take part in the calculation of Tr([Y.sup.*][X.sub.b][X.sup.*.sub.b]Y), while the antipodal simplified ML algorithm of Theorem 5 only requires B/2 points to take part in the calculation of Tr([Y.sup.*][X.sub.b][X.sup.*.sub.b]Y); in addition, looking for the maximum and minimum of {[b.sub.i]} requires the use of t comparison operations with B/2 < t < [B.sup.l] this is such that {[b.sub.max]} and {[b.sub.min]} are two nonempty sets initialized by the first two [b.sub.i]'s and if [b.sub.i] = Tr([Y.sup.*][X.sub.i][X.sup.*.sub.i]Y) > [b.sub.max], then put [b.sub.i] into {[b.sub.max]}; else if [b.sub.i] = Tr([Y.sup.*][X.sub.i][X.sup.*.sub.i]Y) < [b.sub.min], then put [b.sub.i] into {[b.sub.min]}; otherwise calculate the next and the current is discarded for i = 1,2, ..., B/2. In one word, the calculated amount of Tr([Y.sup.*][X.sub.b][X.sup.*.sub.b]Y) descends by half but there is no performance loss. Refer to [10] regarding the other details of the detector.

5. The Algebraic Orthogonal Design Constellation

In Section 3.2, the searching orthogonal USTM constellation based on the antipodal points was provided. In this Section, the feature of the antipodal point for the algebraic orthogonal USTM constellation presented [4] will be verified first, followed by the discussion of its antipodal simplified ML detector and the indexing simplified ML detector.

5.1. The Antipodal Feature of Orthogonal Design. Zhao et al. [4] presented the following Algebraic orthogonal (AO) scheme of USTM:

[mathematical expression not reproducible], (12)

where (k,l) [member of] F x F, F = {0, 1,..., P - 1}, and B = [P.sup.2]. An AO USTM constellation is denoted as [C.sub.AO] = {[X.sub.k,l] | (k,l) [member of] F x F}. Let [mathematical expression not reproducible]. By [[X.sub.x,l] [[bar.X].sub.k,l]] = [Q.sub.T] and [Q.sup.[dagger].sub.T][Q.sub.T] = [I.sub.T] of Lemma 1, it is easy to verify that [C.sub.AO] has the antipodal feature. According to the known elements of [X.sub.k,l] and the antipodal relation between [X.sub.k,l] and [X.sub.jj], elements of [X.sub.k,l] are calculated as [s.sub.2] = [-s.sub.0] = [-e.sup.j][(2[pi]/P).sup.k], [s.sub.3] = [-s.sub.1] = [-e.sup.j[(2[pi]/P).sup.k], [s.sub.4] = [s.sup.*.sub.1] = [e.sup.-j][(2[pi]/P)l, and [s.sub.5] = [-s.sup.*.sub.0] = [- e.sup.-j(2[pi]/P)k]. For the case of P = 4 and B = [P.sup.2] = 16, we determine two distributions of antipodal points for [C.sub.AO], and they are given as scheme one:

[mathematical expression not reproducible] (13)

and scheme two:

[mathematical expression not reproducible]. (14)

Thus the general method of forming a pair of antipodal points in [C.sub.AO] was derived as follows.

Theorem 6. In the set [C.sub.AO] = {[X.sub.x,l] | (k,l) [member of] F x F} = [C.sup.1.sub.AO]. [C.sup.2.sub.AO], given a constellation point [X.sub.k,l] [member of] [C.sub.1.sub.AO], then its antipodal point is [X.sub.(k+P/2)(modP),(1+P/2)(modP) [member of] [C.sup.2.sub.AO].

Proof. From d(U, V) = [square root of 2M - 2 Tr([[summation].sub.[U.sup.*]V]) of (3), it is known that if [U.sup.*]V = 0, then d(U, V) = V2M attains its maximum value. Thus, by calculating [X.sup.*.sub.k,l][X.sup.(k+P/2)(mod P)] = 0, we obtain d([X.sub.k,l], [X.sub.*.sub.k,l][X.sup.(k+P/2)(mod P)], = [square root of 2M] = 2.

5.2. The Antipodal Simplified ML Detector of [C.sub.AO]. The orthogonal USTM design [4] also has the relation similar to (10) in Lemma 2. Let [mathematical expression not reproducible] and [mathematical expression not reproducible]; then [C.sub.AO] = {[X.sub.k,l] | (k, l) [member of] F x F} = [C.sup.1.sub.AO] [union] [C.sup.2.sub.AO]. Knowing that the shape of the transmitted signal with normalizing factor of 1/2 is a T x M unitary matrix [bar.X] = [[[E.sup.*][U.sup.*]].sup.*] in [C.sub.AO] and its antipodal point is [bar.X] = [[[E.sup.*][[bar.U].sup.*]].sup.*], if E is invariable via transmission, then the received signal matrix is Y = [[[E.sup.*][V.sup.*]].sup.*], where

[mathematical expression not reproducible]. (15)

Lemma 7. Let [C.sub.AO] = [C.sub.AO] U [C.sub.AO] be a algebraic orthogonal USTM constellation with antipodal points on [G.sub.T,M], and X = [E*[U.sup.*]]* e CA O and X = [E*[U.sup.*]]* e [C.sub.2]A O. If Y = [E*[V.sup.*]]* is a received matrix when X is a transmitted matrix, then U, [bar.U], and V satisfy the constraint:

Tr([V.sup.*]U[U.sup.*]V) + Tr ([V.sup.*][bar.U][[bar.U].sup.*]V) = Tr ([V.sup.*]V). (16)

Proof. The proof is similar to Lemma 2.

Similar to Theorem 5, the algebraic orthogonal USTM [4] has the following antipodal simplified ML detector.

Lemma 8. Let a = 4 Tr([V.sup.*]V) and [b.sub.i] = Tr([V.sup.*][U.sup.i][U.sup.*.sub.i]V). Calculate [b.sub.max] = max{[b.sub.i] | i = 1, ..., B/2} and [b.sub.min] = min{[b.sub.i] | i = 1, ..., B/2}. By Lemma 7, [[bar.b].sub.max] = [a-b.sub.min] and [[bar.b].sub.min] = [a-b.sub.max] are obtained.

Theorem 9. Let [C.sub.AO] = [C.sub.1.sub.AD] [union] [C.sub.AO] be the transmitted signal constellation and Y be the received signal matrix. Calculate a = 4 Tr([V.sup.*]V) and {[b.sub.i]} = {Tr([V.sup.*][U.sub.i][U.sup.*.sub.i]V)} for i = 1, 2, ..., B/2. By Lemmas 8 and 4 obtain [b.sub.max], [s.sub.max], [b.sub.min], and [s.sub.min]. If [b.sub.max] > a [b.sub.min], then the detector outputs [mathematical expression not reproducible] as an estimate of the transmitted signal X [member of] [C.sub.AO], else if [b.sub.max] < a - [b.sub.min], then it outputs [mathematical expression not reproducible] as an estimate of X [member of] [C.sub.AO].

Obviously, the calculating quantity of Tr([V.sup.*]U[U.sup.*]V) in (16) is half of that of Tr([Y.sup.*]X[X.sup.*]Y) in (10) because the sizes T x M of X and Y in Tr([Y.sup.*]X[X.sup.*]Y) for nonorthogonal design decrease by half the sizes of M x M of U and V in Tr([V.sup.*]U[U.sup.*] V) for orthogonal design.

5.3. The Indexing Simplified ML Detector of [C.sub.AO]. Zhao et al. [4] presented the other simplified detecting algorithm for the algebraic orthogonal USTM, here called the indexing simplified detecting algorithm with k and l.

[mathematical expression not reproducible] (17)

[mathematical expression not reproducible] (18)

Notice that Tr{[Y.sup.*]X[X.sup.*]Y} is decomposed into Tr{[V.sup.*][[THETA].sub.k] + [[THETA].sup.*.sub.k]V} and Tr{[V.sup.*][[PSI].sub.l] + [[PSI].sup.*.sub.l]V}, where Tr{[V.sup.*][[Theta].sub.k] + [[Theta].sup.*,sub.k]V} is only related to the first index k, while Tr{[V.sup.*][[PSI].sub.l] + [[PSI].sup.*.sub.l]V} is only related to the second index l. Based on this decomposition and the exhausted expansion up to the level of elements of the matrix, the simplified ML detector [4] can further be simplified as follows:

[mathematical expression not reproducible], (19) where [[??].sub.ML] and [[??].sub.ML] are computed as follows:

[mathematical expression not reproducible]. (20) The simplified approach of Zhao et al. [4] is required to calculate Tr{Y[Y.sup.*][A.sub.k]}, P times and Tr{Y[Y.sup.3][B.sup.l]}, P times. The aforementioned simplified approach only needs to calculate the [[??].sub.ML] and /ML expressions formed by two complex multiplications and three complex additions, P times, respectively, ignoring matrix operations.

6. Numerical Results

In order to compare the quality between the searching orthogonal constellations and the algebraic orthogonal constellation, we plot their distance spectrums about average number of constellation points versus chordal Frobenius distance distribution away from an initial point. Figure 1 shows the distance spectrum of an searching orthogonal constellation with the minimum chordal Frobenius distance [d.sub.min] = 0.8 which consists of the first 16 points obtained by the grid search algorithm via setting the threshold [d.sub.th] = 0.8. This fist constellation belongs to the set [THETA] of [C.sup.16.sub.24] constellations (see the last in Section 3.2). In the set 0, the best constellation is of (9) with the minimum distance [d.sub.min] = 0.8376 and its distance spectrum is shown in Figure 2. The algebraic orthogonal constellation like (12) does not belong to the set 0 because its minimum Frobenius chordal distance is [d.sub.min] = 0.7321 and its distance spectrum is shown in Figure 3.

In Figure 4, we demonstrate the corresponding performances of three constellations when used in noncoherent communication and operated on the additive white Gaussian noise (AWGN) channel, by plotting the curves between the symbol error probability versus the signal noise ratio. At a symbol error probability of [10.sup.-5], the best searching orthogonal constellation with the minimum distance [d.sub.min] = 0.8376 yields a SNR gain of about 2 dB over the algebraic orthogonal constellation of [4] when the number of receive antennas N = 2. In order to compare our testing results with those from the algebraic orthogonal constellation of [4], Figure 4 also shows the case that the number of receive antennas is N = 1. At a symbol error probability of 10-3, the orthogonal constellation system for two receive antennas yields an SNR gain of about 8 dB over the system for one receive antenna.

7. Conclusion

We build a framework of generating a general USTM constellation based on full diversity and antipodal feature. Under the constraint of this framework, we search a set of the orthogonal constellations all of which are superior to the algebraic orthogonal constellation of [4] in both the distance spectrum and the performance of symbol error probability versus signal noise ratio. But the algebraic orthogonal constellation has a simpler ML detecting algorithm which is only the linear combination of complex elements of the received matrix without dependence on matrix operations.

Conflicts of Interest

The authors declare that they have no conflicts of interest.

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

Acknowledgments

This work was supported in part by the National Natural Science Foundation of China (Grant no. 61271261) and in part by the Basic Research Projects of Shenzhen (JCYJ20150616144425373).

References

[1] B. M. Hochwald and T. L. Marzetta, "Unitary space-time modulation for multiple-antenna communications in Rayleigh flat fading," IEEE Transactions on Information Theory, vol. 46, no. 2, pp. 543-564, 2000.

[2] L. Zheng and D. N. Tse, "Communication on the Grassmann manifold: a geometric approach to the noncoherent multiple-antenna channel," IEEE Transactions on Information Theory, vol. 48, no. 2, pp. 359-383, 2002.

[3] R. H. Gohary and T. N. Davidson, "Noncoherent MIMO communication: Grassmannian constellations and efficient detection," IEEE Transactions on Information Theory, vol. 55, no. 3, pp. 1176-1205, 2009.

[4] W. Zhao, G. Leus, and G. B. Giannakis, "Orthogonal design of unitary constellations for uncoded and trellis-coded noncoherent space-time systems," IEEE Transactions on Information Theory, vol. 50, no. 6, pp. 1319-1327, 2004.

[5] W. Zhao, G. Leus, and G. B. Giannakis, "Algebraic design of unitary space-time constellations," in Proceedings of the International Conference on Communications (ICC '03), pp. 3180-3184, May 2003.

[6] J. Kim, K. Cheun, and S. Choi, "Unitary space-time constellations based on quasi-orthogonal sequences," IEEE Transactions on Communications, vol. 58, no. 1, pp. 35-39, 2010.

[7] V. Tarokh and I.-M. Kim, "Existence and construction of noncoherent unitary space-time codes," IEEE Transactions on Information Theory, vol. 48, no. 12, pp. 3112-3117, 2002.

[8] Y. Jing and B. Hassibi, "Unitary space-time modulation via Cayley transform," IEEE Transactions on Signal Processing, vol. 51, no. 11, pp. 2891-2904, 2003.

[9] J. H. Conway, R. H. Hardin, and N. J. Sloane, "Packing lines, planes, etc.: packings in Grassmannian spaces," Experimental Mathematics, vol. 5, no. 2, pp. 139-159, 1996.

[10] L. Peng and D. Fu, "Antipodal demodulation method and antipodal demodulator for non-coherent unitary space-time modulation in MIMO wireless communication," Patent Number US 8, 879, 660 B1, November 2014.

Li Peng, (1,2) Dacong Hu, (3) Lin Zhang, (3) and Zhen Qin (3)

(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; pengli@hust.edu.cn

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

Academic Editor: Lixin Gao

Caption: Figure 1: The distance distribution of the searching orthogonal constellation with the minimum distance [d.sub.min] = 0.8.

Caption: Figure 2: The distance distribution of the searching orthogonal constellation with the minimum distance [d.sub.min] = 0.8376.

Caption: Figure 3: The distance distribution of the algebraic orthogonal constellation with the minimum distance [d.sub.min] = 0.7321.

Caption: Figure 4: The performance comparisons between two searching orthogonal constellations and an algebraic orthogonal constellation for two cases with one and two receive antennas.
COPYRIGHT 2017 Hindawi Limited
No portion of this article can be reproduced without the express written permission from the copyright holder.
Copyright 2017 Gale, Cengage Learning. All rights reserved.

Article Details
Printer friendly Cite/link Email Feedback
Title Annotation:Research Article
Author:Peng, Li; Hu, Dacong; Zhang, Lin; Qin, Zhen
Publication:Journal of Computer Networks and Communications
Article Type:Report
Date:Jan 1, 2017
Words:6054
Previous Article:Energy Efficient Secure Trust Based Clustering Algorithm for Mobile Wireless Sensor Network.
Next Article:An Architecture for Anonymous Mobile Coupons in a Large Network.
Topics:

Terms of use | Privacy policy | Copyright © 2021 Farlex, Inc. | Feedback | For webmasters