基于动态规划的MUSIC算法谱峰搜索

Spectrum Peak Searching of MUSIC Algorithm Based on Dynamic Programming

动态规划是求解最优化问题的一种方法,研究了其求解矩阵链乘问题的基本思想及具体步骤,并将其应用于MUSIC算法谱峰搜索,通过理论分析得到了MUSIC算法谱峰搜索时不同矩阵链乘顺序的计算量,继而得到矩阵链乘的最优顺序,有效节约了计算量和搜索时间。

Dynamic programming technique is a method to solve optimization problem. This paper studies the basic idea and material steps of the technique to solve the matrix chain multiplication, and use the technique to perform the spectrum peak searching of MUSIC algorithm, fetches the cal- culation quantity of different matrix chain multiplication orders by using MUSIC algorithm to per- form the spectrum peak searching through theory analysis, then fetches the optimization order of matrix chain multiplication, which effectively saves the calculation quantity and searching time.