The max-log list algorithm (MLLA) - A list-sequence decoding algorithm that provides soft-symbol output

Forskningsoutput: TidskriftsbidragArtikel i vetenskaplig tidskrift

Abstract

We present a soft decoding algorithm for convolutional codes that simultaneously yields soft-sequence output, i.e., list sequence (LS) decoding, and soft-symbol output. The max-log list algorithm (MLLA) introduced in this paper provides near- optimum soft-symbol output equal to that of the max-log maximum a posteriori (MAP) probability algorithm. Simultaneously, the algorithm produces an ordered list containing LS-MAP estimates. The MLLA exists in an optimum and a suboptimum version that are different in that the optimum version produces optimum LS-MAP decoding for arbitrary list lengths, while the suboptimum low-complexity version only provides the MAP, the second-order MAP, and the third-order MAP sequence estimates. For lists with more than three elements, MAP decoding is not guaranteed, but the LS decoding is close to the optimal. It is demonstrated that the suboptimum/optimum MLLA can be used to obtain the combination of soft-symbol and soft-sequence outputs at lower complexity than a previously published algorithm. Furthermore, the suboptimum MLLA is well suited for operation in an iterative list (turbo) decoder, since it is obtained by only minor modifications of the well-known Max-Log-MAP algorithm frequently used for decoding of the component codes of turbo codes. Another potential area of application for the suboptimum/optimum MLLA is joint source-channel LS decoding. Estimates of complexity and memory use, as well as performance evaluations of the suboptimum/optimum MLLA, are provided in this paper.

Detaljer

Författare
  • Carl Fredrik Leanderson
  • CEW Sundberg
Enheter & grupper
Forskningsområden

Ämnesklassifikation (UKÄ) – OBLIGATORISK

  • Teknik och teknologier

Nyckelord

Originalspråkengelska
Sidor (från-till)433-444
TidskriftIEEE Transactions on Communications
Volym53
Utgivningsnummer3
StatusPublished - 2005
PublikationskategoriForskning
Peer review utfördJa