Original DAE

The core part of amplitude method is DAE which reveals the relation between the surface deformation and near-field amplitude. The geometry of a reflector antenna is shown in Fig. 2.

Fig. 2.

The coordinate system of the antenna reflector.

The smooth parabola in Fig. 2 represents the ideal state of the antenna when there is no surface deformation. The antenna at this state is called ideal antenna. The wavy curve represents the surface deformation of the antenna. The antenna at that state is called realistic antenna. A Cartesian coordinate system is established at the bottom of the ideal antenna. Point $O$ is the feed, which is located at the focal point of the antenna where the coordinate is $( 0,\; \, 0,\; \, F)$ and $F$ is the focal length. The dash line in the figure denotes a planar near field and $P$ denotes a random point in this near field. The near field is $h$ meters from the origin of the coordinate. The corresponding reflection points of $P$ on the ideal antenna surface and realistic antenna surface are $M$ and $M^{\ast }$ respectively. The $z$-direction projection of $M$ on the realistic antenna is $M^{\ast \ast }$. The angles between the line segments $OM$ and $OM^\ast$ and the vertical direction are $\theta$ and $\theta \ast$.

In this coordinate system, the surface of ideal antenna is a rotating paraboloid as shown as the thick black parabola in Fig. 2, which could be expressed as:

(1)$$z_0 = {x^2 + y^2\over 4F}$$

The $z$-direction offset of the surface deformation is denoted as $\delta$ as shown as the red part in Fig. 2, then the surface of realistic antenna where $M^\ast$ and $M^{\ast \ast }$ in Fig. 2 are located is expressed as:

(2)$$z^\ast = z_0 + \delta$$

The electric fields of the electromagnetic wave radiated by the feed which are reflected by ideal antenna and realistic antenna are denoted as $E$ and $E^\ast$, respectively. To get DAE, $E$ and $E^\ast$ need to be calculated. Take point $P$ as an example, $E( P)$ can be expressed as [Reference Ruan and Felsen21]:

(3)$$E( P) = D( M) E( M) e^{-jk( d_{OM} + d_{MP}) }$$

Where $D( M)$ is the divergency coefficient of the ray-tube which connects point $P$ and $M$ and can be calculated by the law of conservation of energy, based on geometrical optics. The $j$ in the above formula denotes imaginary unit. The $k$ denotes wave number. The $d_{OM}$ denotes the Euclidean distance between point $O$ and $M$. The $d_{MP}$ has a similar meaning. According to the geometric properties of the paraboloid, all the rays emitted from focal point become parallel after being reflected by ideal antenna. Therefore, $D( M)$ equals 1 in the above formula.

In the similar way, $E^\ast ( P)$ can be expressed as:

(4)$$E^\ast\left(P\right) = D( M^\ast) E^\ast( M^\ast) e^{-jk( d_{OM^\ast} + d_{M^\ast P}) }$$

Where $D( M^\ast )$ can be approximately expressed as [Reference Huang, Huiliang, Ye and Meng10]:

(5)$$\matrix{\left[{1\over D\left(M^\ast\right)}\right]^2 & \approx1 + G\nabla^2\delta + \left(U + G_x\right)\delta_x \cr & \quad + \left(V + G_y\right)\delta_y + \left(U_x + V_y\right)\delta }$$

$\nabla ^2$ denotes Laplacian operator. The subscript $x$ and $y$ means taking the derivative of $x$ and $y$. The $G$, $U$, and $V$ in the above equation are expressed as:

(6)$$\matrix{& G = 2F{x^2 + y^2-4Fh\over x^2 + y^2 + 4F^2}\cr & U = {-4Fx\left(x^2 + y^2-4Fh\right)\over \left(x^2 + y^2 + 4F^2\right)^2}\cr & V = {-4Fy\left(x^2 + y^2-4Fh\right)\over \left(x^2 + y^2 + 4F^2\right)^2} }$$

Now that $E( P)$ and $E^\ast ( P)$ are calculated, then we can get:

(7)$$\left({\left\vert E\left(P\right)\right\vert \over \left\vert E^\ast\left(P\right)\right\vert }\right)^2\approx\left({\left\vert E( M) \right\vert \over \left\vert E^\ast( M^\ast) \right\vert }\right)^2\left[{1\over D\left(M^\ast\right)}\right]^2$$

Since the surface deformation is very small, then $( {\left \vert E( M) \right \vert \over \left \vert E^\ast ( M) \right \vert }) ^2\approx 1$. Therefore:

(8)$$\matrix{ \left({\left\vert E\left(P\right)\right\vert \over \left\vert E^\ast\left(P\right)\right\vert }\right)^2 & \approx1 + G\nabla^2\delta + \left(U + G_x\right)\delta_x\cr & \quad + \left(V + G_y\right)\delta_y + \left(U_x + V_y\right)\delta }$$

The above equation is the so-called DAE.

Original algorithm to solve DAE

An iterative algorithm was proposed to solve equation (8). The algorithm first omits $[ ( U + G_x) \delta _x + ( V + G_y) \delta _y] + ( U_x + V_y) \delta$ because it is much smaller than $1 + G\nabla ^2\delta$, then the DAE becomes:

(9)$$\left({\left\vert E\left(P\right)\right\vert \over \left\vert E^\ast\left(P\right)\right\vert }\right)^2-1\approx G\nabla^2\delta$$

We denote $( {\left \vert E( P) \right \vert \over \left \vert E^\ast ( P) \right \vert }) ^2-1$ as $FA$. Then equation (9) becomes:

(10)$$FA\approx G\nabla^2\delta$$

DAE is simplified to a Poisson equation and FA is always given in discrete form. Therefore, the above equation also needs to be solved in discrete form where $\nabla ^2\delta$ can be expressed as:

(11)$$\matrix{\nabla^2\delta & = {\partial^2\delta\over \partial x^2} + {\partial^2\delta\over \partial y^2} = \delta\left(x + 1,\; y\right) + \delta\left(x-1,\; y\right)\cr & \quad + \delta\left(x,\; y + 1\right) + \delta\left(x,\; y-1\right)-4\delta\left(x,\; y\right)}$$

A third-order discrete Laplacian is introduced based on Taylor expansions and the calculation of $\nabla ^2\delta$ could be expressed as the convolution of deformation $\delta$ by the discrete Laplacian [Reference Huang, Huiliang, Ye and Meng10]:

(12)$$L = \left[\matrix{0 & 1 & 0\cr1 & -4 & 1\cr0 & 1 & 0\cr}\right]dxdy,\; \quad \nabla^2\delta = \delta\ast L$$

In the above equation, $dx$ and $dy$ denote distance between discrete points in $x$ and $y$ direction respectively. Using convolution theorem, equation (10) can be solved by fast Fourier transform (FFT) [10]:

(13)$$\widetilde{\delta} = {{\cal F}}^{-1}\left[{{\cal F}( FA/G) \over {\cal F}( L_N) }\right],\; \quad L_N = \left[\matrix{L & \cdots & 0\cr\vdots & \ddots & \vdots\cr0 & \cdots & 0\cr}\right]_{N\times N}$$

Where $L_N$ in the above equation is a $N$ by $N$ matrix obtained from $L$ by zero-padding in the bottom right direction. Equation (13) gives only an approximate solution of the DAE. Huang [10] found the exact solution can be gradually achieved by iteration from the approximate solution. After a rough deformation result $\widetilde {\delta }$ is calculated from the above equation, the first order partial derivative term and deformation term in equation (8), namely, $[ ( U + G_x) \delta _x + ( V + G_y) \delta _y] + ( U_x + V_y) \delta$, could be calculated approximately as shown below:

(14)$$J = \left[\left(U + G_x\right){\widetilde{\delta}}_x + \left(V + G_y\right){\widetilde{\delta}}_y\right] + \left(U_x + V_y\right)\widetilde{\delta}$$

Then equation (8) becomes:

(15)$$FA\approx G{\rm \nabla}^2\delta + J$$

Although $J$ is not precise, a fixed-point iteration method is proposed to make the results converged continuously [10]. FA can be updated as:

(16)$$FA-HJ\rightarrow FA$$

The updated FA can be put into equation (13) again to get a better deformation result. The iterative step can be done several times until the deformation result meets certain requirements. The whole algorithm scheme is shown in Fig. 3.

Fig. 3.

The original algorithm to solve the original DAE.

The error of the original amplitude method

In the original amplitude method, the feed is treated as a point source and that is why the rays emitted from source are straight lines. However, the feed used in practical is more in line with the Gaussian feed model than point source model. The Gaussian feed can be treated as a CPS [22]. The CPS is point source in complex space, which means the location of feed in Fig. 2 is now transferred from $( 0,\; \, 0,\; \, F)$ to $( 0,\; \, 0,\; \, F + jb)$ where $b$ is the Rayleigh distance of the Gaussian feed.

The expression of the electric field of the CPS is very similar to that of point source but now some variables are in complex space. In Fig. 4, a CPS is put at $\bar {O}$ and the electric field at point A is:

(17)$$E_{CPX}\left(A\right) = E_0{1\over \left\vert {\bar{d}}_{\bar{O}A}\right\vert }\exp\left(-jk{\bar{d}}_{\bar{O}A}\right)$$

The variables with a horizontal bar mean that they are complex variables. The ${\bar {d}}_{\bar {O}A}$ is complex extension of Euclidean distance:

(18)$${\bar{d}}_{\bar{O}A} = \sqrt{{( x_A) }^2 + {( y_A) }^2 + {( z_A-F-jb) }^2}$$

Now in Fig. 2, if the feed is a CPS with Rayleigh distance $b$, then the $E( P)$ and $E^\ast ( P)$ are now changed into:

(19)$$E\left(P\right) = E_0\bar{D}( \bar{M}) {1\over \left\vert {\bar{d}}_{\bar{OM}}\right\vert }e^{-jk( {\bar{d}}_{\bar{OM}} + {\bar{d}}_{\bar{M}P}) }$$

And

(20)$$E^\ast\left(P\right) = E_0\bar{D}( \bar{M^\ast}) {1\over \left\vert {\bar{d}}_{\bar{OM^\ast}}\right\vert }e^{-jk( {\bar{d}}_{\bar{OM^\ast}} + {\bar{d}}_{\bar{M^\ast}P}) }$$

Fig. 4.

The electric field of a CPS.

The $\bar {M}$ and $\bar {M^\ast }$ are the reflection points of $P$ on the ideal and realistic antenna in complex space when the feed is a CPS. The location of $\bar {M}$ is denoted as $( {\bar {x}}_{\bar {M}},\; \, \ {\bar {y}}_{\bar {M}},\; \, {\bar {z}}_{\bar {M}})$ and the location of $\bar {M^\ast }$ has similar notation. The location of $\bar {O}$ is $( 0,\; \, \ 0,\; \, F + jb)$. Notice that the above ${\bar {d}}_{\bar {OM}}$ is complex and therefore it has imaginary part. With equations (19) and (20), the DAE can be restated as:

(21)$$\matrix{\left({\left\vert E\left(P\right)\right\vert \over \left\vert E^\ast\left(P\right)\right\vert }\right)^2 \approx \left({\bar{D}\left(\bar{M}\right)\over \bar{D}\left(\bar{M^\ast}\right)}\right)^2\left({\left\vert {\bar{d}}_{\bar{OM^\ast}}\right\vert \over \left\vert {\bar{d}}_{\bar{OM}}\right\vert }\right)^2\cr \cdot {e}^{2kIm( {\bar{d}}_{\bar{OM}} + {\bar{d}}_{\bar{M}P}-{\bar{d}}_{\bar{OM^\ast}}-{\bar{d}}_{\bar{M^\ast}P}) } }$$

The $Im$ notation in the above equation means taking the imaginary part of the variables. In real life, the frequency of an antenna can reach several GHz and therefore the wave number will be very large and then the exp part will play an important role in the above equation. It is the reason why the error occurs in the original DAE and the original solving algorithm.

Improved DAE

Section “The error of the original amplitude method” shows that the error in the original DAE comes from the exp part in equation (21). To calculate this part, the accurate locations of $\bar {M}$ and $\bar {M^\ast }$ are needed to be calculated. Take $\bar {M}$ as example. This can be done by using Fermat theorem in complex space which indicates that the location of $\bar {M}$ should make the derivative of complex optical path equal to zero [Reference Hasselmann and Felsen18]:

(22)$$\bar{LD} = {\bar{d}}_{\bar{OM}} + {\bar{d}}_{\bar{M}P},\; \quad {\partial\bar{LD}\over \partial\bar{x}} = {\partial\bar{LD}\over \partial\bar{y}} = 0$$

To calculate the complex optical path, the surfaces of ideal and realistic antenna need to be extended to complex space. For the surfaces of ideal antenna, the expression in complex space is:

(23)$${\bar{x}}^2 + {\bar{y}}^2-4F\bar{z} = 0$$

Since $\bar {x}$, $\bar {y}$, and $\bar {z}$ are all complex numbers, the antenna surface now becomes four dimensional. This will make the computation of the location very complicated. For the surfaces of realistic antenna, since the deformation $\delta$ is to be determined, the complex space extension will become even more complicated. Due to these difficulties, researchers made some simplifications when they calculate reflection points. Ruan proposed a method called Real Approximation [Reference Ruan and Felsen21]. In this method, the reflection point in real space, $M$ and $M^\ast$ in section “Original DAE”, is firstly computed. Then $\bar {M}$ and $\bar {M^\ast }$ can be calculated as $M$ and $M^\ast$ adding a displacement. The displacement $M\bar {M}$ can be expressed as:

(24)$$M\bar{M} = f( b) $$

Where $f( b)$ has the property that:

(25)$$\left\vert f( b) \right\vert \rightarrow0\text{ as }b\rightarrow0$$

The edge irradiate (EI) of an antenna needs to reach about $-11$dB [Reference Stutzman and Thiele22]. Therefore, the Rayleigh distance $b$ will be very small so that the feed can allocate enough energy to illuminate the boundary. Therefore, by equation (25), $\left \vert f( b) \right \vert \approx 0$ and we can make the assumption that:

(26)$$\bar{M}\approx M,\; \quad \bar{M^\ast}\approx M^\ast$$

By the above approximation, only ${\bar {d}}_{\bar {OM}}$ and ${\bar {d}}_{\bar {OM^\ast }}$ in the exponent part in equation (21) has imaginary part. The ${\bar {d}}_{\bar {OM}}$ can be calculated as:

(27)$$\matrix{& {\bar{d}}_{\bar{OM}}\approx{\bar{d}}_{\bar{O}M} = \sqrt{x_M^2 + y_M^2 + \left[z_M-\left(F + jb\right)\right]^2}\cr & = \sqrt{x_M^2 + y_M^2 + \left(z_M-F\right)^2-{b^2} + 2jb\left(F-z_M\right)}\cr & \approx d_{OM}\left(1 + 2jb{F-z_M\over d_{OM}^2}\right)^{1\over 2}\cr & \approx d_{OM} + jb{F-z_M\over d_{OM}} = d_{OM} + jbcos\theta }$$

The first approximation in the above equation is by equation (26). The second approximation is because of the smallness of $b$ and the last approximation is by taking the first two parts of the Taylor expansion. The $\theta$ is defined in Fig. 2 as the angle between $OM$ and $z$ axis. By the expression of the surface of ideal antenna in equation (1), $\theta$ can be calculated as:

(28)$$\matrix{cos\theta & = {F-\frac{x_M^2 + y_M^2}{4F}\over \sqrt{x_M^2 + y_M^2 + \left(F-\frac{x_M^2 + y_M^2}{4F}\right)^2}}\cr & = {4F^2-\left(x_M^2 + y_M^2\right)\over 4F^2 + x_M^2 + y_M^2} }$$

${\bar {d}}_{\bar {OM^\ast }}$ can be calculated in a similar way:

(29)$${\bar{d}}_{\bar{OM^\ast}}\approx d_{OM^\ast} + jbcos\theta^\ast$$

The $\theta ^\ast$ is defined in Fig. 2 as the angle between $OM^\ast$ and $z$ axis. $\theta ^\ast$ has a very complex expression involving $\delta$ and the first derivative of $\delta$. The calculation of $\theta ^\ast$ will be handled in an iterative method in the next part where the solving algorithm is improved.

By equations (27), (28), and (29), the exponent part in equation (21) is:

(30)$$\matrix{& e^{2kIm\left({\bar{d}}_{\bar{OM}} + {\bar{d}}_{\bar{M}P}-{\bar{d}}_{\bar{OM^\ast}}-{\bar{d}}_{\bar{M^\ast}P}\right)}\cr & \approx e^{2kb\left({4F^2-\left(x_M^2 + y_M^2\right)\over 4F^2 + x_M^2 + y_M^2}-cos\theta^\ast\right)} }$$

We should make the assumptions below because $b$ and $\delta$ are both small.

(31)$$\matrix{& \left({\left\vert {\bar{d}}_{\bar{OM^\ast}}\right\vert \over \left\vert {\bar{d}}_{\bar{OM}}\right\vert }\right)^2\approx1,\; \cr & \left({\bar{D}\left(\bar{M}\right)\over \bar{D}\left(\bar{M^\ast}\right)}\right)^2\approx\left({D\left(M\right)\over D\left(M^\ast\right)}\right)^2 = 1 + G\nabla^2\delta\cr & \quad + \left[\left(U + G_x\right)\delta_x + \left(V + G_y\right)\delta_y\right] + \left(U_x + V_y\right)\delta\ }$$

Therefore, the improved DAE is:

(32)$$\left({\left\vert E\left(P\right)\right\vert \over \left\vert E^\ast\left(P\right)\right\vert }\right)^2 \approx OIR\cdot e^{2kb\left({4F^2-\left(x_M^2 + y_M^2\right)\over 4F^2 + x_M^2 + y_M^2}-cos\theta^\ast\right)}$$

Where OIR is the original intensity ratio, namely the right side of equation (8) or (31). The $x_M$ and $y_M$ in the above equation are $x_P$ and $y_P$ respectively because the rays reflected by ideal antenna are straight lines parallel to each other.

Improved solving algorithm

The original solving algorithm needs to be modified to solve equation (32). A similar approach is adopted like what the original algorithm does. First, $[ ( U + G_x) \delta _x + ( V + G_y) \delta _y] + ( U_x + V_y) \delta$ in OIR and $exp[ 2kb( {4F^2-( x_M^2 + y_M^2) \over 4F^2 + x_M^2 + y_M^2}-cos\theta ^\ast ) ]$ are omitted. Then a rough deformation result can be calculated from equation (13). To facilitate discussion, the notation $EC$ is defined as follows:

(33)$$EC = exp\left[2kb\left({4F^2-\left(x_M^2 + y_M^2\right)\over 4F^2 + x_M^2 + y_M^2}-cos\theta^\ast\right)\right]$$

After getting a rough deformation, the result can be used to calculate $J$ and $EC$. Then $FA$ can be updated as:

(34)$${FA + 1\over EC}-J-1\rightarrow FA$$

$J$ can be easily calculated by the rough deformation. To calculate $EC$, the accurate location of $M^\ast$ needs to be known. Here, a numerical method is proposed to reach this goal. Due to the smallness of the deformation, the location of $M^\ast$ will be close to $M^{\ast \ast }$. Therefore, we can take $M^{\ast \ast }$ as a start point to search $M^\ast$. The neighborhood of $M^{\ast \ast }$ can be well approximated by paraboloid [Reference Min, Feng, Xuewu and Rui20] as Fig. 5 shows.

Fig. 5.

The paraboloid approximation of the neighborhood of $M^{\ast \ast }$.

The discrete point in Fig. 5 denotes deformation. The approximation paraboloid is denoted as $S$. By the definition of $M^{\ast \ast }$, its $x$ and $y$ coordinate values are identical to $x_M$ and $y_M$. A coordinate system is established at $( x_M,\; \, y_M,\; \, 0)$. To avoid confusion of symbols, the $x$ and $y$ axis of the coordinate system are denoted as $u$ and $v$ respectively. The expression of $S$ under this coordinate system can be obtained by Taylor expansion:

(35)$$S = z^\ast + z_x^\ast u + z_y^\ast\nu + {1\over 2}z_{xx}^\ast u^2 + z_{xy}^\ast uv + {1\over 2}z_{yy}^\ast v^2$$

The $z^\ast$ is ideal antenna adding the rough deformation. On $S$, by Fermat theorem, the location of $M^\ast$ should minimize the optical length $LD$:

(36)$$\matrix{M^\ast & = argmin{LD} = d_{OM^\ast} + d_{M^\ast P}\cr & = \sqrt{\left(x_M + u\right)^2 + \left(y_M + v\right)^2 + \left(S-F\right)^2}\cr & \quad + \sqrt{u^2 + v^2 + \left(S-h\right)^2} }$$

The steepest descent method is used to solve the above optimization problem. Since $M^{\ast \ast }$ is start point, the descending direction at that point is needed to be known. The $( u,\; \, v)$ coordinate at $M^{\ast \ast }$ is $( 0,\; \, 0)$, the partial derivative of $LD$ with respect to $u$ at this point is:

(37)$$\matrix{{LD}_u\left(0,\; 0\right)& = {x_M + \left(z^\ast-F\right)z_x^\ast\over \sqrt{x_M^2 + y_M^2 + \left(z^\ast-F\right)^2}}-z_x^\ast\cr & = {x_M + \left(z_0 + \widetilde{\delta}-F\right)\left(z_{0x} + {\widetilde{\delta}}_x\right)\over \sqrt{x_M^2 + y_M^2 + \left(z_0 + \widetilde{\delta}-F\right)^2}}-\left(z_{0x} + {\widetilde{\delta}}_x\right)}$$

${LD}_v( 0,\; \, 0)$ can be calculated in a similar manner:

(38)$$\matrix{{LD}_v\left(0,\; 0\right)& = {y_M + \left(z^\ast-F\right)z_y^\ast\over \sqrt{x_M^2 + y_M^2 + \left(z^\ast-F\right)^2}}-z_y^\ast \cr & = {y_M + \left(z_0 + \widetilde{\delta}-F\right)\left(z_{0y} + {\widetilde{\delta}}_y\right)\over \sqrt{x_M^2 + y_M^2 + \left(z_0 + \widetilde{\delta}-F\right)^2}}-\left(z_{0y} + {\widetilde{\delta}}_y\right)}$$

The descending direction ${\bf d}$ is:

(39)$${\bf d} = \left[{-LD}_u\left(0,\; 0\right)\quad {-LD}_v\left(0,\; 0\right)\right]^T$$

The one-dimension search can be done on that direction. First, the searching interval needs to be determined. This can be done by the following steps:

1. (a) Initialize $i = 0$.

2. (b) $\alpha _i = i,\; \, \beta _i = i + 1$.

3. (c) If $LD( \alpha _i{\bf d}) < LD( \beta _i{\bf d})$, then turn to step e, else turn to step d.

4. (d) $i + +$, turn to step b.

5. (e) The searching interval is $[ 0,\; \, \beta _i] {\bf d}$.

After determining the searching interval, golden section method [23] is adopted to find the optimal step size. The solution steps are as follows:

1. (a) Initialize $n = 0,\; \, c_n = 0,\; \, d_n = \beta _i,\; \, \lambda _n = 0.382\beta _i,\; \, \mu _n = 0.618 \beta _i$, and provide a threshold value $\varepsilon$.

2. (b) If $\left \vert d_n-c_n\right \vert < \varepsilon$, stop iteration and output the result as ${\lambda _n + \mu _n\over 2}$, else if $LD( \lambda _n) > LD( \mu _n)$, turn to step c, else if $LD( \lambda _n) \le LD( \mu _n)$, turn to step d.

3. (c) Set $c_{n + 1} = \lambda _n,\; d_{n + 1} = d_n,\; \lambda _{n + 1} = \mu _n,\; \mu _{n + 1} = c_{n + 1} + 0.618$ $ ( d_{n + 1}-c_{n + 1})$, turn to step e.

4. (d) Set $c_{n + 1} = c_n,\; d_{n + 1} = \mu _n,\; \mu _{n + 1} = \lambda _n,\; \lambda _{n + 1} = c_{n + 1} + 0.382$ $( d_{n + 1}-c_{n + 1})$, turn to step e.

5. (e) $k + +$, turn to step b.

After getting the optimal step size, the optimal solution is:

(40)$$\matrix{& u^\ast = -{\lambda_n + \mu_n\over 2}{LD}_u\left(0,\; 0\right),\; \cr & v^\ast = -{\lambda_n + \mu_n\over 2}{LD}_v\left(0,\; 0\right)}$$

The coordinate of $M^\ast is ( x_M + u^\ast ,\; \, \ \ y_M + v^\ast ,\; \, \ \ S( u^\ast ,\; \, \ \ v^\ast ) )$. After getting the coordinate of $M^\ast ,\; \, cos\theta ^\ast$ in $EC$ is:

(41)$$\cos\theta^\ast = {F-S( u^\ast,\; \ \ v^\ast) \over \sqrt{\left(x_M + u^\ast\right)^2 + \left(y_M + v^\ast\right)^2 + \left[F-S( u^\ast,\; \ \ v^\ast) \right]^2}}$$

Therefore, EC can be calculated when giving the rough deformation. The improved solving algorithm is shown in Fig. 6.

Fig. 6.

The flow chart of the improved algorithm to solve the improved DAE.

Effectiveness of the improved algorithm

In this section, several numerical simulations are performed to verify the effectiveness of the improved amplitude method. The parameter setting of the simulation is shown in Table 1.

Table 1.

The conditions of simulation

The discrete point number $N$ means the number of discrete points on the $x$ axis and $y$ axis on the planar near field. The total number of discrete points on the near field is $N\times N$. The near-field height $h$ denotes the distance between scanning plane and the vertex of the reflector as shown in Fig. 2. The taper angle $\varphi$ denotes the angle between the light radiated by the feed to the edge of the reflector and the $z$-axis. Rayleigh distance $b$ is determined by the Gaussian feed as shown in Fig. 4. The taper $EI$ is the edge irradiate, determined by $b$ and $\varphi$, as shown below.

(42)$$EI = 20log\left(\left(1 + cos{\varphi}\right)/2\right)-20bk\left(1-\cos{\varphi}\right)log\ e$$

Where $k = 2\pi /\lambda$ is the wave number.

The computer used in the simulations is equipped with a 2.6 GHz i7-6700HQ processor.

In the first simulation, the deformation shown below was added to the antenna.

(43)$$\matrix{\delta & = {\sin{\left(\frac{F}{D}\sqrt{x^2 + y^2 + \frac{F}{2}}\right)}\over 50F}\cr & \cdot{1\over 1 + \exp\left[-0.6\left(0.4D-\sqrt{x^2 + y^2}\right)\right]} }$$

The root mean square (RMS) is used to evaluate the accuracy of the solving algorithm. Its calculation formula is shown below:

(44)$$RMS = \sqrt{{\sum_{m = 1}^{N}\sum_{n = 1}^{N}\left[\delta_r\left(x_n,\; \ \ y_m\right)-\delta\left(x_n,\; y_m\right)\right]^2\over N^2}}$$

The $\delta _r$ in the above expression denotes the deformation solved by algorithm.

The curves of RMS of solving algorithm with respect to iteration number is shown in Fig. 7. The blue line in Fig. 7 is RMS data of improved solving algorithm and the red line is that of the original algorithm. It can be seen from the figure that the RMS of both algorithms converges after $12$ iterations, so we set the convergence condition in both algorithms as iterating $12$ times. The final RMS value and computation time of the two algorithms are shown in Table 2.

Fig. 7.

The RMS trends of the original algorithm and the improved algorithm when solving deformation 1, namely equation (43), respectively.

Table 2.

Calculation result of the two algorithms

The $y = 0$ plane cut of the solved deformation is shown in Fig. 8. The red dot line is the deformation solved by original algorithm, the blue line is that of improved algorithm and the yellow line is the theoretical deformation value. From this figure, it is shown that a better result can be retrieved by improved algorithm.

Fig. 8.

$y = 0$ plane cut of the solved deformation.

To verify the versatility of the improvement, a second simulation is performed by adding a random deformation to the antenna with a $113.01\, \mu$m RMS error from the ideal reflector surface, which is more complex and harder to measure than the normal antenna deformation distribution. The added deformation and solved deformation by the two algorithms are shown in Fig 9.

Fig. 9.

A comparison of deformation solved by the improved and original algorithm. Figure (a) shows the theoretical deformation. The deformations solved by the original algorithm and the improved algorithm are shown by (b) and (c), respectively.

The RMS data of the two algorithm are shown in Fig. 10. It can be seen from the figure that the RMS of both algorithms converges after $12$ iterations, so we set the convergence condition as iterating $12$ times and the result shown in Fig 9 is the result after iterating $12$ times. The final RMS value and computation time are shown in Table 3.

Fig. 10.

The RMS trends of the original algorithm and the improved algorithm, respectively.

Table 3.

Calculation result of the two algorithms

From Table 3, it is shown that a better result can be retrieved from improved algorithm, but the computation time of the improved algorithm is much longer than the original one because solving the optimization problem in the improved algorithm is time consuming.

Effectiveness at different f and N

We have simulated the variations of the results with the frequency. The number of iterations is adjusted to $15$ and we keep the discrete point number $N$ $257$ unchanged. The deformation of the reflector surface is also supposed to be equation (43), whose RMS error from the ideal surface is $RMS( \delta ) = 327.54\, \mu$m. The simulation is performed at frequencies of $0.1$, $0.6$, $1$, and $3$ GHz. The final RMS errors between the supposed deformation and the solutions of the method proposed in this paper and the corresponding solving times are shown in Table 4 below. It is shown that the improved algorithm can basically solve the deformation accurately at all frequencies. Although the RMS errors are slightly higher at $0.1$ and $2$ GHz, it is still more accurate than the original algorithm. The time of execution is the same at each frequency due to the same resolution $257\times 257$.

Table 4.

The final RMS errors and the corresponding solving times at different frequencies

Supposing the same deformation on the reflector surface, we have compared the results of the improved algorithm proposed in this paper at different frequencies with the semi-spherical scanning method [Reference Qian24] and the original algorithm of the planar scanning method [Reference Huang, Huiliang, Ye and Meng10], as shown as Fig. 11. The solving region covers the entire reflector surface. It is shown that the improved algorithm performs best at all frequencies.

Fig. 11.

Comparison of the simulated solution accuracy among the semi-spherical scanning method, original algorithm, and improved algorithm of the planar scanning method.

The effectiveness of the improved algorithm under different resolutions has also been verified. The number of iterations is also $15$ and we keep the frequency $0.3$ GHz unchanged. We perform the simulations when the sampling resolutions of the near-field amplitude are $33\times 33$, $65\times 65$, $129\times 129$, $257\times 257$, $513\times 513$, respectively. The setting of $2^n + 1\ ($n=5$,\; \, 6,\; \, 7,\; \, 8,\; \, 9)$ discrete points is convenient to get the central section for comparison. The RMS results and the corresponding solving times are shown in Table 5. It is shown that the RMS error is slightly lager when the resolution decreases and the execution time is proportional to $N^2$. However, even if the resolution is only $33\times 33$, the improved algorithm could also get an accurate solution.

Table 5.

The final RMS errors and the corresponding solving times at different resolutions