Name
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1109/ICC.2014.6883636 | Communications |
Keywords | Field | DocType |
iterative decoding,modulation coding,optical links,parity check codes,pulse position modulation,random codes,space communication links,Gallager RCB,Gallager random coding bound,LDPC code,PPM capacity limit,Poisson channel,asymptotic setting,channel parameters,code symbol,deep-space direct detection optical links,density evolution,erasure channel,finite-length performance,iterative decoding threshold,low-density parity-check code,modulation symbol,optimization,order-q finite field,q-ary PPM,q-ary pulse position modulation,robust pulse position coded modulation scheme,serial concatenation,surrogate channel | Finite field,Pulse-position modulation,Low-density parity-check code,Computer science,Algorithm,Communication channel,Real-time computing,Modulation,Theoretical computer science,Concatenation,Decoding methods,Erasure | Conference |
ISSN | Citations | PageRank |
1550-3607 | 4 | 0.40 |
References | Authors | |
16 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Matuz, B. | 1 | 9 | 0.84 |
| Toscano, G. | 2 | 4 | 0.40 |
| Gianluigi Liva | 3 | 861 | 75.40 |
| Paolini, E. | 4 | 39 | 3.34 |