Adaptive Low Complexity MAP Decoding for Turbo Equalization (bibtex)
by , , ,
Abstract:
Turbo equalization is a powerful method to iteratively detect and decode convolutionally encoded data that is corrupted by inter symbol interference (ISI) and Gaussian noise. It is based on the exchange of reliability information between the equalizer and the decoder, which is typically some sort of maximum a posteriori (MAP) decoder. While the number of remaining errors in the received sequence decreases during the iteration process, the computational effort for decoding remains unchanged in each iteration. In this paper a syndrome based MAP decoder is proposed, that is capable of reducing the computational decoding effort during the iteration process without significantly influencing the convergence behavior.
Reference:
J. Geldmacher, K. Hueske, S. Bialas, J. Götze, Adaptive Low Complexity MAP Decoding for Turbo Equalization, In 6th International Symposium on Turbo Codes & Iterative Information Processing (ISTC'10), Brest, France, 2010.
Bibtex Entry:
@Conference{Geldmacher2010a,
  Title                    = {Adaptive Low Complexity MAP Decoding for Turbo Equalization},
  Author                   = {J. Geldmacher and K. Hueske and S. Bialas and J. G\"otze},
  Booktitle                = {6th International Symposium on Turbo Codes \& Iterative Information Processing (ISTC'10)},
  Year                     = {2010},

  Address                  = {Brest, France},
  Month                    = {August},

  Abstract                 = {Turbo equalization is a powerful method to iteratively detect and decode convolutionally encoded data that is corrupted by inter symbol interference (ISI) and Gaussian noise. It is based on the exchange of reliability information between the equalizer and the decoder, which is typically some sort of maximum a posteriori (MAP) decoder. While the number of remaining errors in the received sequence decreases during the iteration process, the computational effort for decoding remains unchanged in each iteration. In this paper a syndrome based MAP decoder is proposed, that is capable of reducing the computational decoding effort during the iteration process without significantly influencing the convergence behavior.},
  Doi                      = {10.1109/ISTC.2010.5613804},
  Gsid                     = {9219470194227492700},
  Url                      = {http://www.dt.e-technik.tu-dortmund.de/publikationen/istc2010_jan.pdf}
}
Powered by bibtexbrowser