2007/07/04 by Albert Guillén i Fàbregas, Fabregas, Albert Guillen i, Emanuele Viterbo +1
Computer Science · Engineering · #Cellular Automata and Applications #Coding theory and cryptography #FOS: Computer and information sciences #Information Theory (cs.IT) #graph theory and CDMA systems
paper · pdf · doi:10.48550/arxiv.0707.0649
openalex publication_date 2007/07/04 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We study the error probability performance of rotated lattice constellations in frequency-flat Nakagami-m block-fading channels. In particular, we use the sphere lower bound on the underlying infinite lattice as a performance benchmark. We show that the sphere lower bound has full diversity. We observe that optimally rotated lattices with largest known minimum product distance perform very close to the lower bound, while the ensemble of random rotations is shown to lack diversity and perform far from it.