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.

PPM Poisson Channel

Marco Chiani;Oreste Andrisano
2015

Abstract

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.
2015
Istituto di Elettronica e di Ingegneria dell'Informazione e delle Telecomunicazioni - IEIIT
discrete memoryless channel
pulse position modulation
random coding bound
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.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/20.500.14243/294491
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus ND
  • ???jsp.display-item.citation.isi??? ND
social impact