Looking for breakthrough ideas for innovation challenges? Try Patsnap Eureka!

LLL (Lenstra-Lenstra-LovaszLattice) ambiguity decorrelation algorithm

A technology for reducing correlation and ambiguity, applied in the field of satellite navigation and positioning, it can solve the failure of correlation reduction and affect the convergence of the algorithm, and achieve the effects of rounding and rounding error accumulation and improvement, increasing the success rate, and reducing the number of iterations.

Inactive Publication Date: 2015-12-23
WUHAN UNIV
View PDF1 Cites 10 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

Among them, the LLL algorithm is a relatively novel ambiguity reduction algorithm, which has been deeply researched and widely used in recent years, but there are still some defects, such as rounding errors in the process of integer orthogonal transformation. The continuous accumulation during the iterative process will affect the convergence of the algorithm, and even lead to the failure of the drop-correlation

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • LLL (Lenstra-Lenstra-LovaszLattice) ambiguity decorrelation algorithm

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0021] In order to facilitate those of ordinary skill in the art to understand and implement the present invention, the present invention will be described in further detail below in conjunction with the accompanying drawings and embodiments. It should be understood that the implementation examples described here are only used to illustrate and explain the present invention, and are not intended to limit this invention.

[0022] The purpose of the present invention is to provide a new de-correlation algorithm to carry out de-correlation processing on ambiguity. The method adopts Cholesky upper triangular decomposition, which effectively improves the performance of the Z transformation matrix, thereby improving the performance of the entire ambiguity. Search speed and solution success rate. At the same time, the column vectors of the upper triangular matrix U are arranged in descending order according to the size of the inner product, which can improve the descending correlatio...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

PUM

No PUM Login to View More

Abstract

The invention discloses an LLL (Lenstra-Lenstra-LovaszLattice) ambiguity decorrelation algorithm. According to the algorithm, upper triangular decomposition (U<T>U) is performed on a covariance matrix Qa through utilizing Cholesky decomposition method, so that an upper triangular matrix U<T> can be obtained, and with the above decomposition method adopted, the computational efficiency of the LLL algorithm can be improved; before algorithm decomposition every time, descending sorting is performed on column vectors of the matrix Qa according to the magnitude of inner products, and a coefficient matrix can obtain a minimum integer value, and the decorrelation performance of the decorrelation algorithm is better; and a rounding step in an orthogonal transformation process is shifted to a Z-solving matrix, and therefore, calculation quantity increase and error accumulation caused by repeated rounding in an iteration process can be avoided, and the computational efficiency and success rate of the novel algorithm can be improved.

Description

technical field [0001] The invention belongs to the technical field of satellite navigation and positioning, and relates to an ambiguity reduction correlation algorithm, in particular to an LLL ambiguity reduction correlation algorithm used in GNSS integer ambiguity resolution. Background technique [0002] In the process of high-precision real-time positioning using GNSS carrier phase as the observation quantity, it is a key issue to solve the integer ambiguity quickly and accurately. Down-correlation processing is a commonly used method with excellent performance. Because the correlation of the ambiguity covariance directly determines the speed and efficiency of the whole ambiguity solution, and affects the effect and success of the ambiguity solution, therefore, a fast and efficient de-correlation algorithm is proposed to reduce the original ambiguity correlation 1. The key to realizing GNSS high-precision real-time positioning is also the purpose and significance of t...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

Application Information

Patent Timeline
no application Login to View More
Patent Type & Authority Applications(China)
IPC IPC(8): G01S19/37G01S19/44
CPCG01S19/37G01S19/44
Inventor 杨艳茜江金光苏明坤
Owner WUHAN UNIV
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Patsnap Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Patsnap Eureka Blog
Learn More
PatSnap group products