A SYSTEM FOR COMPRESSING REFLECTED SIGNALS ON A FLUCTUATING NOISE BACKGROUND IN ACTIVE SURVEILLANCE RADAR SYSTEMS

Abstract

The invention proposes a system to compress reflected signals on a fluctuating noise background applied to active surveillance radar systems. This is a new, simple and effective solution to compress signals before sharing or transmitting to the processing center. Unlike previous systems based on performing compression on each reflected pulse, this transparent proposed system processes reflected regions in the form of a two-dimensional (2D) correlation matrix, combined with the dynamic calculation, automatically accumulates and adapts to changes; the convolution and compression algorithms are simple and effective since they are associated with the characteristics of active radar reflected areas in both frequency and time domains. Thanks to that, the system proposed in this invention provides effective and superior compression performance compared to the proposed systems. Furthermore, the system proposed in the invention is easily deployed on an FPGA high-speed computing platform to suit low-latency real-time monitoring applications or system expansion.

Claims

1. A system for compressing reflected signals on a fluctuating noise background in active surveillance radar systems, comprising the following blocks: a data normalization block; performing the following small steps: reflected signals are received into a buffer module, processed in a FIFO (First In, First Out) manner, when n (n can be 8, 16, 32, 64) azimuthal reflected signals are accumulated, they are sent to a two-dimensional (2D) matrix creation module of size nn; if the final reflected pulse matrix does not have enough n samples, padding with zero values is added, if the range length of the reflected signal is m, the number of matrices per beam is the integer part of m/n+1; a dynamic terrain noise filtering block; performing the following steps: on initial startup, initialize a two-dimensional (2D) clutter matrix km, where k is the number of beams covering 360 degrees azimuth and m is the range length; a dynamic accumulation module to dynamically accumulate clutter information; a dynamic detection module to dynamically detect changing areas of the clutter; an adaptive spatial noise filtering block; performing the following steps: calculate the threshold i by range i=(1(mi)/m+)0, with ={0; 1} the far threshold coefficient; choose the inertia update coefficient =[0; 1]; compare the value Xi of azimuthal pulse at position i in the range with the threshold i to determine the update principle .sub.i_new=.sub.i_current+(1)X.sub.i: a feature extraction and compression block; performing the following steps: a feature extraction module to separate and store data features after removing clutter and other noise, converting from 2D to 1D format; a bitstream compression module to further compress 1D feature data by replacing identical 8-bit sequences that repeat many times with shorter bit sequences; a data reception, decompression, and display block; performing the following steps: transmit data cyclically (compressed data stream after processing n azimuthal beams, including the bit encoding header) and non-cyclically (clutter data area when there is sufficient change); send all clutter data when a new connection is established; prioritize cyclic data transmission since clutter changes less frequently.

2. The system for compressing reflected signals on a fluctuating noise background in active surveillance radar systems according to claim 1, wherein the dynamic detection module of the dynamic terrain noise filtering block performs the following steps: mark the j-th region being examined by azimuth and range; set the change threshold .sub.CE=[0; 1]; calculate the change level of region j using the formula $C{E}_j={.Math.}_{n,n}\log \left\{\left({}_{i\_\mathrm{new}}-{}_{i\_\mathrm{current}}\right)/{}_{i\_\mathrm{current}}\right\};$ compare CE.sub.j with CE to identify the changing region to be sent (region *).

3. The system for compressing reflected signals on a fluctuating noise background in active surveillance radar systems according to claim 1, wherein the adaptive spatial noise filtering block performs the following steps: subtract the corresponding clutter background; employ a range correlation filtering module to eliminate pulse noise amplitude while enhancing target signals; employ a CDF97 frequency-time transform module to analyze data in both frequency and time domains; employ an adaptive spatial filtering module to eliminate other random noise.

4. The system for compressing reflected signals on a fluctuating noise background in active surveillance radar systems according to claim 3, wherein the range correlation filtering module of the adaptive spatial noise filtering block performs the following steps: select a reference window .sub.1n={.sub.1; .sub.2; . . . ; .sub.n}, with n={4; 8; 16; 32}, .sub.n= [0; 1], multi-level trapezoidal probability distribution; convolve each pulse in the region.

5. The system for compressing reflected signals on a fluctuating noise background in active surveillance radar systems according to claim 3, wherein the CDF97 frequency-time transform module of the feature extraction and compression block performs the following steps: choose the transformation level of CDF97 and perform the transformation to achieve multi-resolution format; set the spatial adaptive threshold T; compare each hij value in the multi-resolution matrix with T to calculate the new value {tilde over (h)}.sub.ij.

6. The system for compressing reflected signals on a fluctuating noise background in active surveillance radar systems according to claim 1, wherein the feature extraction module of the feature extraction and compression block performs the following small steps: select the orientation root in HH or LL in the multi-resolution matrix; set the initial threshold _0 as the nearest integer to the highest level value satisfying .sub.0=2.sup.p, p is a positive integer; after each level, set the corresponding threshold .sub. according to .sub.0 2.sup. if the initial root is in HH, .sub.02.sup. if the initial root is in LL; initialize a one-dimensional (1D) feature element list LSC {0}, size nn; sequentially examine the values in the cells from the orientation root, compare with the threshold .sub. to determine the feature value, and set the corresponding bit to 1.

7. The system for compressing reflected signals on a fluctuating noise background in active surveillance radar systems according to claim 1, wherein the bitstream compression module of the feature extraction and compression block performs the following small steps: pair each 8-bit sequence to form an ASCII character in LSC into an ASCII character list LAC, add padding with zero values at the beginning; count the frequency of each ASCII character in LAC into an ordered ASCII character list (sorted in descending order of frequency) LOAC; calculate the maximum number of bits b to represent LOAC, with b=1+Rounddown (log.sub.2 N), b is always less than 8; establish the bit encoding table in sequence, with characters appearing frequently in LOAC being replaced with fewer bits; replace segments in LSC according to the bit encoding table to obtain the compressed bit sequence.

Description

BRIEF DESCRIPTION OF THE DRAWINGS

[0015] FIG. 1a: Illustrates the components of active radar reflected signals with noise background fluctuating over time-frequency;

[0016] FIG. 1b: Depicts the display on an active radar surveillance screen;

[0017] FIG. 2: Shows the functional blocks of the proposed system;

[0018] FIG. 3: Illustrates the processing flow and modules of the data normalization block;

[0019] FIG. 4: Depicts the processing flow and modules of the dynamic terrain noise filtering block;

[0020] FIG. 5a: Illustrates the processing flow and modules of the adaptive spatial noise filtering block;

[0021] FIG. 5b: Shows the multi-level trapezoidal probability distribution of the range correlation filter;

[0022] FIG. 6: Depicts the processing flow and modules of the feature extraction and compression block; and

[0023] FIG. 7: Illustrates the processing flow and modules of the reception, decompression, and display block.

DETAILED DESCRIPTION OF THE INVENTION

[0024] The invention proposes a system to compress reflected signals on a fluctuating noise background, applicable to active surveillance radar systems, described in detail below:

[0025] Referring to FIG. 1, the radar reflected signal includes target information and noises information (geographic noises that need to be shared or transmitted; other noises that needs to be removed before sharing or transmission) as shown in FIG. 1a. These pieces of information vary in amplitude and time or range, so when displayed on a radar screen, they appear differently as shown in FIG. 1b.

[0026] Referring to FIG. 2, the proposed system in this invention includes the following functional blocks:

[0027] The specific content of the blocks is as follows:

Data Normalization Block (100):

[0028] Referring to FIG. 3, the reflected signal is received by the buffer module (101), which implements a FIFO (First In First Out) sequential processing mechanism. When there are enough n reflected pulses in azimuth 102 (n can be 8, 16, 32, 64), they are sent to the two-dimensional (2D) matrix creation module (103), with dimensions nn. Consecutive matrices will cover the entire distance of the reflected pulse. In case the matrix at the end of the reflected does not have sufficient size n, padding will be added with a value of 0. Assuming the length of the reflected signal over distance is m, the number of matrices on a ray is the integer part of

[00001]$\frac{m}{n}+1.$

Dynamic Terrain Noise Filtering Block (200):

[0029] Referring to FIG. 4, the matrices M are the input for the dynamic terrain noise filtering block (200). During the initial startup, it is necessary to initialize the terrain matrix .sub.km 201, in two dimensions (2D), where k is the number of rays covering the full 360 azimuth and m is the length in distance. Next, the dynamic filtering process of the terrain map includes two main tasks: dynamic accumulation and dynamic detection of changing terrain regions.

[0030] The dynamic accumulation module (202) is implemented based on the principle that the reflected signal from terrain at a certain distance and azimuth is stable, or in other words, the signal reflected from the terrain across different scans is correlated, while the target signal and other fluctuating noise are unstable, varying with each scanning round, and not correlated. Therefore, when receiving the 2D matrix data, it will be processed based on each azimuth pulse as follows: [0031] If the value X.sub.i of the pulse at position i along the distance dimension is greater than the value of the current terrain map threshold .sub.i, then retain the pulse value (target or background noise needs to be kept). Considering that the signal amplitude decreases with distance, with higher signals near and lower signals far, the threshold .sub.i should be dynamically set according to distance m as follows:

[00002]${}_i=\left(1-\frac{m-i}{m}+\right){}_0,$

where ={0; 1} is the far-range threshold coefficient. [0032] When the value is not larger (possibly terrain noise), update the new value at position i according to the principle:

[00003]${}_{i\_\mathrm{new}}={}_{i\_\mathrm{current}}+\left(1-\right)X_i$ [0033] The inertia update coefficient ranges from [0; 1], the closer to 1, the slower the terrain map updates, for example, if =0,975, the new value of the terrain map only incorporates 2.5% of the new pulse characteristic, retaining 97.5% of the old value. This means that the radar complete several rotations for the terrain map to stabilize and be less affected by sudden spike values. [0034] This dynamic accumulation method helps automatically update the terrain background when changes occur. The aggregate of regions around 360 of the radar will provide the dynamically accumulated terrain noise data.

[0035] The dynamic detection module (203) dynamically detects changes in terrain regions by calculating the deviation of the updated value from the current value at each point in the region. Each region here is represented as a two-dimensional (2D) matrix with an assigned code for differentiation, this code is used to inform the receiver to change the corresponding region. The steps are as follows: [0036] Calculate the change level of region j, denoted as Cej, based on cross-entropy theory using the formula:

[00004]$C{E}_j={.Math.}_{n,n}\log \left\{\left({}_{i\_\mathrm{new}}-{}_{i\_\mathrm{current}}\right)/{}_{i\_\mathrm{current}}\right\}$ [0037] If CE.sub.j is greater than the threshold .sub.CE=[0; 1], the terrain map is considered a major change and needs to be sent for update. This region is called the changing terrain region .

Adaptive Spatial Noise Filtering Block (300):

[0038] For other noise with non-fixed frequency characteristics (frequency characteristics), changing pulse shape and positions (time characteristics), processing is required through range correlation filtering and signal transformation into spatial domains of frequency and time to highlight the noise before adaptive threshold processing.

[0039] Referring to FIG. 5a, the two-dimensional (2D) matrices, the inputs of the adaptive spatial noise filtering block (300), need to be fed into the terrain noise subtraction module (301) corresponding to the examined region. Next, because the pulse-shaped noise has low distance correlation, it is first processed through the range correlation filter module (302) to reduce the noise amplitude and at the same time, strengthen the target signal. Accordingly, when receiving matrix data M after terrain subtraction, it will be processed based on each azimuth pulse as follows: [0040] Convolve with a reference window along the distance direction: [0041] .sub.1n={.sub.1; .sub.2; . . . ; .sub.n}, with n={4; 8; 16; 32}, .sub.n=[0; 1].

[0042] The window .sub.1n is selected in the form of a multi-layer trapezoidal probability distribution, as shown in FIG. 5b, which characterizes the target signal. For example, .sub.116={0,4; 0,6; 0,7; 0,8; 0,9; 1,0; 1,0; 1,0; 1,0; 1,0; 1,0; 0,9; 0,8; 0,7; 0,6; 0,4}. [0043] The result of the above convolution is that signal areas with the same intensity distributions similar to the reference will be enhanced, while regions with different distributions from the reference will be attenuated. [0044] The matrices after convolution are processed through the time-frequency transformation module CDF97 (303). Here, the Cohen-Daubechies-Feauveau 97 (CDF97) transform converts the signal into a multi-resolution two-dimensional (2D) matrix (in the form of LL, HL, LH, HH). The number of levels in CDF97 will affect the degree of edge separation after extraction. [0045] Next, the multi-resolution matrices are passed through the spatial adaptive filtering module (304) to eliminate other random noise, the post-transformed value in each cell (h.sub.ij) in the multi-resolution matrices, all contains noise information. Noise removal is performed by comparison with a threshold T; the value {tilde over (h)}.sub.ij after the adaptive filter is calculated as follows:

[00005]${\stackrel{}{h}}_{ij}=\{\begin{array}{cc}{h}_{\mathrm{ij}}+\frac{T\left(e^{-}-1\right)}{2\left(e^{-}+1\right)}& \mathrm{if}{h}_{\mathrm{ij}}T\\ 0& \mathrm{if}{h}_{\mathrm{ij}}<T\end{array},$

where is the level number of CDF97. [0046] The set of {tilde over (h)}.sub.ij forms the matrix H*, a multi-resolution matrix that includes data with other random noise removed.

Feature Extraction and Compression Block (400):

[0047] Referring to FIG. 6, the input is the matrix H*. Here, computations are performed to extract data features and compress the byte sequence.

[0048] Feature extraction module (401) performs reverse calculation according to the spatial orientation tree to extract features, which are elements with values exceeding the corresponding threshold. Since the CDF97 transform halves the value at each level, the threshold will also be adjusted up or down based on the orientation origin choice, done as follows: [0049] Select the orientation origin O.sub.(i,j) as an element of HH (top left corresponds to O.sub.(0,0)) or an element of LL (bottom right corresponds to O.sub.(n-1,n-1)). [0050] Select the initial threshold .sub.0, which is the integer closest to the maximum value of the level, satisfies .sub.0=2.sup.p, p is a positive integer. After each level, set the corresponding threshold .sub.0 according to the principle:

[00006]$=\{\begin{array}{cc}{2}^{-}& \mathrm{if}\mathrm{the}\mathrm{initial}\mathrm{root}\mathrm{is}{O}_{\left(n-1,n-1\right)}\\ 2^{}& \mathrm{if}\mathrm{the}\mathrm{initial}\mathrm{root}\mathrm{is}{O}_{\left(0,0\right)}\end{array}$ [0051] Initialize an empty list of significant cells (LSC) with size nn in a one-dimensional (1D) format {0}. [0052] Sequentially iterate through all levels of H*. At each level, compare the value of each corresponding cell with the threshold to determine if it is a significant element. If the value is less than .sub.0, set the corresponding bit in the LSC to 0; otherwise, set it to 1. The LSC sequence is significantly smaller than the original M matrix because the matrix values are replaced by a single bit.

[0053] Bit Sequence Compression Module (402) will calculate according to the principle of replacing repeated 8-bit sequences with shorter bit sequences as follows: [0054] Pair each 8-bit sequence to create an ASCII character. Add padding with a value of 0 to the beginning. Thus, the LSC bit sequence is represented as a list of ASCII characters (LAC). [0055] Count the frequency of each ASCII character in the LAC to create a list of ordered ASCII characters (LOAC), sorted in descending order of frequency. Also, calculate N as the number of different characters in the LAC string. [0056] To reduce the size, perform the following two actions simultaneously: [0057] Instead of using eight bits to represent an ASCII code, use a maximum of b bits, with b=1+Rounddown (log.sub.2 N), where b is always less than 8. [0058] Create a bit encoding table based on the principle that more frequently occurring characters in the LOAC are replaced by fewer bits. Characters that appear more frequently will be represented by fewer bits. Pack this encoding table as a header before sending the compressed data. [0059] Replace segments in LSC according to the bit encoding table to obtain the compressed data. [0060] Since the echo signal features have similar backgrounds and targets, repeated bits will occur frequently. Therefore, compression using this principle will be effective.

Data Transmission Block (500):

[0061] The transmitted data includes cyclic data (the compressed data sequence after each processing of nnn azimuth beams, including the bit encoding table header) and non-cyclic data (the terrain data region when there is sufficient change). If it's a new connection, all terrain data will be sent. Priority is established for transmitting cyclic data because the terrain changes less frequently.

Data Reception, Decompression, and Display Block (600):

[0062] Referring to FIG. 7, the received data will be fed into the Data Extraction Module (601). Here, based on the marked code, the data is classified into two types: [0063] Non-cyclic data (terrain background, changing terrain regions). This data is passed to the Terrain Initialization and Update Module (603). [0064] Cyclic data (bit encoding table and compressed data sequence). This data is passed to the Decompression Module. Here, the processes of the Feature Extraction and Compression Block (400) and the Adaptive Spatial Filtering Block (300) are sequentially reversed to decompress the data. The CDF97 inverse transform is applied to restore the data into matrices containing target information but lacking terrain data.

[0065] The two types of data are combined according to the correct azimuth and distance codes in the Data Merging Module (605), before being transmitted to the Display Module (606).