Numerical Comparison of IP Formulations as ML Decoders
Numerical Comparison of IP Formulations as ML Decoders
复制标题
IP 公式作为 ML 解码器的数值比较
DOI：
10.1109/icc.2010.5502303
复制
发表时间：
2010
期刊：
影响因子：
--
通讯作者：
F. Kienle
中科院分区：
文献类型：
--
作者：
A. Tanatmis;Stefan Ruzika;Mayur Punekar;F. Kienle
对于具有短和中等块长度的二进制线性码，ML解码可以通过用通用求解器求解相关联的整数规划（IP）问题来实现。IP还提供计算最小距离的算法。在这篇文章中，我们提出了几个IP配方和计算比较他们对各种LDPC和BCH码。这些公式中的大多数是通过强迫线性规划（LP）解码公式在文献中提出的完整性。
For binary linear codes with short and medium block length ML decoding can be achieved by solving the associated integer programming (IP) problem with a general purpose solver. IP also offers algorithms for computing the minimum distance. In this article, we present several IP formulations and computationally compare them on various LDPC and BCH codes. Most of these formulations are obtained by forcing integrality on linear programming (LP) decoding formulations proposed in the literature.