Abstract
An application of a theorem on the optimality of integer least-squares (LS) is described. This theorem states that the integer LS estimator maximizes the ambiguity success rate within the class of admissible integer estimators. This theorem is used to show how the probability of correct integer estimation depends on changes in the second moment of the ambiguity `float' solution. The distribution of the `float' solution is considered to be a member of the broad family of elliptically contoured distributions. Eigenvalue-based bounds for the ambiguity success rate are obtained.
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.
