Paper Info
Title
Spatially-coupled precoded rateless codes
Abstract
Raptor codes are rateless codes that achieve the capacity on the binary erasure channels. However the maximum degree of optimal output degree distribution is unbounded. This leads to a computational complexity problem both at encoders and decoders. Aref and Urbanke investigated the potential advantage of universal achieving-capacity property of proposed spatially-coupled (SC) low-density generator matrix (LDGM) codes. However the decoding error probability of SC-LDGM codes is bounded away from 0. In this paper, we investigate SC-LDGM codes concatenated with SC low-density parity-check codes. The proposed codes can be regarded as SC Hsu-Anastasopoulos rateless codes. We derive a lower bound of the asymptotic overhead from stability analysis for successful decoding by density evolution. The numerical calculation reveals that the lower bound is tight. We observe that with a sufficiently large number of information bits, the asymptotic overhead and the decoding error rate approach 0 with bounded maximum degree.
Year
DOI
Venue
2013
10.1109/ISIT.2013.6620664
Information Theory Proceedings
Keywords
DocType
Volume
computational complexity,matrix algebra,parity check codes,Hsu-Anastasopoulos rateless codes,LDGM codes,Raptor codes,SC low-density parity-check codes,binary erasure channels,computational complexity problem,density evolution,optimal output degree distribution,spatially-coupled low-density generator matrix codes,spatially-coupled precoded rateless codes,stability analysis
Journal
abs/1302.1511
ISSN
Citations 
PageRank 
2157-8095
2
0.41
References 
Authors
9
3
Name
Order
Citations
PageRank
Kosuke Sakata120.41
K. Kasai231933.57
Kohichi Sakaniwa333047.69