Now let's complicate the problem a bit: you have a two-dimensional array of unsigned integers, and you want to find the row with the smallest sum.
现在我们让问题变得复杂点:你有一个二维的无符号整形数组,你想要找到具有最小和的那一行。
By simplifying the message sent from check nodes to bit nodes, the complexity of the algorithm approaches that of the "mini-sum" algorithm.
该算法通过对校验节点传递给比特节点的信息进行有效简化,使计算复杂度接近“最小和”算法。
Four short words sum up what has lifted most successful individuals above the crowd: a little bit more. (Lou Vickery, American author)?
成功的秘诀就是四个简单的字:多一点点。(卢·维克瑞,美国作家)?
应用推荐