MIMO radar transmission sequence set optimization method, device and computer equipment

By constructing a MIMO radar transmission sequence set optimization model with the objective function to minimize the distance-Doppler interval, the problems of low optimization solution efficiency and poor performance in the existing technology are solved. It realizes efficient target detection performance under the similarity between environmental clutter and target.

CN118731861BActive Publication Date: 2024-11-22NAT UNIV OF DEFENSE TECH
View PDF 7 Cites 0 Cited by

Patent Information

Application Number
CN202411209929.5
Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Filing Date
2024-08-30
Publication Date
2024-11-22
Estimated Expiration
2044-08-30

AI Technical Summary

Technical Problem

The existing MIMO radar transmission sequence set optimization method has problems of low optimization solution efficiency and poor transmission sequence performance in application scenarios where environmental clutter is highly similar to targets.

Method used

By constructing the emission sequence set optimization model, the objective function is to minimize the aperiodic autocorrelation and cross-correlation function sidelobes in the distance-Doppler domain interval, and to construct constraints in the airspace and frequency domains, impose constant mode constraints, and use Convex approximation transformation and continuous convex approximation acceleration solution, optimize the emission sequence set parameters to improve performance.

Benefits of technology

In an environment with similarity between environmental clutter and target, the target detection performance of the MIMO radar system is improved, clutter interference is reduced, power efficiency is optimized, and optimization efficiency is improved, and a reliable MIMO radar transmission sequence set is output.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN118731861B_ABST
    Figure CN118731861B_ABST
Patent Text Reader

Abstract

The present invention relates to a MIMO radar transmission sequence set optimization method, device and computer equipment. The method comprises: obtaining transmission sequence set parameters; the transmission sequence set parameters include the angle range of the target and clutter in the spatial domain, the normalized distance interval and normalized Doppler frequency interval where the target appears, and the optimal energy spectrum of the transmission sequence to be optimized in each channel; constructing a transmission sequence set optimization model with the goal of minimizing the side lobes of the non-periodic autocorrelation and cross-correlation functions in the range-Doppler domain interval, and with the spatial domain transmission beam pattern constraint, the transmission sequence set frequency domain constraint and the constant modulus constraint as the constraint conditions; according to the transmission sequence set parameters, the transmission sequence set optimization model is convexly converted to perform continuous convex approximation acceleration solution until the iteration stop condition is reached, and the current MIMO radar transmission sequence set is output. The method can improve the target detection performance of the radar system in an environment where the clutter and the target are highly similar.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present invention relates to the field of signal processing technology, and in particular to a method, a device and a computer device for optimizing a MIMO radar transmission sequence set. Background Art

[0002] The transmission sequence set design technology gives full play to the spatial diversity and waveform diversity characteristics of MIMO radar. By releasing the freedom of the waveform at the transmitting end, this technology effectively enhances the radar system's ability to adapt to complex environments, thereby significantly improving its target detection performance. It has great potential that cannot be ignored in practical applications. Environmental clutter is an irrelevant echo of the transmitted signal after a delay and Doppler frequency different from that of the target. Because it has a strong similarity with the target echo, it is very easy to affect the detection.

[0003] Existing research works mostly focus on optimizing the performance of a single or combined dimension of the transmission sequence set, such as transmission pattern shaping, space-frequency domain joint design, and orthogonal sequence set design. However, the above methods have certain limitations in application scenarios where environmental clutter and targets are highly similar, and there are also problems such as low optimization solution efficiency and poor transmission sequence performance. Summary of the invention

[0004] Based on this, it is necessary to provide a MIMO radar transmit sequence set optimization method, device and computer equipment to address the above technical problems.

[0005] A MIMO radar transmission sequence set optimization method, the method comprising:

[0006] Acquire transmission sequence set parameters; the transmission sequence set parameters include the angle range of the target and clutter in the airspace, the normalized distance interval and normalized Doppler frequency interval where the target may appear, and the optimal energy spectrum of the transmission sequence to be optimized for each channel;

[0007] Constructing a transmission sequence set optimization model; the objective function of the transmission sequence set optimization model includes minimizing the side lobes of the non-periodic autocorrelation and cross-correlation functions in the range-Doppler domain interval, and the constraints of the transmission sequence set optimization model include spatial domain transmission beam pattern constraints, transmission sequence set frequency domain constraints and constant modulus constraints;

[0008] According to the transmit sequence set parameters, the transmit sequence set optimization model is transformed by convex approximation and then continuously convex approximation is performed to accelerate the solution until a preset iteration stop condition is reached, and the current optimization solution is output; the optimization solution is used to design the MIMO radar transmit sequence set.

[0009] In one of the embodiments, it also includes: performing a convex approximation on the objective function of the transmit sequence set optimization model to obtain an upper bound quadratic function, converting the spatial transmit beam pattern constraint and the constant modulus constraint into a convex form, and then using slack variables to equate the current transmit sequence set optimization model to a non-convex optimization model; using the interior point method to solve the non-convex optimization model to obtain an initial solution, and using the initial solution to perform continuous convex approximation to accelerate the solution until a preset iteration stop condition is reached, and then outputting the current optimization solution.

[0010] In one of the embodiments, it also includes: using the square iteration algorithm and the initial solution to accelerate the solution of the non-convex optimization model to obtain an optimized solution, and updating the current relaxation variables in each iteration; projecting the optimized solution into a solution space that satisfies the constraints to obtain a projected solution; determining whether the projected solution satisfies the monotonic convergence of the objective function, and if not, changing the iteration step size and repeating the above steps.

[0011] In one of the embodiments, it also includes: using a projection function to project the optimization solution into a solution space that satisfies the constraint conditions to obtain a new non-convex optimization model, using an interior point method to iteratively solve the new non-convex optimization model until the interior point method convergence conditions are met, stopping the iteration and outputting the projected solution.

[0012] In one of the embodiments, it also includes: if the projection solution satisfies the monotonic convergence of the objective function, determining whether the continuous convex approximation algorithm has reached convergence; if the continuous convex approximation algorithm has reached convergence, outputting the current optimization solution; otherwise, repeating the above steps.

[0013] In one of the embodiments, it also includes: the spatial transmission beam pattern constraint includes a first constraint and a second constraint; the first constraint includes minimizing the spatial integrated sidelobe ratio; the spatial integrated sidelobe ratio is the ratio of the sum of the transmission power of all points in the sidelobe area to the sum of the transmission power of all points in the target area; the second constraint includes ensuring that the energy of the transmission beam pattern at the desired angle is at least half of the maximum energy.

[0014] In one of the embodiments, the frequency domain constraint of the transmit sequence set includes that the spectrum of the transmit sequence to be optimized of each channel is expected to be close to the corresponding optimal energy spectrum.

[0015] In one of the embodiments, the method further includes: maximizing the signal-to-interference-noise ratio of the output signal according to the frequency response and clutter power spectrum of the target, and obtaining the optimal energy spectrum of the transmission sequence of each channel.

[0016] A MIMO radar transmission sequence set optimization device, the device comprising:

[0017] A parameter acquisition module is used to acquire transmission sequence set parameters, wherein the transmission sequence set parameters include the angle range of the target and clutter in the airspace, the normalized distance interval and normalized Doppler frequency interval where the target may appear, and the optimal energy spectrum of the transmission sequence to be optimized for each channel;

[0018] A model building module is used to build a transmission sequence set optimization model; the objective function of the transmission sequence set optimization model includes minimizing the non-periodic autocorrelation and cross-correlation function sidelobes in the range-Doppler domain interval, and the constraints of the transmission sequence set optimization model include spatial domain transmission beam pattern constraints, transmission sequence set frequency domain constraints and constant modulus constraints;

[0019] The result output module is used to perform continuous convex approximation acceleration solution after convexly transforming the emission sequence set optimization model according to the emission sequence set parameters until a preset iteration stop condition is reached, and then output the current optimization solution; the optimization solution is used to design the MIMO radar emission sequence set.

[0020] The above-mentioned MIMO radar transmission sequence set optimization method, device and computer equipment, by minimizing the non-periodic autocorrelation and cross-correlation function sidelobes in the range-Doppler domain interval as the optimization goal, constructing constraints in the spatial domain and frequency domain respectively, and applying constant modulus constraints, can ensure that the transmission sequence covers the target area and avoids the clutter area to avoid clutter interference, and optimize power efficiency. Based on this, a transmission sequence set optimization model is constructed, and the problem model is optimized and solved using the acquired transmission sequence set parameters and a solution algorithm, so that the optimized solution has good performance in the spatial domain, frequency domain and range-Doppler domain. When solving, the transmission sequence set optimization model is specifically transformed by convex approximation and then continuously convex approximation is performed to accelerate the solution, which can improve the optimization efficiency and output a reliable MIMO radar transmission sequence set. The embodiment of the present invention can improve the target detection performance of the MIMO radar system in an environment where environmental clutter and the target are highly similar. BRIEF DESCRIPTION OF THE DRAWINGS

[0021] Figure 1 A schematic diagram of a flow chart of a method for optimizing a MIMO radar transmission sequence set in one embodiment;

[0022] Figure 2 A schematic diagram of a power spectrum curve of environmental clutter within a radar bandwidth in an embodiment;

[0023] Figure 3 Schematic diagram of the optimal transmission waveform energy spectrum of each channel in an embodiment;

[0024] Figure 4 A schematic diagram of the emission direction in one embodiment;

[0025] Figure 5is a schematic diagram of an autocorrelation ambiguity function between a transmission sequence pair (1, 1) in one embodiment;

[0026] Figure 6 is a schematic diagram of a cross-correlation ambiguity function between a pair of transmission sequences (1, 2) in one embodiment;

[0027] Figure 7 is a schematic diagram of a cross-correlation ambiguity function between a transmission sequence pair (2, 1) in one embodiment;

[0028] Figure 8 is a schematic diagram of an autocorrelation ambiguity function between a transmission sequence pair (2, 2) in one embodiment;

[0029] Fig. 9 A schematic diagram showing the comparison between the frequency spectra of different emission sequences and the expected frequency spectra in one embodiment;

[0030] Fig.10 A structural block diagram of a MIMO radar transmission sequence set optimization device in one embodiment;

[0031] Fig.11 FIG. 4 is a diagram showing the internal structure of a computer device in one embodiment. DETAILED DESCRIPTION

[0032] In order to make the purpose, technical solution and advantages of the present invention more clearly understood, the present invention is further described in detail below in conjunction with the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are only used to explain the present invention and are not intended to limit the present invention.

[0033] In one embodiment, Figure 1 As shown, a MIMO radar transmission sequence set optimization method is provided, comprising the following steps:

[0034] Step 102: Obtain transmit sequence set parameters.

[0035] First, determine the number of radar system transmit signal channels based on radar system parameters and actual application scenarios. , the code length of the sequence to be optimized for each channel , thus obtaining the transmission sequence to be optimized for each channel, and the corresponding transmission sequence set is expressed as:

[0036] (1)

[0037] Among them, the matrix Column represents The transmission sequence of each channel in a snapshot is expressed as , the matrix Row represents The transmission sequence of the channels can be expressed as .

[0038] The transmission sequence set parameters include the angular range of the target and clutter in the spatial domain, the normalized distance interval and normalized Doppler frequency interval where the target may appear, and the optimal energy spectrum of the transmission sequence to be optimized for each channel, wherein the optimal energy spectrum of the transmission sequence to be optimized for each channel is calculated through the target frequency response and clutter power spectrum information.

[0039] According to the actual problem, the set of possible angles at which the target may appear in the airspace is determined as follows: , the possible angles of clutter and interference are , and the relationship between the two sets satisfies ,in represents the empty set, thereby obtaining the angular range of the target and clutter in the spatial domain.

[0040] According to the radar system operating parameters, the center frequency is determined as , the bandwidth is , then the wavelength of the emitted electromagnetic wave is ,in, is the propagation speed of electromagnetic waves, and the time width of each code element in the phase-coded sequence is .

[0041] Determine the distance range where the target may appear based on the actual problem and speed range . Then the normalized distance interval in which the target may appear is , recorded as the interval ; The normalized Doppler frequency range in which the target may appear is , recorded as the interval .

[0042] According to the target and environment information, the frequency response of the target within the radar working bandwidth is determined as , the clutter power spectrum is , the noise power spectrum is ,in is the number of sampling points in the frequency domain. Taking the maximum output signal signal-to-interference-to-noise ratio as the optimization criterion, according to the target frequency response and clutter power spectrum information, the optimal energy spectrum of the transmitted waveform of each channel is obtained as follows: , the value of each frequency point in the energy spectrum can be expressed as:

[0043] (2)

[0044] in, It means to find the complex modulus length. is a constant and can be obtained through the energy constraint equation.

[0045] (3)

[0046] in, It is the total energy of the transmitted signal of each channel in the frequency domain.

[0047] Step 104: construct a transmission sequence set optimization model.

[0048] The objective function of the transmit sequence set optimization model includes minimizing the sidelobes of the non-periodic autocorrelation and cross-correlation functions in the range-Doppler domain.

[0049] aisle The launch sequence Normalized Doppler frequency After modulation, it can be expressed ,in, is the Doppler steering vector. Then and Aperiodic correlation function in time delay The value of is:

[0050] (4)

[0051] when When , equation (4) represents the transmission sequence of AAF; when When , it indicates the transmission sequence and CAF. The Doppler shift is When , the covariance matrix of the transmitted sequence set can be expressed as:

[0052] (5)

[0053] Using the launch sequence set It means that formula (5) can be rewritten as:

[0054] (6)

[0055] is a shift matrix, which is expressed as:

[0056] (7)

[0057] Taking into account the local low sidelobe performance of the designed transmit sequence autocorrelation function and the orthogonality between channels, the design objective function is:

[0058] (8)

[0059] Among them, the first term is the local sidelobe energy of the autocorrelation function of each channel, and the second term is the sum of the local sidelobe energy of the cross-correlation function between each channel. It can be written in closed form as:

[0060] (9)

[0061] From equation (9), we can further deduce that the objective function for designing a transmission sequence set with good autocorrelation and cross-correlation performance is:

[0062] (10)

[0063] in, Representative The channel transmits the A phase-coded signal, Represented by vector is a diagonal matrix with diagonal elements, represents the Hadamard product, Represents a vector norm, represents the Kronecker function, which is expressed as:

[0064] (11)

[0065] The constraints of the transmit sequence set optimization model include spatial transmit beam pattern constraints, transmit sequence set frequency domain constraints, and constant modulus constraints. Among them, the spatial transmit beam pattern constraints involve the low sidelobe beam pattern design problem, which generally needs to meet the following two goals: (1) minimize the ratio of the sum of the transmit power of all points in the sidelobe area to the sum of the transmit power of all points in the target area; (2) ensure the transmit direction Figure 1 A fixed 3dB beamwidth.

[0066] Transmit sequence matrix In the direction The energy on can be expressed as:

[0067] (12)

[0068] in, is the orientation vector, , since the MIMO radar array is a uniform linear array, the steering vector can be expressed as .

[0069] Within the set of angles where the target may appear, the energy of the transmit beam pattern is:

[0070] (13)

[0071] in, Similarly, within the set of angles where clutter and interference may occur, the energy of the transmit beam pattern is:

[0072] (14)

[0073] in, .

[0074] For the first constraint of low sidelobe beam pattern, the spatial integrated sidelobe ratio index is defined as:

[0075] (15)

[0076] Therefore, the first constraint can be expressed as:

[0077] (16)

[0078] in, is a constant, representing the maximum value of the spatially integrated sidelobe ratio of the optimized beam pattern. The second constraint can be written as:

[0079] (17)

[0080] in, The angle direction corresponding to the maximum energy of the transmit beam pattern is generally taken as the center point of the target angle set. This constraint ensures that the energy of the transmit beam pattern at the desired angle is at least half of the maximum energy.

[0081] Finally, consider the constraints on the spectrum of the waveform transmitted by each channel, that is, it is expected that the spectrum of the transmission sequence of each channel is close to the ideal spectrum shown in formula (2). The spectrum of the transmission sequence of each channel is obtained by Fourier transform:

[0082] (18)

[0083] in, is the Fourier transform matrix, which can be expressed as:

[0084] (19)

[0085] in, is the result of zero padding of the transmission sequence of each channel, is the length of the transmitted sequence after zero padding. Therefore, the frequency domain constraint of the transmitted sequence set can be written as:

[0086] (20)

[0087] in, On behalf of Hademann, represents the dot product, is the upper limit of the transmission sequence frequency constraint. , represents the weighted value of each frequency point of the transmission sequence, and its value is:

[0088] (twenty one)

[0089] In summary, considering the spatial transmission pattern performance, the self-ambiguity function and mutual ambiguity function performance of the transmission sequence set, the spectrum performance and the constant mode characteristics of the transmission sequence, the optimization problem can be constructed as follows:

[0090] (twenty two)

[0091] The present invention optimizes the transmission sequence set in the joint space-frequency-range-Doppler domain, takes minimizing the non-periodic autocorrelation and cross-correlation function sidelobes in the range-Doppler domain interval as the optimization target, can reduce the sub-peaks of the transmission sequence autocorrelation and cross-correlation functions in a specific range-Doppler domain, thereby reducing the interference of clutter, constructs constraints in the space domain and the frequency domain respectively, can ensure the specific directionality of the transmission sequence in space, so as to cover the target area and avoid the clutter area, and can ensure the specific distribution of the transmission sequence in the frequency domain, so as to avoid environmental clutter interference, and imposes constant modulus constraints, can ensure that the transmission sequence has a constant modulus, that is, the amplitude of each transmission signal is the same, thereby optimizing power efficiency. Based on this, a problem model is constructed, and the problem model is optimized and solved, so that the optimized solution can be achieved in an environment where environmental clutter and the target are highly similar, with little influence from clutter and good target detection performance.

[0092] Step 106, according to the emission sequence set parameters, the emission sequence set optimization model is transformed by convex approximation, and then continuous convex approximation acceleration solution is performed until a preset iteration stop condition is reached, and the current optimization solution is output.

[0093] The optimized solution is used to design the MIMO radar transmit sequence set.

[0094] Since the objective function in the problem model (22) is a non-convex quartic function, the spatial domain and constant modulus constraints are also non-convex, and the non-convex quartic function objective and non-convex constraints will make the solution process need to deal with complex function forms, increase the computational complexity, and it is difficult to ensure convergence to the global optimal solution. The method of the present invention first performs a convex approximation transformation on the problem model and then performs a continuous convex approximation accelerated solution. The convergence speed of the continuous convex approximation algorithm mainly depends on the expression of the upper bound function. The present invention introduces the CBB (Cauchy-Brazilai-Borwein) method and combines the classic steepest descent method and the two-part gradient method to propose a new acceleration algorithm, which can effectively solve the problem of indeterminate point iterative update and significantly improve the solution efficiency and convergence speed. The experimental results also verify that the optimization solution has good performance. The method of the present invention can improve the effectiveness of the MIMO radar transmission sequence set.

[0095] In the above-mentioned MIMO radar transmission sequence set optimization method, by taking minimizing the side lobes of non-periodic autocorrelation and cross-correlation functions in the range-Doppler domain interval as the optimization goal, respectively constructing constraints in the spatial domain and the frequency domain, and applying constant modulus constraints, it can ensure that the transmission sequence covers the target area and avoids the clutter area to avoid clutter interference, and optimize power efficiency. Based on this, a transmission sequence set optimization model is constructed, and the problem model is optimized and solved using the acquired transmission sequence set parameters and the solution algorithm, so that the optimized solution has good performance in the spatial domain, the frequency domain and the range-Doppler domain. When solving, specifically, the transmission sequence set optimization model is transformed by convex approximation and then continuously convex approximation is performed to accelerate the solution, which can improve the optimization efficiency and output a reliable MIMO radar transmission sequence set. The embodiment of the present invention can improve the target detection performance of the MIMO radar transmission sequence set in an environment where environmental clutter and the target are highly similar.

[0096] In one embodiment, after the convex approximation is transformed into the transmission sequence set optimization model, continuous convex approximation is performed to accelerate the solution until a preset iteration stop condition is reached, and the current optimization solution is output, including: performing a convex approximation on the objective function of the transmission sequence set optimization model to obtain an upper bound quadratic function, converting the spatial domain transmission beam pattern constraint and the constant modulus constraint into a convex form, and then using slack variables to make the current transmission sequence set optimization model equivalent to a non-convex optimization model; using the interior point method to solve the non-convex optimization model to obtain an initial solution, and using the initial solution to perform continuous convex approximation to accelerate the solution until a preset iteration stop condition is reached, and then the current optimization solution is output.

[0097] Specifically, the convex approximation is converted into a continuous convex approximation algorithm to provide an initial solution. The process of accelerating the initialization of the continuous convex approximation algorithm includes:

[0098] The objective function in the problem model (22) can be simplified to the following expression:

[0099] (twenty three)

[0100] in , ignoring the constant term in equation (23), and setting , then the objective function can be further expressed as:

[0101] (twenty four)

[0102] in

[0103] (25)

[0104] Simplifying formula (24) we get

[0105] (26)

[0106] in,

[0107] (27)

[0108] By performing convex approximation on equation (26), we can obtain its upper bound function as follows:

[0109] (28)

[0110] in For the The solution of the cycle, so the second and third terms of equation (28) are constants and have nothing to do with the variables to be optimized. The convex approximate upper bound function after ignoring the constant term is:

[0111] (29)

[0112] Further simplifying formula (29), it can be written as:

[0113] (30)

[0114] in

[0115] (31)

[0116] (32)

[0117] (33)

[0118] (34)

[0119] From equations (31) and (32), we can see that the matrix and are all Hermitian matrices, so the real part operation in equation (30) can be ignored.

[0120] (35)

[0121] It can be seen that the original objective function is convexly approximated as a quadratic function as shown in (35), and it can be proved that the matrix is a Hermitian matrix. To ensure the semi-positive definiteness of the Hermitian matrix, a diagonal loading method is used.

[0122] (36)

[0123] in

[0124] (37)

[0125] For the matrix The lower bound of the minimum eigenvalue. The objective function in is convexly approximated as a semi-positive quadratic function,

[0126] (38)

[0127] Secondly, the spatial constraints are transformed. Introducing optimization variables , the first spatial constraint can be transformed into:

[0128] (39)

[0129] in The second spatial constraint can be transformed into:

[0130] (40)

[0131] Formula (39) and Formula (40) are both non-convex fractional forms, which can be converted into polynomial convex function forms:

[0132] (41)

[0133] (42)

[0134] (43)

[0135] To this question The spatial constraints in are transformed into a convex form:

[0136] (44)

[0137] By introducing the variables to be optimized , the problem The constant modulus constraint in is transformed into a convex form,

[0138] (45)

[0139] Observation Problem Model It can be seen that for the variables to be optimized and , only the last constraint is non-convex.

[0140] By introducing slack variables and , and construct a new matrix , the problem model Converts to the following equivalent form:

[0141] (46)

[0142] in is the penalty factor of the constant modulus constraint. The problem can be solved by iteration , alternately optimize each variable and finally achieve constant modulus constraint,

[0143] (47)

[0144] For this variable The result of the iterations, For this variable The objective function and constraints of this problem are now all transformed into convex forms and can be solved using the interior point method.

[0145] When the number of iterations When ignoring the problem model Included in The constraints of the results are solved and used as the initial solution of the continuous convex approximation algorithm. Finally, the eigenvalue decomposition method is used to find the relaxation variables and , so that it satisfies the constraints . The matrix Perform eigenvalue decomposition and obtain the eigenvalue , and its corresponding eigenvector is , then the slack variable

[0146] (48)

[0147] (49)

[0148] Update iterations .

[0149] In one embodiment, the initial solution is used to perform continuous convex approximation accelerated solution until a preset iteration stop condition is reached, and the current optimized solution is outputted, including: using the square iteration algorithm and the initial solution to accelerate the solution of the non-convex optimization model to obtain the optimized solution, and in each iteration, updating the current relaxation variables; projecting the optimized solution into the solution space that satisfies the constraint conditions to obtain the projected solution; determining whether the projected solution satisfies the monotonic convergence of the objective function, and if not, changing the iteration step size and repeating the above steps.

[0150] Specifically, the process of using the initial solution to perform continuous convex approximation to accelerate the solution includes:

[0151] The optimization problem after convex approximation is solved by using the square iteration algorithm. In the first iteration, the interior point method is used to solve the problem model. , and get the optimized solution , and update the slack variables according to equations (48) and (49) .Will Substitute the problem model again In this paper, the interior point method is used to obtain the optimal solution , and update the slack variables according to equations (48) and (49) .

[0152] According to the two optimization solutions, the acceleration step length is calculated using the following formula

[0153] (50)

[0154] (51)

[0155] (52)

[0156] Then update the optimized solution to:

[0157] (53)

[0158] In one embodiment, the optimized solution is projected into a solution space satisfying the constraint conditions, and obtaining the projected solution includes: using a projection function to project the optimized solution into a solution space satisfying the constraint conditions to obtain a new non-convex optimization model, and using an interior point method to iteratively solve the new non-convex optimization model until the convergence conditions of the interior point method are met, then the iteration is stopped and the projected solution is output.

[0159] Specifically, since the optimal solution of the square iteration acceleration algorithm does not necessarily satisfy the problem model constraints, so it is necessary to use the projection function to project it into the solution space that satisfies the constraints.

[0160] (54)

[0161] Using interior point method to iterate and solve the problem model , until the convergence condition is reached:

[0162] (55)

[0163] is a constant, which indicates the error tolerance for judging whether the projected solution meets the convergence condition. After the convergence condition is met, the optimal solution after the acceleration algorithm is projected to the solution space is obtained. .

[0164] Next, determine whether the projection solution satisfies the monotonic convergence of the objective function and transform the problem model The objective function in is expressed as:

[0165] (56)

[0166] like , then let , and update the slack variables according to equations (48) and (49) Otherwise, update the step size , and use formula (53) to recalculate and update the optimal solution , and then use the interior point method to iteratively solve the problem model , until the convergence condition is reached.

[0167] In one embodiment, the initial solution is used to perform continuous convex approximation accelerated solution until a preset iteration stop condition is reached, and outputting the current optimization solution also includes: if the projection solution satisfies the monotonic convergence of the objective function, determining whether the continuous convex approximation algorithm has reached convergence, if the continuous convex approximation algorithm has reached convergence, outputting the current optimization solution, otherwise, repeating the above steps.

[0168] Specifically, the process of judging whether the continuous convex approximation algorithm has reached convergence includes:

[0169] Construct the matrix Perform eigenvalue decomposition and obtain the eigenvalue , then the convergence condition 1 is:

[0170] (57)

[0171] Convergence condition 2 is:

[0172] (58)

[0173] If both convergence conditions are met at the same time, the optimization sequence set results are output Otherwise, repeat the steps of continuous convex approximation to accelerate the solution, solution space projection, and judging whether the projection solution satisfies the monotonic convergence of the objective function until the algorithm converges.

[0174] In one embodiment, the spatial transmission beam pattern constraint includes a first constraint and a second constraint; the first constraint includes minimizing the spatial integrated sidelobe ratio; the spatial integrated sidelobe ratio is the ratio of the sum of the transmission power of all points in the sidelobe area to the sum of the transmission power of all points in the target area; the second constraint includes ensuring that the energy of the transmission beam pattern at the desired angle is at least half of the maximum energy.

[0175] In one embodiment, the frequency domain constraint of the transmit sequence set includes the expectation that the spectrum of the transmit sequence to be optimized of each channel is close to the corresponding optimal energy spectrum.

[0176] In one embodiment, the step of obtaining the optimal energy spectrum of the transmit sequence to be optimized for each channel includes: maximizing the signal-to-interference-noise ratio of the output signal according to the frequency response and clutter power spectrum of the target to obtain the optimal energy spectrum of the transmit sequence for each channel.

[0177] In a specific embodiment, the method of the present invention comprises the following steps:

[0178] Step 1: Determine the optimization problem parameters: According to the clutter suppression and target detection requirements of the MIMO radar system, determine the angle range of the target and strong clutter in the airspace, the frequency response of the target and the clutter power spectrum, as well as the distance range and speed range where the target may appear;

[0179] Step 2: Solve the optimal energy spectrum of the transmission sequence of each channel: Use the water injection method to solve the optimal transmission waveform energy spectrum of each channel;

[0180] Step 3: Optimization problem modeling: Take the MIMO radar transmission sequence set as the optimization variable, and minimize the side lobes of the non-periodic autocorrelation function of each transmission sequence to be optimized in a specific distance-Doppler interval as the objective function. At the same time, take the angular energy ratio of the target and clutter in the transmission pattern of the sequence set to be optimized, the minimum mean square error between the waveform spectrum of the sequence set to be optimized and the ideal spectrum, and the constant modulus constraint as constraints to construct a non-convex optimization model;

[0181] Step 4: Solving the optimization problem: The problem model is transformed into a convex approximation, and the accelerated continuous convex approximation algorithm is used to iteratively solve the non-convex optimization model to obtain the MIMO radar transmission sequence set, which specifically includes the following steps:

[0182] Step 4-1: Initialization: Perform a convex approximation on the original problem's quartic non-convex objective function to obtain the upper bound quadratic function. At the same time, by ignoring some constraints and introducing slack variables, the constraints are transformed into their convex form. At this point, the optimization problem is transformed into a convex problem. The interior point method is used to solve the convex problem, update the emission sequence set, and finally use eigenvalue decomposition to update the slack variables;

[0183] Step 4-2: Accelerated solution by continuous convex approximation: The optimization problem after convex approximation is accelerated by using the square iteration algorithm, and the slack variables are updated by eigenvalue decomposition;

[0184] Step 4-3: Solution space projection: Project the solution obtained after the square iteration algorithm is accelerated into the solution space that satisfies the constraints, and update the slack variables through eigenvalue decomposition;

[0185] Step 4-4: Determine whether the projection solution satisfies the monotonic convergence of the objective function: If so, proceed to step 4-5; otherwise, change the iteration step size and repeat steps 4-2 and 4-3 until the monotonic convergence of the objective function is satisfied.

[0186] Step 4-5: Determine whether the algorithm has reached convergence. If so, output the optimized sequence set results. Otherwise, repeat steps 4-2, 4-3, and 4-4 until the algorithm reaches convergence.

[0187] The specific implementation process of the above steps has been described in the previous text and will not be repeated here. The following numerical simulation experiment further illustrates the beneficial effects of the method of the present invention:

[0188] Determine the optimization problem parameters: Follow step 1 to determine the number of radar system transmission signal channels ,bandwidth , phase encoding code length , carrier frequency , the normalized distance interval in which the target may appear is , the possible normalized Doppler frequency range is The possible angles at which the target may appear in the airspace are , the angle at which clutter may appear in the airspace is The frequency response of the target within the radar working bandwidth is a full 1 vector. The power spectrum curve of the environmental clutter within the radar bandwidth is shown in the figure below. Figure 2 As shown in the figure, it can be seen that in the negative frequency part, the clutter power spectrum energy is higher. The schematic diagram of the optimal transmission waveform energy spectrum of each channel obtained by the water injection method is shown in Figure 3 As shown, the ideal energy spectrum has higher energy at positive frequencies, which is opposite to the trend of clutter energy distribution. Figure 4 This is a schematic diagram of the emission direction of the optimized solution. The emission energy is concentrated between 30 and 40 degrees, which is consistent with the angle of the target. Figures 5 to 8Schematic diagram of self-ambiguity function and mutual ambiguity function between different emission sequence pairs. Figure 5 and Figure 8 The following are the schematic diagrams of the autocorrelation ambiguity function between the transmission sequence pair (1, 1) and the transmission sequence pair (2, 2). Figure 6 and Figure 7 Figure 3 is a schematic diagram of the cross-correlation ambiguity function between the transmit sequence pair (1, 2) and the transmit sequence pair (2, 1). It can be seen that the ambiguity function diagram has a lower sidelobe in the range-Doppler unit of interest and a higher peak at the target location, which proves the higher performance of the transmit sequence set designed by the proposed algorithm in the range-Doppler domain. Fig. 9 This is a schematic diagram comparing the spectra of different emission sequences with the expected spectra. Between the two-channel emission signal spectra and the ideal spectra, the two-channel spectra have higher energy in the normalized positive frequency interval, which is consistent with the trend of the ideal spectrum, proving the effectiveness of the proposed algorithm in the frequency domain.

[0189] It should be understood that although Figure 1 The steps in the flowchart are shown in sequence as indicated by the arrows, but these steps are not necessarily executed in the order indicated by the arrows. Unless otherwise specified in this document, there is no strict order restriction for the execution of these steps, and these steps can be executed in other orders. Moreover, Figure 1 At least part of the steps may include multiple sub-steps or multiple stages. These sub-steps or stages are not necessarily executed at the same time, but can be executed at different times. The execution order of these sub-steps or stages is not necessarily sequential, but can be executed in turn or alternately with other steps or at least part of the sub-steps or stages of other steps.

[0190] In one embodiment, Fig.10 As shown, a MIMO radar transmission sequence set optimization device is provided, comprising:

[0191] The parameter acquisition module 1002 is used to acquire the transmission sequence set parameters, which include the angle range of the target and clutter in the airspace, the normalized distance interval and normalized Doppler frequency interval where the target may appear, and the optimal energy spectrum of the transmission sequence to be optimized for each channel;

[0192] The model building module 1004 is used to build a transmission sequence set optimization model; the objective function of the transmission sequence set optimization model includes minimizing the non-periodic autocorrelation and cross-correlation function side lobes in the range-Doppler domain interval, and the constraints of the transmission sequence set optimization model include spatial domain transmission beam pattern constraints, transmission sequence set frequency domain constraints and constant modulus constraints;

[0193] The result output module 1006 is used to perform continuous convex approximation accelerated solution after convexly transforming the transmit sequence set optimization model according to the transmit sequence set parameters until a preset iteration stop condition is reached, and then output the current optimization solution; the optimization solution is used to design the MIMO radar transmit sequence set.

[0194] In one of the embodiments, it is also used to perform a convex approximation on the objective function of the transmission sequence set optimization model to obtain an upper bound quadratic function, convert the spatial transmission beam pattern constraint and the constant modulus constraint into a convex form, and then use slack variables to convert the current transmission sequence set optimization model into a non-convex optimization model; use the interior point method to solve the non-convex optimization model to obtain an initial solution, and use the initial solution to perform continuous convex approximation to accelerate the solution until a preset iteration stop condition is reached, and then output the current optimization solution.

[0195] In one of the embodiments, it is also used to accelerate the solution of a non-convex optimization model using a square iteration algorithm and an initial solution to obtain an optimized solution. In each iteration, the current slack variables are updated; the optimized solution is projected into a solution space that satisfies the constraints to obtain a projected solution; and it is determined whether the projected solution satisfies the monotonic convergence of the objective function. If not, the iteration step size is changed and the above steps are repeated.

[0196] In one of the embodiments, the method is also used to use a projection function to project the optimization solution into a solution space that satisfies the constraint conditions to obtain a new non-convex optimization model, and use the interior point method to iteratively solve the new non-convex optimization model until the convergence conditions of the interior point method are met, then stop the iteration and output the projected solution.

[0197] In one of the embodiments, if the projection solution satisfies the monotonic convergence of the objective function, it is also used to determine whether the continuous convex approximation algorithm has reached convergence. If the continuous convex approximation algorithm has reached convergence, the current optimization solution is output, otherwise, the above steps are repeated.

[0198] In one of the embodiments, the spatial domain transmit beam pattern constraint includes a first constraint and a second constraint; the first constraint includes minimizing the spatial domain integrated sidelobe ratio; the spatial domain integrated sidelobe ratio is the ratio of the sum of the transmit powers of all points in the sidelobe area to the sum of the transmit powers of all points in the target area; the second constraint includes ensuring that the energy of the transmit beam pattern at the desired angle is at least half of the maximum energy.

[0199] In one of the embodiments, the frequency domain constraint for the transmit sequence set includes the expectation that the spectrum of the transmit sequence to be optimized for each channel is close to the corresponding optimal energy spectrum.

[0200] In one of the embodiments, it is also used to maximize the signal-to-interference-noise ratio of the output signal according to the frequency response and clutter power spectrum of the target, and obtain the optimal energy spectrum of the transmission sequence of each channel.

[0201] For the specific definition of the MIMO radar transmit sequence set optimization device, please refer to the definition of the MIMO radar transmit sequence set optimization method above, which will not be repeated here. Each module in the above-mentioned MIMO radar transmit sequence set optimization device can be implemented in whole or in part by software, hardware and a combination thereof. The above-mentioned modules can be embedded in or independent of the processor in the computer device in the form of hardware, or can be stored in the memory of the computer device in the form of software, so that the processor can call and execute the operations corresponding to the above modules.

[0202] In one embodiment, a computer device is provided. The computer device may be a terminal, and its internal structure diagram may be as follows: Fig.11 As shown. The computer device includes a processor, a memory, a network interface, a display screen and an input device connected through a system bus. Among them, the processor of the computer device is used to provide computing and control capabilities. The memory of the computer device includes a non-volatile storage medium and an internal memory. The non-volatile storage medium stores an operating system and a computer program. The internal memory provides an environment for the operation of the operating system and the computer program in the non-volatile storage medium. The network interface of the computer device is used to communicate with an external terminal through a network connection. When the computer program is executed by the processor, a MIMO radar transmission sequence set optimization method is implemented. The display screen of the computer device can be a liquid crystal display screen or an electronic ink display screen, and the input device of the computer device can be a touch layer covered on the display screen, or a key, trackball or touchpad set on the computer device housing, or an external keyboard, touchpad or mouse, etc.

[0203] Those skilled in the art will understand that Fig.11 The structure shown in the figure is only a block diagram of a part of the structure related to the solution of the present invention, and does not constitute a limitation on the computer device to which the solution of the present invention is applied. The specific computer device may include more or fewer components than those shown in the figure, or combine certain components, or have a different arrangement of components.

[0204] In one embodiment, a computer device is provided, including a memory and a processor, wherein the memory stores a computer program, and the processor implements the steps of the method in the above embodiment when executing the computer program.

[0205] The technical features of the above embodiments may be combined arbitrarily. To make the description concise, not all possible combinations of the technical features in the above embodiments are described. However, as long as there is no contradiction in the combination of these technical features, they should be considered to be within the scope of this specification.

[0206] The above-mentioned embodiments only express several implementation modes of the present invention, and the description thereof is relatively specific and detailed, but it cannot be understood as limiting the scope of the invention. It should be pointed out that, for a person of ordinary skill in the art, several modifications and improvements can be made without departing from the concept of the present invention, and these all belong to the protection scope of the present invention. Therefore, the protection scope of the present invention shall be subject to the attached claims.

Claims

1. A MIMO radar transmission sequence set optimization method, characterized in that: The method comprises: Acquire transmission sequence set parameters; the transmission sequence set parameters include the angle range of the target and clutter in the airspace, the normalized distance interval and normalized Doppler frequency interval where the target may appear, and the optimal energy spectrum of the transmission sequence to be optimized for each channel; Constructing a transmission sequence set optimization model; the objective function of the transmission sequence set optimization model includes minimizing the side lobes of the non-periodic autocorrelation and cross-correlation functions in the range-Doppler domain interval, and the constraints of the transmission sequence set optimization model include spatial domain transmission beam pattern constraints, transmission sequence set frequency domain constraints and constant modulus constraints; According to the transmission sequence set parameters, the transmission sequence set optimization model is transformed by convex approximation and then solved by continuous convex approximation acceleration until a preset iteration stop condition is reached, and the current optimization solution is output; the optimization solution is used to design the MIMO radar transmission sequence set; After the emission sequence set optimization model is transformed by convex approximation, continuous convex approximation acceleration is performed until a preset iteration stop condition is reached, and the current optimization solution is outputted, including: Perform a convex approximation on the objective function of the transmit sequence set optimization model to obtain an upper bound quadratic function, convert the spatial transmit beam pattern constraint and the constant modulus constraint into a convex form, and then use slack variables to convert the current transmit sequence set optimization model into a convex optimization model; The convex optimization model is solved by using the interior point method to obtain an initial solution, and the initial solution is used to perform continuous convex approximation acceleration until a preset iteration stop condition is reached, and the current optimization solution is output; The initial solution is used to perform continuous convex approximation to accelerate the solution until the preset iteration stop condition is reached. The current optimization solution is output including: The convex optimization model is solved by accelerating the square iteration algorithm and the initial solution to obtain an optimized solution, and the current relaxation variable is updated in each iteration; Project the optimized solution into the solution space that satisfies the constraints to obtain the projected solution; Determine whether the projection solution satisfies the monotonic convergence of the objective function. If not, change the iteration step size and repeat the above steps. Project the optimized solution into the solution space that satisfies the constraints, and the projected solution includes: The projection function is used to project the optimization solution into the solution space that satisfies the constraints to obtain a new convex optimization model. The interior point method is used to iteratively solve the new convex optimization model until the convergence condition of the interior point method is met. The iteration is stopped and the projection solution is output.

2. The method according to claim 1, characterized in that: The initial solution is used to perform continuous convex approximation to accelerate the solution until the preset iteration stop condition is reached. The output of the current optimization solution also includes: If the projection solution satisfies the monotonic convergence of the objective function, it is determined whether the continuous convex approximation algorithm has reached convergence. If the continuous convex approximation algorithm has reached convergence, the current optimization solution is output, otherwise, the above steps are repeated.

3. The method according to claim 1, characterized in that The spatial transmission beam pattern constraint includes a first constraint and a second constraint; The first constraint includes minimizing the spatial domain integrated sidelobe ratio; the spatial domain integrated sidelobe ratio is the ratio of the sum of the transmit power of all points in the sidelobe area to the sum of the transmit power of all points in the target area; The second constraint includes ensuring that the energy of the transmit beam pattern at the desired angle is at least half of the maximum energy.

4. The method according to claim 1, characterized in that: The frequency domain constraint of the transmit sequence set includes the expectation that the spectrum of the transmit sequence to be optimized of each channel is close to the corresponding optimal energy spectrum.

5. The method according to claim 1, characterized in that: The step of obtaining the optimal energy spectrum of the transmit sequence to be optimized for each channel includes: According to the target's frequency response and clutter power spectrum, the output signal signal-to-interference-noise ratio is maximized to obtain the optimal energy spectrum of each channel's transmission sequence.

6. A MIMO radar transmission sequence set optimization device, characterized in that: The device comprises: A parameter acquisition module is used to acquire transmission sequence set parameters, wherein the transmission sequence set parameters include the angle range of the target and clutter in the airspace, the normalized distance interval and normalized Doppler frequency interval where the target may appear, and the optimal energy spectrum of the transmission sequence to be optimized for each channel; A model building module is used to build a transmission sequence set optimization model; the objective function of the transmission sequence set optimization model includes minimizing the non-periodic autocorrelation and cross-correlation function sidelobes in the range-Doppler domain interval, and the constraints of the transmission sequence set optimization model include spatial domain transmission beam pattern constraints, transmission sequence set frequency domain constraints and constant modulus constraints; A result output module is used to perform continuous convex approximation accelerated solution after convexly converting the optimization model of the emission sequence set according to the emission sequence set parameters, until a preset iteration stop condition is reached, and then output the current optimization solution; the optimization solution is used to design the MIMO radar emission sequence set; The result output module is also used to perform a convex approximation on the objective function of the transmission sequence set optimization model to obtain an upper bound quadratic function, convert the spatial transmission beam pattern constraint and the constant modulus constraint into a convex form, and then use the slack variables to make the current transmission sequence set optimization model equivalent to a convex optimization model; use the interior point method to solve the convex optimization model to obtain an initial solution, use the initial solution to perform continuous convex approximation to accelerate the solution, and output the current optimization solution when a preset iteration stop condition is reached; The result output module is also used to accelerate the solution of the convex optimization model by using the square iteration algorithm and the initial solution to obtain the optimized solution. In each iteration, the current relaxation variable is updated; the optimized solution is projected into the solution space that satisfies the constraint conditions to obtain the projected solution; it is determined whether the projected solution satisfies the monotonic convergence of the objective function. If not, the iteration step size is changed and the above steps are repeated; The result output module is also used to use the projection function to project the optimization solution into the solution space that satisfies the constraint conditions, obtain a new convex optimization model, and use the interior point method to iteratively solve the new convex optimization model until the convergence conditions of the interior point method are met, then stop the iteration and output the projected solution.

7. A computer device comprising a memory and a processor, wherein the memory stores a computer program, characterized in that: When the processor executes the computer program, the steps of the method according to any one of claims 1 to 5 are implemented.

Citation Information

Patent Citations

  • Steady transmitting and receiving joint optimization method for airborne MIMO radar under constant modulus constraint

    CN111856410A

  • MIMO-STAP radar transmit-receive space-time resource configuration method in clutter scene

    CN113702961A

  • MIMO radar orthogonal sparse frequency waveform sequence set design method based on CCM algorithm

    CN116400301A

  • MIMO radar transmitted waveform design method under similarity and variable modulus constraints

    CN116908786A

  • Space-frequency domain radar communication integrated design method, terminal equipment and storage medium

    CN116990797A