A fast algorithm for computing MDCT is presented, and its computation complexity is analyzed.
提出了一种计算MDCT的快速算法，并分析了算法的计算复杂度。
EESSPA algorithm can avoid the information explosion by distributed control. Its computation complexity is independent of the number of hops along the path.
EESSPA算法的特点是采用分布式控制，避免了由于集中式控制导致的信息爆炸，并且算法复杂度与途经链路数无关。
The results show that the algorithm has relatively higher precision and lower computation complexity.
结果表明，该算法具有较高的精度和较低的计算复杂度。
应用推荐