Harmony search algorithm-based linear sparse array grating lobe inhibition method
A search algorithm and wiring array technology, applied to antenna arrays, antennas, calculations, etc., can solve problems that need to be studied, long computing time, etc., achieve fast convergence speed, and improve optimization efficiency
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment 1
[0084] The present invention can be better understood from the following examples. However, those skilled in the art will readily understand that the specific material ratios, process conditions and results described in the examples are only used to illustrate the present invention, and should not and will not limit the present invention described in detail in the claims .
[0085] 1. Establish sparse wiring array model under multiple constraints
[0086] Consider a linear array with an aperture of L, and N elements are sparsely distributed on the array, such as figure 1 As shown, x i Indicates the position of the i-th array element.
[0087] For this array model, it is assumed that all array elements are the same and have no directionality, and only the pattern characteristics in the direction of elevation angle θ are considered. Then the array pattern function can be simplified to the following form:
[0088]
[0089] The optimization goal is to reduce the PSLL of th...
Embodiment 2
[0131] Embodiment 2 simulation result
[0132] Consider a symmetrical sparse linear array model, aperture L=9.744λ, wavelength Number of array elements N=17, array element spacing constraint d min =0.5λ,d max =λ, the bandwidth of the main lobe zero power point is 12.8°, and the discretization interval is 0.2°. Use the HS algorithm to suppress the sparse array grating lobe, and take the peak sidelobe level as the optimization target. The basic parameters in the HS algorithm are set as follows: HMS is 10, HMCR is 0.8, PAR is 0.3, and the adjustment step size The maximum number of iterations is 3000. The method of artificially limiting the positions of the first and last array elements and the method of vector mapping are used for processing.
[0133] (1) Comparison of two methods
[0134] Method 1: Artificially limit the positions of the first and last array elements
[0135] In order to ensure that the aperture of the array is L, x is artificially specified 1 =0,x N =...
PUM
Abstract
Description
Claims
Application Information
- R&D Engineer
- R&D Manager
- IP Professional
- Industry Leading Data Capabilities
- Powerful AI technology
- Patent DNA Extraction
Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.
© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com