Target trajectory recursion method and FPGA implementation structure
Through the new target trajectory recursive algorithm, only adders and accumulators are used to achieve radar target simulation, which solves the problem of insufficient multiplier resources in the existing technology, and realizes high update rate and high-precision radar target simulation, improving simulation The computational efficiency and target number of the device.
Patent Information
- Application Number
- CN202411341324.1
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2024-09-25
- Publication Date
- 2024-11-26
AI Technical Summary
Under the demand for high update rate, existing radar target simulators require a large amount of FPGA multiplier resources, resulting in calculation accuracy and dynamic range limitations, and the number of multipliers is proportional to the number of targets, affecting the number of simulators and calculation efficiency.
A new target trajectory recursive algorithm is adopted to realize the trajectory calculation of uniformly accelerated linear motion targets through accumulation, using only adders and accumulators, avoiding the use of multipliers, and realizing the recursiveness of the target distance.
Without consuming the multiplier, the target trajectory update rate and high-precision distance calculation of ten nanoseconds are realized, saving FPGA resources, making the number of simulated targets not limited by the multiplier, and improving the calculation efficiency and accuracy.
Smart Images

Figure CN119024290A_ABST
Abstract
Description
Technical Field
[0001] The invention relates to a radar target simulation method and equipment of a digital or analog system, belonging to the field of radar testing. Background Art
[0002] Radar target simulator is an electronic measurement and testing equipment used to simulate targets for radars, and is used for radar research and development and production. Radar target simulators simulate the characteristics of targets, which are often moving, generally uniformly accelerated linear motion targets. In many applications, the update rate of the trajectory of existing radar target simulators can generally only reach the millisecond level, and the target trajectory can be calculated in a digital signal processor (DSP). However, in applications that require a high target update rate, such as a target simulator based on frequency domain compensation, the target update rate requirement will reach the order of tens of nanoseconds. In this case, the calculation of the target trajectory is not suitable for calculation in the DSP, but can only be placed in the FPGA to meet the update rate requirements. At this time, the target calculation rate is basically equivalent to the sampling rate, rather than the pulse repetition period.
[0003] Traditional trajectory calculation methods require the use of multiplier resources in FPGA, which are very valuable and need to be saved as much as possible. In situations where high-precision distance calculation is required, the distance accuracy needs to reach 0.001mm, and the distance range needs to reach 1000km, which requires the number of bits used to express the distance fixed point to reach 40 bits, and the variables in the intermediate calculation process may need to reach 70 bits. This consumes a lot of multiplier resources. If the double data type is used, the number of multipliers required for its multiplication operation is also very large, and timing problems are prone to occur. On the other hand, the number of multipliers required is proportional to the number of targets. In the case of multiple targets, in order to ensure calculation accuracy and dynamic range, the number of multipliers required is several hundred. This greatly affects the number of targets simulated by the simulator.
[0004] The present invention proposes a new target trajectory recursive algorithm for a radar target simulator, which can realize the trajectory calculation of a uniformly accelerated linear motion target by only adding, thus saving a large amount of multiplier resources of FPGA, so that the number of simulated targets is no longer limited by limited multiplier resources. Summary of the invention
[0005] According to the present invention, a new target trajectory recursive algorithm and FPGA implementation structure are adopted to achieve the following beneficial effects:
[0006] 1. Complete the recursion of the target distance without using the FPGA multiplier.
[0007] 2. The target trajectory update rate reaches the order of tens of nanoseconds.
[0008] The present invention proposes a new radar moving target simulation method, wherein the method comprises: the distance change per unit time ΔR n , and for ΔR n The estimated distance R is obtained by accumulating n , the calculation formula is as follows
[0009] R0=R0 (1)
[0010] R n =R n-1 +ΔR n (2)
[0011]
[0012] Where R0 is the starting distance, v0 is the initial velocity, a is the acceleration, f s is the FPGA working clock, n is the clock counter, starting from 0 and increasing by 1 after each clock. and Calculate it in advance and then implement it using only adders and accumulators in the FPGA.
[0013] The present invention also proposes an FPGA implementation structure, wherein the structure implements the target trajectory recursive algorithm as described above.
[0014] According to the present invention, the simulation of the ideal moving point target trajectory can be completed by using only adders without using multipliers, and the target update rate reaches the operation clock rate of the FPGA. BRIEF DESCRIPTION OF THE DRAWINGS
[0015] Figure 1 It is a principle block diagram of the existing target trajectory recursion technology;
[0016] Figure 2 It is a principle block diagram of the method of the present invention;
[0017] Figure 3 is a distance error graph of the method of the present invention; DETAILED DESCRIPTION
[0018] The present invention is further described in detail below in conjunction with the accompanying drawings and specific embodiments.
[0019] The embodiment of the method of the present invention is as follows:
[0020] According to the present invention, a new recursive method for calculating the trajectory of a radar moving target is proposed, which can use only adders instead of multipliers and save a lot of multiplier resources. Figure 1Shown is a principle block diagram of an existing target trajectory recursive technology, which requires a large number of multipliers. Figure 2 FIG. 1 is a block diagram of the principle of the method of the present invention. Figure 2 The main difference from the existing technology is that the multiplication of speed and acceleration on time is changed to a recursive algorithm using accumulation. First, the distance change per unit time is derived using mathematical induction. It can be found that the time unit in the formula changes from n 2 When the number is reduced to n, the multiplier is no longer needed, and only the accumulator is needed to achieve it. Then the distance change can be accumulated again. In this way, the multiplier is optimized through two accumulators, thereby saving a lot of resources. At the same time, because in FPGA, accumulation is compared with multiplication, the calculation accuracy is easier to control, which can improve the accuracy requirement. The specific processing steps are as follows: Calculate the pre-parameters and Place it in the host computer to implement, which can save a lot of resources, and then enter the FPGA to Add up and get Plus After accumulating again and finally adding the starting distance R0, the trajectory of the target can be obtained.
[0021] The target trajectory calculation process of the prior art is as follows:
[0022] Assuming that the target's motion trajectory is uniformly accelerated linear motion, the distance calculation formula is:
[0023]
[0024] In FPGA, time is advanced according to clock n (positive integer), and the formula is as follows:
[0025]
[0026] First, Accumulate once with the clock, and get Then use the multiplier to get Multiply by Plus the clock-accumulated and the initial distance, the target trajectory distance that changes with time can be obtained.
[0027] The applicable conditions of the embodiment of the method of the present invention are described below.
[0028] Since the method of the present invention is improved and optimized based on the distance calculation formula of uniformly accelerated linear motion, and the speed, distance and acceleration are all signed numbers, it is applicable to any uniformly accelerated linear motion within the specified parameter range, including the following situations: accelerating away, decelerating away, accelerating approaching, decelerating approaching, moving away at a uniform speed, and approaching at a uniform speed.
[0029] The feasibility of the method of the present invention is analyzed below.
[0030] We know that the distance formula of uniformly accelerated linear motion is (5), and we analyze it.
[0031] First, the initial distance is the starting distance R0. Then, in the next clock, due to the velocity v0 and acceleration a, a distance increment ΔR1 will be obtained. The two are added together to get the current distance R1. Then R1 plus ΔR2 to get R2, and so on. After mathematical induction, R n .
[0032] We use R n Subtract R n-1 , we can get ΔR n The formula is:
[0033]
[0034] ΔR n By adding them up, we can get R n -R0, plus the starting distance R0, we can get the recursive distance trajectory.
[0035] Although the above formula is derived according to uniformly accelerated linear motion, according to the formula content and algorithm structure, as well as the fact that parameters such as speed, distance, and acceleration are all signed numbers, it is applicable to any uniformly accelerated linear motion within the specified parameter range, including the following situations: accelerating away, decelerating away, accelerating approaching, decelerating approaching, moving away at a constant speed, and approaching at a constant speed.
[0036] Algorithm Example 1 of the present invention: Achieving a starting distance of 0m, an initial speed of 50m / s, and an acceleration of 10m / s 2 ,The target trajectory distance is calculated with a running time of 2s.
[0037] According to the design block diagram, we first calculate the parameters and As input, fixed-point numbers are input here. The integer width is 0 and the decimal width is 63 bits. The integer width is 0 and the decimal width is 53. Then Add up to get Plus After that, the distance is accumulated again, and finally the starting distance is added. The result is the target trajectory distance, that is, uniform acceleration from 0m to 120m. Subtract the result from the MATLAB simulation (double data) running result, and it can be obtained that the error of the estimated distance at any time is less than 10 -3mm, in accordance with the accuracy requirements, such as Figure 3 shown.
[0038] In summary, the present invention provides a new target trajectory recursive algorithm for a radar target simulator. The above are only some embodiments of the present invention and are not intended to limit the protection scope of the present invention. In fact, the present invention is applicable to any uniformly accelerated linear motion within the specified parameter range. Any modification, equivalent replacement, improvement, etc. made within the spirit and principle of the present invention should be included in the protection scope of the present invention.
Claims
1. The present invention proposes a new radar moving target simulation method, wherein: The method includes: a distance change per unit time ΔR n , and for ΔR n The estimated distance R is obtained by accumulating n , the calculation formula is as follows R0=R0 (1) R n =R n-1 +ΔR n (2) Where R0 is the starting distance, v0 is the initial velocity, a is the acceleration, f s is the FPGA working clock, n is the clock counter, starting from 0 and increasing by 1 after each clock. and Calculate it in advance and then implement it using only adders and accumulators in the FPGA.
2. The present invention also proposes an FPGA implementation structure, wherein: The structure implements the target trajectory recursive algorithm as described above.
Citation Information
Patent Citations
Broadband coherent radar target simulator
CN102590794A
Parabola interpolation filter capable of saving FPGA resources
CN110620564A
Hemispherical resonator gyroscope sine wave amplitude phase detection method based on IIR filtering
CN114812533A
Radar simulation data generation method based on piecewise polynomial fitting
CN118276008A
FPGA-based high-speed low-latency floating point accumulator and implementation method therefor
US20130297666A1
