By exploiting thvorable characteristics of a uniIbrm cross-array, a passive localization algorithm of narrowband sources in the spherical coordinates （azimuth, elevation and range） is proposed. Based on the properly...By exploiting thvorable characteristics of a uniIbrm cross-array, a passive localization algorithm of narrowband sources in the spherical coordinates （azimuth, elevation and range） is proposed. Based on the properly chosen sensor outputs, we compute the third-order cyclic moment matrices, and exploit a pre-calibration technique to eliminate multiplicative noise. Then, we construct a parallel factor （PARAFAC） model, and adopt trilinear altemating least squares regression （TALS） to estimate three-dimensional （3-D） near-field parameters. The investigated algorithm is efficient in the sense that it can eliminate multiplicative noise and additive noise, provide the improved estimation accuracy, as well as avoid the parameter-pairing procedure. Simulation results are carried out to demonstrate the performance of the proposed algorithm.展开更多
基金supported by the National Natural Science Foundation of China (61171137)the New Century Excellent Talents in University (NECT) of China (NECT-09-0426)
文摘By exploiting thvorable characteristics of a uniIbrm cross-array, a passive localization algorithm of narrowband sources in the spherical coordinates （azimuth, elevation and range） is proposed. Based on the properly chosen sensor outputs, we compute the third-order cyclic moment matrices, and exploit a pre-calibration technique to eliminate multiplicative noise. Then, we construct a parallel factor （PARAFAC） model, and adopt trilinear altemating least squares regression （TALS） to estimate three-dimensional （3-D） near-field parameters. The investigated algorithm is efficient in the sense that it can eliminate multiplicative noise and additive noise, provide the improved estimation accuracy, as well as avoid the parameter-pairing procedure. Simulation results are carried out to demonstrate the performance of the proposed algorithm.
