This paper investigates the design of non-binary protograph low-density parity-check codes for the Poisson channel with m -ary pulse position modulation. The field order over which the code is constructed is matched to the pulse position modulation order yielding a coded modulation scheme. The optimization of the low-density parity-check code structure is performed via protograph density evolution on a surrogate m -ary erasure channel. The surrogate design is illustrated to be not only accurate, but also robust for a range of practical values of channel background noise and various modulation orders. As a result the proposed codes show excellent performance over the Poisson channel with pulse position modulation outperforming competing schemes. As a side-product of this paper, finite-length benchmarks on the block error probability are provided, together with a union bound to characterize the code performance in the error floor region.
Matuz, B., Paolini, E., Zabini, F., Liva, G. (2017). Non-Binary LDPC Code Design for the Poisson PPM Channel. IEEE TRANSACTIONS ON COMMUNICATIONS, 65(11), 4600-4611 [10.1109/TCOMM.2017.2730868].
Non-Binary LDPC Code Design for the Poisson PPM Channel
Paolini, Enrico;Zabini, Flavio;
2017
Abstract
This paper investigates the design of non-binary protograph low-density parity-check codes for the Poisson channel with m -ary pulse position modulation. The field order over which the code is constructed is matched to the pulse position modulation order yielding a coded modulation scheme. The optimization of the low-density parity-check code structure is performed via protograph density evolution on a surrogate m -ary erasure channel. The surrogate design is illustrated to be not only accurate, but also robust for a range of practical values of channel background noise and various modulation orders. As a result the proposed codes show excellent performance over the Poisson channel with pulse position modulation outperforming competing schemes. As a side-product of this paper, finite-length benchmarks on the block error probability are provided, together with a union bound to characterize the code performance in the error floor region.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.