CN106356641A - Array antenna designing method of polynomial and particle swarm mixing method - Google Patents
Array antenna designing method of polynomial and particle swarm mixing method Download PDFInfo
- Publication number
- CN106356641A CN106356641A CN201610833519.7A CN201610833519A CN106356641A CN 106356641 A CN106356641 A CN 106356641A CN 201610833519 A CN201610833519 A CN 201610833519A CN 106356641 A CN106356641 A CN 106356641A
- Authority
- CN
- China
- Prior art keywords
- array
- particle
- array antenna
- particles
- multinomial
- 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.)
- Granted
Links
- 239000002245 particle Substances 0.000 title claims abstract description 75
- 238000000034 method Methods 0.000 title claims abstract description 41
- 238000009826 distribution Methods 0.000 claims abstract description 35
- 238000005457 optimization Methods 0.000 claims abstract description 22
- 239000013598 vector Substances 0.000 claims abstract description 17
- 238000004422 calculation algorithm Methods 0.000 claims description 25
- 238000013461 design Methods 0.000 claims description 18
- 230000000452 restraining effect Effects 0.000 claims description 2
- 230000005855 radiation Effects 0.000 description 6
- 238000003491 array Methods 0.000 description 5
- 238000005516 engineering process Methods 0.000 description 4
- 238000004458 analytical method Methods 0.000 description 3
- 238000004364 calculation method Methods 0.000 description 3
- 230000015572 biosynthetic process Effects 0.000 description 2
- 238000004891 communication Methods 0.000 description 2
- 230000007423 decrease Effects 0.000 description 2
- 238000010586 diagram Methods 0.000 description 2
- 230000005284 excitation Effects 0.000 description 2
- 239000004744 fabric Substances 0.000 description 2
- 108010074864 Factor XI Proteins 0.000 description 1
- 241000638935 Senecio crassissimus Species 0.000 description 1
- 238000013459 approach Methods 0.000 description 1
- 230000003247 decreasing effect Effects 0.000 description 1
- 238000009795 derivation Methods 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 238000005315 distribution function Methods 0.000 description 1
- 235000013399 edible fruits Nutrition 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 230000002068 genetic effect Effects 0.000 description 1
- 230000010354 integration Effects 0.000 description 1
- 238000004519 manufacturing process Methods 0.000 description 1
- 238000010606 normalization Methods 0.000 description 1
- 230000035699 permeability Effects 0.000 description 1
- 230000002028 premature Effects 0.000 description 1
- 238000011160 research Methods 0.000 description 1
- 238000002922 simulated annealing Methods 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
- 238000003786 synthesis reaction Methods 0.000 description 1
- 230000009466 transformation Effects 0.000 description 1
- 230000000007 visual effect Effects 0.000 description 1
Classifications
-
- H—ELECTRICITY
- H01—ELECTRIC ELEMENTS
- H01Q—ANTENNAS, i.e. RADIO AERIALS
- H01Q21/00—Antenna arrays or systems
- H01Q21/0087—Apparatus or processes specially adapted for manufacturing antenna arrays
Landscapes
- Engineering & Computer Science (AREA)
- Manufacturing & Machinery (AREA)
- Variable-Direction Aerials And Aerial Arrays (AREA)
Abstract
The invention provides an array antenna designing method of a polynomial and particle swarm mixing method, and relates to a thinned array antenna. The array antenna designing method of the polynomial and particle swarm mixing method comprises the following steps: (1) setting parameters of an array antenna according to actual demands; (2) setting a control parameter of particle swarm optimization according to a parameter of the array antenna; (3) selecting an order n of a polynomial, and initializing a particle swarm; (4) solving position distribution of various array elements by using position vectors of particles; (5) calculating whether the particles meet a constraint condition or not according to a model constraint condition, namely calculating whether the particles are in a feasible region or not; (6) judging whether array element distribution shown by the particles is good or bad according to a fitness function and a penalty function, and updating the position vectors and speed vectors of the particles; (7) repeating the step (4), the step (5) and the step (6), and searching optimum of the various current particles and experienced global optimum of all the particles; and (8) carrying out iteration repeatedly, searching to obtain convergent optimal particles, substituting the position vectors of the optimal particles into an array element distribution polynomial, and solving the optimized array distribution.
Description
Technical field
The present invention relates to thinned array antenna, especially relate to the array antenna design of multinomial and population mixed method
Method.
Background technology
Array antenna arrangement mode can be divided into all even uneven arrangement, is claimed by the array that the array element of uneven arrangement forms
For Unequal distance array, otherwise it is equidistant array.Non-uniform spacing array mainly has the advantage that 1) there is phase with uniform intervals array
Same main lobe width, when that is, aperture is approximate, needs less antenna element, reduces the expense of whole system;2) pass through to optimize
Element position is distributed, and can be achieved with Sidelobe characteristic etc. amplitude feed, simplifies feed system.
Non-uniform spacing array can be divided into thinned array and thinning array according to the arrangement mode of array element.Thinning array is
A kind of array of element position Arbitrary distribution, element position distribution has very big degree of freedom, it is possible to obtain radiation characteristic is more preferable
Optimum results.Thinned array antenna passes through to adjust element position or element position and array element excitation controls the radiation of array special
Property, optimizing degree of freedom is more than uniform array and thinned array, can reduce the Peak sidelobe level of antenna pattern further.Base
In the above-mentioned advantage of thinning array, thinning array has in fields such as radar, navigation, communication and radio astronomies and is widely applied very much
Potentiality.
The optimization design of thinned array antenna is with regard to the multivariate of position distribution, multiple constraint nonlinear problem.Up till now
Till had that a large number of researchers propose various thinned array antenna Optimized arrays tradition approximate analytical methods and intelligent optimization is calculated
Method.Wherein traditional approximate analytical method mainly includes based on the approximate Taylor's distribution of Poisson summation, exponential, is based on Fu
Vertical leaf transformation approximate integration technology, the density taper pin method based on graphic technique are although these methods are obtained for thinning array relatively
Optimize element position distribution, but be substantially during theoretical derivation used Approximate Equivalent so as to get termination
Fruit be suboptimal solution it is impossible to obtain optimal solution truly, the effect of optimization to minor level is limited;Using calculating
The perturbation method of machine numerical analysis techniques, the method for exhaustion, statistic law, the method for exhaustion can obtain the element position distribution of optimum, but by
It is very difficult to apply in the more array design of array element number in the too big limitation of amount of calculation.
With the development of computer technology, intelligent optimization algorithm is widely used in the Pattern Synthesis kind of thinning array, bag
Include genetic algorithm, simulated annealing, ant group algorithm, particle algorithm etc..Although however, these can only algorithm can be in overall model
Enclose interior search optimal solution, but still solving precision and solving speed is high, Premature Convergence, calculating can be made when array element number is more
Amount increases, and takies computer resource excessive.Therefore, finding the more optimal technology of structuring the formation is an important research direction.
Content of the invention
It is an object of the invention to provide a kind of array antenna design method of multinomial and population mixed method.
The present invention comprises the following steps:
1) parameter of setting array antenna according to the actual requirements;
2) parameter according to array antenna, sets the control parameter of particle cluster algorithm;
3) choose polynomial exponent number n, initialize population;
4) position distribution of each array element is tried to achieve with the position vector of particle;
5) according to model constraints, calculate particle whether meet the constraint condition, that is, whether this particle is in feasible zone;
6) quality of the array element distribution that particle represents is passed judgment on according to fitness function and penalty, and the position of more new particle
Put vector velocity;
7) repeat step 4)~6), search for the global optimum that the optimum and all particle of each particle current lives through;
8) carry out successive ignition, search obtains the optimal particle restraining, then the position vector of optimal particle is substituted into array element
Distribution polynomials, try to achieve the distribution of the array element after optimization.
In step 1) in, described parameter includes array aperture, array element number, array element minimum spacing constraints etc..
In step 2) in, described parameter includes number of particles, optimizing space bound, inertia weight, aceleration pulse, iteration
Number of times etc..
In step 3) in, described polynomial exponent number n selection range is 2~9;With regard to polynomial exponent number n in the present invention
Select permeability, in theory for, polynomial exponent number is higher, and multinomial more approaches optimized position distribution function,
But during actual optimization, the multinomial of too high exponent number can lead to optimum results easily to converge to infeasible domain, and too high
Exponent number can increase amount of calculation and the optimization time of algorithm, so compromise considers it is proposed that selecting polynomial exponent number n to be 4~6
Rank.
The present invention, in optimizing spatially lower range, removes to optimize polynomial coefficient with particle cluster algorithm, polynomial
The lower limit in the optimizing space of each coefficient is -100~-1, and the upper limit is 1~100.Optimized variable bound with regard to population
Setting problem, in theory for the bound of optimized variable can be whole real number field, but if scope is too big
Optimized algorithm can be led to be absorbed in local convergence after the iterationses setting, do not reach optimal solution, and hunting zone is excessive
The optimal speed of algorithm can be affected, so suggestion selects less bound scope.
All array elements in the present invention are mutually encouraged using constant amplitude etc..
The invention provides a kind of method that is combined of element position polynomial repressentation and particle cluster algorithm is realizing Thinned arrays
The optimal design of array antenna array element distribution, the present invention does not directly optimize element position, but by optimizing polynomial coefficient,
Connect optimization element position distribution, lead to too small amount of multinomial coefficient and control most element positions, advantageously reduce intelligent algorithm
Operand.Additionally, the array antenna through optimization design has low-sidelobe level, the phase feeding network such as simplest constant amplitude,
Both decreased radiation loss, reduced design and manufacturing cost again, had in fields such as radar, navigation, communication and radio astronomies
Potential commercial value.
Compared with the method for designing of existing thinned array antenna, the remarkable advantage of the present invention is as follows:
1st, optimize the coefficient of array element distribution polynomials by particle cluster algorithm, efficiently reduce the operand of algorithm;
2nd, have the advantages that particle cluster algorithm flow process simple, in high precision, fast convergence rate, the array element distribution after optimization is
Excellent solution, has the low characteristic of array minor level;
3rd, array element mutually encourages using with constant amplitude etc., has simplest feeding network, greatly reduces and be designed and manufactured as
This.
Brief description
Fig. 1 is the thinned array antenna schematic diagram symmetrical with regard to array center of the embodiment of the present invention.
Fig. 2 is that the multinomial of the embodiment of the present invention is divided with the right half part array element of population mixed method thinned array antenna
Cloth position.
Fig. 3 is the antenna pattern with population mixed method thinned array antenna for the multinomial of the embodiment of the present invention.
Specific embodiment
Following examples will combine accompanying drawing, and the present invention is further illustrated.
The design procedure of the embodiment of the present invention is as follows:
Step 1: the parameter of setting array antenna according to the actual requirements: array aperture, array element number, array element minimum spacing are about
Bundle condition;
The thinned linear arrays antenna of the present embodiment is symmetrical with regard to array center, the element number of array m=16 on the right side of array, that is,
Array element sum is 2m=32, array aperture l=20 λ, minimum spacing d between array elementc=λ/2, wherein λ are the operation wavelength of array,
First element position d1≥0.5dc, last element position dm=l/2, as shown in Figure 1.
Step 2: according to the parameter of array antenna, set the control parameter of particle cluster algorithm: number of particles, optimizing are spatially
Lower limit, inertia weight, aceleration pulse, iterationses;
In the present embodiment, population number of particles is 100, and optimized variable is { d1,d2,d3,…d16, wherein diFor i-th gust
The position of unit, dimension d=n, aceleration pulse c1=2.05 and c2=2.05, inertia weight w is set as:
Wherein, wmax, wminIt is respectively the minimum and maximum value of w, total iterationses are set to t=2000, and t represents t
Secondary iteration;In solution room, the lower boundary of each dimension is set to xmin=[- 1, -10, -10 ... -10], coboundary is set to xmax=[1,
10,10,…10];
Step 3: choose polynomial order n, initialize population;
In the present embodiment, exponent number n selects 4,5,6 to be optimized design respectively.Random initializtion population, obtains primary
Position vector x1={ x11,x12,…x1dAnd velocity v1={ v11,v12,…,v1d};The position vector x of i-th particlei
={ xi1,xi2,…xidAnd velocity vi={ vi1,vi2,…,vid};
Step 4: try to achieve the position distribution of each array element with the position vector of particle;
Polynomial expression is formula (2a) with the corresponding relation of array element numbering, element position distribution and multinomial coefficient relation
For formula (2b), using the position vector of particle as polynomial coefficient, try to achieve the position distribution of each array element.
Wherein, dmRefer to the array element distribution of m-th array element, wherein xiRepresent position vector in i-th value, x0=1- (x1
+x2+…xn).
Step 5: according to model constraints, calculate particle whether meet the constraint condition, that is, whether this particle is in feasible zone;
The present embodiment model constraints is formula (3), the position vector of particle is substituted in formula (3), judges that this particle is
No in feasible zone.
Step 6: the quality of the array element distribution that particle represents is passed judgment on according to fitness function and penalty, and more new particle
Position vector and velocity;
With the Peak sidelobe level of thinning array antenna pattern as optimization aim, its fitness function is formula to the present invention
(4a):
Wherein, amNormalization for array element encourages amplitude, u=k (sin θ-sin θmain), k is that the propagation in free space is normal
Number, θ is the angle gust between axle and radiation direction, θmainIt is the angle of main radiation direction and battle array axle, the Thinned arrays of the present embodiment
Arrange each array element excitation amplitude all equal, i.e. am=1, emaxIt is antenna pattern main lobe maximum.
Penalty is formula (4b):
Wherein penalty weighter factor ξ=108, x=(x1,x2,…xn) it is the n multinomial representing element position function
Coefficient;
It is formula (4c) that fitness function and penalty are combined into a new object function:
Wherein f is the feasible zone meeting formula (3) constraints.
The present embodiment is to the selection of particle in the following ways:
(1) if two particle xiAnd xjIt is all feasible solution, then directly compare both fitness value fitness (xi)
With fitness (xj), select fitness value minimum for excellent;
(2) if two particle xiAnd xjIt is all infeasible solution, then compare penalty value p (xi) and p (xj), choose
The little particle of penalty value is excellent;
(3) if particle xiIt is feasible solution, particle xjIt is infeasible solution, then choose xiFor excellent particle.
The equation of the speed and position that update i-th particle in the present embodiment is formula (5a) and (5b):
Wherein, t is the current iterationses of algorithm,WithIt is i-th particle position arrow in the t-1 time iteration
Amount and velocity;pbesti={ pi1,pi2,…pidBe the optimum that i-th particle is lived through position, gbest={ pg1,
pg2,,pgdIt is optimized position in the optimal location that all particles live through.
Step 7: repeat step 4~6, the history optimum pbest of search each particle currenti={ pi1,pi2,…pidAnd
Global optimum gbest={ the p that all particles live throughg1,pg2,…pgd}.
Step 8: carry out successive ignition, search obtains the particle of the optimum of convergence, recycles the position vector back substitution of particle
Enter polynomial expression, try to achieve the distribution of the array element after optimization.
After k iteration, the optimal particle of the convergence searching is final gbest={ pg1,pg2,…pgd, this reality
Apply example in n=4,5,6 make the multinomial optimized coefficients that obtain as shown in table 1, by the multinomial coefficient of table 1 substitute into formula (2a) and
(2b) array element distribution after being optimized in, element position distribution is as shown in Fig. 2 adopt the many of different rank as can be seen from Figure 2
Item formula optimizes the element position of thinning array, and the optimization element position distribution obtaining is approximately the same.Finally, element position is divided
Cloth substitutes in the direction schema (6) of array:
Table 1
x0 | x1 | x2 | x3 | x4 | x5 | x6 | |
N=4 | -0.034 | 1.0000 | -0.958 | 1.737 | -0.745 | ||
N=5 | -0.0210 | 0.6790 | 1.209 | -3.948 | 5.586 | -2.505 | |
N=6 | -0.0120 | 0.470 | 2.746 | -8.038 | 10.000 | -4.164 | -0.002 |
Thinned array antenna directional diagram after final optimization pass is as shown in figure 3, the Thinned arrays that obtain of 4~6 rank multinomial optimizations
Row antenna pattern radiation characteristic in visual field is good, and Peak sidelobe level is about -20.41db.Using multinomial and particle
Group's hybrid optimization algorithm optimizes the distribution of thinning array element position, in the not many array of array element number, by choosing 4~6
Rank multinomial represents that element position is distributed, and the various dimensions problem optimizing each element position is converted into optimizing multinomial coefficient
Problem, decreases the number of optimized variable, decreases amount of calculation and operation time.And same array element number and array aperture
When, mixed method is lower than directly obtaining Peak sidelobe level using particle swarm optimization algorithm.Illustrate that the present invention is a kind of feasible
Solution thinning array Optimization Design.
With a n-order polynomial, the present invention parameter needed for initialization system according to the actual requirements, represents that element position is distributed,
Optimize this polynomial coefficient with particle cluster algorithm again, pass judgment on the quality of array element distribution using fitness and penalty, pass through
Successive ignition is searched for, and obtains the array distribution of optimum.The method that element position polynomial repressentation is combined with particle cluster algorithm, leads to
Cross and optimize polynomial coefficient, indirectly optimize element position distribution, lead to too small amount of multinomial coefficient and control most array element positions
Put, advantageously reduce the operand of intelligent algorithm, lift array antenna performance, present invention incorporates particle cluster algorithm flow process is simple
Single, operational precision is high, the feature of fast convergence rate, finds object function by using particle swarm optimization algorithm optimized multinomial
Formula coefficient combines, and realizes the optimization design of thinned array antenna.
Claims (6)
1. multinomial and the array antenna design method of population mixed method are it is characterised in that comprise the following steps:
1) parameter of setting array antenna according to the actual requirements;
2) parameter according to array antenna, sets the control parameter of particle cluster algorithm;
3) choose polynomial exponent number n, initialize population;
4) position distribution of each array element is tried to achieve with the position vector of particle;
5) according to model constraints, calculate particle whether meet the constraint condition, that is, whether this particle is in feasible zone;
6) quality of the array element distribution that particle represents is passed judgment on according to fitness function and penalty, and the position arrow of more new particle
Amount and velocity;
7) repeat step 4)~6), search for the global optimum that the optimum and all particle of each particle current lives through;
8) carry out successive ignition, search obtains the optimal particle restraining, then the position vector of optimal particle is substituted into array element distribution
Multinomial, tries to achieve the distribution of the array element after optimization.
2. the array antenna design method of multinomial as claimed in claim 1 and population mixed method is it is characterised in that in step
In rapid 1), described parameter includes array aperture, array element number, array element minimum spacing constraints.
3. the array antenna design method of multinomial as claimed in claim 1 and population mixed method is it is characterised in that in step
In rapid 2), described parameter includes number of particles, optimizing space bound, inertia weight, aceleration pulse, iterationses.
4. the array antenna design method of multinomial as claimed in claim 1 and population mixed method is it is characterised in that in step
In rapid 3), described polynomial exponent number n selection range is 2~9.
5. the array antenna design method of multinomial as claimed in claim 4 and population mixed method is it is characterised in that described
Polynomial exponent number n is 4~6 ranks.
6. the array antenna design method of multinomial as claimed in claim 1 and population mixed method is it is characterised in that in step
In rapid 4), all array elements are mutually encouraged using constant amplitude etc..
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201610833519.7A CN106356641B (en) | 2016-09-20 | 2016-09-20 | The array antenna design method of multinomial and population mixed method |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201610833519.7A CN106356641B (en) | 2016-09-20 | 2016-09-20 | The array antenna design method of multinomial and population mixed method |
Publications (2)
Publication Number | Publication Date |
---|---|
CN106356641A true CN106356641A (en) | 2017-01-25 |
CN106356641B CN106356641B (en) | 2019-07-23 |
Family
ID=57858699
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CN201610833519.7A Expired - Fee Related CN106356641B (en) | 2016-09-20 | 2016-09-20 | The array antenna design method of multinomial and population mixed method |
Country Status (1)
Country | Link |
---|---|
CN (1) | CN106356641B (en) |
Cited By (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN110972000A (en) * | 2019-12-31 | 2020-04-07 | 青岛海之声科技有限公司 | Microphone array signal noise reduction system and microphone array optimization method |
CN112615158A (en) * | 2020-12-01 | 2021-04-06 | 厦门大学 | Comprehensive method and device for ultra-wideband scanning sparse array antenna |
CN113191070A (en) * | 2021-03-24 | 2021-07-30 | 国网山东省电力公司泰安供电公司 | Particle swarm and genetic algorithm combined antenna array arrangement optimization method |
CN113361053A (en) * | 2021-06-09 | 2021-09-07 | 中国电子科技集团公司第三十八研究所 | Distributed antenna layout optimization design method and system |
Citations (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN103646144A (en) * | 2013-12-19 | 2014-03-19 | 西安电子科技大学 | Aperiodic array antenna design method |
CN105406203A (en) * | 2015-11-12 | 2016-03-16 | 电子科技大学 | Geographic constraint-based optimal deployment method for sparse antenna array |
-
2016
- 2016-09-20 CN CN201610833519.7A patent/CN106356641B/en not_active Expired - Fee Related
Patent Citations (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN103646144A (en) * | 2013-12-19 | 2014-03-19 | 西安电子科技大学 | Aperiodic array antenna design method |
CN105406203A (en) * | 2015-11-12 | 2016-03-16 | 电子科技大学 | Geographic constraint-based optimal deployment method for sparse antenna array |
Non-Patent Citations (1)
Title |
---|
SMITA BANERJEE ET AL: "Linear Array Synthesis using Schelkunoff Polynomial Method and Particle Swarm Optimization", 《2015 INTERNATIONAL CONFERENCE ON ADVANCES IN COMPUTER ENGINEERING AND APPLICATIONS (ICACEA)》 * |
Cited By (5)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN110972000A (en) * | 2019-12-31 | 2020-04-07 | 青岛海之声科技有限公司 | Microphone array signal noise reduction system and microphone array optimization method |
CN112615158A (en) * | 2020-12-01 | 2021-04-06 | 厦门大学 | Comprehensive method and device for ultra-wideband scanning sparse array antenna |
CN112615158B (en) * | 2020-12-01 | 2022-01-28 | 厦门大学 | Comprehensive method and device for ultra-wideband scanning sparse array antenna |
CN113191070A (en) * | 2021-03-24 | 2021-07-30 | 国网山东省电力公司泰安供电公司 | Particle swarm and genetic algorithm combined antenna array arrangement optimization method |
CN113361053A (en) * | 2021-06-09 | 2021-09-07 | 中国电子科技集团公司第三十八研究所 | Distributed antenna layout optimization design method and system |
Also Published As
Publication number | Publication date |
---|---|
CN106356641B (en) | 2019-07-23 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
CN106356641A (en) | Array antenna designing method of polynomial and particle swarm mixing method | |
CN105048112B (en) | Array antenna based on QIWO_IFT combinational algorithms only phse conversion beam form-endowing method | |
CN104901734B (en) | A kind of form-giving array antennas beams method | |
CN104899374B (en) | Based on small echo variation wind Drive Optimization algorithm collinear array Pattern Synthesis method | |
CN104936186B (en) | Cognitive radio network spectrum allocation method based on cuckoo searching algorithm | |
CN104392034B (en) | One kind is based on L1/2The sparse linear array optimization method of norm | |
CN107958106B (en) | A kind of directional diagram numerical optimization of circle bore planar array antenna | |
CN106357316A (en) | Beam forming method and device of array antenna | |
CN114218849B (en) | Complex array antenna intelligent design method based on deep reinforcement learning | |
CN105870935A (en) | Clustering algorithm-based radial distribution network reactive power optimization method | |
CN109033647B (en) | Near-field sparse antenna array optimization method based on L1 norm constraint | |
CN107944133A (en) | Perimeter antenna array Sparse methods based on multi-target quantum spider group's mechanism of Evolution | |
CN108987941A (en) | A kind of compressed sensing based one-dimensional Antenna Subarray Division | |
CN103188695A (en) | Method and system for laying of indoor antennas | |
CN111143983B (en) | Low side lobe comprehensive optimization method for sparse antenna array based on improved water circulation algorithm | |
CN104900988A (en) | Method for designing thin cloth circular antenna array through changing auxiliary grid circle radius | |
CN107766631A (en) | A kind of array antenna optimization method of effectively control excitation amplitude dynamic range | |
CN104020448A (en) | Optimized formation method of radar subarray-level sum/difference beams constrained by equal array elements | |
CN105842666B (en) | Radar Subarray partition optimization method based on difference algorithm | |
CN104485513B (en) | Real-time integrating method for wideband antenna array | |
Lin et al. | Synthesis of sparse linear arrays using vector mapping and simultaneous perturbation stochastic approximation | |
CN114826462B (en) | Beam domain channel augmentation method for large-scale MIMO statistical port selection | |
CN106777601A (en) | Based on the planar array antenna Pattern Synthesis method that MIFT is combined with QP algorithms | |
Recioui et al. | Capacity optimization of MIMO wireless communication systems using a hybrid genetic-taguchi algorithm | |
CN106845725A (en) | A kind of engineering parameter optimization method and system |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
C06 | Publication | ||
PB01 | Publication | ||
SE01 | Entry into force of request for substantive examination | ||
SE01 | Entry into force of request for substantive examination | ||
GR01 | Patent grant | ||
GR01 | Patent grant | ||
CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20190723 |