Design of asymptotically optimal improper constellations with hexagonal packing
Ver/ Abrir
Registro completo
Mostrar el registro completo DCAutoría
López Fernández, Jesús Alberto; González Ayestarán, Rafael; Santamaría Caballero, Luis Ignacio

Fecha
2019-08Derechos
© 2019 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.
Publicado en
IEEE Transactions on Communications, 2019, 67(8), 5445-5457
Editorial
Institute of Electrical and Electronics Engineers Inc.
Enlace a la publicación
Palabras clave
Improper signals
Gaussian noise channels
Two-dimensional lattices
Widely linear processing
Resumen/Abstract
This paper addresses the problem of designing asymptotically optimal improper constellations with a given circularity coefficient (correlation coefficient between the constellation and its complex conjugate). The designed constellations are optimal in the sense that, at high signal-to-noise-ratio (SNR) and for a large number of symbols, yield the lowest probability of error under an average power constraint for additive white Gaussian noise channels. As the number of symbols grows, the optimal constellation is the intersection of the hexagonal lattice with an ellipse whose eccentricity determines the circularity coefficient. Based on this asymptotic result, we propose an algorithm to design finite improper constellations. The proposed constellations provide significant SNR gains with respect to previous improper designs, which were generated through a widely linear transformation of a standard M-ary quadrature amplitude modulation constellation. As an application example, we study the use of these improper constellations by a secondary user in an underlay cognitive radio network.
Colecciones a las que pertenece
- D12 Artículos [360]
- D12 Proyectos de Investigación [517]