Protograph-based LDPC code design for bit-metric decoding
Authors:
- 1 June 2015
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 21578095,p. 1089-1093
Abstract
A protograph-based low-density parity-check (LDPC) code design technique for bandwidth-efficient coded modulation is presented. The approach jointly optimizes the LDPC code node degrees and the mapping of the coded bits to the bit-interleaved coded modulation (BICM) bit-channels. For BICM with uniform input and for BICM with probabilistic shaping, binary-input symmetric-output surrogate channels are constructed and used for code design. The constructed codes perform as good as multi-edge type codes of Zhang and Kschischang (2013). For 64-ASK with probabilistic shaping, a blocklength 64800 code is constructed that operates within 0.69 dB of 1 over 2 log 2 (1 + SNR) at a spectral efficiency of 4.25 bits/channel use and a frame error rate of 10 -3 .Keywords
All Related Versions
This publication has 17 references indexed in Scilit:
- Improving soft FEC performance for higher-order modulations via optimized bit channel mappingsOptics Express, 2014
- Optimized bit mappings for spatially coupled LDPC codes over parallel binary erasure channels2014
- Probabilistic signal shaping for bit-metric decoding2014
- Multi-Edge-Type Low-Density Parity-Check Codes for Bandwidth-Efficient ModulationIEEE Transactions on Communications, 2012
- Protograph-based q-ary LDPC codes for higher-order modulation2010
- Bit-Interleaved Coded Modulation Revisited: A Mismatched Decoding PerspectiveIEEE Transactions on Information Theory, 2009
- Protograph LDPC Codes Design Based on EXIT Analysis2007
- Protograph Based Low Error Floor LDPC Coded Modulation2006
- Convergence of iterative decodingElectronics Letters, 1999
- Differential Evolution – A Simple and Efficient Heuristic for global Optimization over Continuous SpacesJournal of Global Optimization, 1997