Iterative detection for channels with memory

doi:10.1109/JPROC.2007.896511

Iterative detection for channels with memory

2007-06-01

21

OA

AI

A

Achilleas Anastasopoulos *

DOI：10.1109/JPROC.2007.896511

Original

Original request for help

Save

Abstract

En 中文

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.

Keywords:

adaptive iterative detection

channels with memory

finite-memory detection

iterative detection/decoding

message passing detection algorithms

polynomial complexity detection

trellis-based detection

Iterative detection for channels with memory

Abstract

Journal

Organization