One-bit LDPC message passing decoding algorithm based on maximization of mutual information (情報理論)

スポンサーリンク

概要

• 論文の詳細を見る

• We propose an discrete message passing decoding algorithm for Low-Density Parity-Check (LDPC) codes under Additive White Gaussian Noise (AWGN) channel assumption. The message-passing decoding map is derived by using an optimum quantizer that maximizes mutual information, using the technique of density evolution. We focus on the case of 1-bit messages The new algorithm has comparable error rate compared with the lowest error rate given by the extensively studied group of Weighted Bit-Flipping (WBP) algorithms. In addition, the new algorithm has very low complexity.

• 2011-09-22

著者

• Kurkoski Brian

  Dept. Of Inf. And Communications Engineering University Of Electro-communications

• Zou Sheng

  University Of Science And Technology Of China (ustc)

• Kurkoski Brian

  Dept. Of Information And Communications Engineering University Of Electro-communications Uec

関連論文

• Watermarking-Based Method for Image Authentication and Image Recovery
• Robust image hashing against geometric attacks using image normalization and SVD decomposition
• Robust image hashing against geometric attacks using image normalization and SVD decomposition (ワイドバンドシステム・情報通信基礎サブソサイエティ合同研究会)
• Robust image hashing against geometric attacks using image normalization and SVD decomposition (情報セキュリティ・情報通信基礎サブソサイエティ合同研究会)
• Noise Thresholds for GF(q) LDPC Codes Using Reduced-Complexity Decoding
• Generalization of "Algorithm E" for Decoding LDPC Codes Over GF(q)(HISC2006)
• Turbo Decoding Based on the Lookup-Table Algorithm
• Tracing Illegal Users of Video Content Using Watermarking and Fingerprinting
• One-bit LDPC message passing decoding algorithm based on maximization of mutual information (情報理論)

スポンサーリンク