A low complexity smoothing algorithm for improved GPS point solutions on board LEO spacecraft

نویسندگان

چکیده

Abstract This paper describes a novel approach for reducing the kinematic position and time errors on GPS receiver in low Earth orbit. For dual-frequency receivers, point solution are dominated by signal-in-space ranging errors, which introduce sharp discontinuities estimates when visibility changes. These may be calculated removed, greatly peaks of at expense introducing slowly varying bias, is estimated removed. The gives detailed description algorithm illustrates its use using historical ephemerides. To demonstrate real-world efficacy, GRACE-FO observations processed proposed approach. Real-time results show reduction error standard deviation 16% to 1.9ns 3D RMS 17% 1.06m. Maximum real-time reduced 26% 32%, respectively. Delayed processing offers greater reductions near 40%.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On-Board Task Scheduling Algorithm for Spacecraft

An on-board scheduling algorithm is developed for scheduling tasks on a spacecrap. For ofline scheduling, a heuristic routine generates a feasible schedule and orderbased genetic algorithms improve the schedule. For online scheduling, two heuristic routines generate a good schedule in near real-time. The on-board scheduling algorithm is applied to a large problem of IO00 tasks, IO0 resources an...

متن کامل

Improved Low-Complexity Interpolation Algorithm for Deinterlacing

In this paper, we propose an improved low-cost deinterlacing method. The conventional low-complexity interpolation method for deinterlacing (LCID) has a observably better exhibition than other method using one field while requiring low complexity. However, sometimes it gives unpleasant subjective performance due to the miscalculating of edge direction. We aim to increase the interpolation accur...

متن کامل

Improved infeasible-interior-point algorithm for linear complementarity problems

We present a modified version of the infeasible-interior- We present a modified version of the infeasible-interior-point algorithm for monotone linear complementary problems introduced by Mansouri et al. (Nonlinear Anal. Real World Appl. 12(2011) 545--561). Each main step of the algorithm consists of a feasibility step and several centering steps. We use a different feasibility step, which tar...

متن کامل

ON FUZZY NEIGHBORHOOD BASED CLUSTERING ALGORITHM WITH LOW COMPLEXITY

The main purpose of this paper is to achieve improvement in thespeed of Fuzzy Joint Points (FJP) algorithm. Since FJP approach is a basisfor fuzzy neighborhood based clustering algorithms such as Noise-Robust FJP(NRFJP) and Fuzzy Neighborhood DBSCAN (FN-DBSCAN), improving FJPalgorithm would an important achievement in terms of these FJP-based meth-ods. Although FJP has many advantages such as r...

متن کامل

Improved Low Complexity Fully Parallel Thinning Algorithm

A fully parallel iterative thinning algorithm called MB2 is presented. It favourably competes with the best known algorithms regarding homotopy, mediality; thickness, rotation invariance and noise immunity, while featuring a speed improvement by a factor two or more owing to a smaller number of operations to perform. MB2 is grounded on a simple physics-based thinning principle that conveys both...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Navigation: journal of the Institute of Navigation

سال: 2021

ISSN: ['0028-1522', '2161-4296']

DOI: https://doi.org/10.1002/navi.410