Protograph-Based LDPC Code Design for Shaped Bit-Metric Decoding
Preprint
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 for the code design are used. The constructed codes for uniform inputs perform as good as the multi-edge type codes of Zhang and Kschischang (2013). For 8-ASK and 64-ASK with probabilistic shaping, codes of rates 2/3 and 5/6 with blocklength 64800 are designed, which operate within 0.63dB and 0.69dB of continuous AWGN capacity for a target frame error rate of 1e-3 at spectral efficiencies of 1.38 and 4.25 bits/channel use, respectively.Keywords
All Related Versions
This publication has 9 references indexed in Scilit:
- Constant Composition Distribution MatchingIEEE Transactions on Information Theory, 2015
- Bandwidth Efficient and Rate-Matched Low-Density Parity-Check Coded ModulationIEEE Transactions on Communications, 2015
- Unequal Diversity LDPC Codes for Relay ChannelsIEEE Transactions on Wireless Communications, 2013
- Multi-Edge-Type Low-Density Parity-Check Codes for Bandwidth-Efficient ModulationIEEE Transactions on Communications, 2012
- Bit-Interleaved Coded Modulation Revisited: A Mismatched Decoding PerspectiveIEEE Transactions on Information Theory, 2009
- Modern Coding Theory2008
- Design of capacity-approaching irregular low-density parity-check codesIEEE Transactions on Information Theory, 2001
- Differential Evolution – A Simple and Efficient Heuristic for global Optimization over Continuous SpacesJournal of Global Optimization, 1997
- 8-PSK trellis codes for a Rayleigh channelIEEE Transactions on Communications, 1992