Reducing the Number of Elements in Linear and Planar Antenna Arrays With Sparseness Constrained Optimization

The synthesis of sparse antenna arrays has many practical applications in situations where the weight, size and cost of antennas are limited. In this communication the antenna array synthesis problem, with minimum number of elements, is studied from the new perspective of sparseness constrained optimization. The number of antenna elements in the array can be efficiently reduced by casting the array synthesis problem into the framework of sparseness constrained optimization and solving with the Bayesian compressive sensing (BCS) inversion algorithm. Numerical examples of both linear and planar arrays are presented to show the high efficiency of achieving the desired radiation pattern with a minimum number of antenna elements.

[1]  B. P. Kumar,et al.  Generalized analytical technique for the synthesis of unequally spaced arrays with linear, planar, cylindrical or spherical geometry , 2005, IEEE Transactions on Antennas and Propagation.

[2]  Constantine A. Balanis,et al.  Antenna Theory: Analysis and Design , 1982 .

[3]  D. Donoho,et al.  Atomic Decomposition by Basis Pursuit , 2001 .

[4]  Cheong Boon Soh,et al.  Breast Lesion Classification Using Ultrawideband Early Time Breast Lesion Response , 2010, IEEE Transactions on Antennas and Propagation.

[5]  A. Rydberg,et al.  Synthesis of uniform amplitude unequally spaced antenna arrays using the differential evolution algorithm , 2003 .

[6]  Edward A. Parker,et al.  Fabry-Perot approach to the design of double layer FSS , 1996 .

[7]  Kesong Chen,et al.  Synthesis of Sparse Planar Arrays Using Modified Real Genetic Algorithm , 2007, IEEE Transactions on Antennas and Propagation.

[8]  Yilong Lu,et al.  Sidelobe reduction in array-pattern synthesis using genetic algorithm , 1997 .

[9]  Z. Nie,et al.  Reducing the Number of Elements in a Linear Antenna Array by the Matrix Pencil Method , 2008, IEEE Transactions on Antennas and Propagation.

[10]  Lawrence Carin,et al.  Bayesian Compressive Sensing , 2008, IEEE Transactions on Signal Processing.

[11]  Joel A. Tropp,et al.  Greed is good: algorithmic results for sparse approximation , 2004, IEEE Transactions on Information Theory.

[12]  V. Fusco,et al.  The effect of a SiO/sub 2/ interface layer on CPW lines and Schottky barrier diodes on HRS substrates , 1998, 1998 Topical Meeting on Silicon Monolithic Integrated Circuits in RF Systems. Digest of Papers (Cat. No.98EX271).

[13]  Michael E. Tipping,et al.  Fast Marginal Likelihood Maximisation for Sparse Bayesian Models , 2003 .

[14]  Ye Jianfeng,et al.  Immune algorithm in array-pattern synthesis with side lobe reduction , 2008, 2008 International Conference on Microwave and Millimeter Wave Technology.

[15]  Z. Nie,et al.  The Application of a Modified Differential Evolution Strategy to Some Array Pattern Synthesis Problems , 2008, IEEE Transactions on Antennas and Propagation.

[16]  E. Rajo-Iglesias,et al.  Ant Colony Optimization in Thinned Array Synthesis With Minimum Sidelobe Level , 2006, IEEE Antennas and Wireless Propagation Letters.

[17]  Vincent Fusco,et al.  Polarisation independent bandpass FSS , 2007 .

[18]  Michael E. Tipping,et al.  Analysis of Sparse Bayesian Learning , 2001, NIPS.

[19]  G. N. Watson,et al.  Linear Arrays with Arbitrarily Distributed Elements , 1956 .

[20]  Z. Nie,et al.  Reducing the Number of Elements in the Synthesis of Shaped-Beam Patterns by the Forward-Backward Matrix Pencil Method , 2010, IEEE Transactions on Antennas and Propagation.

[21]  LianLin Li,et al.  A Sparse Bayesian Estimation Framework for Conditioning Prior Geologic Models to Nonlinear Flow Measurements , 2009, ArXiv.

[22]  B. P. Kumar,et al.  Design of unequally spaced arrays for performance improvement , 1999 .