The Data Compression Method and FPGA Implementation in the Mars Rover Subsurface-Penetrating Radar on the Tianwen-1 Mission

: Since Mars is far away from Earth, the propagation delay between Mars and Earth is very large. To ensure the effective use of the link transmission bandwidth, China’s first Mars exploration mission has put forward a demand for data compression for all scientific payloads. The on-board mature algorithms for data compression are mainly focused on optical images and microwave imaging radar applications. No articles have been published on data compression methods that are applied to subsurface-penetrating radar. Based on the background of this application, this paper proposes a logarithmic lossy compression algorithm which can meet the mission requirements for high compression ratios of 4:1 and 2.5:1. Its compression error is less than that of the block adaptive quantization (BAQ) algorithm. The algorithm is not only easy to implement on field-programmable gate array (FPGA) platforms, but also offers simple ground decompression and fast imaging. The experimental results show that high compression ratios of 4:1 and 2.5:1 can be realized, even if the data in and between traces do not have a strong correlation. And its relative error is less than 2%, which is a new type of high-efficiency data compression method that can be implemented on-board to meet with the demand of subsurface penetrating radar.


Introduction
China's first Mars exploration mission (Tianwen-1) was officially established in 2016.Tianwen-1 was designed to carry out orbiting, landing, and roving in one mission [1].Tianwen-1 was successfully launched on 23 July 2020 and approached Mars in February 2021.The lander carrying the rover touched down on the southern part of Utopia Planitia, a vast plain in the northern hemisphere of Mars, on 15 May 2021 and successfully detached.TheMars rover on the Tianwen 1 named ZhuRong carried six payloads.The Mars rover subsurface-penetrating radar (RoSPR) is an important payload, which is used to detect the thickness of the upper Martian soil and the structure of potentially buried water ice or dry ice and to determine the depth distribution of the subsurface stratigraphy.Since Mars is far from Earth, the propagation delay in the communication link is very large (more than 20 min).In order to reduce the pressure on the transmission link and ensure the effective use of the link transmission bandwidth, China's first Mars exploration mission has put forward a demand for data compression for all scientific payload data.Compression algorithms are widely used to reduce data storage requirements in computers.A highspeed CPU and memory can easily solve the resource problems of compression algorithms.Therefore, various algorithms, such as text compression, image compression, and encoding compression, have been proposed and successfully applied in different fields.On the model, and the processing flow.In Section 4, the BAQ and logarithmic compression algorithms are compared in terms of the processing of measured data, and this further shows that the logarithmic compression algorithm is more suitable for the RoSPR.Section 5 describes the implementation of the logarithmic compression algorithm in detail.Section 6 introduces the compression processing results of field test data from glaciers and volcanoes, which demonstrates that the algorithm can meet the application requirements.Finally, a summary and acknowledgements are provided for this article.

RoSPR Overview
The subsurface-penetrating radar of the ZhuRong rover is a frequency-domain radar with an FM continuous wave signal, whose block diagram is shown in Figure 1.The RoSPR is equipped with two channels.One is a low-frequency channel, and the other is a high-frequency channel, both of which realize corresponding scientific objects.The low-frequency channel is 15~95 MHz, and the other is 450~2150 MHz.The controller of the radar is composed of a Xilinx Virtex 5 aerospace FPGA, XQR5VFX130T.The main functions of the FPGA are as follows: (1) to generate the two channels' baseband signals; (2) to fulfill the low-frequency channel functions: echo sampling, digital down-conversion and pulse compression, and data compression; (3) to control the RF frontend; (4) to achieve the highfrequency channel functions: echo sampling and data compression; (5) to acquire telemetry signals; and (6) to perform parameter injection, format and send scientific data [13], and so on.
requirements of the RoSPR data compression, which is a high-efficiency data compression method for subsurface-penetrating radar.
The remaining sections are arranged as follows: Section 2 provides an overview of the RoSPR system.Section 3 introduces the data characteristics of the RoSPR, the algorithm model, and the processing flow.In Section 4, the BAQ and logarithmic compression algorithms are compared in terms of the processing of measured data, and this further shows that the logarithmic compression algorithm is more suitable for the RoSPR.Section 5 describes the implementation of the logarithmic compression algorithm in detail.Section 6 introduces the compression processing results of field test data from glaciers and volcanoes, which demonstrates that the algorithm can meet the application requirements.Finally, a summary and acknowledgements are provided for this article.

RoSPR Overview
The subsurface-penetrating radar of the ZhuRong rover is a frequency-domain radar with an FM continuous wave signal, whose block diagram is shown in Figure 1.The RoSPR is equipped with two channels.One is a low-frequency channel, and the other is a high-frequency channel, both of which realize corresponding scientific objects.The lowfrequency channel is 15~95 MHz, and the other is 450~2150 MHz.The controller of the radar is composed of a Xilinx Virtex 5 aerospace FPGA, XQR5VFX130T.The main functions of the FPGA are as follows: (1) to generate the two channels' baseband signals; (2) to fulfill the low-frequency channel functions: echo sampling, digital down-conversion and pulse compression, and data compression; (3) to control the RF frontend; (4) to achieve the high-frequency channel functions: echo sampling and data compression; (5) to acquire telemetry signals; and (6) to perform parameter injection, format and send scientific data [13], and so on.A block diagram of the RoSPR FPGA is given in Figure 2. The low-frequency channel functions are achieved in the digital domain, which is colored in orange in the block diagram.Meanwhile, a superheterodyne receiver is employed in the hardware for the highfrequency channel, and its function is shown in blue in the block diagram.As for the highfrequency channel, the FPGA only needs to complete its echo sampling and data compression.Moreover, the two channels' data compression is the same.We use the low-frequency channel as an example to introduce the algorithm in detail in the following sections.A block diagram of the RoSPR FPGA is given in Figure 2. The low-frequency channel functions are achieved in the digital domain, which is colored in orange in the block diagram.Meanwhile, a superheterodyne receiver is employed in the hardware for the high-frequency channel, and its function is shown in blue in the block diagram.As for the high-frequency channel, the FPGA only needs to complete its echo sampling and data compression.Moreover, the two channels' data compression is the same.We use the low-frequency channel as an example to introduce the algorithm in detail in the following sections.

BAQ and Logarithmic Compression Algorithms
Compression algorithms are generally divided into three categories: (1) scalar quantization compression algorithms; (2) vector compression algorithms; and (3) transformdomain compression algorithms.Transform-domain methods have a high degree of complexity and have not been practically applied in spaceborne SAR systems.Vector compression algorithms, as mentioned above, are not suitable for subsurface-penetrating radar.Therefore, the RoSPR uses a scalar quantization method to achieve lossy compression.Scalar quantization methods include uniform quantization, adaptive quantization, and non-uniform quantization.After pulse compression in the FPGA, the radar data roughly obey the Gaussian distribution.Subsequently, the quantization method needs to employ adaptive quantization or non-uniform quantization instead of uniform quantization.The BAQ algorithm is selected as the adaptive quantization method, while the logarithmic quantization method is chosen as the non-uniform quantization method.A comparison of the two compression algorithms is made in Section 4.

Logarithmic Compression Algorithm and Model
The logarithmic compression algorithm (LCA) is a lossy compression method employing non-uniform quantization.It uses amplitude non-uniform quantization to compress the original data; this is similar to the block adaptive quantization algorithm.In comparison to the BAQ algorithm, it has no block, no average mean, and no quantization code table [14].The LCA can be implemented on a single FPGA, uses few resources, and has good real-time performance.
The maximum echo signal of the RoSPR low-frequency channel is about 2 dBm, and its noise floor is −85 dB.Therefore, the dynamic range of the low-frequency channel is about 87 dB.Considering the margin, 90 dB is taken.RoSPR pulse compression is achieved in the FPGA, which is carried out by FFT multiplication in the frequency domain.The FFT operation result should be at least about 15 bits (90 dB/6 dB/bit).Considering the design margin and accumulation requirements, the FFT result is represented by a 20-bit signed number that covers the 90 dB dynamic range.
A 20-bit signed data becomes a 5-bit signed data after 4:1 compression.The data maximum before compression is (2^20 = 1,048,576), and the data maximum after compression is (2^5 = 32).The base of the logarithmic is 10, and the compression formula is given as follows:

BAQ and Logarithmic Compression Algorithms
Compression algorithms are generally divided into three categories: (1) scalar quantization compression algorithms; (2) vector compression algorithms; and (3) transform-domain compression algorithms.Transform-domain methods have a high degree of complexity and have not been practically applied in spaceborne SAR systems.Vector compression algorithms, as mentioned above, are not suitable for subsurface-penetrating radar.Therefore, the RoSPR uses a scalar quantization method to achieve lossy compression.Scalar quantization methods include uniform quantization, adaptive quantization, and non-uniform quantization.After pulse compression in the FPGA, the radar data roughly obey the Gaussian distribution.Subsequently, the quantization method needs to employ adaptive quantization or non-uniform quantization instead of uniform quantization.The BAQ algorithm is selected as the adaptive quantization method, while the logarithmic quantization method is chosen as the non-uniform quantization method.A comparison of the two compression algorithms is made in Section 4.

Logarithmic Compression Algorithm and Model
The logarithmic compression algorithm (LCA) is a lossy compression method employing non-uniform quantization.It uses amplitude non-uniform quantization to compress the original data; this is similar to the block adaptive quantization algorithm.In comparison to the BAQ algorithm, it has no block, no average mean, and no quantization code table [14].The LCA can be implemented on a single FPGA, uses few resources, and has good real-time performance.
The maximum echo signal of the RoSPR low-frequency channel is about 2 dBm, and its noise floor is −85 dB.Therefore, the dynamic range of the low-frequency channel is about 87 dB.Considering the margin, 90 dB is taken.RoSPR pulse compression is achieved in the FPGA, which is carried out by FFT multiplication in the frequency domain.The FFT operation result should be at least about 15 bits (90 dB/6 dB/bit).Considering the design margin and accumulation requirements, the FFT result is represented by a 20-bit signed number that covers the 90 dB dynamic range.
A 20-bit signed data becomes a 5-bit signed data after 4:1 compression.The data maximum before compression is (2ˆ20 = 1,048,576), and the data maximum after compression is (2ˆ5 = 32).The base of the logarithmic is 10, and the compression formula is given as follows: The symbol ⌊⌋ indicates that the data are rounded down.ini_data represents the 20-bit signed data after radar pulse compression, and compress_data1 represents the compressed data.
Similarly, the data become 8-bit signed data after 2.5:1 compression.The maximum number of data before compression is (2ˆ20 = 1,048,576), and the maximum number of data after compression is (2ˆ7 = 128).The compression formula is as follows: compress_data2 represents the compressed data after 2.5:1 compression.

Algorithm Flow
The LOG quantizer is used to encode the input data.The establishment of the LOG quantizer depends on the width of the input data and the compression ratio.Its block diagram is shown in Figure 3.
The symbol   indicates that the data are rounded down.ini_data represents the 20-bit signed data after radar pulse compression, and compress_data1 represents the compressed data Similarly, the data become 8-bit signed data after 2.5:1 compression.The maximum number of data before compression is (2^20 = 1,048,576), and the maximum number of data after compression is (2^7 = 128).The compression formula is as follows:

Algorithm Flow
The LOG quantizer is used to encode the input data.The establishment of the LOG quantizer depends on the width of the input data and the compression ratio.Its block diagram is shown in Figure 3.The specific LCA process is as follows: (1) According to the width of the input data and the compression ratio, the operation coefficient of logarithmic compression is determined.(2) According to the width of the input data and the operation coefficient of compression, the LOG quantizer is established.(3) The input data are passed through the LOG quantizer, and the compressed coded value is output.(4) The compressed value is transmitted to the ground.(5) The compressed operating coefficient is reused on the ground to decompress the coded value.

BAQ Algorithm
The BAQ quantizers with different bit rates are used to improve the overall compression performance of the TerraSAR-X system [15][16][17].In view of the approximate Gaussian distribution statistical characteristics for microwave imaging radar data [16], the dynamic range of the signal in a short time interval is much smaller than that of the entire echo data set.After the data are divided into blocks, the dynamic range of most compressed data blocks is reduced [18].The BAQ algorithm block diagram is shown in Figure 4.The specific LCA process is as follows: (1) According to the width of the input data and the compression ratio, the operation coefficient of logarithmic compression is determined.(2) According to the width of the input data and the operation coefficient of compression, the LOG quantizer is established.(3) The input data are passed through the LOG quantizer, and the compressed coded value is output.(4) The compressed value is transmitted to the ground.(5) The compressed operating coefficient is reused on the ground to decompress the coded value.

BAQ Algorithm
The BAQ quantizers with different bit rates are used to improve the overall compression performance of the TerraSAR-X system [15][16][17].In view of the approximate Gaussian distribution statistical characteristics for microwave imaging radar data [16], the dynamic range of the signal in a short time interval is much smaller than that of the entire echo data set.After the data are divided into blocks, the dynamic range of most compressed data blocks is reduced [18].The BAQ algorithm block diagram is shown in Figure 4.The specific BAQ algorithm process is as follows: (1) The data are divided into blocks, the average amplitude of the samples in the blocks is calculated, and the standard deviation is obtained from a look-up table with the obtained mean value.( 2) The optimal quantization level threshold is determined from the standard deviation, and the code is obtained by comparing the data samples in the blocks with the threshold, which contains 1 sign bit.(3) The code and the corresponding block amplitude mean are transmitted down to the ground.(4) On the ground, the codes and the mean amplitudes of the corresponding data blocks are used to decompress the data according to the decoding value table.

Test Comparison of the Two Methods
The two compression algorithms were compared with the measured data in the laboratory.A loopback test was carried out to obtain data after pulse compression based on a flight model.The chirp signal transmitted by the transmitter was attenuated by 20 dB by a fixed attenuator, and loopback to the receiver was carried out through a Radio Frequency (RF) cable.The data were directly output after pulse compression was carried out in the FPGA.
We used the logarithmic compression algorithm and the BAQ compression algorithm to complete 4:1 data compression, respectively, and we compared the data compression and decompression results, as shown in Figure 5, where INI represents the initial data.The specific BAQ algorithm process is as follows: (1) The data are divided into blocks, the average amplitude of the samples in the blocks is calculated, and the standard deviation is obtained from a look-up table with the obtained mean value.( 2) The optimal quantization level threshold is determined from the standard deviation, and the code is obtained by comparing the data samples in the blocks with the threshold, which contains 1 sign bit.(3) The code and the corresponding block amplitude mean are transmitted down to the ground.(4) On the ground, the codes and the mean amplitudes of the corresponding data blocks are used to decompress the data according to the decoding value table.

Test Comparison of the Two Methods
The two compression algorithms were compared with the measured data in the laboratory.A loopback test was carried out to obtain data after pulse compression based on a flight model.The chirp signal transmitted by the transmitter was attenuated by 20 dB by a fixed attenuator, and loopback to the receiver was carried out through a Radio Frequency (RF) cable.The data were directly output after pulse compression was carried out in the FPGA.
We used the logarithmic compression algorithm and the BAQ compression algorithm to complete 4:1 data compression, respectively, and we compared the data compression and decompression results, as shown in Figure 5, where INI represents the initial data.
When the input data have no targets (148 µs~153 µs), the noise follows a Gaussian distribution, and BAQ compression performs better than logarithmic compression.However, for targeted data (144 µs~148 µs), due to their high dynamics, the sidelobe compression effect of logarithmic compression is significantly better than that of BAQ.In the later analysis of the RoSPR data, the loss of the echo signal needs to be concerned.The sidelobe loss of BAQ compression has a significant impact on the later data analysis, while the noise loss before and after compression has little impact.
To analyze the errors of the data compression algorithms, it is necessary to separately calculate the average error and peak error of the data before and after compression.When the input data have no targets (148 μs~153 μs), the noise follows a Gaussian distribution, and BAQ compression performs better than logarithmic compression.However, for targeted data (144 μs~148 μs), due to their high dynamics, the sidelobe compression effect of logarithmic compression is significantly better than that of BAQ.In the later analysis of the RoSPR data, the loss of the echo signal needs to be concerned.The sidelobe loss of BAQ compression has a significant impact on the later data analysis, while the noise loss before and after compression has little impact.
To analyze the errors of the data compression algorithms, it is necessary to separately calculate the average error and peak error of the data before and after compression.
(1) Average error The peak signal-to-noise ratio (PSNR) parameter is adopted to evaluate the average error before and after compression.The peak signal-to-noise ratio (PSNR) is expressed as follows: ) )) (max( ( log 10 x represents the signal before compression, and MSE is the mean square error of the data before and after compression: y represents the recovery signal after decompression.According to the PSNR requirements for image and sound compression, it should be between 30 dB and 50 dB, so the radar data compression algorithm specifies that the PSNR should be no less than 30 dB. (

1) Average error
The peak signal-to-noise ratio (PSNR) parameter is adopted to evaluate the average error before and after compression.The peak signal-to-noise ratio (PSNR) is expressed as follows: x represents the signal before compression, and MSE is the mean square error of the data before and after compression: y represents the recovery signal after decompression.According to the PSNR requirements for image and sound compression, it should be between 30 dB and 50 dB, so the radar data compression algorithm specifies that the PSNR should be no less than 30 dB.
(2) Peak error The peak error before and after compression is evaluated using the peak-signal-topeak-noise ratio (PSPNR) parameter: r represents the compression error: The PSPNR should be greater than 50; that is, the maximum compression error should be less than 2% of the signal peak.
The performance of the two compression algorithms is evaluated by comparing the decompressed data The PSNR and PSPNR are employed for evaluation [19].The results show that the compression error of the logarithmic compression algorithm is smaller than that of the BAQ algorithm.And the BAQ algorithm does not meet the strict index requirements, but the logarithmic compression does, as shown in Table 1.Through a comprehensive comparison, it is found that the compression error of the logarithmic compression algorithm is smaller than that of the BAQ algorithm and meets the index requirements.Therefore, the logarithmic lossy compression algorithm is more effective in RoSPR data compression.

Realization of Logarithmic Data Compression in FPGA
The principle of FPGA implementation for this algorithm is to complete logarithmic operations.The conventional method used to implement the logarithm operation in the FPGA is the look-up table method [20].However, when conventional method is used to perform the logarithmic operation for a large volume of data and large-width data, a very large proportion of storage resources is required.
In this design, we adopted the principle of successive approximation to realize logarithmic operations.The implementation process is described in detail below.Assuming that the input data are N and that y = log 10 (N) is what we want to compute, the successive approximation implementation of the logarithm operation includes the following: Variable x and coefficient sequence k are introduced.The value of sequence k is given, assuming k = {k1, k2, k3, . .., kn}, and the approximate value of y_close = log 10 (N/(ki * x)) = log 10 (N/x) − log 10 (ki).
The initial value of x is N divided by the maximum k value kmax in the sequence and then by x = N/kmax at the beginning.
Compensate the value of x for k; that is, let x = ki * x. ki is the maximum of k such that x is not greater than 1.Update the approximation value of y_close synchronously; i.e., subtract the compensated log 10 (ki) [21].
Repeat step (3) until the minimum k value of x compensation is still greater than 1; then, the compensation is abandoned, and the approximate value of y_close is output.
Taking the 4:1 logarithmic compression algorithm as an example, the logarithmic computation is completed by successive approximation.The logarithmic compression coefficient of 4:1 successive approximation based on the FPGA is shown in Table 2.
In the initialization process of data compression, the initial value is input_data/2ˆ20, where input_data is the input data before compression.The approximation operation requires 25 steps in total, that is, the serial numbers 2~26 in Table 2.The convergence condition of the approximation operation is to judge whether the products of the approximation parameter k and x are greater than 2ˆ20 before each step of operation: if the result is not greater than 2ˆ20, the approximation operation of the k value is completed; otherwise, this approximation operation is abandoned, the result of the last operation is assigned to this result, and then the next attempt to perform the approximation operation of the k value is made.If x is still greater than 2ˆ20 after the minimum k value is compensated, the compensation is abandoned, and the compressed data are output.When the data is zero, it is not compressed and is stored directly after its width is converted.A flowchart of the FPGA implementation for the data compression algorithm is shown in Figure 6.
When the algorithm is implemented on the FPGA in ISE13.2, the proportion of resources is evaluated as shown in Figure 7.The registers are only 1% utilized, and the LUTs are only 2% utilized.The proportion of resources used by logarithmic compression in the FPGA is very small, almost negligible [22].Therefore, it is feasible to implement the logarithmic operation in the FPGA using the method of successive approximation.(1 + 2 17 )/2 17  18 25 (1 + 2 18 )/2 18  9 26 (1 + 2 19 )/2 19  4   In the initialization process of data compression, the initial value is input_data/2^20, where input_data is the input data before compression.The approximation operation requires 25 steps in total, that is, the serial numbers 2~26 in Table 2.The convergence condition of the approximation operation is to judge whether the products of the approximation parameter k and x are greater than 2^20 before each step of operation: if the result is not greater than 2^20, the approximation operation of the k value is completed; otherwise, this approximation operation is abandoned, the result of the last operation is assigned to this result, and then the next attempt to perform the approximation operation of the k value is made.If x is still greater than 2^20 after the minimum k value is compensated, the compensation is abandoned, and the compressed data are output.When the data is zero, it is not compressed and is stored directly after its width is converted.A flowchart of the FPGA implementation for the data compression algorithm is shown in Figure 6.When the algorithm is implemented on the FPGA in ISE13.2, the proportion of resources is evaluated as shown in Figure 7.The registers are only 1% utilized, and the LUTs are only 2% utilized.The proportion of resources used by logarithmic compression in the FPGA is very small, almost negligible [22].Therefore, it is feasible to implement the logarithmic operation in the FPGA using the method of successive approximation.

Experimental Verification
In September 2020, a field validation test was carried out at No. 29 Laohugou Glacier in Qilian Mountain, Gansu Province.Subsequently, in October 2020, an outfield validation test was carried out in Ulanhada Volcanic Geological Park, Chahar Right Rear Banner, Ulanqab City, Inner Mongolia Province, as shown in Figure 8a,b.This paper selects the test data of the above two scenarios for a data compression analysis.In order to more intuitively compare the errors of the data before and after compression, one trace data is intercepted and compared before and after compression.A comparison of the two compression ratios of 2.5:1 and 4:1 is shown in Figure 9a,b.This paper selects the test data of the above two scenarios for a data compression analysis.In order to more intuitively compare the errors of the data before and after compression, one trace data is intercepted and compared before and after compression.A comparison of the two compression ratios of 2.5:1 and 4:1 is shown in Figure 9a,b.The decompressed data with a compression ratio of 2.5:1 have a high degree of curve coincidence with the original data, and the error curve is close to the horizontal axis after normalization.The maximum relative error of the single-channel data before and after compression is 0.37%, which can be ignored.The decompressed data with a compression ratio of 4:1 are slightly different from the original data, with a maximum relative error of less than 0.6%.Compared with the huge storage space occupied by the uncompressed data, the error is acceptable.
When the crater high-frequency channel data are input, the processing result is similar to that of the of the glacier data, as shown in Figure 10a,b.Compared with the 2.5:1 compression ratio, a higher 4:1 compression ratio will also result in higher compression errors.The maximum relative error before and after single-channel data compression is 1.38%; the compression error is still acceptable compared to the size of the original data.The decompressed data with a compression ratio of 2.5:1 have a high degree of curve coincidence with the original data, and the error curve is close to the horizontal axis after normalization.The maximum relative error of the single-channel data before and after compression is 0.37%, which can be ignored.The decompressed data with a compression ratio of 4:1 are slightly different from the original data, with a maximum relative error of less than 0.6%.Compared with the huge storage space occupied by the uncompressed data, the error is acceptable.
When the crater high-frequency channel data are input, the processing result is similar to that of the of the glacier data, as shown in Figure 10a,b.Compared with the 2.5:1 compression ratio, a higher 4:1 compression ratio will also result in higher compression errors.The maximum relative error before and after single-channel data compression is 1.38%; the compression error is still acceptable compared to the size of the original data.
data, the error is acceptable.
When the crater high-frequency channel data are input, the processing result is similar to that of the of the glacier data, as shown in Figure 10a,b.Compared with the 2.5:1 compression ratio, a higher 4:1 compression ratio will also result in higher compression errors.The maximum relative error before and after single-channel data compression is 1.38%; the compression error is still acceptable compared to the size of the original data.

Conclusions
This paper proposes a logarithmic lossy compression algorithm for the Tianwen-1 Mars rover subsurface-penetrating radar.The algorithm is implemented based on the FPGA platform, a suitable logarithmic compression model is given according to the compression ratios of 4:1 and 2.5:1, and data compression with a high compression ratio is realized.The logarithm operation of the FPGA is realized by the successive approximation

Conclusions
This paper proposes a logarithmic lossy compression algorithm for the Tianwen-1 Mars rover subsurface-penetrating radar.The algorithm is implemented based on the FPGA platform, a suitable logarithmic compression model is given according to the compression ratios of 4:1 and 2.5:1, and data compression with a high compression ratio is realized.The logarithm operation of the FPGA is realized by the successive approximation method.The register utilization rate of this method is only 1%, and the look-up table utilization rate is only 2%, so it uses a small proportion of resources.The FPGA only elapses 300 ns to compress a 20-bit signed data.The LCA is a very efficient compression algorithm.The relative error of a single trace data point before and after the compression of glacier and crater data is less than 2%.This can provide a reference for subsurface-penetrating radar data compression.

Figure 5 .
Figure 5.Comparison before and after compression by two algorithms.

Figure 5 .
Figure 5.Comparison before and after compression by two algorithms.

Figure 7 .
Figure 7. FPGA resources using for LCA 6. Experimental Verification In September 2020, a field validation test was carried out at No. 29 Laohugou Glacier in Qilian Mountain, Gansu Province.Subsequently, in October 2020, an outfield validation test was carried out in Ulanhada Volcanic Geological Park, Chahar Right Rear Banner, Ulanqab City, Inner Mongolia Province, as shown in Figure 8a,b.

Figure 7 .Figure 8 .
Figure 7. FPGA resources using for LCA6.Experimental VerificationIn September 2020, a field validation test was carried out at No. 29 Laohugou Glacier in Qilian Mountain, Gansu Province.Subsequently, in October 2020, an outfield validation test was carried out in Ulanhada Volcanic Geological Park, Chahar Right Rear Banner, Ulanqab City, Inner Mongolia Province, as shown in Figure8a,b.

Figure 8 .
Figure 8. Site map of the RoSPR detection test.(a) Field exploration of glaciers; (b) Field exploration of craters.

Figure 9 .
Figure 9.Comparison of the errors between the original glacier data and the decompressed data.(a) Original data and 2.5:1 decompressed data; (b) Original data and 4:1 decompressed data.

Figure 9 .
Figure 9.Comparison of the errors between the original glacier data and the decompressed data.(a) Original data and 2.5:1 decompressed data; (b) Original data and 4:1 decompressed data.

Figure 10 .
Figure 10.Comparison of the errors between the original crater data and the decompressed data.(a) Original data and 2.5:1 decompressed data; (b) Original data and 4:1 decompressed data.

Figure 10 .
Figure 10.Comparison of the errors between the original crater data and the decompressed data.(a) Original data and 2.5:1 decompressed data; (b) Original data and 4:1 decompressed data.

Table 1 .
Comparison of the root mean square errors of the compression algorithms.