Computer Science – Information Theory
Scientific paper
2007-07-04
Computer Science
Information Theory
accepted for publication at the IEEE Transactions on Wireless Communications
Scientific paper
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.
Fabregas Albert Guillen i.
Viterbo Emanuele
No associations
LandOfFree
Sphere Lower Bound for Rotated Lattice Constellations in Fading Channels does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Sphere Lower Bound for Rotated Lattice Constellations in Fading Channels, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Sphere Lower Bound for Rotated Lattice Constellations in Fading Channels will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-547731