Reducing the number of elements in the synthesis of a broadband linear array with multiple simultaneous frequency-invariant beam patterns

Publication Type:
Journal Article
Citation:
IEEE Transactions on Antennas and Propagation, 2018, 66 (11), pp. 5838 - 5848
Issue Date:
2018-11-01
Filename Description Size
2B6AE9BA-F08D-4445-B3C8-E45B91D6591B am.pdfAccepted Manuscript Version10.33 MB
Adobe PDF
Full metadata record
© 2018 IEEE. The problem of reducing the number of elements in a broadband linear array with multiple simultaneous crossover frequency-invariant (FI) patterns is considered. Different from the single FI pattern array case, every element channel in the multiple FI pattern array is divided and followed by multiple finite-impulse-response (FIR) filters, and each of the multiple FIR filters has a set of coefficients. In this situation, a collective filter coefficient vector and its energy bound are introduced for each element, and then the problem of reducing the number of elements is transformed as minimizing the number of active collective filter coefficient vectors. In addition, the radiation characteristics including beam pointing direction, mainlobe FI property, sidelobe level, and space-frequency notching requirement for each of the multiple patterns can be formulated as multiple convex constraints. The whole synthesis method is implemented by performing an iterative second-order cone programming (SOCP). This method can be considered as a significant extension of the original SOCP for synthesizing broadband sparse array with single FI pattern. Numerical synthesis results show that the proposed method by synthesizing multiple discretized crossover FI patterns can save more elements than the original iterative SOCP by using a single continuously scannable FI pattern for covering the same space range. Moreover, even for multiple FI-patterns case with complicated space-frequency notching, the proposed method is still effective in the reduction of the number of elements.
Please use this identifier to cite or link to this item: