LDPC Decoding with Natural Redundancy




Abstract: NVMs have become a main technology for big-data storage. To ensure long-term data reliability, new techniques for error correction are being explored. This paper studies the discovery of natural redundancy(NR) in compressed data, and combines it with LDPC codes. It explores the density evolution of LDPC decoding given information from NR decoders. It also proposes a theoretical model for compressed languages, and studies iterative decoding between the LDPC decoder and the NR decoder.

Bio: Pulakesh Upadhyaya is a Ph.D. student at Texas A&M University. His research interests include coding for non-volatile memories, coding for natural redundancy and information retrieval.