Synthesis of Large-Scale Sparse Array Using the Technology of Branch and Bound with Convex Optimization for Satellite Communication

This paper applies the technology of branch and bound with convex optimization to the synthesis of large-scale sparse array with low side lobe level for satellite communication. The branch and bound technology can decompose the optimization to several subproblems. The convex optimization can change optimized variable binary $[0,1]$ of the sparse array to the continues variable from 0 to 1. Finally, the fast and accurate convergence of the synthesis of large-scale sparse array is achieved.