Department of Mathematics
 Search | Help | Login | pdf version | printable version

Math @ Duke



Publications [#319333] of Henry Pfister

Papers Published

  1. Obata, N; Jian, YY; Kasai, K; Pfister, HD, Spatially-coupled multi-edge type LDPC codes with bounded degrees that achieve capacity on the BEC under BP decoding, Ieee International Symposium on Information Theory Proceedings (December, 2013), pp. 2433-2437, IEEE, ISBN 9781479904464 [doi]
    (last updated on 2019/07/16)

    Convolutional (or spatially-coupled) low-density parity-check (LDPC) codes have now been shown to approach capacity for a variety of problems. Yet, most of these results require sequences of regular LDPC ensembles with increasing variable and check degrees. Previously, Kasai and Sakaniwa showed empirically that, for the BEC, this limitation can be overcome by using spatially-coupled MacKay-Neal (MN) and Hsu-Anastasopoulos (HA) ensembles. In this paper, we prove this analytically for (k, 2, 2)-MN and (2, k, 2)-HA ensembles when k is at least 3. The proof is based on the simple approach to threshold saturation, introduced by Yedla et al., which relies on potential functions. The key step is verifying the non-negativity of a potential function associated with the uncoupled system. Along the way, we derive the potential function general multi-edge type (MET) LDPC ensembles and establish a duality relationship between dual ensembles of MET LDPC codes. © 2013 IEEE.
ph: 919.660.2800
fax: 919.660.2821

Mathematics Department
Duke University, Box 90320
Durham, NC 27708-0320