About cookies on this site Our websites require some cookies to function properly (required). In addition, other cookies may be used with your consent to analyze site usage, improve the user experience and for advertising. For more information, please review your options. By visiting our website, you agree to our processing of information as described in IBM’sprivacy statement. To provide a smooth navigation, your cookie preferences will be shared across the IBM web domains listed here.
Publication
ISIT 2007
Conference paper
Rateless Slepian-Wolf coding based on rate adaptive low-density-parity- check codes
Abstract
A rateless Slepian-Wolf coding (SWC) scheme based on rate adaptive low-density-parity-check (LDPC) codes is presented. We first motivate the application of punctured LDPC codes in SWC. A general rate adaptive LDPC framework is then described. The main idea is to adjust the puncturing ratio in the specified variable nodes for rate adaptivity while keeping the bipartite graph structure intact. As a complement, a repetition scheme is proposed for high rate SWC. The asymptotic performance of the proposed scheme is analyzed by density evolution (DE) with universal coding bounds and finite code length performance is verified by computer simulations. ©2007 IEEE.