arXiv subjects

Emanuele Viterbo

Publications and source records attributed to Emanuele Viterbo.

93 records · Page 6Linked to original sources

arXiv2007

On the performance of Golden space-time trellis coded modulation over MIMO block fading channels

The Golden space-time trellis coded modulation (GST-TCM) scheme was proposed in \cite{Hong06} for a high rate $2\times 2$ multiple-input multiple-output (MIMO) system over slow fading channels. In this letter, we present the performance analysis of GST-TCM over block fading channels, where the channel matrix is constant over a fraction of the codeword length and varies from one fraction to another, independently. In practice, it is not useful to design such codes for specific block fading channel parameters and a robust solution is preferable. We then show both analytically and by simulation that the GST-TCM designed for slow fading channels are indeed robust to all block fading channel conditions.

cs.IT↗

arXiv2007

Sphere Lower Bound for Rotated Lattice Constellations in Fading Channels

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.

cs.IT↗

arXiv2007

Golden Space-Time Trellis Coded Modulation

In this paper, we present a concatenated coding scheme for a high rate $2\times 2$ multiple-input multiple-output (MIMO) system over slow fading channels. The inner code is the Golden code \cite{Golden05} and the outer code is a trellis code. Set partitioning of the Golden code is designed specifically to increase the minimum determinant. The branches of the outer trellis code are labeled with these partitions. Viterbi algorithm is applied for trellis decoding. In order to compute the branch metrics a lattice sphere decoder is used. The general framework for code optimization is given. The performance of the proposed concatenated scheme is evaluated by simulation. It is shown that the proposed scheme achieves significant performance gains over uncoded Golden code.

cs.IT↗