# Sparse Planar Array Synthesis Using Matrix Enhancement and Matrix Pencil

Authors: Mei-yan Zheng; Ke-song Chen; Hong-gang Wu; Xian-pan Liu
Journal: International Journal of Antennas and Propagation
 (2013)

---

## Abstract

The matrix enhancement and matrix pencil (MEMP) plays important roles in modern signal processing applications. In this paper, MEMP is applied to attack the problem of two-dimensional sparse array synthesis. Firstly, the desired array radiation pattern, as the original pattern for approximating, is sampled to form an enhanced matrix. After performing the singular value decomposition (SVD) and discarding the insignificant singular values according to the prior approximate error, the minimum number of elements can be obtained. Secondly, in order to obtain the eigenvalues, the generalized eigen-decomposition is employed on the approximate matrix, which is the optimal low-rank approximation of the enhanced matrix corresponding to sparse planar array, and then the ESPRIT algorithm is utilized to pair the eigenvalues related to each dimension of the planar array. Finally, element positions and excitations of the sparse planar array are calculated according to the correct pairing of eigenvalues. Simulation results are presented to illustrate the effectiveness of the proposed approach.


---

## Body

## 1. Introduction

The question of nonuniform planar array synthesis with fewer number of elements for a desired beam pattern has been a popular concern since early in the 1970s. Reducing the number of elements in planar arrays has long been a problem both practical and theoretical significance being the subject of concern; for example, satellite communication system has limitation on the weight of antenna systems and subsystem accessories which wishes to use the minimum number of elements. Furthermore, fewer elements can lower the cost obviously and simplify the antenna system.The synthesis of nonuniform array elements’ positions, excitations, and phases is a complicated nonlinear problem which contains a number of decision variables. So far, there have been many technologies used to synthesize the nonuniform arrays, including optimization algorithm (such as genetic algorithm (GA) [1], differential evolution algorithm (DEA) [2], analytical methods [3, 4], matrix pencil method (MPM) [5], dynamic programming, and particle swarm optimization (PSO)) and other comprehensive technologies. However, some optimization algorithms such as GA, DEA, and PSO are suitable for solving nonlinear optimization of high dimension complex function, but they are very time consuming for their intrinsic iterative mechanism. Many other comprehensive approaches based on iteration do not guarantee that all variables are global optimal solutions. The new non iterative methods, called MPM [6, 7] and MEMP [8], have been successfully used by Yingbo Hua, Tapan K. S. and Odilon Pererira in the parameters estimation of a sum of complex exponentials, such as two-dimensional frequencies [8], azimuth/elevation angel [9], and two-dimensional DOA [10]. These years Liu and others find a new application in the synthesis of nonuniform array for MPM [5, 11].MPM is qualified to the synthesis of sparse planar array which is designed to a separable planar array by a product of two orthogonal linear sparse arrays [5]. It can guarantee the best features in the two principal plane patterns in this particular case, but it cannot at the same time guarantee that others have the same characteristics.Further expansion of MPM to the synthesis of inseparable distribution sparse planar array in this paper, just as in signal processing applications, the new method similarly called matrix enhancement and matrix pencil (MEMP) in synthesis of sparse arrays. The organization of this paper is listed as follows. In Section2, the optimal array model is presented. In Section 3, the idea of matrix enhancement and matrix pencil is introduced, and then the method will be applied to estimate the minimum number of elements and to calculate the locations and excitations of the new array. Section 4 introduces the essential steps of MEMP. Some numerical results are presented in Section 5 to show the efficiency of the proposed method. Finally, some conclusions are drawn in Section 6.


## 2. The Optimal Array Model

Assume an array ofN discrete similarly oriented identical elements arranged arbitrarily in a 3-D space, as shown in Figure 1. Denote the excitation in the ith element located at (ri,θi,ϕi) as Ri.Figure 1
Reference coordinates of an arbitrary array.According to the superposition theorem of electromagnetic waves, we can write the following array factor [12]:
(1)F(θ,φ)=∑i=1NRiexp[j(ϕi+kricosαi)],
where k=2π/λ, λ is the wavelength. Consider,
(2)cosαi=sinθsinθicos(ϕ-ϕi)+cosθcosθi,
where 0≤θ≤π, and 0≤ϕ≤2π are the azimuth and elevation, respectively.For the planar array, (1) can be simplified as
(3)F(u,v)=∑i=1NRiexp[jk(dxu+dyv)],
where dx and dy are the abscissa and ordinate of the ith element, and u=sinθcosϕ,v=sinθsinϕ.


## 3. MEMP to Synthesize Planar Array

### 3.1. Estimation of the Minimum Number of Elements

Matrix enhancement and matrix pencil is to use as few elements as possible to form a new planar array to approximate the desired pattern. Thus, the optimal mathematical is described as(4)min{Q}st.{Min∥F(u,v)-∑i=1QRi′exp[jk(dx′u+dy′v)]∥}≤ε,
where Ri′, dx′, and dy′ are the excitation, abscissa, and ordinate of the new planar array. L=2 because this paper uses the total least squares criteria.Firstly, to sample the desired pattern fromu=-1, v=-1 to u=1, v=1 uniformly, then um=mΔ=m/N, m=-N,…,0,…,N; vn=nΔ=n/N, n=-N,…,0,…,N, which has (2N+1)(2N+1) sampling points.The value of any sampling point is(5)f(m,n)=∑i=1NRiyimzin,
where yi=ejkdxΔ and zi=ejkdyΔ.Secondly, to construct an enhanced matrixXe using the sampling point data,
(6)Xe=[X0X1⋯X2N-K+1X1X2⋯X2N-K+2⋮⋮⋮XK-1XK⋯X2N],
where
(7)Xm=[x(m;0)x(m;1)⋯x(m;2N-L+1)x(m;1)x(m;2)⋯x(m;2N-L+2)⋮⋮⋮x(m;L-1)x(m;L)⋯x(m;2N)],
where x(m;n)=f(m-N;n-N). Xe is a Hankel block matrix and Xm is a Hankel matrix. The choice of parameters {K,L} must satisfy the following conditions:
(8)(K-1)L≥N,K(L-1)≥N,(2N+2-K)(2N+2-L)≥N.Thirdly, to perform the singular value decomposition (SVD) of the enhanced matrixXe,
(9)Xe=∑i=1minσiuiviH=UsΣsVsH+UnΣnVnHmin=min{KL,(2N+2-K)(2N+2-L)} which is the smaller dimension of Xe, and Us, Σs, and VS contain the N principal eigenvalues and eigenvectors. Un, Σn, and Vn contain the remaining eigenvalues and eigenvectors. Specifically,(10a)Us=[u1,u2,…,uN],(10b)Σs=diag{σ1,σ1,…,σN},(10c)VS=[v1,v2,…,vN],(10d)Un=[uN+1,uN+2,…,umin],(10e)Σn=diag{σN+1,σN+2,…,σmin},(10f)Vn=[vN+1,vN+2,…,vmin], where σ1≥σ2≥⋯≥σmin. The rank of enhanced matrix Xe is equal to the number of nonzero singular values. Generally, an array of N elements has N non-zero singular values; that is, σi>0(i=1,…,N), σi=0(i>N+1). So, Σn is equal to zero. Equation (9) can be simplified to
(11)Xe=UsΣsVsH.However, some literature results [13] show that the number of important singular values is much smaller than the total number of array elements, that is the unimportant elements’ contributions can be replaced by a combination of other elements. Therefore, we can discard the unimportant singular values to get a low-rank approximation of the enhanced matrix, which corresponds to the new array with fewer elements. The usual approach is to set these small singular values to zero. That is,
(12)XQ=UsΣQVsH,
where ΣQ=diag{σ1,σ1,…,σQ,0,…,0}, Q≤N.In the actual synthesis of array, the minimum value ofQ can be determined by the following formula [11]:
(13)Q=min{q;∣∑i=q+1Nσi2∑i=1qσi2<ε},
where ε is a small positive number, and the choice of ε depends on the approximation between the reconstructed pattern and the original pattern.


### 3.2. The Solutions of Eigenvaluesyi and zi

The eigenvalues are obtained by constructing two matrixs and solving the generalized eigenvalue of the matrixes [7, 8], then utilizing the ESPRIT algorithm in the literature [14] and pairing algorithm to estimate the correct pairing of yi and zi.


#### 3.2.1. Extractingyi

Once the low rank matrixXQ is obtained, to solve the eigenvalue yi is equal to solve the generalized eigenvalue of the following equation:
(14)(XQ,f-yXQ,l)v=0,
where XQ,f  and XQ,l  are obtained by deleting the first L rows and the last L rows of XQ. To solve (14) is equal to solve the generalized eigenvalue of the following equation:
(15)(U2-yU1)v=0,
where U2 and U1 are obtained by deleting the first L rows and the last L rows of UQ which contains only Q dominant left-singular vectors of Us in (11).Therefore, it can be obviously observed that the matrix pencilU2-yU1 can be expressed as
(16)(U2-yU1)=E1(Yd-yI)T,
where Yd is a diagonal matrix composed of the eigenvalues of {yi,i=1,…,Q}.


#### 3.2.2. Extractingzi

In order to extract another set of{zi,i=1,…,Q}, firstly introduce a permutation matrix P as
(17)P=[pT(1),pT(1+L),…,pT(1+(K-1)L),pT(2),pT(2+L),…,pT(1+(K-1)L),…,…,pT(L),pT(L+L),…,pT(1+(K-1)L)]T.The elementp(i) is a KL×1 vector with one at the ith position and zero everywhere else. Left multiplying Us by P, we can get
(18)UsP=PUs.According to (15), we can conclude that to solve the eigenvalues zi is equal to solve the generalized eigenvalues of the following equation:
(19)(U2P-zU1P)v=0,
where U2P and U1P are obtained by deleting the first K rows and the last K rows of UQP which contains only Q dominant left-singular vectors of UsP in (18).Therefore, it can be obviously observed that the matrix pencilU2P-zU1P can be expressed as
(20)(U2P-zU1P)=E1P(Zd-zI)T,
where Zd is a diagonal matrix composed of the eigenvalues of {zi,i=1,…,Q}.


#### 3.2.3. Pairing

According to (16) and (20), we can deduce that
(21)F1=U1+U2=T-1YdT,F2=U1P+U2P=T-1ZdT.
It can be seen from (21) that the pairing information of the eigenvalues is included in T.The eigenvalue decomposition of a linear combination ofF1 and F2 is computed to obtain a transformation diagonalizing of these two matrixs as follows:
(22)βF1+(1-β)F1=T-1DT.
The transformation T is applied to F1 and F2 to obtain the matrixs:
(23)Yd=TF1T-1,Zd=TF2T-1.
The values in the diagonal position of Yd and Zd determine the pairing.


### 3.3. To Solve Elements’ Excitations and Locations

Onceyi and zi are obtained, the locations can be solved according to (14) in the literature [13]; that is,
(24)dx′=1jkΔln(yi),dy′=1jkΔln(zi).As pointed in [9], a variety of synthetical examples show that, for the symmetrical pencil beam pattern, the imaginary parts of di′ are much smaller than the real parts. For example, the imaginary parts of di′ are ten orders smaller than the real parts for the synthesis of traditional Chebyshev planar pattern. Under this case, we can use the real parts of di′ directly. The elements’ locations are calculated as follows:
(25)dx′=1jkΔln(y^i),dy′=1jkΔln(z^i),
where
(26)y^i=yi|yi|,z^i=zi|zi|.The elements’ excitations can be obtained as follows:(27)R=EL+XeER+.
The diagonal elements of matrix R are Ri(i=1,…,Q) where
(28)EL+=(ELHEL)-1ELH,ER+=ERH(ERERH)-1,
where
(29)EL=[ZLYd-NZLYd-N+1⋮ZLYdK-N-1],ER=[ZR,YdZR,…,Yd2N-K+1ZR],
where
(30)ZL=[(z^1)-N(z^2)-N⋯(z^Q)-N(z^1)-N+1(z^2)-N+1⋯(z^Q)-N+1⋮⋮⋮(z^1)L-1-N(z^2)L-1-N⋯(z^Q)L-1-N],(31)yd=diag{y^1,y^2,…,y^Q},(32)ZR=[1z^1⋯(z^1)2N-L+11z^2⋯(z^2)2N-L+1⋮⋮⋮1z^Q⋯(z^Q)2N-L+1].


## 3.1. Estimation of the Minimum Number of Elements

Matrix enhancement and matrix pencil is to use as few elements as possible to form a new planar array to approximate the desired pattern. Thus, the optimal mathematical is described as(4)min{Q}st.{Min∥F(u,v)-∑i=1QRi′exp[jk(dx′u+dy′v)]∥}≤ε,
where Ri′, dx′, and dy′ are the excitation, abscissa, and ordinate of the new planar array. L=2 because this paper uses the total least squares criteria.Firstly, to sample the desired pattern fromu=-1, v=-1 to u=1, v=1 uniformly, then um=mΔ=m/N, m=-N,…,0,…,N; vn=nΔ=n/N, n=-N,…,0,…,N, which has (2N+1)(2N+1) sampling points.The value of any sampling point is(5)f(m,n)=∑i=1NRiyimzin,
where yi=ejkdxΔ and zi=ejkdyΔ.Secondly, to construct an enhanced matrixXe using the sampling point data,
(6)Xe=[X0X1⋯X2N-K+1X1X2⋯X2N-K+2⋮⋮⋮XK-1XK⋯X2N],
where
(7)Xm=[x(m;0)x(m;1)⋯x(m;2N-L+1)x(m;1)x(m;2)⋯x(m;2N-L+2)⋮⋮⋮x(m;L-1)x(m;L)⋯x(m;2N)],
where x(m;n)=f(m-N;n-N). Xe is a Hankel block matrix and Xm is a Hankel matrix. The choice of parameters {K,L} must satisfy the following conditions:
(8)(K-1)L≥N,K(L-1)≥N,(2N+2-K)(2N+2-L)≥N.Thirdly, to perform the singular value decomposition (SVD) of the enhanced matrixXe,
(9)Xe=∑i=1minσiuiviH=UsΣsVsH+UnΣnVnHmin=min{KL,(2N+2-K)(2N+2-L)} which is the smaller dimension of Xe, and Us, Σs, and VS contain the N principal eigenvalues and eigenvectors. Un, Σn, and Vn contain the remaining eigenvalues and eigenvectors. Specifically,(10a)Us=[u1,u2,…,uN],(10b)Σs=diag{σ1,σ1,…,σN},(10c)VS=[v1,v2,…,vN],(10d)Un=[uN+1,uN+2,…,umin],(10e)Σn=diag{σN+1,σN+2,…,σmin},(10f)Vn=[vN+1,vN+2,…,vmin], where σ1≥σ2≥⋯≥σmin. The rank of enhanced matrix Xe is equal to the number of nonzero singular values. Generally, an array of N elements has N non-zero singular values; that is, σi>0(i=1,…,N), σi=0(i>N+1). So, Σn is equal to zero. Equation (9) can be simplified to
(11)Xe=UsΣsVsH.However, some literature results [13] show that the number of important singular values is much smaller than the total number of array elements, that is the unimportant elements’ contributions can be replaced by a combination of other elements. Therefore, we can discard the unimportant singular values to get a low-rank approximation of the enhanced matrix, which corresponds to the new array with fewer elements. The usual approach is to set these small singular values to zero. That is,
(12)XQ=UsΣQVsH,
where ΣQ=diag{σ1,σ1,…,σQ,0,…,0}, Q≤N.In the actual synthesis of array, the minimum value ofQ can be determined by the following formula [11]:
(13)Q=min{q;∣∑i=q+1Nσi2∑i=1qσi2<ε},
where ε is a small positive number, and the choice of ε depends on the approximation between the reconstructed pattern and the original pattern.


## 3.2. The Solutions of Eigenvaluesyi and zi

The eigenvalues are obtained by constructing two matrixs and solving the generalized eigenvalue of the matrixes [7, 8], then utilizing the ESPRIT algorithm in the literature [14] and pairing algorithm to estimate the correct pairing of yi and zi.


### 3.2.1. Extractingyi

Once the low rank matrixXQ is obtained, to solve the eigenvalue yi is equal to solve the generalized eigenvalue of the following equation:
(14)(XQ,f-yXQ,l)v=0,
where XQ,f  and XQ,l  are obtained by deleting the first L rows and the last L rows of XQ. To solve (14) is equal to solve the generalized eigenvalue of the following equation:
(15)(U2-yU1)v=0,
where U2 and U1 are obtained by deleting the first L rows and the last L rows of UQ which contains only Q dominant left-singular vectors of Us in (11).Therefore, it can be obviously observed that the matrix pencilU2-yU1 can be expressed as
(16)(U2-yU1)=E1(Yd-yI)T,
where Yd is a diagonal matrix composed of the eigenvalues of {yi,i=1,…,Q}.


### 3.2.2. Extractingzi

In order to extract another set of{zi,i=1,…,Q}, firstly introduce a permutation matrix P as
(17)P=[pT(1),pT(1+L),…,pT(1+(K-1)L),pT(2),pT(2+L),…,pT(1+(K-1)L),…,…,pT(L),pT(L+L),…,pT(1+(K-1)L)]T.The elementp(i) is a KL×1 vector with one at the ith position and zero everywhere else. Left multiplying Us by P, we can get
(18)UsP=PUs.According to (15), we can conclude that to solve the eigenvalues zi is equal to solve the generalized eigenvalues of the following equation:
(19)(U2P-zU1P)v=0,
where U2P and U1P are obtained by deleting the first K rows and the last K rows of UQP which contains only Q dominant left-singular vectors of UsP in (18).Therefore, it can be obviously observed that the matrix pencilU2P-zU1P can be expressed as
(20)(U2P-zU1P)=E1P(Zd-zI)T,
where Zd is a diagonal matrix composed of the eigenvalues of {zi,i=1,…,Q}.


### 3.2.3. Pairing

According to (16) and (20), we can deduce that
(21)F1=U1+U2=T-1YdT,F2=U1P+U2P=T-1ZdT.
It can be seen from (21) that the pairing information of the eigenvalues is included in T.The eigenvalue decomposition of a linear combination ofF1 and F2 is computed to obtain a transformation diagonalizing of these two matrixs as follows:
(22)βF1+(1-β)F1=T-1DT.
The transformation T is applied to F1 and F2 to obtain the matrixs:
(23)Yd=TF1T-1,Zd=TF2T-1.
The values in the diagonal position of Yd and Zd determine the pairing.


## 3.2.1. Extractingyi

Once the low rank matrixXQ is obtained, to solve the eigenvalue yi is equal to solve the generalized eigenvalue of the following equation:
(14)(XQ,f-yXQ,l)v=0,
where XQ,f  and XQ,l  are obtained by deleting the first L rows and the last L rows of XQ. To solve (14) is equal to solve the generalized eigenvalue of the following equation:
(15)(U2-yU1)v=0,
where U2 and U1 are obtained by deleting the first L rows and the last L rows of UQ which contains only Q dominant left-singular vectors of Us in (11).Therefore, it can be obviously observed that the matrix pencilU2-yU1 can be expressed as
(16)(U2-yU1)=E1(Yd-yI)T,
where Yd is a diagonal matrix composed of the eigenvalues of {yi,i=1,…,Q}.


## 3.2.2. Extractingzi

In order to extract another set of{zi,i=1,…,Q}, firstly introduce a permutation matrix P as
(17)P=[pT(1),pT(1+L),…,pT(1+(K-1)L),pT(2),pT(2+L),…,pT(1+(K-1)L),…,…,pT(L),pT(L+L),…,pT(1+(K-1)L)]T.The elementp(i) is a KL×1 vector with one at the ith position and zero everywhere else. Left multiplying Us by P, we can get
(18)UsP=PUs.According to (15), we can conclude that to solve the eigenvalues zi is equal to solve the generalized eigenvalues of the following equation:
(19)(U2P-zU1P)v=0,
where U2P and U1P are obtained by deleting the first K rows and the last K rows of UQP which contains only Q dominant left-singular vectors of UsP in (18).Therefore, it can be obviously observed that the matrix pencilU2P-zU1P can be expressed as
(20)(U2P-zU1P)=E1P(Zd-zI)T,
where Zd is a diagonal matrix composed of the eigenvalues of {zi,i=1,…,Q}.


## 3.2.3. Pairing

According to (16) and (20), we can deduce that
(21)F1=U1+U2=T-1YdT,F2=U1P+U2P=T-1ZdT.
It can be seen from (21) that the pairing information of the eigenvalues is included in T.The eigenvalue decomposition of a linear combination ofF1 and F2 is computed to obtain a transformation diagonalizing of these two matrixs as follows:
(22)βF1+(1-β)F1=T-1DT.
The transformation T is applied to F1 and F2 to obtain the matrixs:
(23)Yd=TF1T-1,Zd=TF2T-1.
The values in the diagonal position of Yd and Zd determine the pairing.


## 3.3. To Solve Elements’ Excitations and Locations

Onceyi and zi are obtained, the locations can be solved according to (14) in the literature [13]; that is,
(24)dx′=1jkΔln(yi),dy′=1jkΔln(zi).As pointed in [9], a variety of synthetical examples show that, for the symmetrical pencil beam pattern, the imaginary parts of di′ are much smaller than the real parts. For example, the imaginary parts of di′ are ten orders smaller than the real parts for the synthesis of traditional Chebyshev planar pattern. Under this case, we can use the real parts of di′ directly. The elements’ locations are calculated as follows:
(25)dx′=1jkΔln(y^i),dy′=1jkΔln(z^i),
where
(26)y^i=yi|yi|,z^i=zi|zi|.The elements’ excitations can be obtained as follows:(27)R=EL+XeER+.
The diagonal elements of matrix R are Ri(i=1,…,Q) where
(28)EL+=(ELHEL)-1ELH,ER+=ERH(ERERH)-1,
where
(29)EL=[ZLYd-NZLYd-N+1⋮ZLYdK-N-1],ER=[ZR,YdZR,…,Yd2N-K+1ZR],
where
(30)ZL=[(z^1)-N(z^2)-N⋯(z^Q)-N(z^1)-N+1(z^2)-N+1⋯(z^Q)-N+1⋮⋮⋮(z^1)L-1-N(z^2)L-1-N⋯(z^Q)L-1-N],(31)yd=diag{y^1,y^2,…,y^Q},(32)ZR=[1z^1⋯(z^1)2N-L+11z^2⋯(z^2)2N-L+1⋮⋮⋮1z^Q⋯(z^Q)2N-L+1].


## 4. The Steps of MEMP

The essential steps of MEMP are summarized as follows.Step
1.  To sample the desired pattern uniformly and to construct an enhanced matrix Xe by the sampling data; Xe is shown as (6).Step
2.  To perform the singular value decomposition (SVD) of enhanced matrix Xe and to calculate the singular values and left singular vector Us.Step
3.  According to (13), to determine the minimum number of elements Q.Step
4.  According to (16) and (20), to extract the eigenvalues yi and zi, then to pair them as (22).Step
5.  According to (25) and (27), to solve the elements’ excitations and locations.


## 5. Simulation Results

In order to illustrate the effectiveness of MEMP, this paper gives two examples to reduce the number of elements and let the reconstructed array keep the characteristics of the original array.


### 5.1. Synthesis of Planar Array with Excitation of One

Suppose, there is a rectangular planar array with6×6 elements. The elements are arranged in a rectangular grid, dx=dy=λ/2, and the elements’ excitations are one. In this example, there are (2×36+1)(2×36+1) sampling points (by further increasing the sampling points will not improve the approximate accuracy of the pattern). The parameters K=L=37. According to (13), the required minimum number of elements is Q=25 when ε=10-5. The desired pattern and the reconstructed pattern are shown in Figure 2. The obtained sidelobe levels are −13.1525 dB and −13.1522 dB, respectively. Figure 3 compares the cross-section of the reconstructed pattern and the desired pattern. The figure shows that the array with Q=25 unequally spaced distribution of the elements can basically reconstruct the equally spaced distribution of the elements N=36. The example is to save 30% of the array elements. The elements’ locations of the equally and unequally spaced are shown in Figure 4. The equally spaced elements’ locations and the unequally spaced elements’ excitations and locations are shown in Table 1. Because the locations and excitations are symmetrically distributed, only the locations and excitations in the first quadrant are given.Table 1
The locations (excitations) of uniformly and nonuniformly spaced arrays.
The  locations of uniformly spaced array
The  locations (excitations) of nonuniformly spaced array
0.25, 1.25
0.75, 1.25
1.25, 1.25
0, 1.2308 (1.4579)
0.6423, 1.2308 (1.3936)
1.2308, 1.2308 (1.2226)
0.25, 0.75
0.75, 0.75
1.25, 0.75
0, 0.6423 (1.6619)
0.6423, 0.6423 (1.5886)
1.2308, 0.6423 (1.3936)
0.25, 0.25
0.75, 0.25
1.25, 0.25
0, 0 (1.7386)
0.6423, 0 (1.6619)
1.2308, 0 (1.4579)(a) The desired radiation pattern. (b) The reconstructed radiation pattern.
(a)
(b)Figure 3
The cross-section of the pattern.Figure 4
The elements’ location.


### 5.2. Synthesis of Chebyshev Planar

Suppose that there is a chebyshev planar array with6×6 elements. The elements are arranged in a rectangular grid, dx=dy=λ/2, and the required sidelobe level is −20 dB. In this example, there are (2×36+1)(2×36+1) sampling points, and the parameters K=L=37. Chebyshev planar array has the limitation of the number of elements in every row which is equal to the number of elements in every column which so, we use 5×5 elements to approximate the desired Chebyshev planar array. The desired pattern and the reconstructed pattern are shown in Figure 5. The obtained sidelobe level is −19.3058 dB. Figure 6 compares the cross section of the reconstructed pattern with the desired pattern. Although there is a slight elevation (0.694 dB) of the sidelobe level, we can save 30% elements. The elements’ locations of the equally and unequally spaced are shown in Figure 7. The elements’ excitations and locations of equally and unequally spaced arrays are shown in Table 2.Table 2
The locations (excitations) of Chebyshev and nonuniformly spaced array.
The  locations (excitations) of Chebyshev planar array
0.25, 1.25 (0.3654)
0.75, 1.25 (0.1822)
1.25, 1.25 (0.0364)
0.25, 0.75 (0.2640)
0.75, 0.75 (0.3917)
1.25, 0.75 (0.1822)
0.25, 0.25 (0.4503)
0.75, 0.25 (0.2640)
1.25, 0.25 (0.3645)
The  locations (excitations) of nonuniform planar array
−1.2319, −1.2463 (0.0538)
−0.6505, −1.2237 (0.3215)
−0.0914, −1.1991 (0.7001)
0.3336, −1.1513 (0.8382)
0.9598, −0.9605 (0.5520)
−1.2237, −0.7295 (0.2870)
−0.6472, −0.6505 (0.6144)
0, −0.6238 (0.6207)
0.6472, −0.5680 (0.9560)
1.2237, −0.3341 (0.5179)
−1.1513, −0.2376 (0.6953)
−0.5680, 0 (0.9462)
0, 0 (0.7766)
0.5680, 0 (0.8475)
1.1513, 0.2376 (0.3763)
−1.1981, 0.3341 (0.6218)
−0.5971, 0.6505 (0.6486)
0, 0.5680 (0.8748)
0.5971, 0.7295 (0.8196)
1.1981, 0.6238 (0.6182)
−0.9598, 0.9605 (0.5523)
−0.3336, 1.2237 (0.6272)
0.0914, 1.1991 (0.7050)
0.6505, 1.1513 (0.4298)
1.2319, 1.2463 (0.0526)(a) The Chebyshev radiation pattern. (b) The reconstructed radiation pattern.
(a)
(b)Figure 6
The cross section of the pattern.Figure 7
The elements’ locations.


## 5.1. Synthesis of Planar Array with Excitation of One

Suppose, there is a rectangular planar array with6×6 elements. The elements are arranged in a rectangular grid, dx=dy=λ/2, and the elements’ excitations are one. In this example, there are (2×36+1)(2×36+1) sampling points (by further increasing the sampling points will not improve the approximate accuracy of the pattern). The parameters K=L=37. According to (13), the required minimum number of elements is Q=25 when ε=10-5. The desired pattern and the reconstructed pattern are shown in Figure 2. The obtained sidelobe levels are −13.1525 dB and −13.1522 dB, respectively. Figure 3 compares the cross-section of the reconstructed pattern and the desired pattern. The figure shows that the array with Q=25 unequally spaced distribution of the elements can basically reconstruct the equally spaced distribution of the elements N=36. The example is to save 30% of the array elements. The elements’ locations of the equally and unequally spaced are shown in Figure 4. The equally spaced elements’ locations and the unequally spaced elements’ excitations and locations are shown in Table 1. Because the locations and excitations are symmetrically distributed, only the locations and excitations in the first quadrant are given.Table 1
The locations (excitations) of uniformly and nonuniformly spaced arrays.
The  locations of uniformly spaced array
The  locations (excitations) of nonuniformly spaced array
0.25, 1.25
0.75, 1.25
1.25, 1.25
0, 1.2308 (1.4579)
0.6423, 1.2308 (1.3936)
1.2308, 1.2308 (1.2226)
0.25, 0.75
0.75, 0.75
1.25, 0.75
0, 0.6423 (1.6619)
0.6423, 0.6423 (1.5886)
1.2308, 0.6423 (1.3936)
0.25, 0.25
0.75, 0.25
1.25, 0.25
0, 0 (1.7386)
0.6423, 0 (1.6619)
1.2308, 0 (1.4579)(a) The desired radiation pattern. (b) The reconstructed radiation pattern.
(a)
(b)Figure 3
The cross-section of the pattern.Figure 4
The elements’ location.


## 5.2. Synthesis of Chebyshev Planar

Suppose that there is a chebyshev planar array with6×6 elements. The elements are arranged in a rectangular grid, dx=dy=λ/2, and the required sidelobe level is −20 dB. In this example, there are (2×36+1)(2×36+1) sampling points, and the parameters K=L=37. Chebyshev planar array has the limitation of the number of elements in every row which is equal to the number of elements in every column which so, we use 5×5 elements to approximate the desired Chebyshev planar array. The desired pattern and the reconstructed pattern are shown in Figure 5. The obtained sidelobe level is −19.3058 dB. Figure 6 compares the cross section of the reconstructed pattern with the desired pattern. Although there is a slight elevation (0.694 dB) of the sidelobe level, we can save 30% elements. The elements’ locations of the equally and unequally spaced are shown in Figure 7. The elements’ excitations and locations of equally and unequally spaced arrays are shown in Table 2.Table 2
The locations (excitations) of Chebyshev and nonuniformly spaced array.
The  locations (excitations) of Chebyshev planar array
0.25, 1.25 (0.3654)
0.75, 1.25 (0.1822)
1.25, 1.25 (0.0364)
0.25, 0.75 (0.2640)
0.75, 0.75 (0.3917)
1.25, 0.75 (0.1822)
0.25, 0.25 (0.4503)
0.75, 0.25 (0.2640)
1.25, 0.25 (0.3645)
The  locations (excitations) of nonuniform planar array
−1.2319, −1.2463 (0.0538)
−0.6505, −1.2237 (0.3215)
−0.0914, −1.1991 (0.7001)
0.3336, −1.1513 (0.8382)
0.9598, −0.9605 (0.5520)
−1.2237, −0.7295 (0.2870)
−0.6472, −0.6505 (0.6144)
0, −0.6238 (0.6207)
0.6472, −0.5680 (0.9560)
1.2237, −0.3341 (0.5179)
−1.1513, −0.2376 (0.6953)
−0.5680, 0 (0.9462)
0, 0 (0.7766)
0.5680, 0 (0.8475)
1.1513, 0.2376 (0.3763)
−1.1981, 0.3341 (0.6218)
−0.5971, 0.6505 (0.6486)
0, 0.5680 (0.8748)
0.5971, 0.7295 (0.8196)
1.1981, 0.6238 (0.6182)
−0.9598, 0.9605 (0.5523)
−0.3336, 1.2237 (0.6272)
0.0914, 1.1991 (0.7050)
0.6505, 1.1513 (0.4298)
1.2319, 1.2463 (0.0526)(a) The Chebyshev radiation pattern. (b) The reconstructed radiation pattern.
(a)
(b)Figure 6
The cross section of the pattern.Figure 7
The elements’ locations.


## 6. Conclusion

A synthesis method to sparse planar array which is based on MEMP is presented. Compared to stochastic optimization algorithm, MEMP is a non-iterative algorithm, which is suitable for designing of sparse array with the requirements of narrow beam, low sidelobe level. In addition, compared to MPM, MEMP can guarantee the best features of either plane. The synthesis of planar array in the paper does not consider the mutual coupling [15, 16] between elements. But there exists mutual coupling between actual elements. Therefore, the synthesis results gotten under the condition of unconsidering mutual coupling can be solved by adjusting the elements’ excitations or locations. The discussion of this paper enriches the application of MEMP to the synthesis of planar array and provides a valuable reference in engineering applications dealing with complexity of problems.



---

*Source: 147097-2013-04-03.xml*