Buscar
Mostrando ítems 1-10 de 165
On the Optimality of Finite Constellations from Algebraic Lattices
(2001-04-01)
A construction technique of finite point constellations in n-dimensional spaces from ideals in rings of algebraic integers is described. An algorithm is presented to find constellations with minimum average energy from a ...
On the Optimality of Finite Constellations from Algebraic Lattices
(2001-04-01)
A construction technique of finite point constellations in n-dimensional spaces from ideals in rings of algebraic integers is described. An algorithm is presented to find constellations with minimum average energy from a ...
Signal constellations in the hyperbolic plane: A proposal for new communication systems
(Pergamon-elsevier Science LtdOxfordInglaterra, 2006)
Lattice constellations matched to GF(p)
(1997-12-01)
Signal sets matched to the additive group of GF(p) under the Mannheim distance are constructed. Such constellations are obtained via the ring of algebraic integers of an extension K=Q(√d) of Q, Where d=-1 or d=-3. The ...
Construction of perfect space-time codes
(2013-04-29)
In this work, we propose an innovative methodology to extend the construction of minimum and non-minimum delay perfect codes as a subset of cyclic division algebras over ℚ(ζ3), where the signal constellations are isomorphic ...
Construction of perfect space-time codes
(2013-04-29)
In this work, we propose an innovative methodology to extend the construction of minimum and non-minimum delay perfect codes as a subset of cyclic division algebras over ℚ(ζ3), where the signal constellations are isomorphic ...
On the construction of perfect codes from HEX signal constellations
(Pergamon-Elsevier B.V. Ltd, 2012-12-01)
Recently, minimum and non-minimum delay perfect codes were proposed for any channel of dimension n. Their construction appears in the literature as a subset of cyclic division algebras over Q(zeta(3)) only for the dimension ...