This paper derives a saddlepoint approximation for the random-coding bound to the error probability of channel cod- ing by using complex-integration techniques. The approximation is given by a sum of two terms: one with Gallager’s exponent, and a second one with Arimoto’s strong converse exponent (above capacity) or the sphere-packing exponent (below the critical rate).
A complex-integration approach to the saddlepoint approximation for random-coding bounds
DALAI, Marco;
2014-01-01
Abstract
This paper derives a saddlepoint approximation for the random-coding bound to the error probability of channel cod- ing by using complex-integration techniques. The approximation is given by a sum of two terms: one with Gallager’s exponent, and a second one with Arimoto’s strong converse exponent (above capacity) or the sphere-packing exponent (below the critical rate).File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
MSDG_ISWCS_2014.pdf
gestori archivio
Descrizione: Articolo completo
Tipologia:
Full Text
Licenza:
NON PUBBLICO - Accesso privato/ristretto
Dimensione
289.76 kB
Formato
Adobe PDF
|
289.76 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.
