Wyniki wyszukiwania - BazTech

Ograniczanie wyników

1 Electronics and Telecommunications Quarterly

1 2009

Znaleziono wyników: 1

Liczba wyników na stronie

Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: reduced-complexity algorithms

Sortuj według:

Ogranicz wyniki do:

Log-MAP Decoding of Turbo Codes and Turbo Trellis-Codec Modulation Using Piecewise-Linear Approximations of the max* Operator

Sybis M., Tyczka P., Papaharalabos S., Mathiopoulos P. T., Masera G., Martina M.

Electronics and Telecommunications Quarterly

2009

Vol. 55, No 3

435-451

A novel approach for approximating the max* operator, used in the Log-MAP decoding algorithm, is presented. In this approximation it is not necessary to use any additional correction term, as previous approximation methods require. Several decoding algorithms are obtained for both turbo and turbo trellis-coded modulation (TTCM) codes with optimal and near-optimal bit error rate (BER) performance depending on a single parameter, namely the number of piecewise-linear (PWL) approximation terms used. The decoding complexity is estimated, showing the practical implementation advantages of the proposed method against the Log-MAP algorithm.