Abstract
The author summarizes recent work on the problem of computing maximum-likelihood estimates of structured covariance matrices, as it applies to problems in array processing and spectrum estimation. Two areas are discussed; the existence of positive definite solutions when the number of observations is less than the dimension of the matrix, and the efficient implementation of the algorithm expectation-maximization for estimating Toeplitz matrices. For the Toeplitz case, it is shown that, for a single observation vector, the probability of generating a positive definite solution can be very small, whereas when the Toeplitz covariance matrix is constrained to have a nonnegative definite circulant extension, a positive definite solution will exist with probability. >
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: 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.
