Abstract
This paper deals with the problem of active calibration under the existence of sensor gain/phase uncertainties and position perturbations. Unlike many existing eigenstructure-based (also called subspace-based) calibration methods which using the spatial-domain (i.e., angle) information of the auxiliary sources only, our proposed approach enables exploitation of both the spatial- and time-domain knowledge of the sources, and therefore yields better performance than the eigenstructure-based calibration technology. For the purpose of incorporating the time-domain knowledge of the sources into the error calibration, the maximum likelihood criterion is selected as the optimization principle, and a concentrated alternating iteration procedure (called algorithm II) is developed, which has rapid convergence rate and robustness. As a byproduct of this paper, we also provide an eigenstructure-based calibration approach (termed algorithm I), which alternatively minimizes the weighted signal subspace fitting cost function and weighted noise subspace fitting criterion to update the estimates for sensor position perturbations and gain/phase errors in each iteration, respectively. Similar to some previous subspace-based calibration algorithms in the literature, algorithm I is also asymptotically efficient but is more computationally convenient, and can be introduced as benchmark to be compared to algorithm II. Additionally, the Cramer---Rao bound (CRB) expressions for the sensor gain/phase errors and position perturbations estimates are presented for two situations: (a) the time-domain waveform information of the sources is unavailable, and (b) the time-domain waveform information of the sources is taken as prior knowledge into account. The CRBs for the two cases are also quantitatively compared, and the resulting conclusion demonstrates that by combining the time-domain waveform information of the sources into the calibration algorithm, a significant performance improvement can be achieved. The simulation experiments are conducted to corroborate the advantages of the proposed algorithms as well as the theoretical analysis in this paper.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.