Message-Wise Unequal Error Protection Based on Low-Density Parity-Check Codes

We propose a practical message-wise unequal error protection (UEP) scheme using low-density parity-check (LDPC) codes, where one or more special messages are more protected than other ordinary messages. In contrast to the information theoretic cavity coding scheme, which discards the codewords of ordinary messages near those of special messages, the proposed coding scheme performs codeword flipping to separate the codewords of special and ordinary messages without discarding any codewords. To better distinguish the original and flipped codewords, the LDPC codes with all-odd degree check nodes are employed. The decoder performs message type detection and codeword flipping detection based on the unsatisfied check nodes in iterative decoding. We provide performance analysis for both the message type detection and the codeword flipping detection. Moreover, we provide an asymptotic analysis on the detection error exponent to reveal the relationship between the proposed practical coding scheme and the information theoretically optimal cavity coding. Simulation results are provided to show that the proposed practical message-wise UEP schemes offer capacity-approaching protections to both types of messages as if only one type is transmitted.

[1]  Sujay Sanghavi,et al.  Some fundamental coding theoretic limits of unequal error protection , 2009, 2009 IEEE International Symposium on Information Theory.

[2]  Lizhong Zheng,et al.  Unequal Error Protection: Some Fundamental Limits , 2008, ArXiv.

[3]  Sae-Young Chung,et al.  Analysis of sum-product decoding of low-density parity-check codes using a Gaussian approximation , 2001, IEEE Trans. Inf. Theory.

[4]  Rüdiger L. Urbanke,et al.  Design of capacity-approaching irregular low-density parity-check codes , 2001, IEEE Trans. Inf. Theory.

[5]  Nazanin Rahnavard,et al.  Unequal Error Protection Using Partially Regular LDPC Codes , 2007, IEEE Transactions on Communications.

[6]  Omid Etesami,et al.  Raptor codes on binary memoryless symmetric channels , 2006, IEEE Transactions on Information Theory.

[7]  Rüdiger L. Urbanke,et al.  The capacity of low-density parity-check codes under message-passing decoding , 2001, IEEE Trans. Inf. Theory.

[8]  Stephan ten Brink,et al.  Design of low-density parity-check codes for modulation and detection , 2004, IEEE Transactions on Communications.

[9]  Guosen Yue,et al.  A new binary iterative LDPC decoding algorithm , 2008, 2008 5th International Symposium on Turbo Codes and Related Topics.

[10]  David J. C. MacKay,et al.  Good Error-Correcting Codes Based on Very Sparse Matrices , 1997, IEEE Trans. Inf. Theory.

[11]  Alain Glavieux,et al.  Reflections on the Prize Paper : "Near optimum error-correcting coding and decoding: turbo codes" , 1998 .

[12]  Nazanin Rahnavard,et al.  Rateless Codes With Unequal Error Protection Property , 2007, IEEE Transactions on Information Theory.

[13]  Lizhong Zheng,et al.  some fundamental limits of unequal error protection , 2008, 2008 IEEE International Symposium on Information Theory.