The main problem of space-time trellis codes is constituted by their complexity, which grows exponentially with the number of transmit antennas. To avoid this shortcoming, one can think to a suboptimum decoder in which a simplified metric, together with a preliminary filtering step, is used. In this paper, we develop this idea and give some possible choices for the filter design. These different choices are compared with one another by means of analytical tools and simulations.

A suboptimum iterative decoder for space-time trellis codes / Tarable, Alberto; Montorsi, Guido; Benedetto, Sergio. - 5:(2004), pp. 3000-3004. ((Intervento presentato al convegno Communications, 2004 IEEE International Conference on tenutosi a Paris (France) nel 20-24 June 2004 [10.1109/icc.2004.1313082].

A suboptimum iterative decoder for space-time trellis codes

TARABLE, ALBERTO;MONTORSI, Guido;BENEDETTO, Sergio
2004

Abstract

The main problem of space-time trellis codes is constituted by their complexity, which grows exponentially with the number of transmit antennas. To avoid this shortcoming, one can think to a suboptimum decoder in which a simplified metric, together with a preliminary filtering step, is used. In this paper, we develop this idea and give some possible choices for the filter design. These different choices are compared with one another by means of analytical tools and simulations.
File in questo prodotto:
File Dimensione Formato  
1534166.pdf

non disponibili

Tipologia: 2. Post-print / Author's Accepted Manuscript
Licenza: Non Pubblico - Accesso privato/ristretto
Dimensione 321.96 kB
Formato Adobe PDF
321.96 kB Adobe PDF   Visualizza/Apri   Richiedi una copia
Pubblicazioni consigliate

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11583/1534166
 Attenzione

Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo