i Introduction
The use of several antennas at both the transmitter and receiver ends of a wireless channel increases the data rate. Good transmission over such channels can only be achieved through SpaceTime coding. We consider the coherent case where the receiver has perfect knowledge of all the channel coefficients.
There have been several kinds of spacetime block code designs, for example, orthogonal spacetime code designs [1, 2, 3, 4], unitary spacetime designs [5, 6, 7], lattice based diagonal spacetime code designs using algebraic number theory [8, 9, 10] and lattice based spacetime block code designs from algebraic number fields, that have attracted much attention [11, 12, 13, 14, 15, 16].
A lattice is a discrete finitely generated free abelian subgroup
of a real or complex finite dimensional vector space, called the ambient space. In the spacetime setting, a natural ambient space is the space
of complex matrices. Due to the symmetric situation, we only consider fullrank lattices that have a basis consisting of matrices that are linearly independent over We can form a matrix having rows consisting of the real and imaginary parts of all the basis elements.From the pairwise error probability (PEP) point of view
[17] the performance of a spacetime code is dependent on two parameters: full diversity and minimum determinant (or coding gain or diversity product or determinant distance, or minimum product distance). Since we are considering lattices with fulldiversity, the challenge is to maximize the second parameter.By [18] the normalized minimum determinant of is defined as
where is a generator matrix of and . We can as well use the normalized density of the lattice
Since we can conclude that maximizing the normalized minimum determinant is equivalent to maximizing the normalized density of the corresponding lattice, i.e., minimizing the absolute value of the generator matrix
In [19] and [20], a spacetime code design of full diversity is proposed by using cyclotomic extensions and in [21] is proposed spacetime block codes designs based on quadratic extension. In this paper we present a structure of spacetime block code with full diversity similar to the one defined in [21], over the ring of integers of a imaginary quadratic field for twotransmitter antennas. Here, contrary to what is presented in [21] the informations symbols are not only in or .
Our main contribution of this paper is to prove that the spacetime block code design over proposed in [21] is an optimal spacetime block code compared to any spacetime block code over where is any imaginary quadratic field. We also find optimal spacetime block codes designs over the ring of integers of with and The optimality is the sense that the normalized density (or normalized minimum determinant) is maximal when the mean transmission signal power is fixed. When we will see that the optimal code obtained has the same normalized minimum determinant of the Silver code [22].
The motivation to consider information symbols in another quadratic imaginary field instead and , which are considered in most communication problems, is that there are some recently researches that consider as base field a general ring of algebraic integer, for example [23] and [24]. Moreover, the lattice reduction has also been generalized to a ring of imaginary quadratic integers [25] and only the rings from where takes the values and can be used to define Lovász condition [26].
This paper is organized as follows. In Section II, we define real and complex lattices and briefly introduce the normalized density to composed lattices. In Section III, we propose the spacetime block code designs scheme and some properties. In Section IV, we give a criterion to compare two spacetime block codes and some results that will be useful in the proofs of the next section. In Section V, we dedicate to optimal spacetime block codes designs over the ring of integers of imaginary quadratic fields. We present optimal codes over the ring of integers of with a positive squarefree integer. We also prove that the spacetime block code over is an optimal spacetime block code compared to any spacetime block code over the ring of integers of any imaginary quadratic field.
ii Real and Complex Lattices
In this section, we first define real and complex lattices, and next we describe how a complex lattice can be represented by a real lattice.
Definition ii.1
An dimensional real lattice is a subset in
where stands for the transpose and is an real matrix of full rank and called the generator matrix of the real lattice and .
Definition ii.2
An dimensional complex lattice over a 2dimensional real lattice is a subset of :
where stands for the transpose and is an complex matrix of full rank and called the generator matrix of the complex lattice and is a generator matrix of the lattice
Let be an complex matrix
(1) 
with and be a real matrix, which is from the real and imaginary parts of as follows:
(2) 
where and means the real and imaginary parts of , respectively.
If over then
Rewritten with its real part and imaginary part it follows that for Then can be rewritten as
where with
Set . We need to show that , i.e, has full rank and therefore is a real generator matrix of a dimensional real lattice. Since is the real generator matrix of a twodimensional real lattice We can conclude that by the following proposition.
Proposition 1
Proposition 1 tell us that an dimensional complex lattice over can be equivalently represented as a dimensional real lattice Furthermore, the determinant of their generator matrices have the following relationship:
Now we present the definition of composed complex lattice given in [20]. It is useful for layer spacetime codes.
Definition ii.3
An dimensional composed complex lattice over consists of all points where each segment of length belongs to complex lattice over i.e.
Similarly to a complex lattice, an dimensional composed complex lattice can also be represented by a dimensional real lattice of generator matrix and the following determinant relationship holds:
(3) 
According to the theory presented here, the normalized density can be written as follows:
(4) 
In this paper we focus when and
iii SpaceTime Block Codes
Let be a field, is an irreducible polynomial over , with , the ring of algebraic integers of . The polynomial has two roots:
Let , so and is a basis of over . Let and , be the two embeddings of to such that for any and .
Definition iii.1
A spacetime block code based on an irreducible quadratic polynomial over , with roots defined by
where the ring of integers of is a complex number chosen so that , .
This code can be defined in terms of the quaternion division algebra , with , . We refer readers to [27], [28] for a detailed exposition of the theory of simple algebras, cyclic algebras, their matrix representations and their use in spacetime coding.
Definition iii.2
Let be an spacetime block code, we define the minimum determinant of the code by
The next lemma tells us that when we consider quadratic imaginary fields, the minimum determinant of a spacetime block codes .
Lemma 1
If , with a positive squarefree integer then any has
Proof:
If then
and thus, taking and , we have
.
Since is not the algebraic norm of on it follows that if either or then i.e., , if Also, as , it follows that . Thus we conclude that
Now, taking such that , it follows that . Therefore, .
In order to design a spacetime block code with a large normalized density and nonvanishing determinant, we consider with a positive squarefree integer.
Lattice theory has a close relation to number theory. We refer readers to [29, 30] for some concepts of lattices and rings that will be used throughout this paper.
If then with integral basis Otherwise, if then with integral basis . Then the corresponding generator matrix of 2dimensional lattice is
respectively.
A twolayer spacetime block code is a lattice code over and by Definition ii.3:
with
By (3), if is a generator matrix of the 8dimensional real lattice that we denote by then
and by (4)
(5) 
Remark 1
We denote by Note that the smaller is, the better normalized density of is.
iv Lattice Design Criterion
With the argument of Section III we present a criterion [20] to compare two spacetime block codes.
Definition iv.1
(Determinant Criteria) Let and be two spacetime block codes with
We say that is better than if
where a generator matrix of and a generator matrix of .
Note that codes from same algebras may have different as we can see in the Example 1.
Example 1
Let and be two spacetime block codes and a generator matrix of . Note that and come from the algebra and
while
Soon, .
Definition iv.2
Let be a set of spacetime block codes, where for all . We say that is an optimal spacetime block codes in , if
,
for all .
Now we stablish a strategy to minimize
Note that the irreducible polynomial of over is , where and the irreducible polynomial of over is
where and
We can see by (6) that minimize is the same that minimize
One strategy to minimize (triangular inequality) is first minimize
Proposition 2
Let , with a positive squarefree integer and its ring of integer. If then there exists such that
Proof:
If , then with . Taking we need to check the following cases:

if are even, then (take and ).

if is odd and is even, then (take and ).

if are odd, then (take and ).
So, given , there exists such that .
Otherwise, if , then , with . Analogous, taking and checking the same cases as above we conclude that there exists such that .
v Optimal SpaceTime Block Codes designs
The Golden Code is a perfect spacetime block code for twotransmitter antennas with minimum determinant 1 [31]. We can to verify by (5) that
In [21], the authors proved that the spacetime block code
In addition, they also have proved that is an optimal spacetime block code over with
As we can see, in terms of normalized density analysis the spacetime block code is better than
According to these considerations, there is a question unanswered. Is an optimal spacetime block code when compared with any spacetime block code , with a positive squarefree integer? In order to give an answer to this question, we will see that is enough to find optimal spacetime block codes over with
Suppose that there exists a spacetime block code better than , i.e., there exists a spacetime block code , with a positive squarefree integer, such that in other words, by Definition (iv.1)
,
where is a generator matrix of the lattice obtained via
Let’s to analyse when .
In the Section III we have seen that,

if , then . Soon are the only satisfying .

if then . Soon, are the only satisfying .
So, we only need to consider .
Therefore, from now on we will find the optimal spacetime block codes over with in order to compare with . To do it we need to find convenient and , where is not algebraic norm of over . The corollaries bellow will be useful in this search.
Corollary 1
Let . If , then is not algebraic norm of over .
Proof:
Our goal is to show that the equation has no solution in the field of 3adic numbers , and thus, no solution for all
Let be the valuation ring of , where denotes the 3adic valuation of . Since , it follows that , and then . Taking obviously . Note that and By Hensel’s Lemma [32], it follows that such that , i.e., . It means that . Thus we can view the field as a subfield of . Analogously, the field can be viewed as a subfield of .
Furthermore, the norm map is then a restriction of the norm maps , where .
Thus, in order to prove our claim, it is enough to show that is not in the image of the map
Set and . Suppose on the contrary, that there are adic numbers and such that . We first show that and are in i.e., and . Assume that at least one of them has a negative exponent 3adic valuation, i.e.,

if , then and . Since the nonarchimedean property (see [32]) implies that .

if , then . Since and , it follows that
Thus . Again, the nonarchimedean property implies that .
In both cases,