Consiglio Nazionale delle Ricerche

Tipo di prodottoRapporto tecnico
TitoloPPM Poisson Channel
Anno di pubblicazione2015
FormatoElettronico
Autore/iFlavio Zabini, Balazs Matuz, Gianluigi Liva, Enrico Paolini, Marco Chiani, Oreste Andrisano
Affiliazioni autoriUniversity of Bologna DLR DLR University of Bologna University of Bologna University of Bologna
Autori CNR e affiliazioni
  • MARCO CHIANI
  • ORESTE ANDRISANO
Lingua/e
  • inglese
SintesiThis report investigates the finite-length block error probability for the pulse position modulation (PPM) Poisson channel. Amongst, expressions for the Gallager random coding bound (RCB) and the Gaussian approximation of the converse theorem are derived (with a refinement of the third order term). Likewise, we introduce an erasure channel (EC) approximation that allows the application of known EC bounds to the PPM Poisson channel by matching the channel capacities. We show that the derived benchmarks are not only simple to compute, but also accurate. Moreover, an attempt to get a Dependence Testing (DT) bound is reported.
Lingua sintesieng
Altra sintesi-
Lingua altra sintesi-
Pagine da1
Pagine a11
Pagine totali11
Serie/Collana-
Numero volume della serie/collana-
ISBN-
Editore-
Parole chiavediscrete memoryless channel, pulse position modulation, random coding bound
Link (URL, URI)-
Titolo parallelo-
ID report/working paper-
Note/Altre informazioni-
Strutture CNR
  • IEIIT — IEIIT - Sede secondaria di Bologna
Moduli CNR
    Progetti Europei-
    Allegati
    • PPM Poisson Channel
      Descrizione: This report investigates the finite-length block error probability for the pulse position modulation (PPM) Poisson channel. Amongst, expressions for the Gallager random coding bound (RCB) and the Gaussian approximation of the converse theorem are derived (with a refinement of the third order term). Likewise, we introduce an erasure channel (EC) approximation that allows the application of known EC bounds to the PPM Poisson channel by matching the channel capacities. We show that the derived benchmarks are not only simple to compute, but also accurate. Moreover, an attempt to get a Dependence Testing (DT) bound is reported.