Professional Documents
Culture Documents
Side Lobe Level Reduction of Linear Antenna Arrays PDF
Side Lobe Level Reduction of Linear Antenna Arrays PDF
Abstract— Side lobe level (SLL) reduction has a great importance in recent communication
systems. It is considered as one of the most important applications of digital beamforming since
it reduces the effect of interference arriving outside the main lobe. This interference reduction
increases the capacity of the communication systems. In this paper, our home made synthesis
scheme that is based on the Method of Moments and the Genetic Algorithm to synthesize linear
antenna arrays is utilized. The algorithm accepts a desired radiation pattern and provides the
excitation coefficients that realize the required pattern. If this pattern is applied to the synthesis
scheme, it results in the optimum element spacing and the excitation coefficients that lead to
maximum SLL reduction with a minimum number of array elements. The MoM/GA scheme
provides SLL reduction with exactly the same half power beamwidth (HPBW) as the original
array pattern.
1. INTRODUCTION
Many research efforts attempted to reduce the SLL of the linear antenna arrays by introducing
non-uniform spacing between the antenna array elements and position perturbation with the aid
of the GA algorithms [1–8]. An iterative method for SLL reduction by introducing non-uniform
spacing between the antenna elements was introduced in [1]. The amplitude of the excitation is
assumed to be constant. This iterative method suffers some drawbacks such as; the small reduction
in the SLL and the half power beamwidth broadening which corresponds to the reduction in the
SLL. More attempts in SLL reduction of linear antenna arrays by changing the spaces among array
elements in terms of GA was introduced in [6]. Unfortunately, this algorithm is limited for antenna
arrays of little number of antenna elements and the more the number of elements, the less the
benefit from non-uniform allocation.
Position perturbation of the array elements is used for reducing the SLL of phased antenna
arrays [7]. It results in a reduction in the SLL at the central part of the visible region but with
higher side lobes at both sides of the pattern, which requires special treatment by using directional
elements in the array structure. Other attempts for SLL reduction are presented in [8] using the real
coded genetic algorithm (RGA) optimization technique. The RGA results in a uniformly spaced
array structure with much larger array size than the original array structure.
In this paper, the MoM/GA algorithm [9] is utilized to synthesis the low SLL radiation pattern.
The input to the algorithm is the desired radiation pattern and the output is the excitation coef-
ficients and the element spacing. The key issue in the SLL reduction is the synthesis of a desired
pattern having smooth behavior that permits the array synthesis with minimum number of array
elements.
2. PROBLEM FORMULATION
The array factor of a linear antenna array consisting of M isotropic antenna elements positioned
symmetrically along the z-axis with uniform element spacing d is given by:
M
X µ µ ¶ ¶
M +1
AF (θ) = an exp j n − kd cos θ (1)
2
n=1
where an is the excitation coefficient of the nth element, d is the element spacing, and k = 2π/λ is
the free space wave number [1]. Recently, we presented a synthesis technique based on a combination
between the method of moments and the genetic algorithm (MoM/GA) [9]. The MoM/GA is
utilized to reconstruct new element locations and excitations that fulfill the required characteristics
in the desired pattern. This synthesis method has shown its ability of reducing the number of
Progress In Electromagnetics Research Symposium Proceedings, KL, MALAYSIA, March 27–30, 2012 1329
elements for linear arrays with pencil-beam patterns and shaped-beam patterns as mentioned in [9].
In this paper, the capabilities of this method are extended to synthesize the linear antenna arrays
with maximum SLL reduction with minimum number of antenna elements. The algorithm is based
on solving a system of linear equations which is written in a matrix form as
[Z]M ×M [I]M ×1 = [V ]M ×1 (2)
The aim of this paper is to introduce a scheme for filling the matrix [V ]M ×1 in order to achieve
the minimum side lobe level that corresponds to a specific number of array elements. The matrix
[V ]M ×1 has the complete information about the desired radiation pattern.
The procedure starts by generating a pattern AF (Θ), original pattern, of a known linear antenna
array that achieves the required beamwidth. This pattern is multiplied by a rectangular function
shaping function of the same beamwidth in order to remove the side lobes. The shaping function
is designed as follows µ ¶
Θ − φo
fshaping (Θ) = rect (4)
w
where φo is the main beam direction with respect to the array line and w is the width of the
rectangular pulse which equals the main lobe widest beamwidth. Multiplying the original pattern
by the appropriate shaping function, we get the shaped pattern as follows
AF shaped (Θ) = AF (Θ) × fshaping (Θ) (5)
The resulting shaped pattern AF shaped (Θ) will be raised by a certain level h allowing the smooth
extension of the pattern slightly above the zero level. The raised AF sh raised (Θ) pattern is given
by µ ¶
Θ − φo
AF sh raised (Θ) = AF shaped (Θ) + h × rect (6)
w
where h is the amplitude of the rectangular function that represents the raising level of the shaped
pattern.The raised pattern AF sh raised (Θ) values will be raised to an exponent n in order to keep
the desired beamwidth that is changed slightly by raising the pattern by the level h. This process
contributes greatly in smoothing the desired pattern in such a way that it prevents the appearance
of the undesired harmonics that affect the SLL.The resultant pattern is applied as the desired
pattern within the synthesis scheme presented in [9] such that AF d (Θ) = [AF sh raised (Θ)]n . In this
case, the elements of the vector [V ]M ×1 are given by
Zπ
n −j (m− M2+1 )kd cos(Θ)
Vm = [AF sh raised (Θ)] e dΘ (7)
0
In addition to the use of GA to optimize the spacing between elements, it is also utilized to get
the optimum n and h that achieves the minimum SLL. The Cost Function (CF) to be minimized
is given by
|SLLo − SLLs |
CF = 1 − (8)
|SLLo |
where SLLo and SLLs are the side lobe levels of the original and synthesized patterns respectively.
The GA optimization tool in Matlab is used to estimate the optimum values of d, n, and h while
the corresponding excitation coefficients are determined using Eq. (2) applying the MoMFor λ/2
arrays the initial value of d is set to d = 0.5λ and theGA optimization process for d, n, and h is
performed within the ranges 0.5λ ≤ d ≤ 0.95λ ,1 ≤ n ≤ 2 and L− ≤ h ≤ L− + 5 where L− is the
height of the negative portion of the shaped pattern. The optimization process is done under the
constraint that the HPBW does not change its value.
1330 PIERS Proceedings, Kuala Lumpur, MALAYSIA, March 27–30, 2012
Table 1: Element spacing, SLL, and HPBW of the synthesized arrays with 24, 20, 18, and 16 antenna
elements, compared to the analytical 24-elements λ/2 uniform array.
Figure 1: (a) Shaping function. (b) Shaped pattern. (c) Shaped pattern with positive offset.
Figure 2: The synthesized radiation pattern with 24 Figure 3: Synthesized radiation pattern with 20 el-
elements. ements, and d = 0.896λ element spacing.
same HPBW. The excitation coefficients, the element spacing, and the HPBW of the synthesized
patterns are listed in Table 1 compared to the analytical Uniform array. For clarity, the synthesized
pattern at M = 20 is shown in Fig. 3.
4. CONCLUSION
In this paper, a new scheme based on a combination between the MoM, and the GA is presented for
linear antenna arrays synthesis with maximum side lobe level reduction. The MoM/GA scheme aims
to determine the optimum uniform element spacing and the excitation coefficients that guarantee
maximum SLL reduction without affecting the main lobe beamwidth. In addition, SLL reduction
is performed with a reduced number of antenna elements. The MoM/GA algorithm results in
extremely low SLLs using only a few tens of GA iterations. It is characterized by a fast convergence,
and a less computational complexity compared to other methods such as the RGA algorithm and
the position perturbation algorithm.
REFERENCES
1. Hodjat, F. and S. Hovanessian, “Nonuniformly spaced linear and planar array antennas for
sidelobe reduction,” IEEE Transactions on Antennas and Propagation, Vol. 26, No. 2, 198–204,
Mar. 1978.
2. Yan, K.-K. and Y. L. Lu, “Sidelobe reduction in array-pattern synthesis using genetic algo-
rithm,” IEEE Transactions on Antennas and Propagation, Vol. 45, No. 7, Jul. 1997.
3. Ares-Pena, F. J., J. A. Rodriguez-Gonzalez, E. Villanueva-Lopez, and S. R. Rengarajan, “Ge-
netic algorithms in the design and optimization of antenna array patterns,” IEEE Transactions
on Antennas and Propagation, Vol. 47, No. 3, Mar. 1999.
4. Kumar, B. P. and G. R. Branner, “Design of unequally spaced arrays for performance im-
provement,” IEEE Transactions on Antennas and Propagation, Vol. 47, No. 3, Mar. 1999.
1332 PIERS Proceedings, Kuala Lumpur, MALAYSIA, March 27–30, 2012
5. Marcano, D. and F. Duran, “Synthesis of antenna arrays using genetic algorithms,” IEEE
Antennas Propagat. Magazine, Vol. 42, No. 3, Jun. 2000.
6. Tian, Y. and J. Qian, “Improve the performance of a linear array by changing the spaces
among array elements in terms of genetic algorithm,” IEEE Transactions on Antennas and
Propagation, Vol. 53, No. 7, 2226–2230, Jul. 2005.
7. Sayidmarie, K. H. and A. H. Aboud, “Improvement of array radiation pattern by element
position perturbation,” 5th International Multi-Conference on Systems, Signals and Devices,
IEEE SSD, 1–6, Jul. 20–22, 2008.
8. Das, S., S. Bhattacherjee, D. Mandal, and A. K. Bhattacharjee , “Optimal sidelobe reduction
of symmetric linear antenna array using genetic algorithm,” Annual IEEE India Conference
(INDICON), 1–4, Dec. 17–19, 2010.
9. Hussein, A. H., H. H. Abdullah, A. M. Salem, S. Khamis, and M. Nasr, “Optimum design of
linear antenna arrays using a hybrid MoM/GA algorithms,” IEEE Antennas Wireless Propag.
Lett., in press.
10. Balanis, C. A., Antenna Theory: Analysis and Design, 3rd Edition, Wiley, New York, 2005.