A Construction of a Space Time Code Based on Number Theory
|
|
- Della Chambers
- 5 years ago
- Views:
Transcription
1 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 48, NO. 3, MARCH A Construction of a Space Time Code Based on Number Theory Mohamed Oussama Damen, Associate Member, IEEE, Ahmed Tewfik, Fellow, IEEE, and Jean-Claude Belfiore, Member, IEEE Abstract We construct a full data rate space time (ST) block code over = transmit antennas and = symbol periods, and we prove that it achieves a transmit diversity of over all constellations carved from [ ]. Further, we optimize the coding gain of the proposed code and then compare it to the Alamouti code. It is shown that the new code outperforms the Alamouti code at low and high signal-to-noise ratio (SNR) when the number of receive antennas. The performance improvement is further enhanced when or the size of the constellation increases. We relate the problem of ST diversity gain to algebraic number theory, and the coding gain optimization to the theory of simultaneous Diophantine approximation in the geometry of numbers. We find that the coding gain optimization is equivalent to finding irrational numbers the furthest from any simultaneous rational approximations. Index Terms Block codes, diversity methods, lattices, maximum-likelihood (ML) decoding. I. INTRODUCTION The large capacity of multiple-antenna systems and the desire to transmit at higher data rates with better performance over wireless channels have motivated much research on signal processing over multiple transmit receive antennas [] [4]. A higher data rate can be achieved by transmitting symbols simultaneously from M transmit antennas []. In a fading environment, where the receiver cannot recover an information symbol affected by a deep fade, one improves the performance by providing the receiver with different replicas of the transmitted symbols. This can be done with multireceive antennas with sufficient spacing so that the fades over each receiver are independent from the fades on the other receivers. The diversity can also be obtained at the transmitter by spacing the transmit antennas sufficiently and introducing a code between the transmitted symbols over M transmit antennas (space) and T symbol periods (time) [], [3]. Improving the performance over wireless channels can be done by transmit and/or receive diversity techniques [], [3], [5]; in a system of M transmit and N receive antennas the maximum achievable transmit diversity is M and the total achievable diversity is MN. In [4], a multiantenna prototype, called Vertical Bell Labs Layered Space Time (V-BLAST), with a very high spectral efficiency is proposed, but the detection algorithm proposed in [4] does not fully exploit the receive diversity. In [6], Damen et al. exploited the lattice representation of a multiantenna system in order to apply the sphere decoder and fully exploit the receive diversity giving a large improvement over [4]. Alamouti [] proposed a space time (ST) block code of rate symbol per channel use (PCU) that achieves Manuscript received February, 00; revised September 5, 00. M. O. Damen is with the Department of Electrical and Computer Engineering, University of Alberta, ECERF W-073, Edmonton, AB T6G V4, Canada ( damen@ee.ualberta.ca). A. Tewfik is with the Department of Electrical and Computer Engineering, University of Minnesota, Minneapolis, MN USA ( tewfik@ece.umn. edu). J.-C. Belfiore is with the COMELEC Department, Ecole Nationale Supérieure des Télécommunications (ENST) de Paris, 75634, Paris Cedex 3, France ( belfiore@com.enst.fr). Communicated by G. Caire, Associate Editor for Communications. Publisher Item Identifier S (0) a N diversity for M = transmit and N receive antennas, and has a linear processing optimal decoder. The latter scheme has been generalized for M in [3], where it has also been proved to be the unique scheme of rate one symbol PCU using complex constellations and linear decoder; for some other values of M >, ST codes have been proposed with rates of = and 3=4 symbol PCU. In [5], Damen et al. proposed a different approach to exploit the transmit diversity using rotated constellations and the Hadamard transform. The latter codes achieve the diversity MN and have a rate of one symbol PCU over real or complex constellations for M =or multiple of 4. The decoder used in [5] is the sphere decoder. However, for most values of M and N, the codes proposed in [], [3], [5] have small rates compared to the actual capacity of multiantenna systems []. In [7], ST codes with higher data rates than the ST codes in [], [3], [5] were proposed. However, the so-called linear and dispersive (LD) ST codes [7] do not necessarily satisfy the construction criteria in [8], [3]. In this correspondence, we relax the constraint of linear processing decoder and we propose an ST code for two transmit antennas which achieves the maximum transmit diversity [8], [3], and has a transmission rate of two symbols PCU. We present a comprehensive study of the proposed ST code properties based on number theory. It is shown that due to the lattice structure of the code, the maximum-likelihood (ML) decoder has a moderate complexity. The correspondence is organized as follows. In Section II, we give the system model and recall the construction criteria of block ST codes in [8], [3]. In Section III, we give preliminary definitions and results from number theory, which we will use to construct our ST code. Section IV describes the properties of the proposed ST code, where we prove it to satisfy the construction criteria in [8], [3] without data rate reduction. We consider the decoding in Section V. In Section VI, we give further results from number theory, where we relate the optimization of the coding gain of the proposed code to the simultaneous Diophantine approximation. Before concluding the correspondence, we give some simulation results in Section VII. II. PROBLEM FORMULATION Consider an information symbol vector s =(s;...;s q ) T ;q, where s j ;j=;...;q, belongs to a given constellation (pulse-amplitude modulation (PAM), quadrature-amplitude modulation (QAM), or phase-shift keying (PSK)). A block ST code associates with each information symbol vector s an M T matrix B(s) where M encoded symbols b mt (m = ;...;M) are transmitted simultaneously from all transmit antennas at time t (t =;...;T). There is a one-to-one correspondence between the information symbol vector s and B(s). When there is no confusion, we denote the block ST code by B. We normalize the transmitted power by M so that the total transmitted power is independent of M. At time t and over the nth receive antenna, one has M x nt = h nmb mt + wnt () m= where h nm are the fades between transmit antenna m and receive antenna n, and are assumed to be independent and identically distributed (i.i.d.) zero-mean complex Gaussian random variables with variance 0:5 per real dimension, and fixed during T time periods (quasi-static fading). w nt are assumed to be independent samples of a zero-mean complex Gaussian random variables with variance per dimension. Let X be the N T received signal matrix; H the N M channel matrix; and W the N T noise matrix. One has X = HB + W : () /0$ IEEE
2 754 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 48, NO. 3, MARCH 00 Over a quasi-static fading, minimizing the pairwise error probability (PEP) of the ML detection of s given that s 6= s has been sent is equivalent to satisfying [8], [3]. The Rank Criterion: The minimum rank r of B(s )0B(s ) taken over all distinct pairs (s ;s ) is the diversity gain and should be maximized. The Determinant Criterion: Let A = B(s ) 0 B(s ), then r the minimum of ( j= j )=r, taken over all distinct codeword pairs, is the coding gain and must be maximized, where j ;j=r; are the nonzero eigenvalues of AA H, with A H denoting the conjugate transpose of matrix A. For example, the Alamouti scheme is given by [] s 0s 3 B = G = s s 3 (3) where s ;s are complex information symbols (PSK, QAM), and s 3 denotes the complex conjugate of s. The code (3) satisfies the criteria above; in fact, its coding gain is A = js j + js j > 0: (4) min (s ; s )6=(0; 0) The ST code (3) transmits at a rate of one symbol PCU, and due to the orthogonality of the columns of G, The metric for ML decoding can be produced by linear processing []. III. AN ST CODE BASED ON NUMBER THEORY Before the construction of our ST code we give hereafter some necessary definitions from number theory [9] []. A. Preliminary Definitions From Number Theory Let ; ; ; and denote, respectively, the ring of rational integers, the field of rationals, the field of reals, and the field of complex numbers, and let i = p 0. Also, let [i] denote the ring of complex integers and let (i) denote the field of complex rational. Definition : Let. Then is called an algebraic number if there exists a polynomial P [X] such that P () = 0. We call an algebraic integer if, in addition, one can choose P to be monic (i.e., with leading coefficient equal to ). For algebraic, there exists a unique irreducible polynomial (X) [X] with leading coefficient which has as a root. We call (X) the minimal polynomial of. The degree of ; n is defined to be the degree of (X).If is complex, one can also define (X) over [ix]. Example : Let = e i=4. Then is a root of the irreducible polynomial (X) =X 4 + [X]. The degree of over is 4 and one has 4 = 0. The minimal polynomial of over [ix] is given by (X) =X 0 i, and has a degree over (i). Definition : We define the height of a polynomial P (X) [X] as the maximum modulus of its coefficients. Suppose that (X) [X] is the minimal polynomial of the algebraic number. If we multiply (X) by the least common multiple of the denominators of its coefficients, we obtain a primitive polynomial 0 (X) [X] such that 0 () =0(a polynomial in [X] is called primitive if there is no integer greater than which divides all of its coefficients). Then the height of is defined to be the height of 0 (X). It is easily seen that for algebraic, there exists an integer r>0such that r is an algebraic integer. Example : Take = e i=4 with (X) =X 4 + [X]. (X) [X] and it is primitive, so the height of equals. Definition 3: An algebraic number field is a field containing which, considered as a -vector space, is of a finite dimension. The dimension of over is called the degree of over and is denoted by [ : ]. It can be proved that given an algebraic number field of degree [ : ] over, then there exists an algebraic number of degree n = [ : ] such that = (). Such a number is called a primitive element. The set f; ;...; n0 g generates () and is called a basis of (). Each element (), has a unique representation n0 = r() = a l l with a l ;l=0n0. The roots of (X); = ; ;...; n are called the conjugates of. We define the size of = r() () as jj = max jn jr( j )j. Example 3: The roots of X 4 + are = e i=4 ; = 0e i=4 ; 3 = ie i=4 ; and 4 = 0ie i=4. The roots of X 0 i are = e i=4 and = 0e i=4. The algebraic number field generated by is l=0 () =fa + b + c + d 3 ;a;b;c;d when is considered as an extension of. = (i; ) =fe + f; e; f (i)g when is considered as an extension of (i). The set f; ; ; 3 g is a basis of = () over and the set f; g is a basis of = (i; ) over (i). Definition 4: If is not algebraic it is called transcendental. Example 4: = e; = e i ; and = are transcendental (Hermite, Lindemann) [9, p. 47]; but = e ik=n ;k;n is algebraic (Hermite) [9, Ch. ]. B. Code Construction In order to transmit at a full data rate and also satisfy the construction criteria [8], [3], we propose the following ST code: s + s (s 3 + s 4 ) B ; = p (5) (s 3 0 s 4 ) s 0 s with = and = e i, such that is a real parameter to be optimized. We suppose that the information symbol vector s = (s ;...;s 4 ) T belongs to a (TM = 4)-dimensional constellation C carved from [i] 4 (QAM, or PAM). We note that hereafter we use the Cartesian product sign in order to denote multidimensional constellations, while when using a specific constellation of size q, we put q before the constellation name; for example, if we have four symbols s ;...;s 4, such that each one belongs to the constellation S = q-qam, then s = (s ;...;s 4) T C = S 4 = q-qam 4. Independent of C, the coding gain over [i] 4 of our ST code (5) is B () = inf s6=(0;0;0;0) [i] = = inf s6=(0;0;0;0) [i] inf s6=(0;0;0;0) [i] det B ; B H ; = g s 0 s 3 0 s + s 4 3 T ~s (6) where ~s =(s ; 0s3; 0s;s 4) T ; =(;; ; 3 ) T. Over a finite constellation C [i] 4, the coding gain of B ; is C B() = min s=(=)(s 0s );s 6=s C T ~s B () (7) where multiplying the vector (s 0 s ) by = denotes the multiplication of each component of the vector by =. This is performed for normalization purposes. The inequality C B() B() is due to
3 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 48, NO. 3, MARCH C [i] 4. Our aim is to maximize B() C (maximum transmit diversity and coding gains) for every C [i] 4. IV. CODE PROPERTIES A. Primary Results on Diversity and Coding Gain We discuss in this section the choice of such that the ST code B ; has a maximum transmit diversity over all constellations carved from [i] 4. Proposition : ) If is an algebraic number of degree 4 over (i) then one guarantees the maximum transmit diversity over all constellations carved from [i] 4. ) If is an algebraic number of degree < over (i) then there exists a constellation C [i] 4 such that B() C =0. Proof: Let be an algebraic number of degree 4 over (i), then f; ; ; 3 g is a basis of (i; ) and, therefore, it is a free set, i.e., if 3 j=0 a j j =0; for a j (i); j=0;...; 3 then a 0 = a = a = a 3 =0. This guarantees that B() C 6= 0for all constellations carved from [i] 4. Now, suppose that the degree of <. Then there exists a polynomial of degree over (i) which has as a zero. Let (X) =X + p q [ix] be such a polynomial. Then = 0 p q (i), and hence = p q. There exist a finite constellation C [i] 4 that contains two vectors s =(p; q; 0; 0) 6= s (0p; 0q; 0; 0) such that (=)(s 0 s )= (p; q; 0; 0) T. Substituting in (7) gives C B() jp 0 q j =0: Example 5: Take = e i=8 then the minimal polynomial over (i) equals (X) =X 4 0 i, and is of degree 4. Hence, one guarantees that there are no linear combinations from (i) among the set of numbers f; e i=8 ;e i=4 ;e 3i=8 g, since this set is a basis of (i; ). The coding gain obtained for this value of equals 0:304 for C = 4-QAM 4. Example 6: Let =, and let C =4-QAM 4 be a constellation that contains the two vectors and Substituting s =(+i; +i; +i; +i) T s =(0+i; 0 +i; +i; +i) T : s =(=)(s 0 s )=(; ; 0; 0) T in (7) yields B() C j0 j =0. The first condition in Proposition is sufficient for the maximum transmit diversity, while the second condition is a necessary one. One cannot say much about algebraic numbers of degrees and 3. However, since in (6) one has only a linear combination of f; ; ; 3 g by sj ;j=;...; 4, with s j [i], one has the following result. Proposition : If is an algebraic number of degree over (i) and if (i), then one guarantees the maximum transmit diversity over all constellations carved from [i] 4. Proof: Let us suppose that there exists s 6= (0; 0; 0; 0) T [i] 4 such that ~s T =0 =s 0 s 3 0 s + s 4 3 0= s 0 s 0 s3 0 s4 : (8) Sincef; g is a free set over (i) and since (i), one has s 0 s =0 (9) and s3 0 s4 =0: (0) Since is of degree > ; is not a square in (i), i.e., there is no z z (i) such that = z z. Thus, in (9) one has s = s = s3 = s4 = 0 and therefore s = (0; 0; 0; 0) T which proves our proposition. Example 7: Let = e i=4 of degree over (i). One has = i (i), which is not a square in (i) since p i = p +i p does not belong to (i). It yields that B ; has a maximum transmit diversity over all constellations carved from [i] 4. For C = 4-QAM 4 and C = 6-QAM 4, we maximize C B() by computer search over varying from 0 to = with a step size of 0:00. The maximum coding gain for C = 4-QAM 4 is attained for = e i= and equals 0:369.ForC = 6-QAM 4 the maximum coding gain is attained for = e 0:5i and equals 0:059. Note that C B decreases when the size of the constellation increases (see Section VI). For example, C B(e i= )=0:037, and C B(e i=8 )=0:006 for C = 6-QAM 4.Itis noted that = e i=4 presents a local maximum of the coding gain for C = 4-QAM 4 and C = 6-QAM 4, with coding gain values of 0:0858 and 0:07, respectively. We note that for a four-dimensional constellation C with a very high spectral efficiency (where the size of the constellation #(C) ) the maximization of C B() by computer search is very complex. This, along with the perspective of the generalization of our scheme to more than two transmitters, motivates the research of algebraic techniques for choosing (see Section VI). B. Mutual Information We write the received signal () when using (5) with SNR equal as X = M HB ; + W x = vec (X) = = M M H 0 NM 0 NM H 8s+ vec (W ) Hs + w () where vec(x) arranges the matrix X in one column vector by putting its columns one after the other, 0 NM is an N M matrix with entries 0, and w = vec(w ) is a N column vector which represents the additive white Gaussian noise (AWGN). The noise vector w is component-wise independent with variance =0:5 per real dimension. The channel H is modeled as in () and H is a new N M channel matrix with 88 H = I M. 8 = p Definition 5: We say that the ST code B is information lossless if the capacity of the new precoded channel, H, obtained by considering
4 756 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 48, NO. 3, MARCH 00 the ST code as a part of the channel, has the same capacity of the original channel H. The difference between the capacities of the new and original channels represents the information loss of the ST code. The information loss can be measured either in bits PCU at a given SNR (decibels) or in decibels at the given spectral efficiency (bits PCU). The capacity of the new channel () is [], [7] C B (; N) = max E trr =M log det I N + M HR s H H () where R s is the covariance matrix of s, and the multiplicative factor = is for the normalization of the capacity PCU (T =). Proposition 3: The code B ; (5) is information lossless, where the capacity of the new channel in () equals C B (; N )=E log det IN + M HHH : (3) Proof: The proof is direct when computing () with R s = I M which maximizes the mutual information [7], [] C B (; N )= E log det I N + M HHH = E log det I N + M HHH where one uses the equality det diag I N + M HHH ;I N + to justify the second equation in (4). = E log det I N + M HHH (4) M HHH = det I N + M HHH The capacity of the new precoded channel of the code G equal to the capacity of an equivalent multiantenna system with M =N transmit and one receive antenna with an SNR scaled by N [7], [] C G (; N )=C(N; N; ) C(; ; N) (5) where C(; M; N ) is the channel capacity for SNR =, over M transmit and N receive antennas. The inequality in (5) becomes strict when N > [7]. When N =, both ST codes B ; and G are information lossless, but G outperforms B ; since the former ST code has a better coding gain ( compared to 0:369 for 4-QAM). When N>, Proposition 3 states that the Alamouti code has an information loss compared to the ST code B ; by virtue of C(N; N; ) <C(; ; N) (5). This also allows us to state that the information loss increases with N. Computing the quantities in (4) and (5), one obtains that the Alamouti code has an information loss of about.6 db compared to the code B ; at a spectral efficiency of 4 bits PCU when N =receive antennas. When N =0, the information loss of the Alamouti code is approximately 3.7 db at a spectral efficiency of 4 bits PCU, and it is more than 0 db at a spectral efficiency of 6 bits PCU. It is worth noting that the information loss gives a good approximation of the difference in performance between G and B ; obtained in Section VII, since both codes achieve the maximum transmit diversity. Note that when considering the information loss, an ST code can only worsen things or at most be harmless. The role of ST codes is to provide transmit diversity, and/or to simplify the ML decoding by introducing structure in the new channel matrix as done by the Alamouti code or the codes from orthogonal design [3]. When N =,we are in the lucky situation where the Alamouti code is information lossless, while achieving the maximum transmit diversity and coding gains. However, as it is impossible to have information lossless ST codes from Fig.. The ST code B versus the Alamouti scheme and the code LD with N = receive antennas. orthogonal design when N> [3], [7], the ST code B ; is an advantageous alternative to the Alamouti code since it is information lossless and it achieves the maximum transmit diversity with optimized coding gain. The drawback of using the code B ; is the increase of the decoding complexity. Remark : Note that the ST code B ; can be obtained from the code LD [7] (and vice versa) by means of a unitary transformation s 0! 9s with 9 = diag(; ;;) (6) with and as in (5). Both ST codes B ; and LD are information lossless. The difference with [7] is that our ST code satisfies also the rank and determinant criteria [8], [3] which boosts the performance of B ; compared to the code LD [7] (see Fig. ). Note that the code LD equal to B ;, with =. As noticed in Example 6, the code LD does not satisfy the rank and determinant criteria. C. Constellation Shape We study here some practical properties of the ST code (5). Over the first transmit antenna and the first time interval and also the second transmit antenna and the second time interval, the code B ; transmits signal points from Q = p fs + s ;s ;s Sg (7) where S can be QAM or PAM modulation. Over the first transmit antenna and the second time interval and also the second transmit antenna and the first time interval, the code B ; transmits signal points from Q = fs; s Qg, with = = e i. While the average transmitted energy of the original constellation S is preserved when using the code B ;, the dynamic range of each transmitted symbol increases considerably. A high dynamic range may cause operating in the nonlinear region of power amplifiers due to a high peak-to-average power ratio (PAPR). We note the similarity of our problem with that of multicarrier transmission (orthogonal frequency-division multiplexing; OFDM) where one reduces the PAPR by the use of concatenating error
5 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 48, NO. 3, MARCH correcting codes (see for example [3] and [4] and references therein). The use of similar techniques as in OFDM to reduce the PAPR for the code B ; is under investigation. V. DECODING Consider the received signal (). Assuming that there is sufficient spacing between each of the M transmit antennas (and likewise between each of the N receive antennas), it can be proved that the new channel matrix H is almost surely (a.s.) full rank. The latter property allows to apply the sphere decoder on the real representation of () for N, which can be seen as a lattice point in TN [6]. The principle of the sphere decoder is to limit the minimization of the ML metric to the lattice points enclosed inside a sphere of radius C. It takes advantage of the regular lattice structure in order to enumerate the lattice points enclosed by the sphere. Each time a lattice point is found inside the sphere, one decreases the sphere radius accordingly [6], [5]. The sphere decoder reaches ML performance and has a polynomial complexity in TM, linear in N and nearly independent of the rate [6], [5], [6]. For N =, one can apply the generalized sphere decoder and reaches near ML performance, but with an additional complexity proportional to the square of the constellation size [7]. When the number of receive antennas N M =, one can use a suboptimal scheme based on successive interference cancellation (SIC) such as [4], [8] to perform the decoding of (). Because in such a situation, the performance of the suboptimal scheme approaches the ML decoding performance with a lower complexity [4], [8]. VI. RELATING THE PROBLEM OF MAXIMIZING THE CODING GAIN TO NUMBER THEORY AND LATTICES Here, we relate the maximization of B() C (7) to the simultaneous Diophantine approximation of complex numbers by algebraic numbers. This will allow for the derivation of lower and upper bounds on B(). C Next, we relate the considered problem to lattices, and propose a heuristic approach to choose when the size of the constellation is very large. The interested reader might consult [9, Ch. ], [0, Ch. 5], or [, Ch. ]. First, let us define the quantity = s 0 s3 0 s + s4 3 (8) for s j [i]; j=;...; 4 and algebraic of degree n. By definition, B() C is the minimum of (=) over s =(s ;...;s 4) T =(=)(s 0 s ); s 6= s C: Number theory allows us to determine how small we can make in terms of and the amplitudes and degrees of s ;...;s 4. Thus, one expects to determine the order of magnitude of C B() in terms of and C. Let us recall that our aim is to choose that maximizes the minimum of over a given four-dimensional constellation C. A. Number Theory Definitions and Results Definition 6: The Simultaneous Diophantine Approximation: Given rationals ;...; n ;> 0, and an integer > 0, decide if there exist integers p ;...;p n and an integer q> 0 such that q and jq j 0 p jj <for j =;...;n. Since is everywhere dense in, it follows that the above approximation can be made as close as necessary. Thus, it makes sense to consider its relative closeness, and especially to answer the question how small can we make the integer q. A closely related problem is the following [0]. Definition 7: The Small Linear Form Problem: Given rationals ;...; n; > 0, and an integer > 0, find integers p ;...;p n, not all 0, such that jp jj for j = ;...;nand j p + + n p n j <. Similarly, one can consider the approximation of complex numbers by algebraic numbers, which is our case of interest in this correspondence. Given z, we consider jz 0 j with algebraic. Since the field of algebraic numbers is everywhere dense in, it follows that z can be approximated arbitrarily closely by algebraic. The approximation theory provides the order of this closeness jz 0 j, which depends on the considered (). One has the following theorem which is a generalization of Liouville s theorem over real numbers [9, pp. 3 3]. Theorem : If is an algebraic number of degree n and height h, then for any 6= algebraic of degree k and height H, one has j 0 j > 3 k(n0) h kn (h +) k (h +3) k H n : (9) The generalized Liouville s theorem is a necessary condition for a number to be algebraic. It proves that the numbers in which are algebraic are not very well approximated by other algebraic numbers. The restriction of Theorem over allows one to show that the irrational quadratic numbers have the worst order of approximation by rationals p q. It is worth mentioning that in this case, a well-known approach to determine the order of approximation of irrational numbers by rationals is the theory of continued fractions [9]. Definition 8: A continued fraction expansion of is given by = a 0 + a + a + Another way of writing the above expansion of is : (0) =[a 0 ; a ;a ;...] () where a j ;j=0; ; ;...; are called the quotients of the continued fraction expansion of. The expansion of to the order k, i.e., [a 0; a ;...;a k ] is called the kth-order convergent of. It is clear that if then its continued fraction expansion is finite (i.e., a j = for some j). On the other hand, is not well approximated by a rational if a j;j, are all relatively small [0]. The generalized Liouville s theorem gives a lower bound on the approximation of algebraic by another 6= algebraic, which can be considered as one-dimensional Diophantine approximation. The following result, which is based on Liouville s theorem, gives a lower bound on the simultaneous approximation of algebraic numbers by other algebraic numbers [9, p. 34]. Theorem : Suppose that ;...; m are algebraic numbers, and n is the degree of the algebraic number field () that contains these numbers. Then for any polynomial P (X ;...;X m) [X;...;X m] with degree k and height H, either P ( ;...; m )=0or else c k jp ( ;...; m)j () H n0 with c constant depending only on j;j=;...;m c = r n c n0 (3) 0 with r> 0 as an integer such as r j is an algebraic integer for j = ;...;m;and c 0 =+ m j= j jj
6 758 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 48, NO. 3, MARCH 00 with j jj as the size of the algebraic number j;j=;...;m(see Definitions 3). We have only considered until now the behavior of algebraic numbers when approximated by other algebraic numbers. The following theorem concerning the behavior of transcendental numbers is due to Lindemann [9, pp. 5 7]. Theorem 3: If ;...; m are distinct algebraic numbers, and if c ;...;c m are algebraic numbers not all equal to zero, then m l= c l e 6=0: (4) Lindemann also showed that if is an algebraic number 6= 0, then e is transcendental. B. Further Results on Diversity and Coding Gain In view of Theorem 3, one obtains the following result. Proposition 4: A maximum transmit diversity of B ; can be guaranteed by choosing = e i with 6= 0algebraic ( is transcendental). In particular, = e i= and = e 0:5i,guarantee a maximum transmit diversity over all constellations carved from [i] 4. Proof: Let 6=0be an algebraic number, then f0; i; i; 3ig are distinct algebraic numbers. Applying the Theorem of Lindemann on f;; ; 3 g with = e i, yields that if 3 j=0 a j j =0 with a j ;j = 0;...; 3 algebraic, then a 0 = a = a = a 3 = 0. This yields that B() C 6= 0for every C [i] 4, which proves our proposition. Having a maximum transmit diversity does not prevent B C from vanishing when the size of the constellation #(C) increases since (i) is everywhere dense in. Hence, we want to find such that B() C decreases as slowly as possible when the size of the constellation #(C) increases. With respect to Theorem we obtain the following. Proposition 5: For s j [i]; j = ;...; 4, not all zero, and algebraic integer of degree n>3over (i) = s 0 s 3 0 s + s js j j j= 3(n0) : (5) Proof: Let s j [i]; j=;...; 4 and algebraic integer of degree n>3over (i) such that s ;...;s 4; (i; ) of degree n over (i). Note that due to Galois theorem [] (i; ) is of degree n over. Furthermore, let with c as a constant depending only on s ;...;s 4;. Note that = jp (s ;s ;s 3 ;s 4 ;)j. Due to Proposition, one guarantees that P (s ;...;s 4 ;) 6= 0since n>3. Hence c k = (8) r nk c k(n0) 0 where r > 0 an integer such that rs j is algebraic integer for j = ;...; 4 and r is algebraic integer. c 0 =+ 4 j= js jj + jj (see Definitions 3). Since s ;...;s 4 ; are algebraic integers, one obtains r =. Since s j [i], one has that the size of s j equals js jj = js jj for j = ;...; 4. The size of equals over the basis f; ; ; 3 g. Finally, substituting in (8) one proves the Proposition. As a corollary of Proposition 5 one has the following. Corollary : Given an algebraic integer of degree n > 3 over (i), and given a constellation C with One has = max s=(s ;...;s ) (js j j;j=;...; 4): C B C : (9) ( + 4) 3(n0) Corollary shows that we can make the vanishing of B C slow as the size of C increases by choosing algebraic with the smallest possible degree n. Proposition tells us that the degree of over (i) should be at least. Heuristically, by combining Proposition and Corollary, one prevents B C 6= 0from vanishing rapidly when #(C) increases by choosing algebraic with the smallest degree such that B C 6= 0. It is somewhat surprising that the maximum of B C over the constellation C = 4-QAM 4 is achieved by = e i= transcendental. Nevertheless, number theory guarantees a lower bound on the shrinking of B() C for algebraic; while there is no such guarantee in the case when is transcendental. The latter observation is confirmed by computer search where B(e C i= ) drops from 0:369 for C = 4-QAM 4 to 0:037 for C = 6-QAM 4 (7.3 times); B(e C i=8 ) drops from 0:304 for C = 4-QAM 4 to 0:006 for C = 6-QAM 4 (.3 times); finally, B(e C i=4 ) drops from 0:0858 for C = 4-QAM 4 to 0:07 C = 6-QAM 4 (3.5 times). C. Relation to Lattices We note briefly here the relation between maximizing the coding gain of our ST code and the problem of finding nonzero short vectors in a given lattice []. First, let us define the quantity C B = min j T sj: (30) s=(=)(s 0s );s 6=s C It is easily seen that for a given constellation C 0 [i] 4 there exists CC 0 [ s ;...;s 4 T ; (s ;...;s 4 ) T C 0 P (X ;...;X 5 ) = X 0 X 3 X 5 0 X X 5 + X 4 X 3 5 [X ;...;X 5]: (6) such that C B C B : (3) The degree of P (X ;...;X 5 ) is k 3 and its height H =.By Theorem, either P (s ;...;s 4;)=0, or else jp (s ;...;s 4 ;)j ck H n0 (7) Hence, finding that guarantees an acceptable value of C B ensures a good value of C B. Based on the above discussion we propose a heuristic approach to find with C B() not too small for #C, or for an eventual generalization of our scheme to more than two transmit antennas.
7 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 48, NO. 3, MARCH ) As a necessary condition, should be chosen such that f ;; g are not well approximated by rational complex numbers with small denominators. Because from (6) we develop the following upper bounds on B : B min (s ;...;s )6=(0;0;0;0) [i] min (s ;...;s )6=(0;0;0;0) [i] min (s ;...;s )6=(0;0;0;0) [i] s 0 s 3 (s = s 4 =0) s 0 s (s 3 = s 4 =0) s + s 4 3 (s = s 3 =0) (3) so if any of f ;; g can be well approximated by a rational complex number, the coding gain vanishes rapidly. ) Given =(;; ; 3 ), test the value of C B using the sphere decoder to search the shortest nonzero vector in the lattice generated by A = I 4 p (; ; ; 3 ) with being the maximum absolute value taken by the symbols from the considered constellation. I 4 is the identity matrix of dimension 4. This step gives a good approximation of C B() []. In fact, the lattice generated by A is 3 = fu = As; s [i] 4 g 5 which can also be seen as a subset of A 54 as <(A) =(A) 0=(A) <(A) 0 upon representing and representing u and s as (<(u); =(u)) T and (<(s); =(s)) T, respectively, where <( ) and =( ) are the real and imaginary operators. The norm square of a vector u 3 equals kuk = 4 j= js j j + 4 j= s j j Hence, the shortest nonzero vector in the lattice 3 guarantees a small value of 4 s j j j= which gives a good approximation of C B() (30). This simplifies slightly the problem of maximizing the coding gain when the size of the constellation increases. Because we know that step ) can be approached in two ways. One may choose algebraic with small degree and small height (Liouville s thereom). Some interesting numbers satisfying the above constraints are the cyclotomic numbers which are the nth roots of unity n = e i=n (such as e i=8 or e i=4 ) []. The minimal polynomial of n over is (X) = j<n; GCD(n; j)= : X 0 j n with GCD(n; j) the greatest common divisor of n and j. The degree of n over equals (n), the Euler function [], which represents the number of integers j < n such that GCD(n; j) =. Or one may choose transcendental such as the quotients of its continued fraction expansion are bounded [9]. The advantage of step ) above is that the sphere decoder is an efficient algorithm nearly independent of the constellation size. Thereby, one can guarantee acceptable values of C B() for C with very large size. We used step ) above to compute C B for C with different values of. We have found that C B(), with = e i=8, is always a local maximum for = ; 4; 00, which confirms our results in Section VI-B. Note that e i=8 gives an acceptable value of B C for C = 4-QAM 4 and C = 6-QAM 4. We note also that C B(e i=4 )=0, because ie i=4 = 0i. It is an interesting approach to see the design of ST encoding as searching irrational numbers the furthest from rational approximations. On the other hand, the decoding process is equivalent to searching rational integers the closest to irrational numbers; and both encoding and decoding can be approached by the same algorithm (sphere decoder) of searching nonzero short vectors in a given lattice. Remark : The real rotation obtained in [0] in order to maximize the minimum product distance defined as d p; min = min (s ;s )6=(0;0) fjy ky j; y =sg can also be considered as a one-dimensional Diophantine approximation. One has Hence, d p; min = = min (s ;s )6=(0;0) : (33) fjs + s k0s + s jg: Note that by choosing not to be well approximated by a rational number s one maximizes d s p; min. It has been shown by Shokrollahi in [] that when using the rotation (33) with a differential diagonal double antennas ST code, one optimizes the so-called diversity product (d p; min ) by choosing opt = n g = + p 5. Indeed, opt = n g is found by computer search to maximize d p; min over the binary phase-shift keying (BPSK) constellation in [0] and over the 6-PAM constellation in []. We note that the Golden number n g is in a sense the furthest real number from any rational approximation. In fact, the continued fraction expansion quotients of n g are [; ; ;...], and hence n g is the irrational number the most poorly approximated by rational fractions [9, p. 36]. We also note that the rotation in (33) is used for the diagonal algebraic ST code of rate one symbol PCU over M =transmit antennas along with Hadamard transform in [5]. VII. SIMULATIONS RESULTS The channel is modeled as () (); we compare the ST code B ; (with = e i= for 4-QAM, = e 0:5i for 6-QAM, and = e i=4 for 56-QAM) with the Alamouti scheme and the code LD, at the same spectral efficiency and the same average transmitted power. The sphere decoder is used to decode both ST codes B ; and LD. The number of receive antennas equals N =in Fig. and N =0in Fig.. In both figures, we plot the average bit-error rate as a function of SNR. Fig. shows that the code B ; outperforms the Alamouti code at low and high SNR. For example, at a spectral efficiency of 8 bits PCU, ST code B ; shows about.5-db gain over the Alamouti code. At a spectral efficiency of 8 bits PCU, the code LD has a better performance than the Alamouti code for SNR 33 db. This is due to the information loss of the Alamouti code. Note that the slope of the
8 760 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 48, NO. 3, MARCH 00 Fig.. The ST code B versus the Alamouti scheme with N = 0 receive antennas. LD curves are different from the Alamouti code and B ;, because LD does not satisfy the rank and determinant criteria [8], [3], thus, for relatively high SNR, the Alamouti code becomes better. On the other hand, the code B ; satisfies all the desired criteria, and has a better performance than both the Alamouti code and the code LD at low and high SNR. In Fig., for N =0and at a spectral efficiency of 6 bits PCU our scheme has a gain of more than 0 db over the Alamouti code. We also notice the difference in performance is enhanced when N or the spectral efficiency increases, which is confirmed by the information loss of the Alamouti code (see Section IV). It has been observed that small changes of imply small changes of the error probability curves as long as one chooses to guarantee the maximum transmit diversity. Nonetheless, the problem of searching that maximizes the coding gain is very interesting from the theoretical point of view. As for optimizing the performance of the scheme, one notes that the main role is played by the sphere decoder which reaches the ML detection performance of the proposed code with a moderate complexity, and in most cases, has a dramatic improvement over suboptimal detection schemes [6]. This emphasis on the importance of the sphere decoder is true for many high-rate linear ST codes such as the codes in [5] [7]. VIII. CONCLUSION We have proposed a new ST code over two transmit and N receive antennas which maximizes the transmit diversity and the coding gain. The proposed code is information lossless, and is shown to largely outperform the Alamouti code when N. Due to the lattice structure of the proposed code, the ML decoding can be performed at a moderate complexity using the sphere decoder. Tools from algebraic number theory and the geometry of numbers were used to optimize the diversity and coding gains of the proposed code. REFERENCES [] S. M. Alamouti, A simple transmit diversity technique for wireless communications, IEEE J. Select. Areas Commun., vol. 6, pp , Oct [] I. E. Telatar, Capacity of multi-antenna Gaussian channels, Europ. Trans. Telecommun., vol. 0, pp , Nov [3] V. Tarokh, H. Jafarkhani, and A. R. Calderbank, Space time block codes from orthogonal designs, IEEE Trans. Inform. Theory, vol. 45, pp , July 999. [4] G. D. Golden, G. J. Foschini, R. A. Valenzuela, and P. W. Wolniasky, Detection algorithm and initial laboratory results using V-BLAST space time communication architecture, IEE Electron. Lett., vol. 35, pp. 4 6, Jan [5] M. O. Damen, K. Abed-Meraim, and J.-C. Belfiore, Diagonal algebraic space time block codes, IEEE Trans. Inform. Theory, vol. 48, pp , Mar. 00. [6] M. O. Damen, A. Chkeif, and J.-C. Belfiore, Lattice codes decoder for space time codes, IEEE Commun. Lett., vol. 4, pp. 6 63, May 000. [7] B. Hassibi and B. Hochwald, Linear dispersion codes, in Proc. IEEE Int. Symp. Information Theory (ISIT 00), Washington, DC, June 00, p. 35. [8] J.-C. Guey, M. P. Fitz, M. R. Bell, and W.-Y. Kuo, Signal design for transmitter diversity wireless communication systems over Rayleigh fading channels, in Proc. Vehicular Technology Conf. (VTC 96), Atlanta, GA, Apr [9] A. B. Shidlovskii, Transcendental Numbers. New York: W. de Gruyter, 989. [0] M. Grötschel, L. Lovász, and A. Schrijver, Geometric Algorithms and Combinatorial Optimization. New York: Springer-Verlag, 988. [] H. Cohen, A Course in Computational Algebraic Number Theory. Berlin, Germany: Springer-Verlag, 993. [] S. Sandhu and A. Paulraj, Space time block codes: A capacity perspective, IEEE Commun. Lett., vol. 4, pp , Dec [3] J. A. Davis and J. Jedwab, Peak-to-mean power control in OFDM, Golay complementary sequences and Reed Muller codes, IEEE Trans. Inform. Theory, vol. 45, pp , Nov [4] K. Paterson and V. Tarokh, On the existence and construction of good codes with low peak-to-average power ratios, IEEE Trans. Inform. Theory, vol. 46, pp , Sept [5] E. Viterbo and J. Boutros, A universal lattice code decoder for fading channel, IEEE Trans. Inform. Theory, vol. 45, pp , July 999. [6] M. O. Damen, K. Abed-Meraim, and M. S. Lemdani, Further results on the sphere decoder, in Proc. IEEE Int. Symp. Information Theory (ISIT 00), Washington, DC, June 00, p [7] M. O. Damen, K. Abed-Meraim, and J.-C. Belfiore, Generalized sphere decoder for asymmetrical space time communication architecture, IEE Electron. Lett., vol. 36, p. 66, Jan [8] M. O. Damen, K. Abed-Meraim, and S. Burykh, Iterative QR detection for BLAST, Wireless Personal Commun., vol. 9, pp. 79 9, Dec. 00. [9] A. Khinchin, Continued Fractions. Chicago: Univ. Chicago Press, 964. [0] V. M. DaSilva and E. S. Sousa, Fading-resistant modulation using several transmitter antennas, IEEE Trans. Commun., pp , Oct [] A. Shokrollahi, Double antenna diagonal space time codes and continued fractions, in Proc. IEEE Int. Symp. Information Theory (ISIT 00), Washington, DC, June 00, p. 08. [] J. Boutros and E. Viterbo, Signal space diversity: A power and bandwidth efficient diversity technique for the Rayleigh fading channel, IEEE Trans. Inform. Theory, vol. 44, pp , July 998. ACKNOWLEDGMENT The authors are grateful to the anonymous reviewers for their helpful comments. M. O. Damen would like to thank Dr. B. Hassibi for pointing out Remark.
FULL rate and full diversity codes for the coherent
1432 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 51, NO. 4, APRIL 2005 The Golden Code: A 2 2 Full-Rate Space Time Code With Nonvanishing Determinants Jean-Claude Belfiore, Member, IEEE, Ghaya Rekaya,
More information4184 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 51, NO. 12, DECEMBER Pranav Dayal, Member, IEEE, and Mahesh K. Varanasi, Senior Member, IEEE
4184 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 51, NO. 12, DECEMBER 2005 An Algebraic Family of Complex Lattices for Fading Channels With Application to Space Time Codes Pranav Dayal, Member, IEEE,
More informationOn the Performance of. Golden Space-Time Trellis Coded Modulation over MIMO Block Fading Channels
On the Performance of 1 Golden Space-Time Trellis Coded Modulation over MIMO Block Fading Channels arxiv:0711.1295v1 [cs.it] 8 Nov 2007 Emanuele Viterbo and Yi Hong Abstract The Golden space-time trellis
More informationAchieving the Full MIMO Diversity-Multiplexing Frontier with Rotation-Based Space-Time Codes
Achieving the Full MIMO Diversity-Multiplexing Frontier with Rotation-Based Space-Time Codes Huan Yao Lincoln Laboratory Massachusetts Institute of Technology Lexington, MA 02420 yaohuan@ll.mit.edu Gregory
More informationLecture 9: Diversity-Multiplexing Tradeoff Theoretical Foundations of Wireless Communications 1. Overview. Ragnar Thobaben CommTh/EES/KTH
: Diversity-Multiplexing Tradeoff Theoretical Foundations of Wireless Communications 1 Rayleigh Wednesday, June 1, 2016 09:15-12:00, SIP 1 Textbook: D. Tse and P. Viswanath, Fundamentals of Wireless Communication
More informationA Fast-Decodable, Quasi-Orthogonal Space Time Block Code for 4 2 MIMO
Forty-Fifth Annual Allerton Conference Allerton House, UIUC, Illinois, USA September 26-28, 2007 ThC6.4 A Fast-Decodable, Quasi-Orthogonal Space Time Block Code for 4 2 MIMO Ezio Biglieri Universitat Pompeu
More informationOn the diversity of the Naive Lattice Decoder
On the diversity of the Naive Lattice Decoder Asma Mejri, Laura Luzzi, Ghaya Rekaya-Ben Othman To cite this version: Asma Mejri, Laura Luzzi, Ghaya Rekaya-Ben Othman. On the diversity of the Naive Lattice
More informationLecture 9: Diversity-Multiplexing Tradeoff Theoretical Foundations of Wireless Communications 1
: Diversity-Multiplexing Tradeoff Theoretical Foundations of Wireless Communications 1 Rayleigh Friday, May 25, 2018 09:00-11:30, Kansliet 1 Textbook: D. Tse and P. Viswanath, Fundamentals of Wireless
More informationLecture 7 MIMO Communica2ons
Wireless Communications Lecture 7 MIMO Communica2ons Prof. Chun-Hung Liu Dept. of Electrical and Computer Engineering National Chiao Tung University Fall 2014 1 Outline MIMO Communications (Chapter 10
More informationOn the Robustness of Algebraic STBCs to Coefficient Quantization
212 Australian Communications Theory Workshop (AusCTW) On the Robustness of Algebraic STBCs to Coefficient Quantization J. Harshan Dept. of Electrical and Computer Systems Engg., Monash University Clayton,
More informationAlgebraic Multiuser Space Time Block Codes for 2 2 MIMO
Algebraic Multiuser Space Time Bloc Codes for 2 2 MIMO Yi Hong Institute of Advanced Telecom. University of Wales, Swansea, UK y.hong@swansea.ac.u Emanuele Viterbo DEIS - Università della Calabria via
More informationAlgebraic Methods for Wireless Coding
Algebraic Methods for Wireless Coding Frédérique Oggier frederique@systems.caltech.edu California Institute of Technology UC Davis, Mathematics Department, January 31st 2007 Outline The Rayleigh fading
More informationMaximum Achievable Diversity for MIMO-OFDM Systems with Arbitrary. Spatial Correlation
Maximum Achievable Diversity for MIMO-OFDM Systems with Arbitrary Spatial Correlation Ahmed K Sadek, Weifeng Su, and K J Ray Liu Department of Electrical and Computer Engineering, and Institute for Systems
More informationAdaptive Space-Time Shift Keying Based Multiple-Input Multiple-Output Systems
ACSTSK Adaptive Space-Time Shift Keying Based Multiple-Input Multiple-Output Systems Professor Sheng Chen Electronics and Computer Science University of Southampton Southampton SO7 BJ, UK E-mail: sqc@ecs.soton.ac.uk
More informationConstrained Detection for Multiple-Input Multiple-Output Channels
Constrained Detection for Multiple-Input Multiple-Output Channels Tao Cui, Chintha Tellambura and Yue Wu Department of Electrical and Computer Engineering University of Alberta Edmonton, AB, Canada T6G
More informationThe Sorted-QR Chase Detector for Multiple-Input Multiple-Output Channels
The Sorted-QR Chase Detector for Multiple-Input Multiple-Output Channels Deric W. Waters and John R. Barry School of ECE Georgia Institute of Technology Atlanta, GA 30332-0250 USA {deric, barry}@ece.gatech.edu
More informationMulti-Branch MMSE Decision Feedback Detection Algorithms. with Error Propagation Mitigation for MIMO Systems
Multi-Branch MMSE Decision Feedback Detection Algorithms with Error Propagation Mitigation for MIMO Systems Rodrigo C. de Lamare Communications Research Group, University of York, UK in collaboration with
More informationImproved Multiple Feedback Successive Interference Cancellation Algorithm for Near-Optimal MIMO Detection
Improved Multiple Feedback Successive Interference Cancellation Algorithm for Near-Optimal MIMO Detection Manish Mandloi, Mohammed Azahar Hussain and Vimal Bhatia Discipline of Electrical Engineering,
More informationThe Asymmetric Golden Code for Fast Decoding on Time-Varying Channels
Wireless Personal Communications manuscript No. (will be inserted by the editor) The Asymmetric Golden Code for Fast Decoding on Time-Varying Channels Mohanned O. Sinnokrot John R. Barry Vijay K. Madisetti
More informationConstellation Shaping for Communication Channels with Quantized Outputs
Constellation Shaping for Communication Channels with Quantized Outputs Chandana Nannapaneni, Matthew C. Valenti, and Xingyu Xiang Lane Department of Computer Science and Electrical Engineering West Virginia
More informationA View on Full-Diversity Modulus-Preserving Rate-One Linear Space-Time Block Codes
SIGNAL PROCESSING (TO APPEAR) A View on Full-Diversity Modulus-Preserving Rate-One Linear Space-Time Block Codes Shengli Zhou 1, Xiaoli Ma 2, and Krishna Pattipati 1 Paper Number: SIGPRO-D-05-00038 Associate
More informationGolden Space-Time Block Coded Modulation
Golden Space-Time Block Coded Modulation Laura Luzzi Ghaya Rekaya-Ben Othman Jean-Claude Belfiore and Emanuele Viterbo Télécom ParisTech- École Nationale Supérieure des Télécommunications 46 Rue Barrault
More informationDirty Paper Coding vs. TDMA for MIMO Broadcast Channels
TO APPEAR IEEE INTERNATIONAL CONFERENCE ON COUNICATIONS, JUNE 004 1 Dirty Paper Coding vs. TDA for IO Broadcast Channels Nihar Jindal & Andrea Goldsmith Dept. of Electrical Engineering, Stanford University
More informationPrecoded Integer-Forcing Universally Achieves the MIMO Capacity to Within a Constant Gap
Precoded Integer-Forcing Universally Achieves the MIMO Capacity to Within a Constant Gap Or Ordentlich Dept EE-Systems, TAU Tel Aviv, Israel Email: ordent@engtauacil Uri Erez Dept EE-Systems, TAU Tel Aviv,
More informationApplications of Lattices in Telecommunications
Applications of Lattices in Telecommunications Dept of Electrical and Computer Systems Engineering Monash University amin.sakzad@monash.edu Oct. 2013 1 Sphere Decoder Algorithm Rotated Signal Constellations
More informationThe Aladdin-Pythagoras Space-Time Code
The Aladdin-Pythagoras Space-Time Code Joseph J Boutros Texas A&M University Department of Electrical Engineering Education City Doha Qatar boutros@tamuedu Hugues Randriambololona TELECOM ParisTech / LTCI
More informationCHANNEL FEEDBACK QUANTIZATION METHODS FOR MISO AND MIMO SYSTEMS
CHANNEL FEEDBACK QUANTIZATION METHODS FOR MISO AND MIMO SYSTEMS June Chul Roh and Bhaskar D Rao Department of Electrical and Computer Engineering University of California, San Diego La Jolla, CA 9293 47,
More informationLecture 8: MIMO Architectures (II) Theoretical Foundations of Wireless Communications 1. Overview. Ragnar Thobaben CommTh/EES/KTH
MIMO : MIMO Theoretical Foundations of Wireless Communications 1 Wednesday, May 25, 2016 09:15-12:00, SIP 1 Textbook: D. Tse and P. Viswanath, Fundamentals of Wireless Communication 1 / 20 Overview MIMO
More informationOptimal Signal Constellations for Fading Space-Time Channels
Optimal Signal Constellations for Fading Space-Time Channels 1. Space-time channels Alfred O. Hero University of Michigan - Ann Arbor Outline 2. Random coding exponent and cutoff rate 3. Discrete K-dimensional
More informationAnalysis of coding on non-ergodic block-fading channels
Analysis of coding on non-ergodic block-fading channels Joseph J. Boutros ENST 46 Rue Barrault, Paris boutros@enst.fr Albert Guillén i Fàbregas Univ. of South Australia Mawson Lakes SA 5095 albert.guillen@unisa.edu.au
More information2318 IEEE TRANSACTIONS ON SIGNAL PROCESSING, VOL. 54, NO. 6, JUNE Mai Vu, Student Member, IEEE, and Arogyaswami Paulraj, Fellow, IEEE
2318 IEEE TRANSACTIONS ON SIGNAL PROCESSING, VOL. 54, NO. 6, JUNE 2006 Optimal Linear Precoders for MIMO Wireless Correlated Channels With Nonzero Mean in Space Time Coded Systems Mai Vu, Student Member,
More informationMultiple Antennas in Wireless Communications
Multiple Antennas in Wireless Communications Luca Sanguinetti Department of Information Engineering Pisa University luca.sanguinetti@iet.unipi.it April, 2009 Luca Sanguinetti (IET) MIMO April, 2009 1 /
More informationA Design of High-Rate Space-Frequency Codes for MIMO-OFDM Systems
A Design of High-Rate Space-Frequency Codes for MIMO-OFDM Systems Wei Zhang, Xiang-Gen Xia and P. C. Ching xxia@ee.udel.edu EE Dept., The Chinese University of Hong Kong ECE Dept., University of Delaware
More informationLayered Orthogonal Lattice Detector for Two Transmit Antenna Communications
Layered Orthogonal Lattice Detector for Two Transmit Antenna Communications arxiv:cs/0508064v1 [cs.it] 12 Aug 2005 Massimiliano Siti Advanced System Technologies STMicroelectronics 20041 Agrate Brianza
More informationOn the Robustness of Lattice Reduction Over. Correlated Fading Channels
On the Robustness of Lattice Reduction Over Correlated Fading Channels Hossein Najafi, Student Member, IEEE, Mohammad Erfan Danesh Jafari, Student Member, IEEE, and Mohamed Oussama Damen, Senior Member,
More informationLattices and Lattice Codes
Lattices and Lattice Codes Trivandrum School on Communication, Coding & Networking January 27 30, 2017 Lakshmi Prasad Natarajan Dept. of Electrical Engineering Indian Institute of Technology Hyderabad
More informationA Fast Decodable Full-Rate STBC with High Coding Gain for 4x2 MIMO Systems
A Fast Decodable Full-Rate STBC with High Coding Gain for 4x2 MIMO Systems Ming Liu, Maryline Hélard, Jean-François Hélard, Matthieu Crussière To cite this version: Ming Liu, Maryline Hélard, Jean-François
More informationShannon meets Wiener II: On MMSE estimation in successive decoding schemes
Shannon meets Wiener II: On MMSE estimation in successive decoding schemes G. David Forney, Jr. MIT Cambridge, MA 0239 USA forneyd@comcast.net Abstract We continue to discuss why MMSE estimation arises
More informationSystematic Design of Space-Frequency Codes with Full Rate and Full Diversity
Systematic Design of Space-Frequency Codes with Full Rate and Full Diversity Weifeng Su Department of ECE University of Maryland, College Park, MD 20742, USA Email: weifeng@engumdedu Zoltan Safar Department
More informationA Coding Strategy for Wireless Networks with no Channel Information
A Coding Strategy for Wireless Networks with no Channel Information Frédérique Oggier and Babak Hassibi Abstract In this paper, we present a coding strategy for wireless relay networks, where we assume
More informationA Precoding Method for Multiple Antenna System on the Riemannian Manifold
Journal of Communications Vol. 9, No. 2, February 2014 A Precoding Method for Multiple Antenna System on the Riemannian Manifold Lin Zhang1 and S. H. Leung2 1 Department of Electronic Engineering, City
More informationConstellation Precoded Beamforming
Constellation Precoded Beamforming Hong Ju Park and Ender Ayanoglu Center for Pervasive Communications and Computing Department of Electrical Engineering and Computer Science University of California,
More informationSpace-Time Coding for Multi-Antenna Systems
Space-Time Coding for Multi-Antenna Systems ECE 559VV Class Project Sreekanth Annapureddy vannapu2@uiuc.edu Dec 3rd 2007 MIMO: Diversity vs Multiplexing Multiplexing Diversity Pictures taken from lectures
More informationAugmented Lattice Reduction for MIMO decoding
Augmented Lattice Reduction for MIMO decoding LAURA LUZZI joint work with G. Rekaya-Ben Othman and J.-C. Belfiore at Télécom-ParisTech NANYANG TECHNOLOGICAL UNIVERSITY SEPTEMBER 15, 2010 Laura Luzzi Augmented
More informationPhase Precoded Compute-and-Forward with Partial Feedback
Phase Precoded Compute-and-Forward with Partial Feedback Amin Sakzad, Emanuele Viterbo Dept. Elec. & Comp. Sys. Monash University, Australia amin.sakzad,emanuele.viterbo@monash.edu Joseph Boutros, Dept.
More informationCONSIDER the following generic model:
1104 IEEE TRANSACTIONS ON COMMUNICATIONS, VOL. 53, NO. 7, JULY 2005 Sphere Decoding Algorithms With Improved Radius Search Wanlun Zhao Georgios B. Giannakis, Fellow, IEEE Abstract We start by identifying
More informationarxiv:cs/ v1 [cs.it] 11 Sep 2006
0 High Date-Rate Single-Symbol ML Decodable Distributed STBCs for Cooperative Networks arxiv:cs/0609054v1 [cs.it] 11 Sep 2006 Zhihang Yi and Il-Min Kim Department of Electrical and Computer Engineering
More informationUSING multiple antennas has been shown to increase the
IEEE TRANSACTIONS ON COMMUNICATIONS, VOL. 55, NO. 1, JANUARY 2007 11 A Comparison of Time-Sharing, DPC, and Beamforming for MIMO Broadcast Channels With Many Users Masoud Sharif, Member, IEEE, and Babak
More informationTraining-Symbol Embedded, High-Rate Complex Orthogonal Designs for Relay Networks
Training-Symbol Embedded, High-Rate Complex Orthogonal Designs for Relay Networks J Harshan Dept of ECE, Indian Institute of Science Bangalore 56001, India Email: harshan@eceiiscernetin B Sundar Rajan
More informationBlind Channel Identification in (2 1) Alamouti Coded Systems Based on Maximizing the Eigenvalue Spread of Cumulant Matrices
Blind Channel Identification in (2 1) Alamouti Coded Systems Based on Maximizing the Eigenvalue Spread of Cumulant Matrices Héctor J. Pérez-Iglesias 1, Daniel Iglesia 1, Adriana Dapena 1, and Vicente Zarzoso
More informationApplications of the Golden Code
Applications of the Golden Code Emanuele Viterbo DEIS - Università della Calabria via P. Bucci, Cubo 42C 87036 Rende (CS) - ITALY viterbo@deis.unical.it Yi Hong Institute for Telecom. Research University
More informationClosed Form Designs of Complex Orthogonal. Space-Time Block Codes of Rates (k + 1)=(2k) for
Closed Form Designs of Complex Orthogonal Space-Time Block Codes of Rates (k + 1)(k) for k 1 or k Transmit Antennas Kejie Lu, Shengli Fu, Xiang-Gen Xia Abstract In this correspondence, we present a systematic
More informationOn Random Rotations Diversity. Motorola Semiconductors Toulouse, France. ENST, 46 rue Barrault Paris, France. November 19, 1999.
On Random Rotations Diversity and Minimum MSE Decoding of Lattices Catherine LAMY y - Joseph BOUTROS z y Motorola Semiconductors Toulouse, France z ENST, 46 rue Barrault 75013 Paris, France lamyc@enst.fr,
More informationON DECREASING THE COMPLEXITY OF LATTICE-REDUCTION-AIDED K-BEST MIMO DETECTORS.
17th European Signal Processing Conference (EUSIPCO 009) Glasgow, Scotland, August 4-8, 009 ON DECREASING THE COMPLEXITY OF LATTICE-REDUCTION-AIDED K-BEST MIMO DETECTORS. Sandra Roger, Alberto Gonzalez,
More information1186 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 54, NO. 3, MARCH /$ IEEE
1186 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL 54, NO 3, MARCH 2008 Diversity Multiplexing Tradeoff Outage Performance for Rician MIMO Channels Won-Yong Shin, Student Member, IEEE, Sae-Young Chung,
More informationCyclic Division Algebras: A Tool for Space Time Coding
Foundations and Trends R in Communications and Information Theory Vol. 4, No. 1 (2007) 1 95 c 2007 F. Oggier, J.-C. Belfiore and E. Viterbo DOI: 10.1561/0100000016 Cyclic Division Algebras: A Tool for
More informationEE6604 Personal & Mobile Communications. Week 13. Multi-antenna Techniques
EE6604 Personal & Mobile Communications Week 13 Multi-antenna Techniques 1 Diversity Methods Diversity combats fading by providing the receiver with multiple uncorrelated replicas of the same information
More informationConstruction of Barnes-Wall Lattices from Linear Codes over Rings
01 IEEE International Symposium on Information Theory Proceedings Construction of Barnes-Wall Lattices from Linear Codes over Rings J Harshan Dept of ECSE, Monh University Clayton, Australia Email:harshanjagadeesh@monhedu
More informationLattice Reduction Aided Precoding for Multiuser MIMO using Seysen s Algorithm
Lattice Reduction Aided Precoding for Multiuser MIMO using Seysen s Algorithm HongSun An Student Member IEEE he Graduate School of I & Incheon Korea ahs3179@gmail.com Manar Mohaisen Student Member IEEE
More informationCharacterization of Convex and Concave Resource Allocation Problems in Interference Coupled Wireless Systems
2382 IEEE TRANSACTIONS ON SIGNAL PROCESSING, VOL 59, NO 5, MAY 2011 Characterization of Convex and Concave Resource Allocation Problems in Interference Coupled Wireless Systems Holger Boche, Fellow, IEEE,
More informationCapacity of multiple-input multiple-output (MIMO) systems in wireless communications
15/11/02 Capacity of multiple-input multiple-output (MIMO) systems in wireless communications Bengt Holter Department of Telecommunications Norwegian University of Science and Technology 1 Outline 15/11/02
More informationAn Efficient Optimal Algorithm for Integer-Forcing Linear MIMO Receivers Design
An Efficient Optimal Algorithm for Integer-Forcing Linear MIMO Receivers Design Jinming Wen, Lanping Li, Xiaohu Tang, Wai Ho Mow, and Chintha Tellambura Department of Electrical and Computer Engineering,
More informationLarge Zero Autocorrelation Zone of Golay Sequences and 4 q -QAM Golay Complementary Sequences
Large Zero Autocorrelation Zone of Golay Sequences and 4 q -QAM Golay Complementary Sequences Guang Gong 1 Fei Huo 1 and Yang Yang 2,3 1 Department of Electrical and Computer Engineering University of
More informationLecture 5: Antenna Diversity and MIMO Capacity Theoretical Foundations of Wireless Communications 1. Overview. CommTh/EES/KTH
: Antenna Diversity and Theoretical Foundations of Wireless Communications Wednesday, May 4, 206 9:00-2:00, Conference Room SIP Textbook: D. Tse and P. Viswanath, Fundamentals of Wireless Communication
More informationIN THE last several years, there has been considerable
IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 48, NO. 8, AUGUST 2002 2291 Unitary Signal Constellations Differential Space Time Modulation With Two Transmit Antennas: Parametric Codes, Optimal Designs,
More informationTitle. Author(s)Tsai, Shang-Ho. Issue Date Doc URL. Type. Note. File Information. Equal Gain Beamforming in Rayleigh Fading Channels
Title Equal Gain Beamforming in Rayleigh Fading Channels Author(s)Tsai, Shang-Ho Proceedings : APSIPA ASC 29 : Asia-Pacific Signal Citationand Conference: 688-691 Issue Date 29-1-4 Doc URL http://hdl.handle.net/2115/39789
More informationThe E8 Lattice and Error Correction in Multi-Level Flash Memory
The E8 Lattice and Error Correction in Multi-Level Flash Memory Brian M Kurkoski University of Electro-Communications Tokyo, Japan kurkoski@iceuecacjp Abstract A construction using the E8 lattice and Reed-Solomon
More informationOn the Optimality of Multiuser Zero-Forcing Precoding in MIMO Broadcast Channels
On the Optimality of Multiuser Zero-Forcing Precoding in MIMO Broadcast Channels Saeed Kaviani and Witold A. Krzymień University of Alberta / TRLabs, Edmonton, Alberta, Canada T6G 2V4 E-mail: {saeed,wa}@ece.ualberta.ca
More informationDecomposing Bent Functions
2004 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 49, NO. 8, AUGUST 2003 Decomposing Bent Functions Anne Canteaut and Pascale Charpin Abstract In a recent paper [1], it is shown that the restrictions
More informationSingle-User MIMO systems: Introduction, capacity results, and MIMO beamforming
Single-User MIMO systems: Introduction, capacity results, and MIMO beamforming Master Universitario en Ingeniería de Telecomunicación I. Santamaría Universidad de Cantabria Contents Introduction Multiplexing,
More informationHigh-Rate and Information-Lossless Space-Time Block Codes from Crossed-Product Algebras
High-Rate and Information-Lossless Space-Time Block Codes from Crossed-Product Algebras A Thesis Submitted for the Degree of Doctor of Philosophy in the Faculty of Engineering by Shashidhar V Department
More informationSchur-convexity of the Symbol Error Rate in Correlated MIMO Systems with Precoding and Space-time Coding
Schur-convexity of the Symbol Error Rate in Correlated MIMO Systems with Precoding and Space-time Coding RadioVetenskap och Kommunikation (RVK 08) Proceedings of the twentieth Nordic Conference on Radio
More informationSpace-Time Block Codes from Cyclic Division Algebras: An Introduction
Space-Time Block Codes from Cyclic Division Algebras: An Introduction Anders OF Hendrickson December 15, 2004 Coding theory addresses the problem of transmitting information accurately across noisy channels
More informationChapter 7. Error Control Coding. 7.1 Historical background. Mikael Olofsson 2005
Chapter 7 Error Control Coding Mikael Olofsson 2005 We have seen in Chapters 4 through 6 how digital modulation can be used to control error probabilities. This gives us a digital channel that in each
More informationWE study the capacity of peak-power limited, single-antenna,
1158 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 56, NO. 3, MARCH 2010 Gaussian Fading Is the Worst Fading Tobias Koch, Member, IEEE, and Amos Lapidoth, Fellow, IEEE Abstract The capacity of peak-power
More informationLattices for Communication Engineers
Lattices for Communication Engineers Jean-Claude Belfiore Télécom ParisTech CNRS, LTCI UMR 5141 February, 22 2011 Nanyang Technological University - SPMS Part I Introduction Signal Space The transmission
More informationA Fast Generalized Sphere Decoder for Optimum Decoding of Under-determined MIMO systems
A Fast Generalized Sphere Decoder for Optimum Decoding of Under-determined MIMO systems Pranav Dayal and Mahesh K. Varanasi e-mail: fdayalp, varanasig@dsp.colorado.edu University of Colorado, Boulder,
More informationHow Much Training and Feedback are Needed in MIMO Broadcast Channels?
How uch raining and Feedback are Needed in IO Broadcast Channels? ari Kobayashi, SUPELEC Gif-sur-Yvette, France Giuseppe Caire, University of Southern California Los Angeles CA, 989 USA Nihar Jindal University
More informationLow Complexity Distributed STBCs with Unitary Relay Matrices for Any Number of Relays
Low Complexity Distributed STBCs with Unitary elay Matrices for Any Number of elays G. Susinder ajan Atheros India LLC Chennai 600004 India susinder@atheros.com B. Sundar ajan ECE Department Indian Institute
More informationOmnidirectional Space-Time Block Coding for Common Information Broadcasting in Massive MIMO Systems
Omnidirectional Space-Time Block Coding for Common Information Broadcasting in Massive MIMO Systems Xin Meng, Xiang-Gen Xia, and Xiqi Gao 1 arxiv:1610.07771v1 [cs.it] 25 Oct 2016 Abstract In this paper,
More informationOn Optimal Quasi-Orthogonal Space-Time. Block Codes with Minimum Decoding Complexity
On Optimal Quasi-Orthogonal Space-Time 1 Block Codes with Minimum Decoding Complexity Haiquan Wang, Dong Wang, and Xiang-Gen Xia Abstract Orthogonal space-time block codes (OSTBC) from orthogonal designs
More informationThese outputs can be written in a more convenient form: with y(i) = Hc m (i) n(i) y(i) = (y(i); ; y K (i)) T ; c m (i) = (c m (i); ; c m K(i)) T and n
Binary Codes for synchronous DS-CDMA Stefan Bruck, Ulrich Sorger Institute for Network- and Signal Theory Darmstadt University of Technology Merckstr. 25, 6428 Darmstadt, Germany Tel.: 49 65 629, Fax:
More informationComputational Complexity of Decoding Orthogonal Space-Time Block Codes
936 IEEE TRANSACTIONS ON COMMUNICATIONS, VOL. 59, NO. 4, APRIL 2011 Computational Complexity of Decoding Orthogonal Space-Time Block Codes Ender Ayanoglu, Fellow, IEEE, Erik G. Larsson, Senior Member,
More informationComplete Analysis of Space Time Group Codes
Complete Analysis of Space Time Group Codes Sirin Nitinawarat Dept. of Electrical and Computer Engineering University of Maryland College Park, MD 74 nitinawa@mail.umd.edu Nigel Boston Dept. of Electrical
More informationDemixing Radio Waves in MIMO Spatial Multiplexing: Geometry-based Receivers Francisco A. T. B. N. Monteiro
Demixing Radio Waves in MIMO Spatial Multiplexing: Geometry-based Receivers Francisco A. T. B. N. Monteiro 005, it - instituto de telecomunicações. Todos os direitos reservados. Demixing Radio Waves in
More information4488 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 54, NO. 10, OCTOBER /$ IEEE
4488 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 54, NO. 10, OCTOBER 2008 List Decoding of Biorthogonal Codes the Hadamard Transform With Linear Complexity Ilya Dumer, Fellow, IEEE, Grigory Kabatiansky,
More informationBlind MIMO communication based on Subspace Estimation
Blind MIMO communication based on Subspace Estimation T. Dahl, S. Silva, N. Christophersen, D. Gesbert T. Dahl, S. Silva, and N. Christophersen are at the Department of Informatics, University of Oslo,
More informationSingle-Symbol ML Decodable Distributed STBCs for Partially-Coherent Cooperative Networks
This full text paper was peer reviewed at the direction of IEEE Communications Society subject matter experts for publication in the ICC 2008 proceedings Single-Symbol ML Decodable Distributed STBCs for
More informationDesign of Multidimensional Mappings for Iterative MIMO Detection with Minimized Bit Error Floor
Design of Multidimensional Mappings for Iterative MIMO Detection with Minimized Bit Error Floor abil Sven Muhammad, Joachim Speidel Institute of Telecommunications, University of Stuttgart, Pfaffenwaldring
More informationL interférence dans les réseaux non filaires
L interférence dans les réseaux non filaires Du contrôle de puissance au codage et alignement Jean-Claude Belfiore Télécom ParisTech 7 mars 2013 Séminaire Comelec Parts Part 1 Part 2 Part 3 Part 4 Part
More informationBounds on fast decodability of space-time block codes, skew-hermitian matrices, and Azumaya algebras
Bounds on fast decodability of space-time block codes, skew-hermitian matrices, and Azumaya algebras Grégory Berhuy, Nadya Markin, and B. A. Sethuraman 1 Abstract We study fast lattice decodability of
More informationELEC E7210: Communication Theory. Lecture 10: MIMO systems
ELEC E7210: Communication Theory Lecture 10: MIMO systems Matrix Definitions, Operations, and Properties (1) NxM matrix a rectangular array of elements a A. an 11 1....... a a 1M. NM B D C E ermitian transpose
More informationFour-Group Decodable Semi-Orthogonal Algebraic Space-Time Block Codes
This full text paper was peer reviewed at the direction of IEEE Communications Society subject matter experts for publication in the WCNC 27 proceedings Four-Group Decodable Semi-Orthogonal Algebraic Space-Time
More informationTight Lower Bounds on the Ergodic Capacity of Rayleigh Fading MIMO Channels
Tight Lower Bounds on the Ergodic Capacity of Rayleigh Fading MIMO Channels Özgür Oyman ), Rohit U. Nabar ), Helmut Bölcskei 2), and Arogyaswami J. Paulraj ) ) Information Systems Laboratory, Stanford
More informationFour-Group Decodable Space-Time Block Codes
IEEE TRANSACTIONS ON SIGNAL PROCESSING, VOL. X, NO. X, X 2X 1 Four-Group Decodable Space-Time Block Codes Dũng Ngọc Ðào, Member, IEEE, Chau Yuen, Member, IEEE, Chintha Tellambura, Senior Member, IEEE,
More informationReduced Complexity Sphere Decoding for Square QAM via a New Lattice Representation
Reduced Complexity Sphere Decoding for Square QAM via a New Lattice Representation Luay Azzam and Ender Ayanoglu Department of Electrical Engineering and Computer Science University of California, Irvine
More informationCONSTRUCTION AND ANALYSIS OF A NEW QUATERNIONIC SPACE-TIME CODE FOR 4 TRANSMIT ANTENNAS
COMMUNICATIONS IN INFORMATION AND SYSTEMS c 2005 International Press Vol. 5, No. 1, pp. 1-26, 2005 001 CONSTRUCTION AND ANALYSIS OF A NEW QUATERNIONIC SPACE-TIME CODE FOR 4 TRANSMIT ANTENNAS ROBERT CALDERBANK,
More informationApproximately achieving the feedback interference channel capacity with point-to-point codes
Approximately achieving the feedback interference channel capacity with point-to-point codes Joyson Sebastian*, Can Karakus*, Suhas Diggavi* Abstract Superposition codes with rate-splitting have been used
More informationExploiting Partial Channel Knowledge at the Transmitter in MISO and MIMO Wireless
Exploiting Partial Channel Knowledge at the Transmitter in MISO and MIMO Wireless SPAWC 2003 Rome, Italy June 18, 2003 E. Yoon, M. Vu and Arogyaswami Paulraj Stanford University Page 1 Outline Introduction
More information