computational complexity of group-theoretic algorithm 群论算法的计算复杂度
Numerical analysis and simulations show that this algorithm reduces the computational complexity significantly for the estimation of large frequency offset while maintains a good performance.
理论分析和仿真表明该算法在保证估计精度的同时,可显著降低大频偏估计的计算复杂度。
It does not cause any computational complexity to use this algorithm and it is of value to practical applications.
同时,用有序修正法不会引起计算上复杂性,因而具有实际应用价值。
A automatic face detection and tracking algorithm is presented, which is of very low computational complexity and is rather robust to image content.
给出了一种运算量低、鲁棒性好的人脸自动识别和跟踪算法。
应用推荐