By Topic

Efficient estimation of Class A noise parameters via the EM algorithm

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Zabin, S.M. ; Sch. of Electr. Eng., Georgia Inst. of Technol., Atlanta, GA, USA ; Poor, H.V.

The Class A Middleton noise model is a commonly used statistical-physical, parametric model for non-Gaussian interference superimposed on a Gaussian background. In this study, the problem of efficient estimation of the Class A parameters for small sample sizes is considered. The proposed estimator is based on the EM algorithm, a two-step iterative estimation technique that is ideally suited for the Class A estimation problem since the observations can be readily treated as incomplete data. For the single-parameter estimation problem, a closed-form expression for the estimator is obtained. Furthermore, for the single-parameter estimation problem, it is shown that the sequence of estimates obtained via the EM algorithm converges, and a characterization of the point to which the sequence converges is given. In particular, it is shown that if the limit point of this convergent sequence is an interior point of the parameter set of interest, then it must be a stationary point of the traditional likelihood function. In addition, for both the single-parameter and two-parameter estimation problems, the small-sample-size performance of the proposed EM algorithm is examined via an extensive simulation study

Published in:

Information Theory, IEEE Transactions on  (Volume:37 ,  Issue: 1 )