Abstract

The study of linear arrays has been developed in different regions. The computerized techniques that appeared in this century motivated the researchers to find a new techniques that save time. In this work the method of succesive projection is used in solving the nonuniform space and phase arrays. This technique was used before to solve the nonuniform current arrays. The main concept of this method is to find a common point of many different sets. This point will have the best solution to satisfy all conditions. In this technique the solution of the set of inequalities is the main scope. The addition of one or more constraints to the array is only as adding one more set to the group of sets we have. This means that the solution of constrained arrays also is available. Several illustrations are discussed and compared with different other techniques. A simple program is available and easy to establish. In this work, the broadside direction pattern is divided into <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">180\deg</tex> that represent 180 sets. At each set the synthesized pattern must satisfy the desired pattern.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call