In this study, the authors deal with the problem of how to effectively approximate the max?? operator when having n > 2 input values, with the aim of reducing implementation complexity of conventional Log-MAP turbo decoders. They show that, contrary to previous approaches, it is not necessary to apply the max?? operator recursively over pairs of values. Instead, a simple, yet effective, solution for the max?? operator is revealed having the advantage of being in non-recursive form and thus, requiring less computational effort. Hardware synthesis results for practical turbo decoders have shown implementation savings for the proposed method against the most recent published efficient turbo decoding algorithms by providing near optimal bit error rate (BER) performance.

Non-recursive max* operator with reduced implementation complexity for turbo decoding / S., Papaharalabos; P. T., Mathiopoulos; Masera, Guido; Martina, Maurizio. - In: IET COMMUNICATIONS. - ISSN 1751-8628. - STAMPA. - 6:7(2012), pp. 702-707. [10.1049/iet-com.2011.0217]

Non-recursive max* operator with reduced implementation complexity for turbo decoding

MASERA, Guido;MARTINA, MAURIZIO
2012

Abstract

In this study, the authors deal with the problem of how to effectively approximate the max?? operator when having n > 2 input values, with the aim of reducing implementation complexity of conventional Log-MAP turbo decoders. They show that, contrary to previous approaches, it is not necessary to apply the max?? operator recursively over pairs of values. Instead, a simple, yet effective, solution for the max?? operator is revealed having the advantage of being in non-recursive form and thus, requiring less computational effort. Hardware synthesis results for practical turbo decoders have shown implementation savings for the proposed method against the most recent published efficient turbo decoding algorithms by providing near optimal bit error rate (BER) performance.
File in questo prodotto:
File Dimensione Formato  
paper_iet_v5.pdf

accesso aperto

Tipologia: 2. Post-print / Author's Accepted Manuscript
Licenza: PUBBLICO - Tutti i diritti riservati
Dimensione 135.08 kB
Formato Adobe PDF
135.08 kB Adobe PDF Visualizza/Apri
Pubblicazioni consigliate

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/11583/2497666
 Attenzione

Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo