CN117272809A - Optimal arrangement method of non-uniform linear array for direction finding - Google Patents

Optimal arrangement method of non-uniform linear array for direction finding Download PDF

Info

Publication number
CN117272809A
CN117272809A CN202311239952.4A CN202311239952A CN117272809A CN 117272809 A CN117272809 A CN 117272809A CN 202311239952 A CN202311239952 A CN 202311239952A CN 117272809 A CN117272809 A CN 117272809A
Authority
CN
China
Prior art keywords
optimal
array
quantum
arrangement
initial
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Pending
Application number
CN202311239952.4A
Other languages
Chinese (zh)
Inventor
郑雅晴
高洪元
乔玉龙
陈暄
刘马均
孙可歆
黄飞扬
杜子怡
刘凯龙
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Harbin Engineering University
Original Assignee
Harbin Engineering University
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Harbin Engineering University filed Critical Harbin Engineering University
Priority to CN202311239952.4A priority Critical patent/CN117272809A/en
Publication of CN117272809A publication Critical patent/CN117272809A/en
Pending legal-status Critical Current

Links

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F30/00—Computer-aided design [CAD]
    • G06F30/20—Design optimisation, verification or simulation
    • G06F30/27—Design optimisation, verification or simulation using machine learning, e.g. artificial intelligence, neural networks, support vector machines [SVM] or training a model
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F30/00—Computer-aided design [CAD]
    • G06F30/10—Geometric CAD
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06N—COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS
    • G06N3/00—Computing arrangements based on biological models
    • G06N3/004—Artificial life, i.e. computing arrangements simulating life
    • G06N3/006—Artificial life, i.e. computing arrangements simulating life based on simulated virtual individual or collective life forms, e.g. social simulations or particle swarm optimisation [PSO]

Landscapes

  • Engineering & Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • Theoretical Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Evolutionary Computation (AREA)
  • Geometry (AREA)
  • General Engineering & Computer Science (AREA)
  • Artificial Intelligence (AREA)
  • Software Systems (AREA)
  • Computer Hardware Design (AREA)
  • Computational Mathematics (AREA)
  • Biophysics (AREA)
  • Computer Vision & Pattern Recognition (AREA)
  • Mathematical Analysis (AREA)
  • Mathematical Optimization (AREA)
  • Pure & Applied Mathematics (AREA)
  • Health & Medical Sciences (AREA)
  • Life Sciences & Earth Sciences (AREA)
  • Biomedical Technology (AREA)
  • Medical Informatics (AREA)
  • Computational Linguistics (AREA)
  • Data Mining & Analysis (AREA)
  • General Health & Medical Sciences (AREA)
  • Molecular Biology (AREA)
  • Computing Systems (AREA)
  • Mathematical Physics (AREA)
  • Variable-Direction Aerials And Aerial Arrays (AREA)

Abstract

The invention discloses an optimal arrangement method of a non-uniform linear array for direction finding, which comprises the following steps: generating initial quantum particle positions, initial quantum particle speeds and initial local optimal positions based on a preset array optimal arrangement model; constructing a first fitness function based on a minimum interval criterion and a minimum maximum relative side lobe level based on a preset array optimal arrangement model; acquiring an initial global optimal position of the quantum particles based on the first fitness function; updating the speed and the position of the quantum particles based on the initial local optimal position and the initial global optimal position to obtain the global optimal position; and obtaining an optimal array arrangement result based on the global optimal position. The invention designs an optimal special array arrangement method based on a minimum interval criterion and a minimum maximum relative sidelobe level, and the optimal array arrangement mode is searched by utilizing a discrete quantum particle group, so that the high-precision direction finding of the optimal array arrangement under specific conditions and requirements is realized.

Description

Optimal arrangement method of non-uniform linear array for direction finding
Technical Field
The invention belongs to the technical field of array signal processing, and particularly relates to an optimal arrangement method of a non-uniform linear array for direction finding.
Background
The array antenna is not simply arranged at the position of the antenna, but arranged and combined at the position of the antenna according to a specific rule, so that an antenna system is formed. Among them, the graph describing the amplitude characteristic of the array antenna system and the spatial scan angle is called a pattern. In practical engineering application, the control of the directional diagram of the array antenna is realized by reasonably arranging different parameters such as the array element placement position of the antenna, the distribution form of the array antenna, the excitation amplitude and the phase of the array element and the like. The position construction problem of the array antenna in actual engineering is solved based on the method.
According to the direction diagram, when the scanning angle is the same as the incoming wave direction angle, the direction diagram has obvious main lobes, but side lobes appear at other scanning angles, the side lobes influence the accuracy of incoming wave direction estimation, and when the side lobes are lower relative to the main lobe level, the side lobes cause less interference to direction finding accuracy.
In addition, the array element arrangement rules of the existing three special arrays, namely the minimum redundant array, the maximum continuous delay array and the minimum gap array can bring inspiration to the optimal array arrangement under specific limitation. The minimum redundant array means that the position difference set of the array elements is fully extendedAnd the set of position differences is a continuous natural number, i.e. there are no spaces in the set of position differences. The maximum continuous delay array means that the position difference among the array elements of the whole array satisfies the maximum continuous delay number N max . Maximum number of consecutive delays of array N max Assuming that there is a position difference between each real array element of the whole array, the position difference can be written as a range from 0 to N max But for array element position differences greater than N max May not be continuous. The minimum gap array is that a certain number is allowed to be lost for a set formed by position differences among array elements, but the number of the lost positions is minimum, and the position differences in the front group and the rear group of the lost positions are required to be continuous. Combining the three array element arrangement rules of the existing classical special array, the current array element position difference set tau can be obtained ij The smaller the number of intervals, the more the direction-finding capability of the array is often improved, and the larger-degree expansion of the array aperture is realized, namely, a large antenna is simulated by using an array formed by a plurality of small antennas, so that the size of the receiving antenna is effectively increased.
In the prior art, a new method is provided for reducing side lobes by a large-scale plane array sparse optimization technical review published in space electronic technology by Zhang Ming et al, but the problem of selecting optimal special array arrangement under the constraint condition cannot be solved. Most of the existing problems are not designed for array arrangement with certain constraint conditions such as forbidden array elements. In order to solve the problem, the invention designs an optimal special array arrangement method based on a minimum interval criterion and a minimum maximum relative side lobe level, and the optimal array arrangement mode is searched by utilizing a discrete quantum particle group, so that the high-precision direction finding of the optimal array arrangement under specific conditions and requirements is realized.
Disclosure of Invention
In order to solve the technical problems, the invention provides an optimal arrangement method of a non-uniform linear array for direction finding, and the designed method can be used as a new method for carrying out a special non-uniform linear array arrangement mode for high-precision direction finding on a target under the specific constraint conditions of a maximum relevant delay range, the number of existing real array elements, the forbidden array element positions and the like, meets the requirement of limiting the specific position, and can realize the high-precision direction finding of expanding array aperture.
In order to achieve the above object, the present invention provides an optimal arrangement method of a non-uniform linear array for direction finding, including:
generating initial quantum particle positions, initial quantum particle speeds and initial local optimal positions based on a preset array optimal arrangement model;
constructing a first fitness function based on a minimum interval criterion and a minimum maximum relative side lobe level based on the preset array optimal arrangement model;
acquiring an initial global optimal position of the quantum particles based on the first fitness function;
updating the speed and the position of the quantum particles based on the initial local optimal position and the initial global optimal position to obtain a global optimal position;
and acquiring an optimal array arrangement result based on the global optimal position.
Optionally, generating the initial quantum particle location, velocity, and initial local optimum location comprises:
and constructing the preset array optimal arrangement model based on a minimum clearance criterion and a minimum maximum relative side lobe level, and determining parameters of a quantum particle swarm search mechanism corresponding to the preset array optimal arrangement model to generate the initial position, speed and local optimal position of the quantum particles.
Optionally, obtaining the initial global optimal position of the quantum particle comprises:
and carrying the position of the quantum particle into the first fitness function, obtaining the fitness function of the quantum particle, evaluating the fitness function of the quantum particle, and obtaining the initial global optimal position.
Optionally, updating the velocity and position of the quantum particles includes:
updating the speed of the quantum particles based on the initial local optimal position and the initial global optimal position;
the position is updated based on the updated velocity of the quantum particles.
Optionally, obtaining the global optimal position includes:
calculating an fitness value corresponding to the new position of the updated quantum particle, updating the local optimal position of the quantum particle, and obtaining the updated global optimal position;
judging whether the update of the quantum particles reaches the preset maximum iteration times, if not, continuously updating the speed and the position of the quantum particles, if so, terminating the cycle, and outputting the global optimal position at the moment.
Optionally, obtaining the optimal array arrangement result includes:
and comparing and evaluating the direction finding accuracy of the array arrangement corresponding to the global optimal position with the direction finding accuracy of the uniform linear array arrangement with the same array element number, if the direction finding accuracy of the corresponding array arrangement is lower than that of the uniform linear array with the same array element number, namely, the root mean square error is large, judging that the array arrangement is invalid, randomly changing the maximum delay number within a set range at the moment, reconstructing a first fitness function based on a minimum interval criterion and the minimum maximum relative sidelobe level, and otherwise, regarding the corresponding array arrangement as the optimal array arrangement result.
Optionally, the first fitness function is:
wherein f 0 For the proportioning constant, q is the interval number, a is the weight constant,is a proportional coefficient->Is t th generation->And quantum particle positions.
Optionally, obtaining the updated global optimal position includes:
mapping the updated new position of each quantum particle into preset special array arrangement, acquiring the maximum relative sidelobe level corresponding to the preset special array arrangement, and acquiring the adaptability of the new position of each quantum particle based on the minimum interval criterion and the minimum maximum relative sidelobe level and the adaptability of the corresponding special array, wherein the nth quantum particle is updated into the (t+1) th generation by using the optimal quantum particle which is subjected to the (t+1) th generationLocal optimum position of individual quantum particles-> At the same time find the global optimum position for the whole population of particles up to the t+1st generation +.>
Compared with the prior art, the invention has the following advantages and technical effects:
(1) The invention realizes the direction finding estimation of more incoming wave directions by using fewer real array elements, and can realize the high-precision direction of arrival estimation of the expanded array aperture.
(2) Compared with the traditional special array construction method, the method can utilize the advantages of quantum theory and discrete particle swarm search mechanism to aim at the situation that the number of the existing real array elements, the maximum delay range and the forbidden array element position are known and fixed, and still can obtain the optimal special array arrangement mode meeting the conditions, thereby proving the universality of the method.
(3) Simulation results prove that the optimal special array arrangement designed by the invention based on the minimum interval criterion and the minimum maximum relative side lobe level has higher direction finding precision compared with other special array arrangements, improves the convergence precision and the convergence speed of an algorithm, and illustrates the effectiveness of the optimal special array construction method based on the extracted discrete quantum particle search mechanism.
Drawings
The accompanying drawings, which are included to provide a further understanding of the application, illustrate and explain the application and are not to be construed as limiting the application. In the drawings:
FIG. 1 is a schematic diagram of an optimal arrangement method of a non-uniform linear array for direction finding according to an embodiment of the present invention;
FIG. 2 is a given example of the inventionN＝10，b＝[3,4,5,6,7]In the time of 5 information sources, the change curve schematic diagram of the success probability of the direction finding estimation of different array element arrangements along with the generalized signal to noise ratio;
FIG. 3 is a given example of the inventionN＝10，b＝[3,4,5,6,7]When the method is used, a schematic diagram of a change curve of the success probability of direction finding estimation of different array element arrangements of the 11 information sources along with generalized signal to noise ratio is provided;
FIG. 4 is a given example of the inventionN＝15，b＝[3,7,9,24,36,42]In the time of 5 information sources, the change curve schematic diagram of the success probability of the direction finding estimation of different array element arrangements along with the generalized signal to noise ratio;
FIG. 5 is a given example of the inventionN＝15，b＝[3,7,9,24,36,42]When the method is used, a schematic diagram of a change curve of the success probability of direction finding estimation of different array element arrangements of the 11 information sources along with generalized signal to noise ratio is provided;
FIG. 6 is a given example of the inventionN＝10，b＝[3,4,5,6,7]When the method is used, the optimal array arrangement pattern is obtained;
FIG. 7 is a given example of the inventionN＝15，b＝[3,7,9,24,36,42]And obtaining an optimal array arrangement directional diagram.
Detailed Description
It should be noted that, in the case of no conflict, the embodiments and features in the embodiments may be combined with each other. The present application will be described in detail below with reference to the accompanying drawings in conjunction with embodiments.
It should be noted that the steps illustrated in the flowcharts of the figures may be performed in a computer system such as a set of computer executable instructions, and that although a logical order is illustrated in the flowcharts, in some cases the steps illustrated or described may be performed in an order other than that illustrated herein.
As shown in fig. 1, this embodiment proposes an optimal arrangement method for a non-uniform linear array for direction finding, including the following steps:
step one: establishing a special array optimal arrangement model based on a minimum gap criterion and a minimum maximum relative side lobe level, determining some parameters of a special array corresponding quantum particle swarm search mechanism, and generatingThe position of the individual initial quantum particles->Speed of Quantum particles->And the locally optimal position of the quantum particles->
Assuming that the linear array to be optimized is formed by N nondirectional array elementsArranged according to a simple arrangement. And the included angle between the incoming wave direction and the array normal in the linear array is defined as theta, the number of array elements can be determined as N, and the excited amplitude weight vector is defined asIn the concrete expression form->Wherein->Represents the amplitude weight of the nth element, satisfying n=1, 2, N; the phase weight vector is defined as +.>In the concrete expression form->Wherein->Represents the phase weight of the nth element, satisfying n=1, 2, N; spacing between adjacent array elements
By usingExpressed in the concrete form +.>Wherein->Represents the spacing between the 1 st and N th array elements, satisfying n=1, 2. The directional diagram function of the linear array is determined by their coaction. Excitation->The mathematical expression of (2) is +.>It is assumed that when the incident angle of a unit plane wave to a linear array is θ, the input steering vector a (θ) of this particular linear array is formed by combining two parts: first part (L)>Is generated by the change of the relative position between adjacent array elements, the expression of which is +.>To be determined asWherein (1)>Being a wave constant, λ represents a wavelength; a second portion of the first portion,wherein (1)>The expression of the pattern function is thereforeThe relative pattern function expression is +.>Wherein U is max =max|f (θ) |, satisfying n=1, 2,...
Setting the range of the known maximum delay number asThe number N of the existing real array elements and the forbidden array element position vector +.> Is the lower bound of the maximum delay number, +.>Is the upper bound of the maximum delay number, wherein +.> Is the minimum spacing of the virtual array elements, +.>
And determining key parameters of a quantum particle search mechanism corresponding to the special optimal arrangement array based on the minimum interval criterion according to the constraint conditions. Assuming that the number of variables to be solved, namely the space search dimension is D, the number of quantum particles in the quantum particle swarm isThen->The t-th generation quantum velocity of individual quantum particles can be defined asIn (1) the->D is more than or equal to 1 and less than or equal to D. When initializing population, for the situation that the number of real array elements is fixed value, the number d of '1' in the randomly selected quantum particle positions x Make a restriction to satisfy d x N, where N is the number of real array elements. Aiming at the situation of forbidden array elements, the forbidden position vector is +.>All +.>The dimensions of the forbidden array elements corresponding to the positions of the quantum individuals are all set to be 0, namely, the forbidden array elements are made +.>Wherein,determining the locally optimal position of the quantum particles at iteration 1 as +.>
Step two: and according to the designed array arrangement rule, designing an adaptability function based on a minimum interval criterion and a minimum maximum relative side lobe level.
The designed new array arrangement rule based on the minimum interval criterion and the minimum maximum relative sidelobe level has the core idea that an array arrangement rule is designed, and the number of lost positions in an array element position difference set, namely the interval number q, is minimum under the condition of determining the maximum delay range, the number of existing real array elements and the forbidden array element positions, and meanwhileThe maximum relative side lobe level of the special array is constructed as +.>The maximum relative sidelobe level is defined as the ratio of the radiation intensity in the direction of the maximum value of the main lobe to the radiation intensity in the direction of the maximum value of the sidelobe, so that the optimal array arrangement mode under specific requirements is realized.
So the t th generationIndividual quantum particle positions->The fitness function of (2) isWherein f 0 For the proportionality constant, q is the interval number, a is the weight constant, and a is the proportionality coefficient.
Step three: bringing the positions of the quantum particles into the fitness function, calculating the fitness function of the quantum particles, and evaluating to obtain the global optimal position
The progress of the evolution of the quantum particles is then represented by an update of the quantum velocity. The t-th generation position of the nth quantum particle in the population is recorded asThe t generation quantum speed is marked as +.>The local optimum position is marked as +.>The global optimal position of the population until the t th generation is
Step four: and updating the quantum speed and the position of the quantum particles by using an updating strategy aiming at array arrangement under specific conditions.
T+1st generationThe updated formula of the quantum velocity of each quantum particle isWherein c 1 And c 2 For two selection constants, for determining the local maxima of the quantum particlesThe closeness of the optimal position and the global optimal position, i.e. the indication of the degree of influence received, satisfies +.>D is 1-D and>wherein eta 1 Is a mutation factor. When the positions are updated according to the quantum particle speeds, the quantum speeds of all dimensions of the same individual are ordered to ensure that the number of 1's in the quantum particle positions is kept unchanged in the updating process, and only the dimension corresponding to the largest N quantum speeds is selected and updated to 1's. For the forbidden array element condition, the forbidden position vector is b= [ b ] 1 ,b 2 ,...,b B ]When the position is updated according to the speed of the quantum particles, the dimension corresponding to the forbidden array element position in the quantum particle position in the updating process is ensured to be always kept at 0.
Step five: and calculating the fitness value corresponding to the updated new position of the quantum particle, updating the nth local optimal position, and finding the global optimal position.
Mapping the new position of each quantum particle into a special array arrangement, calculating the corresponding maximum relative sidelobe level, calculating the adaptability of the new position of each quantum particle based on the minimum interval criterion and the minimum maximum relative sidelobe level and the adaptability of the corresponding special array, and updating the optimal quantum particle subjected to the generation of t+1 into the generation of t+1 by using the nth quantum particleLocal optimum position of individual quantum particles-> At the same time find the t+1st generation to find the whole mass of the particlesGlobal optimum position->
Step six: judging whether the algorithm reaches the preset maximum iteration times, if not, returning to the fourth step for continuous circulation if t=t+1; otherwise, the loop is terminated, the global optimal position at the moment is output, the optimal array arrangement to be solved is corresponding to the global optimal position at the moment, and the corresponding optimal special array arrangement vector is l= [ l ] 1 ,l 2 ,...,l N ]。
Step seven: comparing and evaluating the direction finding accuracy of the special array arrangement obtained by executing the steps with the direction finding accuracy of the uniform linear array arrangement with the same array element number, if the direction finding accuracy of the obtained special array is lower than that of the uniform linear array with the same array element number, namely the root mean square error is large, judging that the special array is invalid, and randomly changing the maximum delay number within the set rangeAnd returning to the second step; otherwise, outputting the obtained optimal array arrangement result.
And taking the obtained optimal array arrangement mode as an array element placement position during direction finding, carrying out spectrum peak search by using a MUSIC algorithm, wherein the angle corresponding to the peak value in the spatial spectrum function is the incoming wave direction of the information source to be solved, and outputting a direction finding result.
Assuming existence in spaceThe far-field narrowband signal sources are incident on a receiving antenna array formed by non-uniform special array arrangement, and N array elements form a non-uniform special array arrangement vector of l= [ l ] 1 ,l 2 ,...,l N ]Position vectorThen->Wherein->Representing the minimum array element spacing of the virtual uniform or nearly uniform linear array to form a set +.>Set->In addition to element 0, share the maximum delay number +.>Different elements. The received signal of the nth element at time t can be expressed asWherein n=1, 2,..n,/-is satisfied>For the ith incident signal, < >>ω 0 For the center frequency of the incident signal, θ i For the azimuth angle of the incident signal of the ith signal, τ n (θ i ) Delay of the reception of the signal for the nth element with respect to the reference point +.>Is the additive impulse noise of the nth array element. Then a signal vector is receivedThe source signal vector in space is +.>The array accepts a noise vector of +.>The noise is complex impulse noise that is spatially and temporally independent and obeys the sαs distribution. Array guide matrix->Is->Order matrix->Wherein the guide vector a (θ i ) The calculation formula of (2) isThus, the signal model of the receiving array is +.>The number of the actually received snapshots is K, and the model of the sampling signal of the kth snapshot of the receiving array is
The signal processed by infinite norm of the kth snapshot sample of the received data isWhere max {.cndot }, is a function of taking the maximum value. The infinite norm fraction low-order covariance matrix of the K-time snapshot sampling data isThe (1)>Line->Column elements arek＝1, 2., K is the maximum snapshot number, γ is the fractional lower order covariance parameter, and x represents the conjugate operation. Let->Wherein it satisfies1≤ρ，/>The extended infinity low order covariance matrix for K shots is +.>Wherein->The expanded guide matrix is +.>The extended steering vector is +.>Low-order covariance matrix for extended infinity norm score->Is subjected to characteristic decomposition to obtain->Wherein,is a signal subspace and consists of feature vectors corresponding to large feature values. Corresponding->Is a noise subspace and consists of feature vectors corresponding to small feature values; />Is a diagonal matrix composed of large eigenvalues, +.>Is a diagonal array of small eigenvalues. The spectrum estimation formula of the non-uniform linear array MUSIC algorithm is +.> Is the azimuth variable. The angle corresponding to the spectrum peak value in the space spectrum function is the estimated value of the direction of arrival to be solved by the special non-uniform linear array +.>
The uniform linear array can be regarded as a special case of a special non-uniform linear array, assuming that there is space in the spaceThe far-field narrowband signal sources are incident on the uniform linear array, and only the +.>The estimated value of the direction of arrival of the uniform linear array can be solved by using the solving method of the special non-uniform linear array>
If the direction finding result of the special array is obtainedThe root mean square error of (a) is greater than the uniform linear array direction finding result of the same array element number +.>The root mean square error of (1) in which the maximum delay number is randomly changed within the set range>And returning to the second step; otherwise, outputting the optimized special array to obtain the optimal array arrangement result.
The embodiment realizes that under the condition of determining the maximum delay range, the number of the existing real array elements and the position of the forbidden array elements, the optimal array arrangement based on the minimum interval criterion and the minimum maximum relative side lobe level can be still provided. The method comprises the following steps: establishing a special array optimal arrangement model based on a minimum gap criterion and a minimum maximum relative side lobe level, determining some parameters of a special array corresponding quantum particle swarm search mechanism, and generatingThe positions of the initial quantum particles, the speeds of the quantum particles and the local optimal positions of the quantum particles; according to the designed array arrangement rule, designing an adaptability function based on a minimum interval criterion and a minimum maximum relative side lobe level; bringing the positions of the quantum particles into the fitness function, calculating the fitness function of the quantum particles, and evaluating the fitness function so as to obtain a global optimal position; updating the quantum speed and the position of the quantum particles by using an updating strategy aiming at array arrangement under specific conditions; calculating the fitness value corresponding to the new position of the updated quantum particle, and updating the +.>Local optimal positions are found, and global optimal positions are found; judging whether the algorithm reaches the preset maximum iteration times, if not, returning to the fourth step for continuous circulation if t=t+1; otherwise, the loop is terminated, the global optimal position at the moment is output, the optimal array arrangement to be solved is corresponding to the global optimal position at the moment, and the corresponding optimal special array arrangement vector is l= [ l ] 1 ,l 2 ,...,l N ]The method comprises the steps of carrying out a first treatment on the surface of the Comparing and evaluating the direction finding accuracy of the optimal array arrangement obtained by executing the steps with the direction finding accuracy of the uniform linear array arrangement with the same array element number, if the direction finding accuracy of the obtained optimal array is lower than that of the same arrayIf the element number is uniform, it is determined that the element number is invalid, and the maximum delay number is changed within a set range>And returning to the second step; otherwise, outputting the obtained optimal array arrangement result. According to the invention, the optimal array structure can be selected according to specific geometric shapes and key goods placement positions in certain scenes, so that the high-precision direction of arrival estimation of the expanded aperture is realized, and meanwhile, the cost is reduced.
In order to verify that the array element arrangement mode designed in the method is the optimal mode under the set condition, the direction-finding simulation result using the array element arrangement mode is compared with the direction-finding accuracy of other array element arrangement combinations which are not selected in the QPSO updating iteration under the same condition, and the following computer simulation experiment is carried out.
For convenience of description, the optimal special array arrangement method based on discrete quantum particle swarm algorithm in the figure is simply referred to as an array element arrangement mode designed by the invention, other array element arrangement combinations which are not selected during QPSO updating iteration are simply referred to as a comparison array element arrangement, and other parameters are the same as the arrangement of the method designed by the invention.
The simulation specific parameters of the model are set as follows: setting a maximum delay number lower bound for a non-uniform array to be optimizedUpper bound->The number of the existing real array elements is N=10, and the position vector b= [3,4,5,6,7 of the forbidden array elements]，f 0 ＝1，a＝10，/>When the confidence source number is set to be 5, the incoming wave direction is [30,10,0, -20, -50]The unit is degree; when the source number is set to 11, the incoming wave direction is [70,60,45,30,10,0, -20, -35, -50, -65, -80]The units are degrees. The characteristic index of the impact noise is alpha=1.8, and the maximum snapshot is thatThe number is set to k=100 and the scan interval of the music algorithm is 0.05 °.
The parameters of the QPSO method designed in this embodiment are set as follows: the population size of the quantum particle group is N=100, the maximum iteration number G=200, and the maximum value and the minimum value of the quantum velocity of the quantum particle are respectively defined as v max ＝10，v min = -10, mutation factor η 1 =0.8, select constant c 1 ＝2，c 2 ＝2。
From simulation results of fig. 2, fig. 3, fig. 4 and fig. 5, it can be seen that the array element arrangement mode designed in the embodiment has obvious superiority in direction-finding accuracy, and can better realize the maximum effective expansion of array aperture under the condition of constraint conditions on the premise of ensuring direction-finding accuracy. As can be seen from the simulation results of the simulation of fig. 6 and 7, the maximum sidelobe level obtained by the inventive method for optimally arranging the discrete quantum particle swarm arrays is lower than the maximum sidelobe level of the other comparative arrays. The quantum particle swarm search mechanism has more excellent global convergence characteristic, overcomes the defect that a particle swarm algorithm is easy to fall into local optimum, obtains lower maximum relative side lobe level, saves cost and simultaneously ensures the direction-finding performance of an optimal special array.
The foregoing is merely a preferred embodiment of the present application, but the scope of the present application is not limited thereto, and any changes or substitutions easily conceivable by those skilled in the art within the technical scope of the present application should be covered in the scope of the present application. Therefore, the protection scope of the present application shall be subject to the protection scope of the claims.

Claims (8)

1. An optimal arrangement method for a non-uniform linear array for direction finding is characterized by comprising the following steps:
generating initial quantum particle positions, initial quantum particle speeds and initial local optimal positions based on a preset array optimal arrangement model;
constructing a first fitness function based on a minimum interval criterion and a minimum maximum relative side lobe level based on the preset array optimal arrangement model;
acquiring an initial global optimal position of the quantum particles based on the first fitness function;
updating the speed and the position of the quantum particles based on the initial local optimal position and the initial global optimal position to obtain a global optimal position;
and acquiring an optimal array arrangement result based on the global optimal position.
2. The method of optimal placement of a non-uniform linear array for direction finding according to claim 1, wherein generating initial positions, velocities, and initial locally optimal positions of quantum particles comprises:
and constructing the preset array optimal arrangement model based on a minimum clearance criterion and a minimum maximum relative side lobe level, and determining parameters of a quantum particle swarm search mechanism corresponding to the preset array optimal arrangement model to generate the initial position, speed and local optimal position of the quantum particles.
3. The optimal arrangement method for a direction finding heterogeneous linear array according to claim 1, wherein obtaining an initial global optimal position of quantum particles comprises:
and carrying the position of the quantum particle into the first fitness function, obtaining the fitness function of the quantum particle, evaluating the fitness function of the quantum particle, and obtaining the initial global optimal position.
4. The optimal arrangement method for a non-uniform linear array for direction finding according to claim 1, wherein updating the speed and position of the quantum particles comprises:
updating the speed of the quantum particles based on the initial local optimal position and the initial global optimal position;
the position is updated based on the updated velocity of the quantum particles.
5. The optimal arrangement method for a direction finding non-uniform linear array according to claim 1, wherein obtaining the global optimal position comprises:
calculating an fitness value corresponding to the new position of the updated quantum particle, updating the local optimal position of the quantum particle, and obtaining the updated global optimal position;
judging whether the update of the quantum particles reaches the preset maximum iteration times, if not, continuously updating the speed and the position of the quantum particles, if so, terminating the cycle, and outputting the global optimal position at the moment.
6. The optimal arrangement method for a direction-finding non-uniform linear array according to claim 1, wherein obtaining an optimal array arrangement result comprises:
and comparing and evaluating the direction finding accuracy of the array arrangement corresponding to the global optimal position with the direction finding accuracy of the uniform linear array arrangement with the same array element number, if the direction finding accuracy of the corresponding array arrangement is lower than that of the uniform linear array with the same array element number, namely, the root mean square error is large, judging that the array arrangement is invalid, randomly changing the maximum delay number within a set range at the moment, reconstructing a first fitness function based on a minimum interval criterion and the minimum maximum relative sidelobe level, and otherwise, regarding the corresponding array arrangement as the optimal array arrangement result.
7. The optimal arrangement method for a non-uniform linear array for direction finding according to claim 1, wherein the first fitness function is:
wherein f 0 For the proportioning constant, q is the interval number, a is the weight constant,is a proportional coefficient->Is t th generation->And quantum particle positions.
8. The optimal arrangement method for a direction finding non-uniform linear array according to claim 5, wherein obtaining an updated global optimal position comprises:
mapping the updated new position of each quantum particle into preset special array arrangement, acquiring the maximum relative sidelobe level corresponding to the preset special array arrangement, and acquiring the adaptability of the new position of each quantum particle based on the minimum interval criterion and the minimum maximum relative sidelobe level and the adaptability of the corresponding special array, wherein the nth quantum particle is updated into the (t+1) th generation by using the optimal quantum particle which is subjected to the (t+1) th generationLocal optimum position of individual quantum particles-> At the same time find the global optimum position for the whole population of particles up to the t+1st generation +.>
CN202311239952.4A 2023-09-25 2023-09-25 Optimal arrangement method of non-uniform linear array for direction finding Pending CN117272809A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202311239952.4A CN117272809A (en) 2023-09-25 2023-09-25 Optimal arrangement method of non-uniform linear array for direction finding

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202311239952.4A CN117272809A (en) 2023-09-25 2023-09-25 Optimal arrangement method of non-uniform linear array for direction finding

Publications (1)

Publication Number Publication Date
CN117272809A true CN117272809A (en) 2023-12-22

Family

ID=89215562

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202311239952.4A Pending CN117272809A (en) 2023-09-25 2023-09-25 Optimal arrangement method of non-uniform linear array for direction finding

Country Status (1)

Country Link
CN (1) CN117272809A (en)

Similar Documents

Publication Publication Date Title
CN108375751B (en) Multi-source direction-of-arrival estimation method
CN108761381B (en) Target information source detection method based on array antenna
CN111224706B (en) Surface multi-beam shaping method based on hybrid adaptive particle swarm algorithm
CN110244272B (en) Direction-of-arrival estimation method based on rank-denoising model
CN108663654B (en) 360-degree all-dimensional dynamic direction finding method based on continuous quantum pigeon group
CN111695233A (en) Array element failure correction method based on improved whale optimization algorithm
CN110398732A (en) The target direction detection method of low calculation amount adaptive step iterative search
CN109212466B (en) Quantum dragonfly evolution mechanism-based broadband direction finding method
CN110736976A (en) sonar beam former performance estimation method of arbitrary array
CN111487594A (en) Circular array beam forming method based on particle swarm optimization
CN113759303A (en) Non-grid DOA (angle of arrival) estimation method based on particle swarm optimization
CN111812580A (en) Motion linear sparse array optimization method based on underdetermined information source Cramer-Rao bound
CN117272809A (en) Optimal arrangement method of non-uniform linear array for direction finding
CN111830495A (en) Airborne radar self-adaptive beam forming algorithm based on convex optimization learning
CN116306199A (en) Efficient optimization method based on multivariate vector control cross eye interference technology
CN113093111B (en) Uniform circular array two-dimensional coherent signal demodulation method and system based on compressed sensing and genetic algorithm
CN116400312A (en) Rapid networked radar node selection method based on migration reinforcement learning
CN114167347B (en) Amplitude-phase error correction and direction finding method for mutual mass array in impact noise environment
Ma et al. Computation-efficient 2-D DOA estimation algorithm with array motion strategy
CN109358312B (en) Method, device, medium and equipment for determining incoming wave direction of incident signal
CN110873866A (en) Monostatic MIMO radar target angle estimation method under cross-coupling condition
CN117688789B (en) Phased array scanning radar sparse array synthesis method and device based on ADMM
CN113067615B (en) Near-field array beam control method
CN117993038A (en) Distributed array layout structure optimization method, system and storage medium based on discrete quantum electromagnetic field optimization mechanism
CN116879962B (en) Efficient electromagnetic analysis method for dynamic group targets in sea surface environment

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination