The problem caused by shortness or excessiveness of snapshots and by coherent sources in underwater acoustic positioning is considered.A matched field localization algorithm based on CS-MUSIC(Compressive Sensing Multi...The problem caused by shortness or excessiveness of snapshots and by coherent sources in underwater acoustic positioning is considered.A matched field localization algorithm based on CS-MUSIC(Compressive Sensing Multiple Signal Classification) is proposed based on the sparse mathematical model of the underwater positioning.The signal matrix is calculated through the SVD(Singular Value Decomposition) of the observation matrix.The observation matrix in the sparse mathematical model is replaced by the signal matrix,and a new concise sparse mathematical model is obtained,which means not only the scale of the localization problem but also the noise level is reduced;then the new sparse mathematical model is solved by the CS-MUSIC algorithm which is a combination of CS(Compressive Sensing) method and MUSIC(Multiple Signal Classification) method.The algorithm proposed in this paper can overcome effectively the difficulties caused by correlated sources and shortness of snapshots,and it can also reduce the time complexity and noise level of the localization problem by using the SVD of the observation matrix when the number of snapshots is large,which will be proved in this paper.展开更多
A fast MUltiple SIgnal Classification (MUSIC) spectrum peak search algorithm is devised, which regards the power of the MUSIC spectrum function as target distribution up to a constant of proportionality, and uses Metr...A fast MUltiple SIgnal Classification (MUSIC) spectrum peak search algorithm is devised, which regards the power of the MUSIC spectrum function as target distribution up to a constant of proportionality, and uses Metropolis-Hastings (MH) sampler, one of the most popular Markov Chain Monte Carlo (MCMC) techniques, to sample from it. The proposed method reduces greatly the tremendous computation and storage costs in conventional MUSIC techniques i.e., about two and four orders of magnitude in computation and storage costs under the conditions of the experiment in the paper respectively.展开更多
Abs 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 o...Abs 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.展开更多
This paper addresses the problem of joint angle and delay estimation(JADE) in a multipath communication scenario. A low-complexity multi-way compressive sensing(MCS) estimation algorithm is proposed. The received data...This paper addresses the problem of joint angle and delay estimation(JADE) in a multipath communication scenario. A low-complexity multi-way compressive sensing(MCS) estimation algorithm is proposed. The received data are firstly stacked up to a trilinear tensor model. To reduce the computational complexity,three random compression matrices are individually used to reduce each tensor to a much smaller one. JADE then is linked to a low-dimensional trilinear model. Our algorithm has an estimation performance very close to that of the parallel factor analysis(PARAFAC) algorithm and automatic pairing of the two parameter sets. Compared with other methods, such as multiple signal classification(MUSIC), the estimation of signal parameters via rotational invariance techniques(ESPRIT), the MCS algorithm requires neither eigenvalue decomposition of the received signal covariance matrix nor spectral peak searching. It also does not require the channel fading information, which means the proposed algorithm is blind and robust, therefore it has a higher working efficiency.Simulation results indicate the proposed algorithm have a bright future in wireless communications.展开更多
基金supported by the National Natural Science Foundation of China (61202208)
文摘The problem caused by shortness or excessiveness of snapshots and by coherent sources in underwater acoustic positioning is considered.A matched field localization algorithm based on CS-MUSIC(Compressive Sensing Multiple Signal Classification) is proposed based on the sparse mathematical model of the underwater positioning.The signal matrix is calculated through the SVD(Singular Value Decomposition) of the observation matrix.The observation matrix in the sparse mathematical model is replaced by the signal matrix,and a new concise sparse mathematical model is obtained,which means not only the scale of the localization problem but also the noise level is reduced;then the new sparse mathematical model is solved by the CS-MUSIC algorithm which is a combination of CS(Compressive Sensing) method and MUSIC(Multiple Signal Classification) method.The algorithm proposed in this paper can overcome effectively the difficulties caused by correlated sources and shortness of snapshots,and it can also reduce the time complexity and noise level of the localization problem by using the SVD of the observation matrix when the number of snapshots is large,which will be proved in this paper.
基金Supported by the National Natural Science Foundation of China (No.60172028).
文摘A fast MUltiple SIgnal Classification (MUSIC) spectrum peak search algorithm is devised, which regards the power of the MUSIC spectrum function as target distribution up to a constant of proportionality, and uses Metropolis-Hastings (MH) sampler, one of the most popular Markov Chain Monte Carlo (MCMC) techniques, to sample from it. The proposed method reduces greatly the tremendous computation and storage costs in conventional MUSIC techniques i.e., about two and four orders of magnitude in computation and storage costs under the conditions of the experiment in the paper respectively.
基金Supported by the National Outstanding Young Foundation (No.60825104)the National Natural Science Foundation of China (No.60736009)
文摘Abs 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.
基金supported by the National Natural Science Foundation of China(6107116361271327+4 种基金61471191)the Fundamental Research Funds for the Central Universities(NP2015504)the Jiangsu Innovation Program for Graduate Education(KYLX 0277)the Priority Academic Program Development of Jiangsu Higher Education Institutions(PADA)the Funding for Outstanding Doctoral Dissertation in NUAA(BCXJ14-08)
文摘This paper addresses the problem of joint angle and delay estimation(JADE) in a multipath communication scenario. A low-complexity multi-way compressive sensing(MCS) estimation algorithm is proposed. The received data are firstly stacked up to a trilinear tensor model. To reduce the computational complexity,three random compression matrices are individually used to reduce each tensor to a much smaller one. JADE then is linked to a low-dimensional trilinear model. Our algorithm has an estimation performance very close to that of the parallel factor analysis(PARAFAC) algorithm and automatic pairing of the two parameter sets. Compared with other methods, such as multiple signal classification(MUSIC), the estimation of signal parameters via rotational invariance techniques(ESPRIT), the MCS algorithm requires neither eigenvalue decomposition of the received signal covariance matrix nor spectral peak searching. It also does not require the channel fading information, which means the proposed algorithm is blind and robust, therefore it has a higher working efficiency.Simulation results indicate the proposed algorithm have a bright future in wireless communications.
