Compression method for early-warning radar track data transmission

Abstract

The invention discloses a transmission compression method for early warning radar track data, and relates to the technical field of radar data transmission methods. The method includes the following steps: the sending end receives the data reported by the radar; the target points of the same batch number have been associated into the track by the radar, and the least square method is used for curve fitting with every 6 points in the track as a unit to obtain The fitting curve parameters of the target track; according to the threat level of the target, upload the fitting curve parameters of the target track and the last point track data in the time period to the receiving end; the receiving end uses the track fitting curve parameters to restore the target track trace. The method makes full use of limited communication capacity to transmit radar intelligence data, and fully utilizes the function of Beidou short messages, so that it can become a means of early warning radar emergency information transmission, which has far-reaching military and strategic significance.

Description

technical field [0001] The invention relates to the technical field of radar data transmission methods, in particular to an early warning radar track data transmission compression method. Background technique [0002] Military intelligence has its own specific format, but it is different according to its own regulations. The principle is basically to transmit large information with small capacity. Most digital equipment is equipped with a standard interface for military intelligence, which can directly transmit military information in a standard format. Radar track data is composed of point track data according to a fixed protocol. Radar track data is essentially text data, so radar track data is usually compressed before transmission. Commonly used text data compression methods include Huffman coding, arithmetic coding, run-length coding and LZ coding. [0003] Huffman coding: D.A. Huffman discovered a data compression algorithm based on signal probability. It includes t...

AI Technical Summary

Problems solved by technology

However, the implementation of arithmetic coding has two major defects: it is difficult to complete infinite precision arithmetic operations on a computer with fixed precision; the highly complex calculation amount is not conducive to practical application

For the target track, the first-order Gaussian function fitting, the second-order polynomial fitting, the first-order exponential function fitting and the first-order sine function fitting are respectively adopted by Figure 1-4 It can be seen that the fitting effects of these four algorithms are close, and the root mean square error is about 200. The exponential function fitting only needs two coefficients, but for some cases, the exponential function cannot be fitted, and the applicability is not strong

Images