Array pattern synthesis via sparse weight vector finding and convex programming

Authors:
Hui Chen;Qun Wan;An Min Huang;Juan Wang
Affiliations:
Department of Electrical Engineering, University of Electronic Science and Technology, Chengdu, China;Department of Electrical Engineering, University of Electronic Science and Technology, Chengdu, China;Department of Electrical Engineering, University of Electronic Science and Technology, Chengdu, China;Department of Electrical Engineering, University of Electronic Science and Technology, Chengdu, China
Venue:
WiCOM'09 Proceedings of the 5th International Conference on Wireless communications, networking and mobile computing
Year:
2009

Citing 3
Cited 0

Synthesis of unequally spaced arrays by simulated annealing

IEEE Transactions on Signal Processing
Antenna array pattern synthesis via convex optimization

IEEE Transactions on Signal Processing
Optimal array pattern synthesis using semidefinite programming

IEEE Transactions on Signal Processing

Quantified Score

Hi-index	0.00

Visualization

Abstract

In array pattern synthesis, smaller aperture or fewer elements are expected to obtain the desired array performance. In this paper, a novel approach is proposed to design a non-uniform array with a desired pattern. First, this problem is formulated as finding a sparse weight vector. Second, the antenna elements corresponding to nonzero values of the sparse weight vector are retained to form the non-uniform array. Finally, the weight vector of the non-uniform array is optimized via convex programming. Numerical examples are provided to verify the superior performance of the proposed method.