论文部分内容阅读
Root-MUSIC (MUltiple SIgnal Classification) is the polynomial rooting form of MUSIC, namely, the spectrum peak searching is resplaced by the polynomial rooting in MUSIC implementation. The coefficients finding of the polynomial is the critical problem for Root-MUSIC and its improvements. By analyzing the Root-MUSIC algorithm thoughly, the finding method of the polynomial coefficient is deduced and the concrete calculation formula is given, so that the speed of polynomial finding roots will get the bigger exaltation. The particular simulations are given and attest correctness of the theory analysis and also indicate that the proposed algorithm has preferable estimating performance.
Root-MUSIC (MUltiple SIgnal Classification) is the polynomial rooting form of MUSIC, namely, the spectrum peak searching is resplaced by the polynomial rooting in MUSIC implementation. The coefficients finding of the polynomial is the critical problem for Root-MUSIC and its improvements. By analyzing the Root-MUSIC algorithm thoughly, the finding method of the polynomial coefficient is deduced and the concrete calculation formula is given, so that the speed of polynomial finding roots will get the bigger exaltation. The particular simulations are given and attest correctness of the theory analysis and also that suggesting the proposed algorithm has advantageous estimating performance.