An Efficient Approach for the Synthesis of Large Sparse Planar Array

Gu, Pengfei; Gui, Weihua; Fan, Zhenhong; Chen, R. S.

doi:10.1109/tap.2019.2931959

Cited by 39 publications

(18 citation statements)

References 21 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…After the sampling, we have

where

and

. With the sampled data, the block Hankel matrix

can be obtained as follows [ 27 ]:

in which K and L are pencil parameters, which should be chosen such that

and

with M being the element number of reference pattern [ 18 ]. Then the singular value decomposition of the matrix

is performed as

where

and

are unitary matrices.…”

Section: Proposed Synthesis Methods For Sparse Fdamentioning

confidence: 99%

“…However, in some cases where the weight and size of antenna systems are limited, it is very significant to obtain the desired beampattern performance with the sparse array. In the past several decades, the pattern synthesis problem of the sparse array has been extensively studied [ 13 , 14 , 15 , 16 , 17 , 18 , 19 , 20 , 21 , 22 ]. The typical synthesis methods of sparse arrays can be summarized into three categories: (1) global optimization algorithms [ 13 , 14 , 15 , 16 ]; (2) non-iterative algorithms [ 17 , 18 , 19 ]; and (3) sparsity constraint-based algorithms [ 20 , 21 , 22 ].…”

Section: Introductionmentioning

confidence: 99%

“…In the past several decades, the pattern synthesis problem of the sparse array has been extensively studied [ 13 , 14 , 15 , 16 , 17 , 18 , 19 , 20 , 21 , 22 ]. The typical synthesis methods of sparse arrays can be summarized into three categories: (1) global optimization algorithms [ 13 , 14 , 15 , 16 ]; (2) non-iterative algorithms [ 17 , 18 , 19 ]; and (3) sparsity constraint-based algorithms [ 20 , 21 , 22 ]. Nevertheless, most of these methods are designed for PAs, and the research on beampattern synthesis for sparse FDA is still lacking.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Efficient Beampattern Synthesis for Sparse Frequency Diverse Array via Matrix Pencil Method

Shao

Zhang

et al. 2022

Sensors

View full text Add to dashboard Cite

Due to the introduction of frequency offsets, the pattern synthesis problem of sparse Frequency diverse array (FDA) becomes more complicated than that of the phased array. A typical way to solve this problem is to use a global optimization algorithm, but this is usually time-consuming. In this paper, we propose an efficient non-iterative beampattern synthesis approach for sparse FDA. For a given reference pattern, which can be generated by other synthesis methods, we first sample it uniformly and construct the Hankel matrix with the sampled data. By low-rank processing, a low-rank approximation version of the Hankel matrix can then be obtained. Finally, the matrix enhancement and matrix pencil (MEMP) and matrix pencil (MP) methods are applied to estimate the antenna positions, frequency offsets, and excitations of the obtained array from the approximated matrix. Besides this, two typical FDA frameworks including multi-carrier FDA (MCFDA) and standard FDA (SFDA) are considered. Numerical simulation results prove that the proposed method outperforms the existing methods in terms of synthesis error, average runtime, and percentage of saving elements.

show abstract

“…After the sampling, we have

where

and

. With the sampled data, the block Hankel matrix

can be obtained as follows [ 27 ]:

in which K and L are pencil parameters, which should be chosen such that

and

with M being the element number of reference pattern [ 18 ]. Then the singular value decomposition of the matrix

is performed as

where

and

are unitary matrices.…”

Section: Proposed Synthesis Methods For Sparse Fdamentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Efficient Beampattern Synthesis for Sparse Frequency Diverse Array via Matrix Pencil Method

Shao

Zhang

et al. 2022

Sensors

View full text Add to dashboard Cite

show abstract

“…Later on, the Iterative Fourier Technique (IFT) [ 8 ] as well as its derived IFT-based algorithms [ 9 , 10 ] and more recent dynamic programming [ 11 ] have been successfully applied to large array thinning. Another solution is the nonuniformly distributed arrays, e.g., [ 12 , 13 , 14 , 15 , 16 ]. Though they may outperform thinned arrays in many aspects theoretically, the interelement spacing is changed, which violates the nature of the uniform distribution.…”

Section: Introductionmentioning

confidence: 99%

Synthesis of Planar Circular Arrays with Quantized Amplitude Weights

Chen

2021

Sensors

View full text Add to dashboard Cite

A new stepwise and radially processed method for synthesizing uniformly distributed circular planar arrays with quantized weights is proposed in this paper. This method is based on a generalized analytical equation describing that for high directivity focusing arrays, minimizing the weighted mean square error between the reference pattern and the synthesized pattern is equivalent to minimizing the mean square error between the radial cumulative distributions of the reference distribution and the synthesized distribution. This principle has been successfully performed for designing large concentric ring arrays, and in this paper, we extend its use for synthesizing uniformly distributed planar circular arrays with quantized weights. Various numerical examples and comparisons with several reported statistical methods in terms of the lowest Maximum SideLobe Level (MSLL) demonstrate the effectiveness of the proposed method.

show abstract

“…As an important research direction of antenna arrays, the theory of array synthesis has attracted more and more attention because it can be applied to customizing the patterns and impedance matching. Therefore, many optimization methods based on analytical methods [1]- [6], stochastic algorithms [7]- [10], convex optimization [11]- [13] and hybrid methods [14]- [17] have been proposed for array synthesis problems in recent years. The above methods have shown excellent performances in many array synthesis problems; however, they all consider the elements in the arrays to be ideal models and the mutual coupling effects among the elements are ignored, which could cause two problems.…”

Section: Introductionmentioning

confidence: 99%

An ANN-Based Synthesis Method for Nonuniform Linear Arrays Including Mutual Coupling Effects

2020

View full text Add to dashboard Cite

This paper proposes an artificial neural network (ANN)-based synthesis method for nonuniform linear arrays with mutual coupling effects. The proposed method can simultaneously optimize the location distributions and excitations of the elements. As is well known, for nonuniform linear arrays, the mutual coupling effects on the active element patterns (AEPs) and passive S parameters vary with the location distribution of the elements. However, few papers have focused on how to describe the relationship between the effects of mutual coupling and the location distribution of the elements. In this paper, we use several parallel and independent ANNs to characterize the effects of mutual coupling on the AEPs and passive S parameters in nonuniform linear arrays with variable location distributions. At the same time, to relieve the curse of dimensionality, we make use of the idea of subarrays, which makes it possible for the proposed method to model nonuniform linear arrays with a large number of elements. After building accurate ANN models, we make use of the adaptive differential evolution algorithm JADE to search for the optimal location distribution and the excitations of the elements, to satisfy the requirements for the radiation pattern and the active S parameters of the antenna array. In view of the fact that the mutual coupling effects are accounted for in the synthesis process, the proposed method probably exhibits more practical value in antenna array designs than in other synthesis methods. The validity and efficiency of the proposed method are confirmed based on three examples. INDEX TERMS Artificial neural networks, Mutual coupling effects, Nonuniform linear antenna arrays, Subarray.

show abstract

An Efficient Approach for the Synthesis of Large Sparse Planar Array

Cited by 39 publications

References 21 publications

Efficient Beampattern Synthesis for Sparse Frequency Diverse Array via Matrix Pencil Method

Efficient Beampattern Synthesis for Sparse Frequency Diverse Array via Matrix Pencil Method

Synthesis of Planar Circular Arrays with Quantized Amplitude Weights

An ANN-Based Synthesis Method for Nonuniform Linear Arrays Including Mutual Coupling Effects

Contact Info

Product

Resources

About