| Full text | |
| Author(s): |
Pereira Vicente, Luis Gustavo
;
Sharma, Manish
;
IEEE
Total Authors: 3
|
| Document type: | Journal article |
| Source: | 2019 WORKSHOP ON COMMUNICATION NETWORKS AND POWER SYSTEMS (WCNPS); v. N/A, p. 4-pg., 2019-01-01. |
| Abstract | |
In this work, we present a method to design N-dimensional digital constellations in a Euclidean space using a vector quantization algorithm. The method starts with a subset of the lattice that contains all lattice points that are within a hypersphere, which is the maximum symbol energy constraint. By hypothesis, the method will find a digital constellation with the largest minimum distance, given the imposed energy restriction. Results show that the final solution is slightly better than the lattice-based constellation regarding symbol error probability as a function of peak signal-to-noise ratio. (AU) | |
| FAPESP's process: | 13/25977-7 - Security and reliability of Information: theory and practice |
| Grantee: | Marcelo Firer |
| Support Opportunities: | Research Projects - Thematic Grants |