In this article we focus on the channel decoding problem in presence of a-priori information. In particular, assuming that the a-priori information reliability is not perfectly estimated at the receiver, we derive a novel analytical framework for evaluating the decoder's performance. It is derived the important result that a good code, i.e., a code which allows to fully exploit the potential benefit of a-priori information, must associate information sequences with high Hamming distances to codewords with low Hamming distances. Basing on the proposed analysis, we analyze the performance of random codes and turbo codes.

Abrardo, A. (2009). Performance bounds and codes design criteria for channel decoding with a-priori information. IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, 8(2), 608-612 [10.1109/TWC.2009.071247].

Performance bounds and codes design criteria for channel decoding with a-priori information

ABRARDO, ANDREA
2009

Abstract

In this article we focus on the channel decoding problem in presence of a-priori information. In particular, assuming that the a-priori information reliability is not perfectly estimated at the receiver, we derive a novel analytical framework for evaluating the decoder's performance. It is derived the important result that a good code, i.e., a code which allows to fully exploit the potential benefit of a-priori information, must associate information sequences with high Hamming distances to codewords with low Hamming distances. Basing on the proposed analysis, we analyze the performance of random codes and turbo codes.
File in questo prodotto:
File Dimensione Formato  
paperk.pdf

non disponibili

Tipologia: Post-print
Licenza: NON PUBBLICO - Accesso privato/ristretto
Dimensione 175.06 kB
Formato Adobe PDF
175.06 kB Adobe PDF   Visualizza/Apri   Richiedi una copia

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: http://hdl.handle.net/11365/24835
 Attenzione

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