High Dimensional Integer Ambiguity Resolution: A First Comparison between LAMBDA and Bernese

摘要

The LAMBDA method for integer least-squares ambiguity resolution has been widely used in a great variety of Global Navigation Satellite System (GNSS) applications. The popularity of this method stems from its numerical efficiency and its guaranteed optimality in the sense of maximising the success probability of integer ambiguity estimation. In the past two decades, the LAMBDA method has been typically used in cases where the number of ambiguities is less than several tens. With the advent of denser network processing and the availability of multi-frequency, multi-GNSS systems, it is important to understand LAMBDA'S performance in high dimensional spaces. In this contribution, we will address this issue using real GPS data based on the Bernese software. We have embedded the LAMBDA method into the Bernese software and compared their ambiguity resolution performances. Twelve day dual-frequency GPS data with a sampling interval of 30 s was used in the experiment, which was collected from a network of 19 stations in the Perth area of Western Australia with an average baseline length of 380 km. Different experimental scenarios were examined and tested with different observation spans, which represent the different ambiguity dimensions. The results showed that LAMBDA is still efficient even when the number of ambiguities is more than 100, and that the baseline repeatability obtained with the ambiguities resolved from the LAMBDA method agreed well with that of Bernese. Therefore, for future dense network processing, the easy-to-use LAMBDA method should be considered as an alternative to baseline-per-baseline methods as those used in e.g. the Bernese software.