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)?
成功的秘诀就是四个简单的字：多一点点。(卢·维克瑞，美国作家)？
Then it introduces receiving signal as reliability evaluate or weighted coefficient of hard-decision, consequently presents weighted bit-flipping decoding algorithm based on check sum.
在此基础上引入接收信号作为可靠性评估，使评估值作为硬判决的加权系数，从而提出基于校验和的加权位翻转解码算法。
Adds two 32-bit integers and replaces the first integer with the sum, as an atomic operation.
以原子操作的形式，添加两个32位整数并用两者的和替换第一个整数。
Adds two 32-bit integers and replaces the first integer with the sum, as an atomic operation.
以原子操作的形式，添加两个32位整数并用两者的和替换第一个整数。
应用推荐