In this letter we consider turbo decoding of parallel concatenated Single Parity Check (K+1,K) codes, with row-column interleaving. Existence and uniqueness of the asymptotic probability density evaluated with the turbo algorithm is proved for every length K and every signal-to-noise ratio.
Existence and uniqueness of the solution for turbo decoding of parallel concatenated Single Parity Check codes
M P Ferrari
2003
Abstract
In this letter we consider turbo decoding of parallel concatenated Single Parity Check (K+1,K) codes, with row-column interleaving. Existence and uniqueness of the asymptotic probability density evaluated with the turbo algorithm is proved for every length K and every signal-to-noise ratio.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
