In this paper, we present an overview on the design of algorithms for iterative detection over channels with memory. The starting point for all the algorithms is the implementation of soft-input soft-ouput maximum a posteriori (MAP) symbol detection strategies for transmissions over channels encompassing unknown parameters, either stochastic or deterministic. The proposed solutions represent effective ways to reach this goal. The described algorithms are grouped into three categories: i) we first introduce algorithms for adaptive iterative detection, where the unknown channel parameters are explicitly estimated; ii) then, we consider finite-memory iterative detection algorithms, based on ad hoc truncation of the channel memory and often interpretable as based on an implicit estimation of the channel parameters; and iii) finally, we present a general detection-theoretic approach to derive optimal detection algorithms with polynomial complexity. A few illustrative numerical results are also presented.

Iterative detection for channels with memory / Achilleas, Anastasopoulos; Keith M., Chugg; Colavolpe, Giulio; Ferrari, Gianluigi; Raheli, Riccardo. - In: PROCEEDINGS OF THE IEEE. - ISSN 0018-9219. - 95:(2007), pp. 1272-1294. [10.1109/JPROC.2007.896511]

Iterative detection for channels with memory

COLAVOLPE, Giulio;FERRARI, Gianluigi;RAHELI, Riccardo
2007-01-01

Abstract

In this paper, we present an overview on the design of algorithms for iterative detection over channels with memory. The starting point for all the algorithms is the implementation of soft-input soft-ouput maximum a posteriori (MAP) symbol detection strategies for transmissions over channels encompassing unknown parameters, either stochastic or deterministic. The proposed solutions represent effective ways to reach this goal. The described algorithms are grouped into three categories: i) we first introduce algorithms for adaptive iterative detection, where the unknown channel parameters are explicitly estimated; ii) then, we consider finite-memory iterative detection algorithms, based on ad hoc truncation of the channel memory and often interpretable as based on an implicit estimation of the channel parameters; and iii) finally, we present a general detection-theoretic approach to derive optimal detection algorithms with polynomial complexity. A few illustrative numerical results are also presented.
2007
Iterative detection for channels with memory / Achilleas, Anastasopoulos; Keith M., Chugg; Colavolpe, Giulio; Ferrari, Gianluigi; Raheli, Riccardo. - In: PROCEEDINGS OF THE IEEE. - ISSN 0018-9219. - 95:(2007), pp. 1272-1294. [10.1109/JPROC.2007.896511]
File in questo prodotto:
File Dimensione Formato  
j33.pdf

non disponibili

Tipologia: Documento in Post-print
Licenza: NON PUBBLICO - Accesso privato/ristretto
Dimensione 735.44 kB
Formato Adobe PDF
735.44 kB Adobe PDF   Visualizza/Apri   Richiedi una copia

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/11381/1639769
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 26
  • ???jsp.display-item.citation.isi??? 19
social impact