EXIT Function Aided Design of Iteratively Decodable Codes for the Poisson PPM Channel

Barsoum, Maged; Moision, Bruce; Fitz, M.P.; Hamkins, Jon

doi:10.1109/tcomm.2010.110310.060572

Cited by 19 publications

(35 citation statements)

References 23 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Likewise, we consider the base matrix of a (binary) ARA code from [23] that was suggested for the PPM Poisson channel and is given by The iterative decoding threshold of the ensemble on the q-EC is ǫ * = 0.442. Table I provides iterative decoding thresholds for two nonbinary code ensembles on the 64-ary PPM Poisson channel.…”

Section: Selected Protographsmentioning

confidence: 99%

“…Observe that the best code, namely C 64 1 , performs always within 0.5 dB from the theoretical bounds, while C 64 2 loses due to its worse iterative decoding threshold. In [23] a binary code C 2 3 (8192, 4096) was derived from B 2 and used for transmission over the PPM Poisson channel. Iterative message passing between the demodulator and the decoder was performed.…”

Section: Selected Protographsmentioning

confidence: 99%

See 1 more Smart Citation

The PPM poisson channel: Finite-length bounds and code design

Zabini

Matuz

Liva

et al. 2014

2014 8th International Symposium on Turbo Codes and Iterative Information Processing (ISTC)

View full text Add to dashboard Cite

This work 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. 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. Additionally, the design of protograph-based non-binary low-density parity-check (LDPC) codes for the (PPM) Poisson channel is addressed. The order q of the finite field is directly matched to the PPM order, so that no iterative message exchange between the decoder and the demodulator is required. The suggested design turns out to be robust w.r.t. different channel parameters, yielding performances within 0.5 dB from the theoretical benchmarks.

show abstract

Section: Selected Protographsmentioning

confidence: 99%

Section: Selected Protographsmentioning

confidence: 99%

The PPM poisson channel: Finite-length bounds and code design

Zabini

Matuz

Liva

et al. 2014

2014 8th International Symposium on Turbo Codes and Iterative Information Processing (ISTC)

View full text Add to dashboard Cite

show abstract

“…With the rise of iterative coding schemes, such as turbo codes [7] or low-density parity-check (LDPC) codes [8], significant gains could be achieved. For instance, the binary LDPC coding scheme proposed in [9] outperforms a classical RS code by more than 3 dB at a bit error rate (BER) of 10 −5 for 64-ary PPM. Hereby, messages are not only exchanged iteratively between the nodes of the B.…”

Section: Introductionmentioning

confidence: 99%

“…Matuz LDPC decoder, but also between the PPM demodulator and the decoder. A competing binary iterative scheme, originally introduced in [10], outperforms the LDPC scheme of [9] by a few tenths of dB. So-called serially concatenated pulse position modulation (SCPPM) currently represents, to the best of the authors' knowledge, the most powerful coding scheme for the Poisson channel with PPM.…”

Section: Introductionmentioning

confidence: 99%

“…This work investigates the design of non-binary LDPC codes for direct detection optical links. As opposed to the binary schemes in [9], [10], iterative message passing between the demodulator and the channel code is no longer required since the finite field size is matched with the modulation order. Resulting from that, the PPM soft demodulator computes probabilities (modulation) symbolwise which are directly mapped onto code symbol probabilities.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

A robust pulse position coded modulation scheme for the Poisson channel

Matuz

Toscano

Liva

et al. 2014

2014 IEEE International Conference on Communications (ICC)

View full text Add to dashboard Cite

A coded modulation scheme for the Poisson channel is investigated. The scheme relies on the serial concatenation of an outer low-density parity-check (LDPC) code over an order-q finite field and q-ary pulse position modulation (PPM). Due to the matching between code and modulation symbols, no iterative message exchange between the decoder and the modulator is required. The PPM capacity limit serves as a reference to evaluate the efficiency of the proposed scheme in the asymptotic setting via density evolution. A simplified form of the Gallager random coding bound (RCB) is also developed and used as a reference for the finite-length performance of the coded modulation scheme. The optimization via density evolution is performed on a surrogate (erasure) channel, yielding excellent iterative decoding thresholds for a wide range of channel parameters. The proposed coded modulation technique performs close to the theoretical bounds not only asymptotically, but also for moderate block lengths. It turns to represent a viable solution for deep-space direct detection optical links, for which the Poisson channel is adopted as a model.

show abstract