A Method of Sparse Plane Arrays Synthesis Based on Archimedean Spiral and Quantum Search Algorithm

A new method of sparse array synthesis based on quantum search algorithm is proposed. The method ensures the constraints include the number of elements, the array aperture and the minimum element spacing can still be satisfied by setting rational parameters of achimedean spiral reasonably when array elements are distributed along archimedean spiral. It turns the optimization problem of sparse plane array into the optimization of asymmetrical linear arrays, which will reduce the complexity of solving problems greatly. The quantum search algorithm (QSA) is a new global optimization methods, which is inspired by quantum mechanics theories, and has excellent global optimization performance. Nowadays, the application of QSA in sparse plane arrays synthesis is few. The method combines archimedean spiral and the QSA, make the sparse plane array produce lower peak sidelobe level (PSLL). The simulated results show that the approach is high efficiency and robust, and can apply to problem of sparse plane antenna array synthesis with the constraint of minimum element spacing and aperture.