ABSTRACT
The theory of lattices have shown to be useful in information theory and rotated lattices with high modulation diversity have been extensively studied as an alternative approach for transmission over a Rayleigh-fading channel, where the performance of this modulation schemes essentially depends on the modulation diversity and on the minimum product distance to achieve substantial coding gains. The maximum diversity of a rotated lattice is guaranteed when we use totally real number fields and the minimum product distance is optimized by considering fields with minimum discriminant. In this paper, we present construction of a full diversity rotated lattice for the Rayleigh fading channel in Euclidean space with full diversity, where this construction is through a totally real subfield of the cyclotomic field , where is an odd prime, obtained by endowing their ring of integers.
Key words lattices; cyclotomic fields; algebraic number field; rotated lattice
RESUMO
A teoria de reticulados têm mostrado útil na teoria da informação e reticulados ideais com alta diversidade de modulação têm sido extensamente estudados como uma alternativa de transmissão via o canal de Rayleigh, onde o desempenho destes esquemas de modulação depende essencialmente da diversidade de modulação e da distância produto mínima para obter ganhos substanciais de codificação. A diversidade máxima de um reticulado rotacionado é garantida quando usamos corpos de números totalmente reais e a distância produto mínima é otimizada considerando os corpos com discriminante mínimo. Neste trabalho, apresentamos uma construção de reticulado rotacionado, onde esta construção é através de um subcorpo totalmente real do -ésimo corpo ciclotômico, onde é um número primo ímpar, obtido via o seu anel de inteiros.
Palavras-chave reticulados; corpos ciclotômicos; corpos de números algébricos; reticulado rotacionado.
1 INTRODUCTION
Algebraic number theory has recently raised a great interest for their new role in algebraic lattice theory and for application in coding and modulation. The problem of finding algebraic lattices with maximal minimum product distance has been studied in last years and this has motivated special attention of many researchs in considering ideals of certain rings [5], [2] and [1]. Eva Bayer et al. [8] and Andrade et al. [1] have presented families of rotated -lattices based on algebraic number theory. We know that totally real algebraic number fields result in the maximum diversity, equal to the dimension of the lattice [3]. This motivates the investigation on lattices over totally real number fields.
A lattice is a discrete additive subgroup of , equivalently, is a lattice iff there are linearly independent vectors such that
The set is a -basis and a matrix whose rows are these vectors is said to be a generator matrix for and the associated Gram matrix is given by . Lattices have been considered in different areas, especially in coding theory and more recently in cryptography. In this paper, we attempt to construct lattices with full rank, i.e., , which may be suitable for signal transmission over both Gaussian and Rayleigh fading channels [3]. For this purpose the tattice parameters we consider here are diversity and minimum product distance.In [1], for any integer , rotated -lattices, and , were constructed from , the maximal real subfield of , and over , where is a primitive -th root of unity. In this work, having the construction procedure of a rotated lattice over the maximal real subfield of a cyclotomic field as the main motivation, we make use of algebraic number theory for constructing rotated lattices via totally real subfields of the cyclotomic field , where is an odd prime number.
This paper is organized as follows. In Section 2, notions and results from algebraic number theory that are used in the work are reviewed. In Section 3, rotated lattices are constructed from totally real subfields of the cyclotomic field , where is an odd prime number. In Section 4, an algorithm to the construction of rotated lattices is presented and we present examples in terms of center density and minimum product distance.
2 BASIC RESULTS FROM NUMBER THEORY
A number field is a field that is a finite degree extension of . An element is called an algebraic integer if there is a monic polynomial with integer coefficients such that . The set
is a ring called ring of algebraic integers of . The ring is a -module of rank and a -basis of is called an integral basis of (or of ). Furthermore, , where is a root of a monic irreducible polynomial . The distinct roots of are the conjugates of . If is a -homomorphism, then for some , and there are exactly -homomorphism , for . A homomorphism is said to be real if and imaginary otherwise. A number field is said to be totally real if is real for all and totally imaginary if is imaginary for all . The trace of any element is defined as the rational number and if , then . The discriminant of , denoted by , is the rational integer given by .A cyclotomic field is a number field such that , where is a primitive -th root of unity. Also, , where is the Euler function, is the ring of algebraic integers of , and the field is the maximal real subfield of , where and [6], [9].
3 CONSTRUCTION OF A ROTATED LATTICE
If is a primitive -th root of unity, where is an odd prime number, then is a cyclic extension of degree over that contains the real subfield , which is cyclic of degree over . If is the Galois group (cyclic) of over with generator (or ), then , where is a generator of , and , that is, is a primitive element modulo .
Theorem 1. [11] (Dirichlet’s theorem) If are integers such that and , then the arithmetic progression contains infinitely many primes.
If is a positive integer, from Theorem 1, it follows that there exists a prime such that . Since divides , from Galois Correspondence Theorem, it follows that there exists a unique field contained in which is cyclic of degree over . If is an even number that divides or if is an odd number, then is contained in the real subfield . In this case, , where ,
where , and is an integral basis of , where , for all [6].If is the canonical embedding given by
then is an algebraic lattice in with maximum diversity. Since the set is a -basis of , it follows that is a basis of the lattice , whose generator matrix is given by Since , it follows that the -th row is given by for . The Gram matrix of is given by , where Since and , for all , it follows that for . Thus, Since , for , it is sufficient to calculate , for . Finally, and for .The following theorem, which is the main result of this work, gives us the key to constructing full diversity rotated lattice bssed on real subfields of the cyclotomic field .
Theorem 2. If , then
Proof. Since , it follows that
for all ., and because , whose order is . Thus, Since is a generator of , it follows that , and thus, , for all . So, Therefore, , for all . Now, if , then , for some . Thus, . So, Furthermore, if , i.e., , then , and since ranges in , it follows that also ranges in . Thus, Since and , it follows that , where , because , and thus for some . So, , for some . Now, since , it follows that Thus, if , then where for . The first case is trivial. Now, for , is sufficient observe that is a root of the polynomial and therefore, Now, to calcule , we consider the cases and . But, In fact, if and , then . Since is even, it follows that there exists such that . So, , i.e., . Thus, or . But, since the first case is not possible because is the smallet positive integer with this property, it follows that . Thus, , and therefore, Reciprocally, if , i.e., , then Since , it follows that From [10], it follows that Thus divides , i.e., there exists such that . Now, , (because ) and (because ), and thus, . Since , it follows that . Thus, , and therefore, Since is positive, because if , then . Thus, or , because if , then . But, since is odd, it follows that . Therefore, , which concludes the proof of the equivalency of the Equation (3.1). Observe that the number is integer because . Now, for , from equivalency of the Equation (3.1), it follows that , and therefore, . Thus, Now, suppose . From equivalency of the Equation (3.1), if , then , and if , then . Therefore, Since ranges in , with , it follows that which concludes the proof. ""²4 AN ALGORITHM OF CONSTRUCTION OF A ROTATED LATTICE
In this section, we present an algorithm to construct of a rotated lattice and we analyze if these lattices have good performance in terms of center density and minimum product distance. For this, we consider a field such that , where is a prime, and .
4.1 Algorithm
An algorithm to construct of a rotated lattice is given by:
-
Choose a dimension .
-
Compute a prime such that , where is an even number that divides or if is an odd number.
-
Compute such that is a primitive element modulo , i.e., is a generator of .
-
Compute and , for , with .
-
Compute the Gram matrix , where
for .
4.2 Center density and minimim distance product
If , where , then
If is a -submodule in of rank , then the set is a lattice in called an algebraic lattice. The center density of is given by where , denotes the index of the submodule and [7]. If is an element of , the product distance of from the origin is defined as and the minimum product distance of is defined as If is a principal ideal of , then the minimum product distance of is given by where [8]. The normalized minimum product distance of , , is the minimum product distance of the rotated lattice . Thus, the normalized minimum product distance of is given by where . Thus,4.3 Example
If and , where , then , , ,
is the Gram matrix of the algebraic lattice , and . In this case, the center density is given by and the normalized minimum product distance. Since , it follows that . In the Table 1, we summarized a comparision of the values of , where , and for some known constructions of algebraic lattices in some dimensions.5 ACKNOWLEDGMENTS
The authors would like to thank the anonymous reviewers for their intuitive comentary that significantly improved the worth of this work.
REFERENCES
- [1] A.A. Andrade & J.C. Interlando. Rotated -lattices via real subfields of TEMA - Trends in Applied and Computational Mathematics, 20(3) (2019).
- [2] A. Ansari, T. Shah, Z.u. Rahman & A.A. Andrade. Sequences of Primitive and Non-primitive BCH Codes. TEMA - Trends in Applied and Computational Mathematics, 19(2) (2018), 369–389.
- [3] J. Boutros, E. Viterbo, C. Rastello & J.C. Belfiore. Good lattice constellations for both Rayleigh fading and Gaussian channels. IEEE Transactions on Information Theory, 42(2) (1996), 502–518.
- [4] J.H. Conway & N.J.A. Sloane. “Sphere Packings, Lattices and Groups”. Springer-Verlag (1998).
- [5] A. de Andrade & R. Palazzo Jr. Linear codes over finite rings. TEMA - Trends in Applied and Computational Mathematics, 6(2) (2005), 207–217.
- [6] B. Erez. The Galois structure of the trace form in extensions of odd prime degree. Journal of Algebra, 118(2) (1988), 438–446.
- [7] J.C. Interlando, J.O.D. Lopes & T.P. Nóbrega. The discriminant of abelian number fields. Journal of Algebra and its Applications, 5(01) (2006), 35–41.
- [8] F. Oggier, E. Bayer-Fluckiger & E. Viterbo. New algebraic constructions of rotated cubic lattice constellations for the Rayleigh fading channel. In “Proceedings 2003 IEEE Information TheoryWorkshop (Cat. No. 03EX674)”. IEEE (2003), pp. 263–266.
- [9] P. Ribenboim. “Classical theory of algebraic numbers”. Springer Science & Business Media (2013).
- [10] J.P.O. Santos. “Introduction to numbers theory, Projeto Euclides”. Impa (2006).
- [11] J.P. Serre. “A course in arithmetic”, volume 7. Springer Science & Business Media (2012).
Publication Dates
-
Publication in this collection
13 Dec 2019 -
Date of issue
Sep-Dec 2019
History
-
Received
14 Mar 2019 -
Accepted
6 Aug 2019