Title :
A Direct Method to Generate Approximations of the Barankin Bound
Author :
Quinlan, A. ; Chaumette, E. ; Larzabal, P.
Author_Institution :
Trinity Coll. Dublin
Abstract :
The search for an easily computable but tight approximation of the Barankin bound (BB) is important for the prediction of the signal-to-noise ratio (SNR) value where the Cramer-Rao bound (CRB) becomes unreliable for prediction of maximum likelihood estimators (MLE) variance. In this paper we propose a method for the derivation of a general class of BB approximations which has the advantage of a clear interpretation. This method suggests a new practical BB approximation, whose computational complexity does not exceed that of the CRB but which seems tighter than existing approximations
Keywords :
computational complexity; maximum likelihood estimation; signal processing; Barankin bound; Cramer-Rao bound; SNR; computational complexity; maximum likelihood estimators; signal-to-noise ratio; Computational complexity; Educational institutions; Maximum likelihood estimation; Mean square error methods; Parameter estimation; Signal to noise ratio;
Conference_Titel :
Acoustics, Speech and Signal Processing, 2006. ICASSP 2006 Proceedings. 2006 IEEE International Conference on
Conference_Location :
Toulouse
Print_ISBN :
1-4244-0469-X
DOI :
10.1109/ICASSP.2006.1660777