IEEE TRANSACTIONS ON ANTENNAS AND PROPAGATION, VOL. 62, NO.

12, DECEMBER 2014

6123

The Filter Diagonalization Method in Antenna Array

Optimization for Pattern Synthesis
Jiazhou Liu, Student Member, IEEE, Zhiqin Zhao, Senior Member, IEEE, Mengqing Yuan,
Gary A. Ybarra, Senior Member, IEEE, and Qing Huo Liu, Fellow, IEEE

AbstractPattern synthesis of nonuniform antenna arrays has

drawn significant attention because of its wide applications. With
the aim of reducing the number of elements in linear and planar
arrays, this paper introduces a novel non-iterative method based
on the filter diagonalization method (FDM), which was originally
applied in the problem of identifying and quantifying chemical
molecules with nuclear magnetic resonance (NMR) in quantum
mechanical formalism. The proposed method samples the data
set from the desired discrete pattern and associates the sample
data with a time autocorrelation function of a fictitious dynamical
system, which is described by an effective Hamiltonian operator
that contains the array element information. The Hamiltonian
operator can be decomposed by a set of orthonormal eigenvectors.
Therefore, the original pattern synthesis is converted into solving
the general eigenvalue decomposition with Krylov bases. The
number of nonuniform array elements depends on the number
of the Krylov bases and the sample data. The proposed method
can obtain an optimized antenna array to reconstruct the desired
radiation pattern with a high accuracy. Numerical examples show
that proposed FDM pattern synthesis can use less prior knowledge
to achieve the desired pattern with highly sparse antenna arrays.
Index TermsFilter diagonalization method (FDM), general
eigenvalue decomposition, linear and planar arrays, pattern
synthesis, sparse antenna array.

I. INTRODUCTION

NTENNA arrays have attracted growing attention in a

wide range of applications such as sonar, radar, and mobile communications. The goal of the array pattern synthesis is
to find appropriate element excitations and element positions
for the nonuniform linear and planar arrays to yield the desired radiation pattern. Owing to the advantages of lower cost,
Manuscript received November 25, 2013; revised August 05, 2014; accepted
October 01, 2014. Date of publication October 24, 2014; date of current version
November 25, 2014. This work was supported in part by the Joint Ph.D. Fellowship Program of the China Scholarship Council under Grant 201206070039, in
part by the Natural Science Foundation of China under Grants 61032010 and
61171044.
J. Liu is with the School of Electronic Engineering, University of Electronic
Science and Technology of China (UESTC), Sichuan 611731, China, and also
with the Department of Electrical and Computer Engineering, Duke University,
Durham, NC 27708 USA (e-mail: jiazhou.liu@gmail.com).
Z. Zhao is with the School of Electronic Engineering, University of Electronic
Science and Technology of China (UESTC), Sichuan 611731, China (e-mail:
zqzhao@uestc.edu.cn).
M. Yuan is with Wave Computation Technologies Corporation, Durham, NC
27707 USA (e-mail: yuanmengqing@yahoo.com).
G. A. Ybarra and Q. H. Liu is with Department of Electronic Engineering,
Duke University, Durham, NC 27708 USA (e-mail: gary@ee.duke.edu;
qhliu@ee.duke.edu).
Color versions of one or more of the figures in this paper are available online
at http://ieeexplore.ieee.org.
Digital Object Identifier 10.1109/TAP.2014.2364818

lighter weight and compact area by reducing the number of

elements in the array, pattern synthesis has been widely applied in MIMO radar systems, phased array radar and satellite
communications, etc.
In the past decades, several algorithms have been proposed
to solve the antenna array synthesis problem. The conventional
algorithms, such as the DolphChebyshev [1] and the Taylor
methods [2], are well known for synthesizing arrays with narrow
beam and low sidelobes in uniformly spaced arrays. However,
the antenna arrays obtained from these methods are densely
spaced: The array requires a large number of elements to radiate the desired pattern. A large array limits the applications,
especially radar on aircraft or satellite. Recently, new array synthesis techniques for nonuniform spacing are developed. Parameter optimization algorithms, such as the differential evolution algorithm (DEA) [3][5], the genetic algorithm (GA) [6]
and the particle swarm optimization (PSO) method [7][10],
are successful in solving this problem. However, the capabilities of finding a global optimal solution in these methods can be
improved. The element excitations optimization with a convex
form [11][14], techniques based on the compressive sensing
(CS) [15], and Bayesian compressive sensing (BCS) have been
developed in addition to Zhang et al. [16] and Oliveri et al. [17],
[18] for designing the maximally sparse linear arrays by optimizing the element excitations and positions. However, conventional optimization solvers have a relatively high computational cost scaling for very large problems. A new non-iterative synthesis algorithm based on the matrix pencil method
(MPM), which can reduce the elements efficiently, was proposed in [19][21]. However, it can be only applied for linear
array and required a much higher sampling rate than Nyquist
sampling theorem. There are also other types of methods such
as analytical method [22] and synthesis techniques [23][25],
but limitations are still existing.
For planar array, the pattern synthesis for minimizing the
number of elements is still a challenging problem. The sparseness constrained optimization (SpaCO) [16] and convex method
[26] are popular due to the high performance for small planar
arrays. However, the conventional methods do not scale well
for large 2-D array pattern synthesis because they use a large
number of samples; our experience with such algorithms show
that they may even fail to simulate for large number of unknowns. Therefore, challenges still exist in the 2-D pattern synthesis problem.
This paper proposes a new non-iterative method based on the
filter diagonalization method (FDM), which can reconstruct the
desired pattern with a low number of antenna elements in linear

0018-926X 2014 IEEE. Personal use is permitted, but republication/redistribution requires IEEE permission.
See http://www.ieee.org/publications_standards/publications/rights/index.html for more information.

6124

IEEE TRANSACTIONS ON ANTENNAS AND PROPAGATION, VOL. 62, NO. 12, DECEMBER 2014

and planar arrays. The FDM was designed by Neuhauser [27] in

a quantum-mechanical formalism for chemical purity and spectrometer performance. Mandelshtam and Taylor [28] reformulated it for a conventional problem of processing a time signal
with uniform sampling. The application of FDM in finite-difference time-domain (FDTD) is proposed first in [29]. The method
is demonstrated by finding eigenmodes and frequencies of an
electromagnetic resonant cavity. The main idea is to extract
the complex frequencies
and amplitudes
from a signal
in a small frequency interval by
recasting the harmonic inversion problem into a small matrix
diagonalization. This method consists of three steps. First, a fictitious dynamical Hamiltonian evolution operator with complex eigenvalues (representing the array element positions) and
some initials are produced from a time autocorrelation function which is sampled from the desired discrete pattern data
set. Then, we use an orthogonal eigenvector to diagonalize the
Hamiltonian operator. Thus, the problem of extracting the
eigenvalues is now equivalent to diagonalize the Hamiltonian
operator with an appropriately chosen base set. Both the operator and the overlap matrix are evaluated on the sampling
points of the desired discrete pattern. Finally, the problem is then
cast into a generalized complex symmetric eigenvalue problem
and is solved by the general eigenvalue decomposition method.
Therefore, The rearrangements of excitation and location distributions for the new antenna array with a reduced number of
elements are obtained from the eigenvectors and eigenvalues.
Several simulations show the desired pattern is reconstructed
well with fewer elements than existing methods.
The paper is organized as follows. In Section II, the linear and
planar mode methodologies for applying FDM are introduced.
The pattern synthesis based on 1-D and 2-D FDM analysis in
linear and planar mode is presented in Section III. The simulation results are shown in Section IV. The last section presents
the conclusions.
II. METHODOLOGY AND FORMULATION

Suppose

is uniformly distributed in

:
(3)

where the number of samples is

,
is the sample
interval. The desired pattern function can be written as
(4)
where
. According to the Nyquist sampling theorem,
the condition that
must be satisfied, where
. For instance,
for the -element array with a uniform spacing of
[19].
Second, 2-D antenna arrays with the specialties of low sidelobe level (SLL) and narrow mainlobe are usually used in application of the spacecraft communication and the phased array
radar. For a uniformly spaced
planar array with
isotropic elements, assuming a plane wave of wavelength is
impinging on the array in the
direction, where and denote the elevation and azimuth angles, respectively. Along the
direction
and
, the array beam
pattern can be defined as [26]
(5)
. Sampling
where the complex array weights is
the planar pattern function with a uniform step, (5) can be
written

(6)
and
are sample numbers of -axis and -axis,
where
and
are the sample intervals, respectively.
B. Notations for Quantum Mechanics

A. Linear and Planar Models for Pattern Synthesis

First, we investigate the 1-D pattern synthesis. The array radiation pattern is based on the multiplication of the array element
pattern and array factor. For a linear array with
isotropic elements, the far field array factor is considered:

In order to conveniently describe the FDM, there are some

basis definitions shown. Here, we employ Bra-ket notation to
express quantum states. In an -dimensional Hilbert space,
can be represented as a column vector
. The
row vector with the same elements is denoted by
. It is so
called because the inner product of two states is denoted by

(1)

(7)

,
, is the wavelength. , and
where
are the location and the complex excitation coefficient of the th
element, respectively. is the angle between the direction of
observation and the linear array geometry.
The objective is to synthesize a new linear antenna array with
a minimized number of elements to achieve the desired pattern
as
. Let
and
. Equation (1) can be
written as

denotes a linear operator with

Here, the construction
matrix elements
so that
.
Operators can be viewed as acting on bras from the right-hand
side. If is a linear operator,
is a ket, and
is a bra, then
is another bra defined by the rule

(2)

(8)
this expression is commonly written as
.
In quantum mechanics, the overlap expression
is typically interpreted as the probability amplitude for the state to

LIU et al.: FILTER DIAGONALIZATION METHOD IN ANTENNA ARRAY OPTIMIZATION FOR PATTERN SYNTHESIS

collapse into the state . Mathematically, this represents the coefficient for the projection of onto . it is also described as the
projection of state onto state .
Let
be the initial state of the system, and
be the state
at time . This state is supposed to represent the system in the
same physical state at time. These two states can differ by a
multiplicative factor
,
.

Lemma: A set of Krylov base

,
,
with
, can be generated by propagating the initial
state,
and the evolution operator . So to consider the
Krylov base [30], it can be generated by the Hamiltonian evolution operator and initials:
(13)
Based on (7), the matrix element of
written as

C. FDM in 1-D and 2-D [30], [31]

and amplitudes
with a
To obtain the frequencies
given input signal
is a nonlinear problem. Here, we investigate the 1-D FDM first. The input signal can be expressed as
a given form
. To associate the given
signal, a time autocorrelation function of a fictitious dynamical
system is described by an effective complex symmetric Hamiltonian operator with complex eigenvalues
as follows:
(9)
where the round bracket pair is defined as a complex symmetric
inner product,
, without complex conjugation.
is a fictitious dynamical Hamiltonian operator,
which contains the complex eigenvalues
.
is the initial
state which does not need to be known explicitly.
is the
discrete input signal, consisting of samples of the desired array
factor pattern, amplitude, and phase.
Suppose that can be diagonalized by a set of orthonormal
eigenvectors,
. With the theorem of a diagonzalizable matrix, can be written as
(10)
where
and
are the eigenvalues and the corresponding
eigenvectors, respectively.
,
is
unit vector.
Inserting (8) into (7), the input signal can be written as
with
(11)
Therefore, the solutions for eigenvalue
and amplitude
are equivalent to diagonalizing the Hamiltonian or,
equivalently, the evolution operator
. So, we rewrite
(8) as
(12)
where
is the eigenvalue and
is the eigenvector. Through above procedures, the original nonlinear fitting
problem is converted into an eigenvalue problem in a linear algebraic. That is, one diagonalization of yields all the desired
parameters.
Here, the initials
, Hamiltonian operator , and are
unknown, thus (12) cannot be solved directly. However, these
matrix elements are determined by the input signal
with an
appropriately chosen base. The base, which is not necessarily
orthonormal, can be chosen in several different ways [31].

6125

in this base can be

(14)

since the base is not orthonormal, the overlap matrix element is

(15)
where
is the overlap matrix and
is that of . Equation
(10) can be cast into a generalized complex symmetric eigenvalue expression
(16)
is the eigenvector matrix. The eigenvalues determine
where
the frequency components of the input signal, while the eigenvectors determine the amplitudes and the phase of the components. Thus, at most
points can be uniquely fitted to a
signal whose number of samples is [27].
The 2-D FDM [32] is similar to the 1-D FDM. To associate
the sample data, a double time correlation function with two
commuting non-Hermitian symmetric Hamiltonians
and
with complex eigenvalues
is designed as
follows:
(17)
where
,
,
and
are the sample
intervals. The Hamiltonians are diagonalized by the same set of
eigenvectors, the equation is converted into
(18)
Thus the fitting problem is recast into a 2-D generalized
complex symmetric eigenvalue problem with Krylov base as
follows:
(19)
where
is represented as in each dimension, and
is represented as eigenvalue in each dimension. The two eigenvalues
can be obtained by a general eigenvalue solver. The complex
amplitudes are obtained by the eigenvectors in the same way as
that in 1-D.
III. PATTERN SYNTHESIS WITH MINIMUM ARRAY
A. Pattern Synthesis for a Linear Array
As described in Section II, the desired pattern (4) has a corresponding representation in FDM. The frequencies from eigenvalues and complex amplitudes from eigenvectors in FDM are
referred to as the element positions and excitations in antenna
array, respectively. Therefore, the desired discrete array factor

6126

IEEE TRANSACTIONS ON ANTENNAS AND PROPAGATION, VOL. 62, NO. 12, DECEMBER 2014

pattern data set is initialized as the input signal. The 1-D time
autocorrelation function is equal to the sampled desired pattern

TABLE I
POSITION AND EXCITATION OF THE RECONSTRUCTED PATTERN FROM THE
CHEBYSHEV ARRAY WITH N SAMPLING DATA

(20)
is given from the dewhere is the sampling number,
sired pattern data set, is the sample interval. According to the
Nyquist sampling theorem, the condition that
must be satisfied, where
.
for a
-element array with a uniform spacing of
[19].
Theoretically, the minimum number of sampling points to reconstruct the pattern of a -element uniformly spaced array is
. With the Krylov base in (14) and (15), the matrix
elements of and overlap matrix are obtained as
(21)
(22)
The Krylov base size is
at most, which is represented as the number of a nonuniform array elements. Then, the
problem for obtaining the array positions and excitations which
has a nonlinear solution is cast into a generalized complex symmetric eigenvalue problem

where
,
.
For any time vector
,
is equal to the
overlap matrix in each dimension,
and
, respectively. The planar array locations can be obtained by the real
part of eigenvalues of (27) and the amplitudes of the array can
be obtained as that in 1-D FDM
(28)

(23)
.
are eigenwhere
values that contain the element locations .
is the eigenvectors matrix, and the excitations
can be expressed as
(24)
The locations of antenna in the array are derived from the real
part of eigenvalues , and which can be expressed as
(25)

B. Pattern Synthesis in a Planar Array

The pattern synthesis of planar array using the 2-D FDM is
similar to the linear pattern synthesis through the 1-D FDM. A
double-time correlation function of a fictitious quantum system
with two commuting non-Hermitian symmetric Hamiltonians
and
is based on the 2-D desired discrete pattern data

(26)
,
.
,
are the sampling
where the vector
intervals, respectively.
Then, the operator eigenvalue problem can be converted into
two generalized eigenvalue problems with the Krylov base
(27)

IV. NUMERICAL SIMULATIONS

In this section, five numerical simulations are presented to
validate the effectiveness of the proposed method for both linear
and planar sparse antenna array synthesis. Here, we employ
the root mean square error to describe the error between the
desired array factor and the reconstructed array factor (MSE,
,
and
are represented as desired array factor and reconstructed array
factor, respectively).
A. Synthesis of the 1-D Chebyshev Pattern
In this example, the desired radiation pattern comes from the
Chebyshev array [1], which uses a 20-element array with the
dB. The distance between two
sidelobe level (SLL) SLL
adjacent elements is
. According to the Nyquist theorem, the required minimum number of sampling points to reconstruct the desired pattern is 19. The MPM [19] uses 41 sampling data to reconstruct a satisfactory approximation. The FDM
only needs 29 sampling data to obtain the same approximation,
which means the proposed method needs less prior knowledge
than MPM. Moreover, the MPM cannot get much better performance than FDM for this same sampling number of 29. From the
simulation, the designed pattern based on the FDM only requires
a 13-element nonuniform array. As a comparison, the SpaCO
[16] and the BCS [17] need 14 nonuniform elements. The details
of the positions and excitations are in [16], [17]. Even though
the SeCO [14] and MPM [19] can obtain a 13nonuniform elements array. However, the SeCO is an iterative method, which
is much more time-consuming. Table I shows the antenna locations and excitation amplitudes to achieve the desired pattern
by Chebyshev, MPM, SeCO, and the FDM with 29 sampling
data in this paper. The MSE between the desired pattern and the

LIU et al.: FILTER DIAGONALIZATION METHOD IN ANTENNA ARRAY OPTIMIZATION FOR PATTERN SYNTHESIS

Fig. 1. Reconstruction of the Chebyshev pattern with MPM, SpaCO, and FDM.
TABLE II
POSITION AND EXCITATION OF THE RECONSTRUCTED PATTERN FROM THE
CHEBYSHEV ARRAY WITH
SAMPLING DATA

Fig. 2. Reconstruction of the Chebyshev pattern by

6127

sampling.

TABLE III
POSITION AND EXCITATION OF THE RECONSTRUCTED PATTERN FROM THE
TAYLORKAISER ARRAY WITH N SAMPLING DATA

reconstructed pattern is
. However, the MSE of the
MPM, which is using the same sampling points as the FDM, is
and the MSE of the SeCO is
. In Fig. 1,
the line with circles is the reference pattern. The dotted line
with squares is that reconstructed by the MPM. The dash dotted
line with triangles and diamond are obtained by the SpaCO and
SeCO method. The dash line with asterisks comes from the proposed method.
Our investigation shows that the desired pattern can also be
obtained with only 12 nonuniform array elements with 25 pattern sampling data through the FDM and the MPM. The MSE
of the FDM and the MPM are
and
,
respectively. With this error level, the performance of the proposed method is still acceptable. The FDM has a smaller MSE
than MPM with the same sampling. The CPU time for this is
0.0624 s, which is much faster than the SpaCO. The positions
and excitations with 12 elements are listed in Table II and the
Fig. 2 shows the performance of the proposed method.
B. Synthesis of the 1-D Taylor-Kaiser Pattern
This example comes from [2], which uses a 29-element
TaylorKaiser array with the SLL
dB to generate the
desired radiation pattern. The distance between two adjacent
elements is
. With the Nyquist theorem, the sampling
data should be 28 at least. The [19] uses 17 elements based on
59 sampling data to reconstruct pattern with a
error level.
Here, a nonuniform array with 17 elements is designed using 37
sampling points to reconstruct a satisfactory approximation of
the desired pattern by FDM. The MSE between the synthesized
pattern and desired radiation pattern is
. When
the number of sampling points decreases further, the FDM
performance degrades, but it is still acceptable. The MSE of
the FDM is
when 36 sampling data are used. As
a comparison, the MSE of the MPM is
. In this
simulation, the SpaCO, BCS need 18 elements to reconstruct

Fig. 3. Reconstruction of the TaylorKaiser pattern with MPM, SpaCO, and

FDM.

the pattern, and the SeCO needs 17 antennas with a nonuniform

layout. Table III shows the antenna locations and the excitation
amplitudes for different methods and different samplings. Fig. 3
is the pattern comparison with the desired pattern in MPM,

6128

IEEE TRANSACTIONS ON ANTENNAS AND PROPAGATION, VOL. 62, NO. 12, DECEMBER 2014

TABLE IV
NUMBER OF THE NONUNIFORM ARRAY AND
MSE BETWEEN SEVERAL METHODS

THE

Fig. 4. Reconstruction of the Chebyshev large array pattern with 309 sampling
points.

SpaCO, SeCO, and FDM. The solid line with circles is the
desired pattern. The dotted line with squares is designed by the
MPM. The dash dotted lines with triangles and diamonds are
obtained by the SpaCO and SeCO. The dash line with asterisks
is reconstructed by the proposed method. The simulation shows
the SpaCO not only uses one more element than the FDM, but
also the accuracy is worse than the FDM.
C. Synthesis of the Large Linear Pattern
Here, we employ a large linear array to illustrate the efficiency of the FDM in optimizing the pattern synthesis with a
minimum number of array elements. A 300-element Chebyshev
array with SLL
dB is designed to generate the desired
pattern. We choose 309 sampling data as the input for the FDM.
The synthesized pattern is presented in Fig. 4. The solid line denotes the desired pattern and the dash line are obtained by the
proposed method. The total number of elements is 153 and the
array length is
. As a comparison, the minimum element
number is 224 by the SCO [16], and the SeCO [14] fails due to
the large array number. In [19], the element number used and
the error level are same as the FDM. However, 601 sampling
data are used as an input for getting error at the
level. The
FDM only needs 309 sampling data as an input. The MSEs of the
MPM and FDM with 309 samples are
and
,
respectively. This example shows the proposed method requires
fewer sampling points and has a smaller MSE compared to the
MPM. The savings in the number of elements is almost 50%
for this case in which the SCO only saves 25%. Meanwhile, the
CPU time of the large array synthesis is 8 s, which is much less
than the CVX, the SCO, and the BCS.
For convenience, Table IV shows the comparison with
SpaCO, BCS, CVX, SeCO, MPM and the proposed method
in the number of elements and the MSE in linear array. It is
easily seen that the proposed method has very high accuracy
and saves computational time for using nonuniform arrays to
reconstruct the given pattern.
D. Synthesis of the Planar Array Pattern
From above, we observe the MPM is also an effective method
for 1-D pattern synthesis, but unfortunately the MPM cannot be
directly used in 2-D arrays. Here we show that the FDM is applicable to 2-D array pattern synthesis. The beam patterns are

Fig. 5. 3-D Chebyshev pattern of the 1024-element planar array in [9].

Fig. 6. 3-D reconstructed pattern of the 361-element planar array with the proposed method.

plotted in Fig. 4. It can be achieved by a 1024-element uniform array through the synthesis method [9], which has SLL
dB and
. The desired pattern is shown
in Fig. 5. The synthesized beam pattern is given by a 3-D radiation pattern with 361 elements in Fig. 6. Meanwhile, the
MSE between the desired pattern and the synthesized pattern
is
. However, the 496 elements are used in the SCO
[16]. In FDM, a total of 1521 samples of the radiation pattern are
used at different azimuth and elevation angles. The SCO needs
a total of 2500 samples for this procedure. Obviously, the proposed method required over 50% fewer array elements, and is
more efficient than the SCO. The comparison of the radiation
patterns in the E-plane is presented in Fig. 7.

LIU et al.: FILTER DIAGONALIZATION METHOD IN ANTENNA ARRAY OPTIMIZATION FOR PATTERN SYNTHESIS

6129

time is 20 s. In contrast, the method based on the convex optimization [14], [15] has much more computational cost and
cannot handle this problem size.
V. CONCLUSION

Fig. 7. Comparison of the radiation pattern in the E-cut.

A new algorithm based on the filter diagonalization method

has been proposed for linear and planar array pattern synthesis.
The nonlinear pattern-matching problem with the Krylov base
is reformulated into a linear general eigenvalue problem and is
successfully solved with fewer data samples. By using the proposed method, the desired patterns are reconstructed by nonuniformly spaced linear or planar arrays with fewer elements than
uniformly spaced arrays. Numerical validations show its effectiveness for different reference patterns and array sizes. The
simulations show that compared to CVX, SCO, and BCS, FDM
can obtain the desired pattern with fewer elements. The element
count obtained from MPM is the same as FDM. However, the
FDM uses fewer samples than the MPM and achieves better
MSE performance. Furthermore, unlike MPM, FDM also can
handle the 2-D planar pattern synthesis efficiently. That means
the FDM requires less prior knowledge than other methods to
obtain a more accurate reconstruction.
REFERENCES

Fig. 8. 3-D desired radiation pattern of the 8000-element planar array.

Fig. 9. 3-D reconstructed radiation pattern of the 2385-element planar array.

E. Synthesis of the Large Planar Array Pattern

In this example, the proposed method shows the efficiency
and time saving in a large 2-D planar array. The desired radiation pattern is shown in Fig. 8, which represents an 8000-element uniform array with SLL
dB in the -axis and
SLL
dB in the -axis. The element spacing in each
dimension is one-half wavelength. The reconstructed radiation
pattern is given in Fig. 9 and the number of elements is 2385
with 9540 sampling points. The MSE between the desired pattern and reconstructed pattern is
. The computational

[1] R. S. Elliot, Antenna Theory and Design. Englewood Cliffs, NJ,

USA: Prentice-Hall, 1981.
[2] C. A. Constantine and A. Balanis, Antenna Theory. New York, NY,
USA: Wiley, 1997.
[3] D. G. Kurup, M. Himdi, and A. Rydberg, Synthesis of uniform amplitude unequally spaced antenna array using the differential evolution algorithm, IEEE Trans. Antennas Propag., vol. 55, no. 12, pp.
22102217, Dec. 2007.
[4] R. Li, L. Xu, X. W. Shi, N. Zhang, and Z. Q. Lv, Improved differential
evolution strategy for antenna array pattern synthesis, Progr. Electromagn. Res., vol. 113, pp. 429441, 2011.
[5] X. Li, W. T. Li, X. W. Shi, J. Yang, and J. F. Yu, Modified differential
evolution algorithm for pattern synthesis of antenna arrays, Progr.
Electromagn. Res., vol. 137, pp. 371388, 2013.
[6] K. K. Yan and Y. Lu, Sidelobe reduction in array-pattern synthesis
using genetic algorithm, IEEE Trans. Antennas Propag., vol. 45, pp.
11171122, Jul. 1997.
[7] P. J. Bevelacqua and C. A. Balanis, Minimum sidelobe levels for
linear arrays, IEEE Trans. Antennas Propag., vol. 55, pp. 22102217,
Dec. 2007.
[8] W. T. Li, X. W. Shi, and Y. Q. Hei, An improved particle swarm
optimization algorithm for pattern synthesis of phased arrays, Progr.
Electromagn. Res., vol. 82, pp. 319332, 2008.
[9] J. Ye and W. Pand, Immune algorithm in array-pattern synthesis with
side lobe reduction, in Proc. Int. Conf. Microw. Millimeter Wave
Technol., 2008, vol. 3, pp. 11271130.
[10] S. E. Nai, W. Ser, Z. L. Yu, and S. Rahardia, Beampattern synthesis
with linear matrix inequalities using minimum array sensors, Progr.
Electromagn. Res. M, vol. 9, pp. 165176, 2009.
[11] I. D. Dotlic and A. J. Zejak, Arbitrary antenna array pattern synthesis
using minimal algorithm, Electron. Lett., vol. 37, no. 4, pp. 206208,
Feb. 2001.
[12] S. F. Yan and J. M. Hovem, Array pattern synthesis with robustness
against manifold vectors uncertainty, IEEE J. Ocean. Eng., vol. 33,
no. 4, pp. 405413, Oct. 2008.
[13] H. G. Hoang, H. D. Tuan, and B.-N. Vo, Low-dimensional SDP
formulation for large antenna array synthesis, IEEE Trans. Antennas
Propag., vol. 55, no. 6, pp. 17161725, Jun. 2007.
[14] G. Priso and M. DUrso, Maximally sparse arrays via sequential
convex optimization, IEEE Trans. Antennas Wireless Propag. Lett.,
vol. 11, pp. 192195, 2012.
[15] H. Chen, Q. Wan, and R. Fan, Beampattern synthesis using
reweighted l1-norm minimization and array orientation diversity,
Radioengineering, vol. 22, no. 2, pp. 602609, Jun. 2013.
[16] W. J. Zhang, L. Li, and F. Li, Reducing the number of elements in
linear and planar antenna arrays with sparseness constrained optimization, IEEE Trans. Antennas Propag., vol. 59, no. 8, pp. 31063111,
Aug. 2011.

6130

IEEE TRANSACTIONS ON ANTENNAS AND PROPAGATION, VOL. 62, NO. 12, DECEMBER 2014

[17] G. Oliveri and A. Massa, Bayesian compressive sampling for pattern synthesis with maximally sparse non-uniform linear arrays, IEEE
Trans. Antennas Propag., vol. 59, no. 2, pp. 467481, Feb. 2011.
[18] G. Oliveri, M. Carlin, and A. Massa, Complex-weight sparse linear
array synthesis by Bayesian compressive sampling, IEEE Trans. Antennas Propag., vol. 60, no. 5, pp. 23092326, May 2012.
[19] Y. H. Liu, Z. P. Nie, and Q. H. Liu, Reducing the number of elements
in a linear antenna array by the matrix pencil method, IEEE Trans.
Antennas Propag., vol. 56, no. 9, pp. 29552962, Sep. 2008.
[20] Y. H. Liu, Q. H. Liu, and Z. P. Nie, Reducing the number of elements
in the synthesis of shaped-beam patterns by the forward-backward matrix pencil method, IEEE Trans. Antennas Propag., vol. 58, no. 2, pp.
604608, Feb. 2010.
[21] Y. H. Liu, Z. P. Nie, and Q. H. Liu, A new method for the synthesis
of non-uniform linear arrays with shaped power patterns, Progr. Electromagn. Res., vol. 107, pp. 349363, 2010.
[22] B. P. Kumar and G. R. Branner, Generalized analytical technique for
the synthesis of unequally spaced arrays with linear, planar, cylindrical
or spherical geometry, IEEE Trans. Antennas Propag., vol. 53, no. 2,
pp. 621633, Feb. 2005.
[23] A. Monorchio and S. Genovesi, An efficient interpolation scheme
for the synthesis of linear arrays based on Schelkunoff polynomial
method, IEEE Trans. Antennas Wireless Propagat. Lett., vol. 6, pp.
484487, 2007.
[24] F. B. T. Marchaud, G. D. de Villiers, and E. R. Pike, Element
positioning for linear arrays using generalized Gaussian quadrature,
IEEE Trans. Antennas Wireless Propagat. Lett., vol. 51, no. 6, pp.
13571363, Jun. 2003.
[25] P. Jarske, T. Sramaki, S. K. Mitra, and Y. Neuvo, On the properties
and design of nonuniformly spaced linear arrays, IEEE Trans. Acoust.,
Speech, Signal Process., vol. 36, no. 3, pp. 372380, Mar. 1988.
[26] S. E. Nai, W. Ser, Z. L. Yu, and H. W. Chen, Beampattern synthesis
for linear and planar arrays with antenna selection by convex optimization, IEEE Trans. Antennas Propag., vol. 58, no. 12, pp. 39233930,
Dec. 2010.
[27] M. R. Wall and D. Neuhauser, Extraction, through filter diagonalization, of general quantum eigenvalues or classical normal mode frequencies from a small number of residues or a short time segment of
a signal. I. theory and application to a quantum dynamics model, J.
Chem. Phys., vol. 102, p. 8011, 1995, 10.1063/1.468999.
[28] V. A. Mandelshtam and H. S. Taylor, Harmonic inversion of time
signals and its applications, J. Chem. Phys., vol. 107, p. 6756, 1997,
10.1063/1.475324.
[29] G. R. Werner and J. R. Cary, Extracting degenerate modes and frequencies from time-domain simulations with filter-diagonalization, J.
Comput. Phys., vol. 227, pp. 52005214, 2008.
[30] J. H. Chen, Nonlinear methods for high resolution spectral analysis
and their applications in nuclear magnetic resonance experiments,
Ph.D. dissertation, Univ. of California, Irvine, CA, USA, 2002.
[31] H. Hu, Q. N. Van, V. A. Mandelshtam, and A. J. Shaka, Reference
deconvolution, phase correction, line listing of NMR spectra by the
1-D filter diagonalization method, J. Magn. Resonance, vol. 134, pp.
7687, 1998.
[32] V. A. Mandelshtam, H. S. Taylor, and A. J. Shaka, Application of
the filter diagonalization method to one- and two-dimensional NMR
spectra, J. Magn. Resonance, vol. 133, pp. 304312, 1998.

Jiazhou Liu (S13) was born in 1988. He received

the B.S. degree in communication engineering from
the University of Electronic Science and Technology
of China (UESTC), Chengdu, in 2009. He is now
working toward the Ph.D. degree at the UESTC.
Since September 2012, he has been a Visiting
Researcher in the Department of Electrical and
Computer Engineering, Duke University, Durham,
NC, USA, under the financial support from the China
Scholarship Council. His research interests include
array signal processing and conformal antenna array.

Zhiqin Zhao (SM05) received the B.S. and M.S.

degrees in electronic engineering from the University of Electronic Science and Technology of China
(UESTC), Chengdu, and the Ph.D. degree in electrical engineering from Oklahoma State University,
Stillwater, OK, USA, in 1990, 1993, and 2002, respectively.
From 1996 to 1999, he was with the Department of
Electronic Engineering, UESTC. From 2000 to 2002,
he researched rough surface scattering as a Research
Assistant with the School of Electrical and Computer
Engineering, Oklahoma State University.
Dr. Zhao is a member of the Phi Kappa Phi honor society.

Mengqing Yuan received the B.S. degree in electrical power engineering from the Huazhong University of Science and Technology, Wuhan, China, in
1995, the M.S. degree in applied science from Vrije
Universiteit Brussel, Brussels, Belgium, in 2000, and
the Ph.D. degree from Duke university, Durham, NC,
USA, in 2011.
He was a Mechanical Designer of hydro turbines
for six years in China after graduation from HUST
in 1995. In 2005, he joined Wave Computation
Technologies. His research interests include computational electromagnetics, microwave circuit designs, hybrid solvers for EM
and circuits, B field antennas, and elastic waves.

Gary A. Ybarra (S86M86SM06) was born in

Hampton, VA, USA, on May 13, 1960. He received
the B.S., M.S., and Ph.D. degrees from North Carolina State University, Raleigh, NC, USA, in 1983,
1986, and 1992, respectively, all in electrical and
computer engineering.
He is currently a Professor of the Practice and Director of Undergraduate Studies with the Department
of Electrical and Computer Engineering, Duke University, Durham, NC. His research interests include
radar signal processing and microwave imaging.

Qing Huo Liu (S88M89SM94F05) received

the B.S. and M.S. degrees in physics from Xiamen
University, Fujian Province, China, in 1983 and
1986, respectively, and the Ph.D. degree in electrical engineering from the University of Illinois at
Urbana-Champaign, Urbana, IL, USA, in 1989.
He was with the Electromagnetics Laboratory,
University of Illinois at Urbana-Champaign, as a Research Assistant from September 1986 to December
1988, and as a Postdoctoral Research Associate from
January 1989 to February 1990.
He was a Research Scientist and Program Leader with Schlumberger-Doll
Research, Ridgefield, CT, USA, from 1990 to 1995. From 1996 to May 1999,
he was an Associate Professor with New Mexico State University. Since June
1999, he was been with Duke University, Durham, NC, USA, where he is now
a Professor of Electrical and Computer Engineering. He is also a guest Chair
Professor at Xiamen University, Fujian, China. His research interests include
computational electromagnetics and acoustics, inverse problems, geophysical
subsurface sensing, biomedical imaging, electronic packaging, and the simulation of photonic and nano-devices. He has published more than 520 papers in
refereed journals and conference proceedings.
Dr. Liu is a Fellow of the Acoustical Society of America, a member of
Phi Kappa Phi, Tau Beta Pi, a full member of the U.S. National Committee
of URSI Commissions B and F. Currently he serves as the Deputy Editor in
Chief of Progress in Electromagnetics Research, an Associate Editor for IEEE
TRANSACTIONS ON GEOSCIENCE AND REMOTE SENSING, and an Editor for the
Journal of Computational Acoustics. He is also a Guest Editor in Chief of the
PROCEEDINGS OF THE IEEE for a special issue on large-scale computational
electromagnetics in 2013. He received the 1996 Presidential Early Career
Award for Scientists and Engineers (PECASE) from the White House, the 1996
Early Career Research Award from the Environmental Protection Agency, and
the 1997 CAREER Award from the National Science Foundation.