Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
194 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Design of Robust, Protograph Based LDPC Codes for Rate-Adaptation via Probabilistic Shaping (1607.00356v1)

Published 1 Jul 2016 in cs.IT and math.IT

Abstract: In this work, the design of robust, protograph-based low-density parity-check (LDPC) codes for rate-adaptive communication via probabilistic shaping is considered. Recently, probabilistic amplitude shaping (PAS) by B\"ocherer et al. has been introduced for capacity approaching and rate-adaptive communication with a bitwise-demapper and binary decoder. Previous work by the authors considered the optimization of protograph based LDPC codes for PAS and specific spectral efficiencies (SEs) to jointly optimize the LDPC code node degrees and the mapping of the coded bits to the bit-interleaved coded modulation (BICM) bit-channels. We show that these codes tend to perform poor when operated at other rates and propose the design of robust LDPC codes by employing a min-max approach in the search for good protograph ensembles via differential evolution. The considered design uses a single 16 amplitude-shift-keying (ASK) constellation and a robust 13/16 rate LDPC code to operate between 0.7 to 2.7 bits per channel use. For a blocklength of 16224 bits and a target frame error rate of 1e-3 the proposed code operates within 1.32 dB of continuous AWGN capacity for 0.7 to 1.3 bpcu and within 1.05 dB for 1.3 bpcu to 2.7 bpcu.

Citations (3)

Summary

We haven't generated a summary for this paper yet.