SearcharxivSearch

arXiv subjects

Aleksandr Kharin

Publications and source records attributed to Aleksandr Kharin.

3 recordsLinked to original sources

Robust Model Order Selection via Dithered Differential Step-Down Thresholding

This paper studies the problem of model order selection in stationary noise. Single-threshold detection is sensitive to extreme noise excursions, particularly when the detection threshold is lowered to capture weak deterministic components. To augment single-threshold detection, we propose a differential step-down thresholding algorithm. We use a threshold grid in this algorithm. To overcome the threshold grid misalignment error induced by grid evaluation, we utilize randomized grid dithering. Using extreme value theory, we show the clustering of the noise extrema. The stopping rule of the proposed algorithm detects this clustering and stops the algorithm to prevent false alarms. By analytically bounding the threshold grid misalignment error, we prove that our algorithm achieves asymptotic exact order recovery under the 0-1 loss function. Moreover, the proposed algorithm remains robust even if the detection threshold in the original single-threshold algorithm is lowered or extreme noise excursions occur.

eess.SP

Estimating the number of superimposed sinusoids

Estimation of the number of superimposed sinusoids in the presence of noise is an important model order selection (MOS) problem in statistical signal processing. In this paper, we propose a new approach to the design of MOS algorithms for estimating the number of superimposed sinusoids. Our proposed approach is partially based on the minimum error probability criterion. Also, we pay a lot of attention to the performance and consistency analysis of the MOS algorithms. In this study, an error probability is used as a universal performance measure of the MOS algorithms. We propose a theoretical framework that makes it possible to provide consistency analysis and to obtain closed-form expressions for the approximated error probabilities of a wide range of MOS algorithms. As an example, we applied this framework to the consistency and performance analysis of several MOS algorithms for estimating the number of superimposed sinusoids. Using the obtained results, we provide a parametric optimization of the presented MOS algorithms. Finally, we examine a quasilikelihood approach to the design and performance analysis of the MOS algorithms. The proposed theoretical framework is used to find the scope of the quasilikelihood approach.

eess.SP

Determining the Number of Sinusoids Measured with Errors

This paper describes how a priori information about the signal parameters can influence the accuracy of estimating the number of these signals. This study considers sinusoidal signals and it is supposed that the parameters (amplitudes, frequencies and phases) of the received signals are known up to a certain error. The error probability of the maximum likelihood estimation of the number of sinusoids is calculated under this condition.

eess.SP