Rapid planar sparse array synthesis method

A planar array, sparse array technology, applied in special data processing applications, instruments, electrical digital data processing and other directions, can solve the problem of long time-consuming array synthesis, reduce the array synthesis time, have versatility and portability, speed up The effect of convergence speed

Inactive Publication Date: 2015-07-01
NANJING UNIV OF INFORMATION SCI & TECH
View PDF2 Cites 16 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

This patent provides an array synthesis method for linear arrays, and this method needs to use optimization tools, such as convex optimization tools, to solve the linear array synthesis problem, so the array synthesis will take a long time

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Rapid planar sparse array synthesis method
  • Rapid planar sparse array synthesis method
  • Rapid planar sparse array synthesis method

Examples

Experimental program
Comparison scheme
Effect test

Embodiment 1

[0074] Set the horizontal length of the planar array to be integrated to 5λ and the vertical length to 5λ, where the horizontal array element spacing is λ / 4 , the longitudinal array element spacing is λ / 4 , then the number of transverse array elements of the initialized planar array is M=21, and the number of longitudinal array elements is N=21, then the number of initialized array elements, that is, the number of array elements before synthesis, is 441, and the beam peak sidelobe level of the planar sparse array is required to be less than -20dB. If adopt the method that is λ / 2 full array arrangement according to array element pitch, then need antenna element number be 121, adopt the fast planar sparse array comprehensive method that the present invention proposes to optimize, wherein u x and v y Sampling is performed at an interval of 0.05 within the value range [-1 1], Lagrangian factor α=71.5, and the minimum error value ξ=10 -5 , the number of planar sparse array ele...

Embodiment 2

[0076] In order to further verify the effectiveness of the method of the present invention, the planar array synthesis is carried out again under different constraints such as given planar array scale and peak side lobe level. The constraint conditions are set as follows: the horizontal length of the planar array is 8λ and the vertical length is 8λ, the distance between the horizontal array elements is λ / 4, and the vertical array element spacing is λ / 4. If the number of elements is N=33, the number of initial array elements is 1089, and the optimized beam peak side lobe level is required to be less than -24dB. If adopting the method of carrying out full array arrangement according to the array element spacing as λ / 2, the number of antenna elements is required to be 289, while adopting the fast planar sparse array synthesis method proposed by the present invention only needs 165 antenna array elements, and the sparsity of the array reaches 57.09%, saving 124 antenna elements, w...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

PUM

No PUM Login to view more

Abstract

The invention discloses a rapid planar sparse array synthesis method. The method has the advantages that a conventional planar array synthesis constraint optimization model is converted into an unconstraint optimization problem by constructing a Lagrange function, so that calculation ill-posed problems in the iterative optimization process of a planar array are avoided, an array weight vector can be updated by the aid of closed-form solution in each time of iteration, planar array synthesis problems can be solved without an optimization tool, the method is more universal and transportability, an inverse matrix in the closed-form solution is quite large in scale as a two-dimensional space angle sample number of the planar array is increased in a quadratic manner, the inversion problem of the large-scale matrix is solved by introducing a conjugate gradient method, and convergence of planar array synthesis is accelerated, so that the method is higher in real-time performance and particularly applicable to occasions with high requirements on array optimization real-time performance and universality.

Description

technical field [0001] The invention relates to a fast planar sparse array synthesis method. Background technique [0002] In recent years, planar antenna arrays have been widely used in the fields of radar, communication, guidance, and satellite broadcasting and television. In order to reduce the hardware and software complexity and cost of the system, in actual engineering, it is usually required that the planar array can achieve a large array aperture with as few antenna elements as possible to obtain high spatial resolution while maintaining a low sidelobe level. Therefore, using a non-uniform sparse planar array is an effective solution, and the sparse arrangement of array elements often leads to an increase in the sidelobe level of the pattern. [0003] The purpose of antenna array synthesis is to make the antenna array use the least number of array elements to meet the desired radiation characteristics by optimizing the array element position and its excitation mode ...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

Application Information

Patent Timeline
no application Login to view more
Patent Type & Authority Applications(China)
IPC IPC(8): G06F17/50
Inventor 曹华松陈金立李家强葛俊祥
Owner NANJING UNIV OF INFORMATION SCI & TECH
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products