Abstract
This paper presents a formulation of snapshot positioning as a mixed-integer least-squares problem. In snapshot positioning, one estimates a position from code-phase (and possibly Doppler-shift) observations of global navigation satellite system (GNSS) signals without knowing the time of departure (timestamp) of the codes. Solving the problem allows a receiver to determine a fix from short radio-frequency snapshots missing the timestamp information embedded in the GNSS data stream. This is used to reduce the time to first fix in some receivers, and it is used in certain wildlife trackers. This paper presents two new formulations of the problem and an algorithm that solves the resulting mixed-integer least-squares problems. We also show that the new formulations can produce fixes even with huge initial errors, much larger than permitted in Van Diggelen's widely-cited coarse-time navigation method.
Iterative Tomographic Solution of Integer Least Squares Problems With Applications to MIMO Detection
