An alternating iterative algorithm for the synthesis of complex-excitation and pattern reconfigurable planar sparse array

An efficient algorithm is presented to reduce the number of antenna elements for a complex-excitation and pattern reconfigurable planar array. The approach alternately iterates between two procedures. One procedure involves a multiple measurement vectors (MMV) sparse recovery process for minimizing the number of antenna elements and finding multiple sets of complex-valued excitations for multiple different patterns. The other procedure is a local optimization for the real-valued positions of the elements. Results from a set of numerical experiments are presented to assess its performance in terms of the computational efficiency and the ability to reduce the number of antenna elements while maintaining array pattern characteristics. An alternating iterative algorithm for planar sparse array synthesis is presented.A sparse processing technique is used to minimize the number of antenna element.A local optimization is performed for refining the real-valued element positions.

[1]  Tao Dong,et al.  Synthesis of planar sparse arrays by perturbed compressive sampling framework , 2016 .

[2]  W. Keizer.  Large Planar Array Thinning Using Iterative FFT Techniques , 2009, IEEE Transactions on Antennas and Propagation.

[3]  Bhaskar D. Rao,et al.  Sparse solutions to linear inverse problems with multiple measurement vectors , 2005, IEEE Transactions on Signal Processing.

[4]  T. Isernia,et al.  An Effective Approach to the Synthesis of Phase-Only Reconfigurable Linear Arrays , 2012, IEEE Transactions on Antennas and Propagation.

[5]  D. L. Donoho,et al.  Compressed sensing , 2006, IEEE Trans. Inf. Theory.

[6]  Paolo Rocca,et al.  Optimal Synthesis of Reconfigurable Planar Arrays With Simplified Architectures for Monopulse Radar Applications , 2015, IEEE Transactions on Antennas and Propagation.

[7]  J. Tropp.  Algorithms for simultaneous sparse approximation. Part II: Convex relaxation , 2006, Signal Process..

[8]  Vittorio Murino,et al.  Synthesis of unequally spaced arrays by simulated annealing , 1996, IEEE Trans. Signal Process..

[9]  Yuantao Gu,et al.  Retrieval of sparse solutions of multiple-measurement vectors via zero-point attracting projection , 2012, Signal Process..

[10]  Dale J. Shpak,et al.  Synthesis of Linear and Planar Arrays With Minimum Element Selection , 2014, IEEE Transactions on Signal Processing.

[11]  Stéphane Canu,et al.  $\ell_{p}-\ell_{q}$ Penalty for Sparse Linear and Sparse Multiple Kernel Multitask Learning , 2011, IEEE Transactions on Neural Networks.

[12]  Qing Huo Liu,et al.  Reducing the Number of Elements in Multiple-Pattern Linear Arrays by the Extended Matrix Pencil Methods , 2014, IEEE Transactions on Antennas and Propagation.

[13]  M. D'Urso,et al.  Maximally Sparse Arrays Via Sequential Convex Optimizations , 2012, IEEE Antennas and Wireless Propagation Letters.

[14]  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.

[15]  Jianwei Ma,et al.  Compressed sensing by inverse scale space and curvelet thresholding , 2008, Appl. Math. Comput..

[16]  Kesong Chen,et al.  Synthesis of Sparse Planar Arrays Using Modified Real Genetic Algorithm , 2007 .

[17]  Alex B. Gershman,et al.  Sparse Array Design for Azimuthal Direction-of-Arrival Estimation , 2011, IEEE Transactions on Signal Processing.

[18]  Rabab Kreidieh Ward,et al.  Algorithms to Approximately Solve NP Hard Row-Sparse MMV Recovery Problem: Application to Compressive Color Imaging , 2012, IEEE Journal on Emerging and Selected Topics in Circuits and Systems.

[19]  Xinpeng Du,et al.  A heuristic search algorithm for the multiple measurement vectors problem , 2014, Signal Process..

[20]  Federico Viani,et al.  Reconfigurable sum-difference pattern by means of parasitic elements for forward-looking monopulse radar , 2013 .

[21]  Yaakov Tsaig,et al.  Extensions of compressed sensing , 2006, Signal Process..

[22]  Chee Seng Tan,et al.  Sparse Array 3-D ISAR Imaging Based on Maximum Likelihood Estimation and CLEAN Technique , 2010, IEEE Transactions on Image Processing.

[23]  Qing Huo Liu,et al.  Synthesis of Sparse or Thinned Linear and Planar Arrays Generating Reconfigurable Multiple Real Patterns by Iterative Linear Programming , 2016 .

[24]  Woon-Seng Gan,et al.  Nonlinear least-square solution to flat-top pattern synthesis using arbitrary linear array , 2005, Signal Process..

[25]  A. Massa,et al.  Compressive Sensing Pattern Matching Techniques for Synthesizing Planar Sparse Arrays , 2013, IEEE Transactions on Antennas and Propagation.

[26]  A. Massa,et al.  Bayesian Compressive Sampling for Pattern Synthesis With Maximally Sparse Non-Uniform Linear Arrays , 2011, IEEE Transactions on Antennas and Propagation.

[27]  Yang Feng,et al.  Sparse array synthesis with regularized FOCUSS algorithm , 2013, 2013 IEEE Antennas and Propagation Society International Symposium (APSURSI).

[28]  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.

[29]  J Rashed-Mohassel,et al.  Flat-Top Footprint Pattern Synthesis Through the Design of Arbitrary Planar-Shaped Apertures , 2010, IEEE Transactions on Antennas and Propagation.

[30]  Kristine L. Bell,et al.  Explicit Ziv-Zakai bound for analysis of DOA estimation performance of sparse linear arrays , 2013, Signal Process..