跳到主要导航 跳到搜索 跳到主要内容

A proof of the hadamard transform decoding of the belief propagation algorithm for LDPCC over GF(q)

  • Chongqing University of Posts and Telecommunications
  • Concordia University

科研成果: 期刊稿件会议文章同行评审

摘要

LDPCC belief-propagation decoding algorithm uses a bipartite graph and sends belief messages between the variable symbols and the checks in an iterative process. The message that a check sends to a variable symbol can be calculated using Hadamard transform, as introduced in. However, the explicit proof of the correctness of the FHT implementation of the decoding algorithm has not been seen in the literature so far. In this paper, we give a proof for the FHT implementation of the decoding algorithm for LDPC codes over GF(q).

源语言英语
页(从-至)2518-2519
页数2
期刊IEEE Vehicular Technology Conference
60
4
出版状态已出版 - 2004
已对外发布
活动2004 IEEE 60th Vehicular Technology Conference, VTC2004-Fall: Wireless Technologies for Global Security - Los Angeles, CA, 美国
期限: 26 9月 200429 9月 2004

指纹

探究 'A proof of the hadamard transform decoding of the belief propagation algorithm for LDPCC over GF(q)' 的科研主题。它们共同构成独一无二的指纹。

引用此