Pattern synthesis of linear arrays using a hybrid optimization algorithm

A hybrid optimization algorithm that is used in pattern synthesis of linear arrays is introduced The proposed algorithm combines Schelkunoff´s zero placement method and genetic algorithm (GA). The problem of pattern synthesis is transformed into searching proper roots of Schelkunoff´s polynomial in complex plane. Some roots are placed in term of s of the desired pattern, and GA is used to search other roots. When computing side lobes of the pattern, an accelerated algorithm is used to reduce the burden of computation.