Minimum sum algorithm is very simple and is easy for hardware implementation. But the decoding performance is degraded.
最小和算法具有简单、容易实现的特点，但使译码性能较大幅度地降低。
This paper presents a new fast algorithm by analyzing the moment method, which is based on the character that the sum of distances between centroid and other points is the minimum.
通过对矩方法的进一步分析，提出基于目标质心与目标上各点间距离之和取得最小值这一特性的质心快速搜索策略。
In this paper a global optimization algorithm is proposed for locating global minimum of sum of linear ratios problem (p) with coefficients.
对带系数的线性比式和问题(p)提出一确定性全局优化算法。
应用推荐