Serial Concatenation of Reed Muller and LDPC Codes with Low Error Floor
AffiliationUniv Arizona, Dept Elect & Comp Engn
MetadataShow full item record
CitationX. Xiao, M. Nasseri, B. Vasić and S. Lin, "Serial concatenation of reed muller and LDPC codes with low error floor," 2017 55th Annual Allerton Conference on Communication, Control, and Computing (Allerton), Monticello, IL, 2017, pp. 688-693. doi: 10.1109/ALLERTON.2017.8262804
RightsCopyright © 2017, IEEE
Collection InformationThis item from the UA Faculty Publications collection is made available by the University of Arizona with support from the University of Arizona Libraries. If you have questions, please contact us at firstname.lastname@example.org.
AbstractIn this paper, we propose a concatenated coding scheme involving an outer Reed-Muller (RM) code and an inner Finite Field low-density parity check (LDPC) code of medium length and high rate. It lowers the error floor of inner Finite Field LDPC code. This concatenation scheme offers flexibility in design and it is easy to implement. In addition, the decoding works in a serial turbo manner and has no harmful trapping sets of size smaller than the minimum distance of the outer code. The simulation results indicate that the proposed serial concatenation can eliminate the dominant trapping sets of the inner Finite Field LDPC code.
VersionFinal accepted manuscript
SponsorsNSF [ECCS-1500170]; Indo-US Science and Technology Forum (IUSSTF) through the Joint Networked Center for Data Storage Research [JC-16-2014-US]