An Efficient Analytical Evaluation of the Electromagnetic Cross-Correlation Green's Function in MIMO Systems
Debdeep Sarkar Said Mikki Yahia Antar






An Efficient Analytical Evaluation of the Electromagnetic Cross-Correlation Green's Function in MIMO Systems
    Debdeep Sarkar, Member, IEEE, Said Mikki, Senior Member, IEEE, Yahia Antar, Life Fellow, IEEE
    December 30, 2023
============================================================================================================



[1]Debdeep Sarkar (Corresponding Author) and Yahia Antar are with the Royal Military College, PO Box 17000, Station Forces Kingston, Ontario, K7K 7B4, Canada (Emails: debdeep1989@gmail.com; antar-y@rmc.ca).
[2]Said Mikki is with University of New Haven, West Haven, Connecticut, 300 Boston Post Rd, 06516, USA (Email: said.m.mikki@gmail.com).
[3]20XX IEEE.  Personal use of this material is permitted.  Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.”
















In this paper, we completely eliminate all numerical integrations needed to compute the far-field envelope cross-correlation (ECC) in multiple-input-multiple-output (MIMO) systems by deriving accurate and efficient analytical expressions for the frequency-domain cross-correlation Green's functions (CGF), the most fundamental electromagnetic kernel needed for understanding and estimating spatial correlation metrics in multiple-antenna configurations. The analytical CGF is derived for the most general three-dimensional case, which can be used for fast CGF-based correlation matrix calculations in MIMO systems valid for arbitrary locations and relative polarizations of the constituent elements.  




MIMO arrays, Cross-correlation Green's Function, Infinitesimal Dipole Model (IDM).





































§ INTRODUCTION

Fifth generation (5G) wireless networks aiming at high data-rate (>10 Gbps) and efficient interference suppression between multiple users in ultra-dense networks (UDNs), deploy large antennas arrays/massive multiple-input-multiple-output (MIMO) systems as key enabling technology <cit.>-<cit.>. One crucial aspect of such multiple-antenna systems in MIMO transceivers is the latter's “spatial correlation matrix”, which accounts for mutual interaction (conventionally, only far-field is taken into account) between the constituent antenna element-pairs <cit.>-<cit.>. Despite the pivotal role of this spatial correlation matrix in shaping the overall channel matrix and consequent capacity/interference-suppression issues (see <cit.>-<cit.> for details), the impact of pure antenna effects and various core electromagnetic aspects in MIMO channel modelling are often not emphasized adequately. 

Traditionally, this antenna spatial correlation performance is determined from a formula involving the radiation patterns of individual elements <cit.>, which makes it very cumbersome to perform antenna current level optimization aiming at a desired diversity performance. To relate the antenna correlation directly to the radiating antenna current distribution (i.e., essentially bypassing altogether the original far-field pattern route), the concept of cross-correlation Green's functions (CGFs) was first introduced in <cit.>,<cit.> and later elaborated for antenna design applications <cit.>, <cit.>. A preliminary step of this  CGF-based correlation calculation is to construct a suitable infinitesimal dipole model (IDM) for the radiating MIMO antenna current distribution (see <cit.>-<cit.> for detailed theory and applications of IDM). The next step is to employ suitable CGFs in order to compute individual ID-pair interactions systematically and then combine them togethoer to construct the global correlation matrices of the system <cit.>. Application of CGFs to realize high diversity gain MIMO antenna arrays as well as dual-polarized massive MIMO systems has been reported in recent past <cit.>-<cit.>. By efficient integration of the CGFs with finite-difference-time-domain (FDTD) computational paradigm, one can also perform wide-band time-domain correlation analysis for arbitrary antennas <cit.>-<cit.>. The CGFs are also extended to deal with radiators involving both electric/magnetic current sources <cit.>. Possible application of the CGF methodology for near-field stochastic systems <cit.> and antenna directivity analysis <cit.> are also being actively explored presently. 

However, calculation of the CGF tensor components requires numerical integration involving elevation (θ) and azimuth (ϕ) angle dependent terms in the argument of complex exponential functions <cit.>, <cit.>. Therefore, it becomes extremely difficult to efficiently embed these CGFs in fast optimization routines aiming at finding optimum current distributions for desired diversity performance. This necessitates a robust analytical evaluation scheme for the determination of the CGF tensor components and the possibility of achieving this was in fact already suggested in <cit.>. Although some specialized approximation formulas of the time-domain CGFs were attempted in <cit.>, IDM-synthesis of MIMO antennas strictly requires frequency-domain CGFs, and the analytical evaluation of the latter at a very general level has been so far an open problem. Mitigating this shortcoming in the literature will be the main contribution of the present work.  

In this paper, we first employ a series-expansion approach to approximate the complex exponential functions in CGF tensors (some preliminary ideas were briefly suggested <cit.>). Next, by deploying carefully selected mathematical properties enjoyed by the Beta and Gamma functions, we analytically evaluate the full angular space integration involving oscillatory terms. In this way, analytical expressions of CGF tensors are presented here for the most general three-dimensional case. 







§ ANALYTICAL CGF DETERMINATION IN ONE/TWO/THREE DIMENSIONAL ARRAYS




 §.§ Review of the CGF Tensor


In standard MIMO literature, the complex correlation coefficient ρ between the far-field patterns 𝐄_1=𝐄_1(θ,ϕ) and 𝐄_2=𝐄_2(θ,ϕ), respectively generated by complex current distributions 𝐉_1=𝐉_1(𝐫') and 𝐉_2(𝐫”), is traditionally calculated by <cit.> 

    ρ=∫_4π[𝐄_1·𝐄_2^*] dΩ/√(∫_4π[𝐄_1·𝐄_1^*] dΩ∫_4π[𝐄_1·𝐄_1^*] dΩ),

where dΩ is the solid angle element given by dΩ=sinθ dθ dϕ. That is, only the radiation fields appear in the original definition. This makes the process of evaluating ρ and desinging optimum antennas for spatial diversity applications very challenging since the 3D computation of the far-field pattern is demanding. Moreover, the geometrical details of the radiator, e.g., shape, orientations, excitations, do not directly manifest themselves in the far field. For those reasons, in <cit.> ρ is expressed directly in terms of 𝐉_1 and 𝐉_2 as:

    ρ=∫ d^3𝐫'∫ d^3𝐫”𝐉_1·𝐂·𝐉^*_2/√([ ∫ d^3𝐫'∫ d^3𝐫”𝐉_1·𝐂·𝐉^*_1][ ∫ d^3𝐫'∫ d^3𝐫”𝐉_2·𝐂·𝐉^*_2]),

where all integrals are performed over the entire antenna radiating surface (the support of the current distribution functions J_1(r) and J_2(r).
Here, 𝐂=𝐂(𝐫',𝐫”) stands for the CGF tensor in uniform propagation environment given by <cit.>:

    𝐂(𝐫',𝐫”)= ∫_0^π∫_0^2π[𝐈-r̂r̂] e^j𝐤·(𝐫'-𝐫”)sinθ dθ dϕ.

The quantity 𝐈̅ is the unit dyad, while 𝐫' and 𝐫” denote the spatial dependencies of 𝐉_1 and 𝐉_2, respectively. Moreover, 𝐤=kr̂, with k=2π/λ (λ= operating wavelength) and r̂ being the radial unit-vector in spherical coordinate system given by

    r̂(θ ,φ)=r̂(Ω)  := x̂cosφsinθ  + ŷsinφsinθ  + ẑcosθ.

The nine components C_pq (where p=x,y,z and q=x,y,z) of the CGF tensor 𝐂(𝐫',𝐫”) in (<ref>) can be derived after using (<ref>) and elementary dyadic arithmetic rule. The results are expressed as:

    C_pq=∫_0^π∫_0^2π f_pqexp[jkr_d] dθ dϕ,

where r_d=r̂·(𝐫'-𝐫”)=x_dsinθcosϕ + y_dsinθsinϕ + z_dcosθ, with x_d=x'-x”, y_d=y'-y” and z_d=z'-z” and values of f_pq=f_pq(θ,ϕ) are defined as <cit.>, <cit.>:

    f_xx   =   sinθ(1-sin^2θcos^2ϕ) , 
    
    f_yy   =   sinθ(1-sin^2θsin^2ϕ) , 
    
    f_zz   =   sin^3θ,  
    
    f_xy = f_yx   =    -sin^3θ, cosϕsinϕ, 
    
    f_yz = f_zy   =    -sin^2θcosθsinϕ, 
    
    f_zx = f_xz   =    -sin^2θcosθcosϕ.

Consequently, the CGF-based technique completely eliminates the requirement of going through the conventional pattern-based route of (<ref>) by focusing instead on the total radiating antenna current distribution, i.e., only current points reflecting the radiator excitation and geometry are needed, and these are considerably smaller in number than the far-field points <cit.>, <cit.>, <cit.>.
Clearly, still all components of the CGF involve two-dimensional angular integration operations over the entire sphere. In general, for every position pair r',r”, these integrals must be computed again. Therefore, for large antenna arrays the net number of numerical computations becomes large. 



 §.§ General Idea of CGF Tensor Approximation


While evaluation of C_pq via (<ref>) requires computing an angular-space integration of f_pqexp(jkr_d), it was pointed out in <cit.> that CGF might be computed or at least well-approximated analytically. Various approaches may be pursued here. For example, it is possible to expand the integrand of every integral into orthogonal functions then evaluate angular integrations using exact orthogonality relations. However, the orthogonal expansion itself often requires numerical integrations to obtain the needed Fourier coefficients (the weight of every orthogonal function) and hence it may not lead to efficient algorithm. Moreover, because each of the nine integrals entering into the determination of the full 3 × 3 dyad 𝐂 may involve a distinct angular function in the integrand, performing an orthogonal function expansion here becomes cumbersome and very tedious.

Another idea is to simplify (<ref>) by making use of a Bessel's function utilizing the Jacobi-Anger expansion <cit.>. However, an alternative approach is proposed in this paper, where we simply utilize the familiar Taylor series expansion of the exponential functions 

    exp[jkr_d] = ∑_n=0^∞(jkr_d)^n/n!,

after which C_pq in (<ref>) can be approximated by truncating into finite number of N terms giving 

    C_pq≈∑_n=0^N( jk )^n I_pq,n,

where,

    I_pq,n= 1/n!∫_0^π∫_0^2π f_pq( r_d. )^n dθ dϕ.

The subsequent sections will build fast and robust algorithm for the evaluation of the quantity I_pq,n for various infinitesimal dipole (ID) array configurations (one/two/three dimensional topologies will be considered). 

We also note at this juncture that the formal limit N →∞ in (<ref>) will give the exact C_pq value as obtained from (<ref>). However, soon we will discover that opting for N →∞ is not required in our correlation matrix computation algorithm. The proposed method then provides a tradeoff between exactness and computational efficiency. While the use of N makes our evaluation less exact than using complete orthogonal function series expansion, nevertheless the final algorithm turns out to be very efficient for reasonably finite values of N, while it avoids the mathematical complexity of the angular spherical function approach. 


 


 §.§ Analytical CGF Estimation for One-dimensional Linear Dipole Arrays


To begin with, let us consider the linear/one-dimensional array configuration that consists of infinitesimal dipoles (IDs) strictly placed along the y-axis, but yet are allowed to have arbitrary polarization and inter-element spacing. Since x_d=z_d=0 for this case, we have r_d= y_dsinθsinϕ. Applying this r_d in (<ref>), the reduced expression for I_pq,n is obtained as follows:

    I_pq,n= (y_d)^n/n! G_pq,n,

where,

    G_pq,n=∫_0^π∫_0^2π f_pq( sinθsinϕ)^n dθ dϕ.

Now the natural question that arises here is this: how can one decide the proper value n=N in (<ref>) needed to efficiently compute the far-field correlation of given ID pair with acceptable accuracy?

To answer this question, we probe further into C_pq, by expressing the inter-element spacing y_d in terms of the operating wavelength λ. Writing y_d=pλ and using k=2π/λ, one can put C_pq via (<ref>), (<ref>) and (<ref>) in the following form 

    C_pq≈∑_n=0^N  j^n G_pq,n[( 2π p )^n/n!].

At this point, we use the well known Stirling's formula for n!, which is very accurate for large values of n <cit.>-<cit.>:

    n!=√(2π n)( n/e)^n.

This further reduces (<ref>) to:

    C_pq≈∑_n=0^N j^n( G_pq,n/√(2π n)) ( 2π e p/n)^n.

Note that, the factor G_pq,n/√(2π n) in (<ref>) decreases asymptotically with n, and is ignored for the time-being. By careful observation of the next term involving n-th power of (2π e p/n) and using 2π e ≈ 17.08, we provide a rule-of-thumb to determine the necessary n=N for a given value of p required to truncate the series in (<ref>) yet while not compromising correlation calculation accuracy:

    N > 17p.

For the example p=5, i.e. if the two IDs are placed 5λ apart, one should need approximately 85 terms to accurately determine C_pq from (<ref>). A numerical verification of this rule-of-thumb formula (<ref>) can be found in Fig. <ref>(a) and Fig. <ref>(b), where variations of |ρ| with respect to inter-element spacing p=d/λ (where y_d=d) are shown respectively for a y-directed and z-directed ID pair, placed along the y-axis. One can observe from Fig. <ref>(a) and Fig. <ref>(b) that for d/λ > N/17, the |ρ| value using (<ref>) quickly deviates from that determined via the exact formula (<ref>). Observing Fig. <ref>(a) and Fig. <ref>(b), it can be said that for inter-element spacing >6 λ, spatial correlation magnitude |ρ| is sufficiently small (|ρ|<0.1), and may be ignored for practical application purpose. This fact will also come in handy in formulating a general spatial correlation determination algorithm in the subsequent section.    









The next challenge is to determine G_pq,n analytically, therefore completely eliminating the need for numerical integration routines, as emphasized before. We demonstrate the derivation for G_zz,n to start with. Using f_zz from (<ref>) in (<ref>), we obtain:

    G_zz,n=∫_0^π∫_0^2π f_zz( sinθsinϕ)^n dθ dϕ
    = [ ∫_0^πsin^n+3θ dθ] [ ∫_0^2πsin^nϕ dϕ].

Note that, n can be either odd or even. For odd values of n, the integral with ϕ-dependent term vanishes, i.e. we have:

    ∫_0^2πsin^nϕ dϕ =0,

Therefore, G_zz,n=0 for odd values of n. On the other hand, for even values of n, we have:

    ∫_0^2πsin^nϕ dϕ = 2B(1/2,n/2+1/2)=2Γ(1/2)Γ(n/2+1)/Γ(n/2+1 )
    = 2√(π)/(n/2)![n!/2^n(n/2)!√(π)]= π/2^n-1n!/[(n/2)!]^2,

with B and Γ standing for Beta and Gamma functions respectively <cit.>. Also, when n is even, n+3 is odd, yielding: 

    ∫_0^πsin^n+3θ dθ =B(1/2,n/2+2)=Γ(1/2)Γ(n/2+2)/Γ(n/2+5/2)
    =√(π)(n/2+1)! [2^n+4(n/2+2)!/√(π)(n+4)!]
        
    = [(n/2)!]^2/n!(n/2+1) [ 2^n+4(n/2+2)(n/2+1)/(n+4)(n+3)(n+2)(n+1)]
        
    = [(n/2)!]^2/n!(n/2+1) [ 2^n+2/(n+3)(n+1)]


Therefore, using (<ref>), (<ref>) and (<ref>), we obtain for even values of n:

    G_zz,n=(n/2+1) W_n,

where,

    W_n=8π/(n+1)(n+3).

W_n is a “general weighing factor” for this one-dimensional ID array scenario, which would soon prove to be readily applicable for the more general three dimensional case. The several relevant formulas used to simplify the integrations are collected in the Appendix. 

The rest of the derivations for G_pq,n follows a similar route, and consequently will not be elaborately shown here.  
With the help of a symbolic computer package (e.g., the symbolic toolbox of MATLAB or Mathematica), further verification of the detailed  derived expressions for G_pq,n were conducted by the authors. The following general observations can be drawn from the results: 

    
  * The following condition holds always true:
    
    G_pq,n=0  for odd values of n for all p,q.

    This is very significant, since it literally halves the number of integrations to be solved. 
    
  * The coefficients for mutually orthogonal ID pairs all vanish, i.e. for all values of n:
    
    G_xy,n=G_yx,n=G_yz,n
    =G_zy,n=G_xz,n=G_zx,n=0.

    
  * The coefficients for the ID pairs orthogonal to the placement axes (i.e. for x-directed or z-directed ID pairs) are identical, and can be expressed as:
    
    G_xx,n=G_zz,n=(n/2+1)G_yy,n.

    where G_yy,n=W_n. 


These analytical results and the various details about the behaviour of various terms indexed by n will be fully exploited in what follows to build efficient and robust cross-correlation computation algorithms for massive MIMO.












 §.§ Analytical CGF Estimation for Two-dimensional Planar Dipole Arrays

In the last section, we considered that placement of IDs is restricted along y-axis, i.e. x_d=z_d=0, which significantly simplified the scenario. Next, let us take the case of a two-dimensional/planar array of IDs placed in the yz-plane. Since here x_d=0, we have r_d=y_dsinθsinϕ + z_dcosθ. By deploying the binomial series to expand r_d and following some algebraic manipulations, we get:

    (r_d)^n=(y_dsinθsinϕ + z_dcosθ)^n
    = ∑_m=0^nn!/m!(n-m)! y_d^m z_d^n-msin^mθcos^n-mθsin^mϕ.

Therefore, following (<ref>), the expression for I_pq,n becomes:

    I_pq,n=1/n!∑_m=0^nn!/m!(n-m)! V^n_pq,m y_d^m z_d^n-m,

where,

    V^n_pq,m =∫_0^π∫_0^2π f_pqsin^mθcos^n-mθsin^mϕ dθ dϕ.

To solve for V^n_pq,m (which will finally lead to I_pq,n) we need to carefully choose  f_pq expressions from (<ref>) and apply suitable properties of Beta and Gamma functions. We demonstrate the solution for I_zz,n here.

    V^n_zz,m=[∫_0^πsin^m+3θcos^n-mθ dθ] [∫_0^2πsin^mϕ dϕ]

Note that, the integral with ϕ vanishes for odd values of m. Similar to the 1D case, we have for even m, we have:

    ∫_0^2πsin^mϕ dϕ=2B(1/2,m/2+1/2)=π/2^m-1m!/[(m/2)!]^2.

Now, we consider the two scenarios of n. When n is odd with m being even, both the quantities m+3 and n-m are odd. Therefore using the fact that cosine function cosθ is odd with respect to π/2 we have:

    ∫_0^πsin^m+3θcos^n-mθ dθ =0.

Once again, we have I_zz,n=0 for odd values of n. On the other hand, when n is even with m also being even, m+3 is odd while n-m is even. Therefore,  

    ∫_0^πsin^m+3θcos^n-mθ dθ = B(n-m/2+1/2,m/2+2 ) 
    =Γ(n-m/2+1/2)Γ(m/2+2 )/Γ(n+4/2+1/2)
    =(m/2+1 )! [(n-m)!/2^n-m(n/2-m/2)!] [ 2^n+4(n/2+2)!/(n+4)!].

Using (<ref>) and (<ref>) in (<ref>), we obtain:

    V^n_zz,m=2^5π[m!(n-m)!/n!][(n/2)!/(n/2-m/2)!(m/2)!] 
    ×[(m/2+1 )(n/2+2 )(n/2+1 )/(n+4)(n+3)(n+2)(n+1)] 
        
    =8π(m/2+1 )/(n+3)(n+1)[m!(n-m)!/n!] [(n/2)!/(n/2-m/2)!(m/2)!].

When V^n_zz,m is substituted in (<ref>) and the expression for W_n is recognized from (<ref>), the expression for I_zz,n becomes:

    I_zz,n=W_n/n!∑_m=0^n[(m/2+1 )(n/2)!/(n/2-m/2)!(m/2)!] y_d^mz_d^n-m,

At this point, we notice that I_zz,n is actually a sum of two series-summations as follows:

    ∑_m=0^n[(n/2)!/(n/2-m/2)!(m/2)!] y_d^mz_d^n-m = (y_d^2+z_d^2)^n/2,


    ∑_m=0^n[(n/2)!/(n/2-m/2)!(m/2-1)!] y_d^mz_d^n-m
    = y_d^2(n/2) ∑_m=0^n[(n/2-1)!/(n/2-m/2)!(m/2-1)!] y_d^m-2z_d^n-m
    =n/2y_d^2 (y_d^2+z_d^2)^n/2-1.

After substituting these series summation values in (<ref>), the final expression for I_zz,n reduces to:

    I_zz,n = W_n/n!(y_d^2+z_d^2)^(n/2-1)[(n/2+1)y_d^2+z_d^2].

In a similar fashion, the expressions for other I_pq,n for even values of n can be derived as follows:

    I_xx,n = W_n/n!( n/2+1 )(y_d^2+z_d^2)^(n-1),


    I_yy,n = W_n/n!(y_d^2+z_d^2)^(n/2-1)[y_d^2+(n/2+1)z_d^2],


    I_yz,n = I_zy,n = -W_n/n!( n/2) (y_dz_d) (y_d^2+z_d^2)^(n/2-1)


    I_xy,n = I_yx,n = I_xz,n = I_zx,n = 0.

Note that, the condition I_pq,n=0 for odd values of n holds true. Furthermore, (<ref>) suggests that the IDs oriented orthogonal to the plane of arrangement (i.e. x-directed IDs) do not have any correlation with the IDs oriented along the plane of arrangement (i.e. y-directed or z-directed IDs).



 §.§ Analytical CGF Estimation for Three-Dimensional Dipole Arrays: Generalized Case

Finally we consider the most general case of three-dimensional arrays with no restrictions imposed on the dipole locations, i.e. in general, x_d≠ y_d≠ z_d≠ 0. Here, it turns out we have to deal with a trinomial expansion or successive binomial expansions of (r_d)^n where 

    r_d=x_dsinθcosϕ+y_dsinθsinϕ + z_dcosθ.

Therefore, the analytical integrations needed to evaluate I_pq,n (see (<ref>)) become slightly more complicated. Performing integration both by-hand using the properties of Beta and Gamma functions as before, we determine the following general formula for I_pq,n for even values of n:   

    I_xx,n = W_n/n![x_d^2+( n/2+1 )y_d^2+( n/2+1 )z_d^2] d^n-2,


    I_yy,n = W_n/n![( n/2+1 )x_d^2+y_d^2+( n/2+1 )z_d^2] d^n-2,


    I_zz,n = W_n/n![( n/2+1 )x_d^2+( n/2+1 )y_d^2+z_d^2] d^n-2,


    I_xy,n=I_yx,n=-W_n/n![ nx_dy_d/2] d^n-2,


    I_yz,n=I_zy,n=-W_n/n![ ny_dz_d/2] d^n-2,


    I_zx,n=I_xz,n=-W_n/n![ nx_dz_d/2] d^n-2,

where,

    d=√(x_d^2+y_d^2+z_d^2)

However the results are further validated by use of the symbolic toolbox in MATLAB (see appendix). It is observed that for odd values of n, I_pq,n=0. Also note that, the expressions for one-dimensional and two-dimensional ID arrays can be easily computed back from (<ref>)-(<ref>), substituting x_d,y_d and z_d accordingly. Consequently, the results of this subsection (<ref>)-(<ref>) are the most general but we opted for presenting the one- and two-dimensional cases for convenience since the mathematical treatment is considerably more complex in three dimensional arrays while lower-dimensional MIMO systems tend to be more commonly encountered in practice. 

Now, similar to our approach for the linear array (or 1D case), it is crucial to predict the maximum number of terms N needed to truncate the series in (<ref>). With that objective in mind, we start by carefully examining I_xx,n, where we note that for n>0:

    I_xx,n=W_n/n![x_d^2+( n/2+1 )y_d^2+( n/2+1 )z_d^2] d^n-2
    <W_n/n!( n/2+1 )[x_d^2+y_d^2+z_d^2]d^n-2.

Using d from (<ref>), following the same procedure for all all p=x,y,z, and applying the Stirling's approximation (<ref>), the upper-bound of I_pp,n can be expressed as:

    I_pp,n|_U.B.= W_n( n/2+1 ) d^n/n! = W_n( n+2/2√(2π n))  (epλ/n)^n,

where d=pλ. Therefore, when this I_pp,n is used in (<ref>) containing the (jk)^n term where k=2π/λ, we would obtain a term (2π ep /n)^n, very much similar to (<ref>). Therefore, it can be deduced that the maximum N-value for the three-dimensional array situation also follows the same guideline given by (<ref>). 

































































§ CONCLUSION

The present paper analytically estimates the frequency-domain CGF tensor by employing an accurate series expansion, followed by detailed integration of functions involving trigonemetric expressions of elevation (θ) and azimuth (ϕ) angles. Expressions for coefficients I_pq,n are formulated for the general three-dimensional case (see (<ref>)-(<ref>)), which enables very efficient CGF-tensor calculation by simply using the knowledge of inter-element spacing (x_d, y_d and z_d) between the ID-pairs, along with their relative polarizations. We systematically demonstrate the effect of number of terms N needed to truncate the series used for approximating the CGFs (see (<ref>)), and proposed an effective equation (<ref>) for estimating N from spacing between the IDs. 





§ APPENDIX


While deriving the I_pq,n expressions for the one/two/three dimensional cases, we encountered several definite integrations (over the full θ-ϕ space), involving arbitrary powers of trigonometric functions sinθ, cosθ, sinϕ and cosϕ. To obtained closed form solutions of these integrations, we utilized the well-known Beta functions B(m,n) having the mathematical form <cit.>

    B(m,n)=∫_0^1 z^m-1 (1-z)^n-1 dz.

The connection between the Beta functions and the integrals involving trigonometric functions is established using

    B(m+1,n+1)=2∫_0^π/2cos^2m+1θsin^2n+1θ dθ.

Now, the analytical evaluation of Beta functions is performed by invoking the Gamma functions via the relation <cit.>

    B(m,n)=Γ(m)Γ(n)/Γ(m+n),

where,

    Γ(n+1)=n!   and  Γ(n+1/2) = (2n)!/2^2n n!√(π).


Next, we provide solutions for the four general classes of definite integrals involving sinθ and cosθ, that are encountered during the derivations.



Class-I: Power of sin odd, Power of cos even:

    ∫_0^πsin^2m+1θcos^2nθ dθ = B(n+1/2,m+1).


    ∫_0^2πsin^2m+1θcos^2nθ dθ = 0.





Class-II: Power of sin odd, Power of cos odd:

    ∫_0^πsin^2m+1θcos^2n+1θ dθ = ∫_0^2πsin^2m+1θcos^2n+1θ dθ =  0.





Class-III: Power of sin even, Power of cos odd:

    ∫_0^πsin^2mθcos^2n+1θ dθ = ∫_0^2πsin^2mθcos^2n+1θ dθ = 0.





Class-IV: Power of sin even, Power of cos even:

    ∫_0^πsin^2mθcos^2nθ dθ=1/2∫_0^2πsin^2mθcos^2nθ dθ
    =B(n+1/2,m+1/2).















99
mimo_book1 J. R. Hampton, Introduction to MIMO Communications, Cambridge, U.K.: Cambridge Univ. Press, 2014.

5g_yang Y. Yang, J. Xu, G. Shi, and Cheng-Xiang Wang, 5G Wireless Systems: Simulation and Evaluation Techniques, Springer 2017.

chanmod_4 C. X. Wang, J. Bian, J. Sun, W. Zhang and M. Zhang, “A Survey of 5G Channel Measurements and Models,” IEEE Communications Surveys and Tutorials, vol. 20, no. 4, pp. 3142-3168, Fourth Quarter, 2018. 

mimo_book2 T. L. Marzetta, E. G. Larsson, H. Yang, and H. Q. Ngo, Fundamentals of Massive MIMO, Cambridge, U.K.: Cambridge Univ. Press, 2016.

mm_wave_2018 J. du Preez and S. Sinha, Millimeter-Wave Antennas: Configurations and Applications, Springer, 2018.



mimo_book4 A. Chockalingam and B. S. Rajan, Large MIMO Systems, Cambridge, U.K.: Cambridge Univ. Press, 2014.





spacetime A. Paulraj and C. Papadias, “Space-time processing for wireless communications,” IEEE Signal Processing Magazine, vol. 14, no. 6, pp. 49-83, 1997.

doa J. Dmochowski, J. Benesty and S. Affes, “Direction of Arrival Estimation Using the Parameterized Spatial Correlation Matrix,” IEEE Transactions on Audio, Speech and Language Processing, vol. 15, no. 4, 2007.



chanmod_2 K. Zheng, S. Ou and X. Yin, “Massive MIMO Channel Models: A Survey,” International Journal of Antennas and Propagation (Hindawi), Article ID 848071, pp. 1-10, 2014.



karaboikis M. P. Karaboikis, V. C. Papamichael, G. F. Tsachtsiris, C. F. Soras, and V. T. Makios, “Integrating Compact Printed Antennas Onto Small Diversity/MIMO Terminals,” IEEE Transactions on Antennas and Propagation, vol. 56, no. 7, pp. 2067-2078, 2008.

ampoma_1 A. E. Ampoma, H. Zhang, Y. Huang, G. Wen, and O. G. Kwame, “Three dimensional spatial fading correlation of uniform rectangular array using total power of angular distribution,” IEEE Antennas and Wireless Propagation Letters, vol. 16, pp. 2134–2137, 2017.









jensen_wallace J. W. Wallace and M. A. Jensen, “Electromagnetic Considerations for Communicating on Correlated MIMO Channels with Covariance Information,” IEEE Transactions on Wireless Communications, vol. 7, no. 2, pp. 543-551, February 2008.

vaughan R. Vaughan and J. B. Andersen, Channels, Propagation, and Antennas for Mobile Communications, IET, London, 2003.

antenna_topology C. T. Neil, M. Shafi, P. J. Smith, and P. A. Dmochowski, “On the impact of antenna topologies for massive MIMO systems,”Proc. IEEE Int. Conf. Commun. (ICC), London, U.K., Jun. 2015, pp. 2030–2035.

janaswamy R. Janaswamy, “Effect of Element Mutual Coupling on the Capacity of Fixed Length Linear Arrays,” IEEE Antennas and Wireless Propagation Letters, vol. 1, pp. 157-159, 2002.





mikki_cgf_2015 S. M. Mikki and Y. M. M. Antar, “On Cross Correlation in Antenna Arrays With Applications to Spatial Diversity and MIMO Systems,” IEEE Transactions on Antennas and Propagation, vol. 63, no. 4, pp. 1798-1810, 2015.

mikki_book S. Mikki and Y. M. M. Antar, New Foundations for Applied Electromagnetics: Spatial Structures of Electromagnetic Field, Norwood, MA, USA: Artech House, 2016.

mikki_access S. M. Mikki, S. Clauzier and Y. M. M. Antar, “Empirical Geometrical Bounds on MIMO Antenna Arrays for Optimum Diversity Gain Performance: An Electromagnetic Design Approach,” IEEE Access, vol. 6, pp. 39876-39894, 2018.



mikki_idm1 S. M. Mikki and A. Kishk, “Theory and Applications of Infinitesimal Dipole Models for Computational Electromagnetics,” IEEE Transactions on Antennas and Propagation, vol. 55, no. 5, pp. 1325-1337, 2007.

mikki_idm2 S. M. Mikki and Y. M. M. Antar, “Near-Field Analysis of Electromagnetic Interactions in Antenna Arrays Through Equivalent Dipole Models,” IEEE Transactions on Antennas and Propagation, vol. 60, no. 3, pp. 1381-1389, 2012.

karimkashi S. Karimkashi, A. A. Kishk, and D. Kajfez, “Antenna array optimization using dipole models for MIMO applications,” IEEE Transactions on Antennas and Propagation, vol. 59, no. 8, pp. 3112–3116, Aug. 2015.

izquierdo_1 J. F. Izquierdo, J. Rubio, and J. Zapata, “Antenna-Generalized Scattering Matrix in Terms of Equivalent Infinitesimal Dipoles: Application to Finite Array Problems,” IEEE Transactions on Antennas and Propagation, vol. 60, no. 10, pp. 4601-4609, 2012.

karimkashi_0 S. Karimkashi, A. Kishk, and G. Zhang, “Modelling of aperiodic array antennas using infinitesimal dipoles,” IET Microwaves, Antennas Propagation, vol. 6, no. 7, p. 761, 2012.

izquierdo_2 J. F. Izquierdo, J. Rubio, J. Crcoles, R. Gmez-Alcal, “Efficient Radiation Antenna Modeling via Orthogonal Matching Pursuit in Terms of Infinitesimal Dipoles,” IEEE Antennas and Wireless Propagation Letters, vol. 15, pp. 444-447, June 2015. 

clauzeir_slotarray S. Clauzier, S. Mikki, A. Shamim and Y. M. M. Antar, “A New Method for the Design of Slot Antenna Arrays: Theory and Experiment,” Proceedings of 10th European Conference on Antennas and Propagation,  Davos, Switzerland, pp. 1-4, April 2016.

yang_idm S. J. Yang, D. J. Yun, H. J. Kim, J. I. Lee, W. Y. Yang, and N.H. Myung, “Antenna far-field prediction using restricted IDM based convex optimization,” Proceedings of IEEE Asia Pacific Microwave Conference (APMC), pp. 1-4, 2017.

idm_blade_antenna I. A. Baratta, and C. B. de Andrade, “Installed Performance Assessment of Blade Antenna by means of the Infinitesimal Dipole Model,” IEEE Latin America Transactions, vol. 14, no. 2, pp. 569-574, 2016.

yang_idm_2 S. J. Yang, Y. D. Kim, D. J. Yun, D. W. Yi, and N. H. Myung, “Antenna Modeling Using Sparse Infinitesimal Dipoles Based on Recursive Convex Optimization,” IEEE Antennas and Wireless Propagation Letters, vol. 17, no. 4, pp. 662-665, 2018.



clauzier1 S. Clauzier, S. M. Mikki and Y. M. M. Antar, “Design of high diversity gain MIMO antenna arrays through surface current optimization,” Proceedings of IEEE International Symposium on Antennas and Propagation and USNC/URSI National Radio Science Meeting, pp. 9-10, 2015.

clauzier2 S. Clauzier, S. M. Mikki and Y. M. M. Antar, “Generalized methodology for antenna design through optimal infinitesimal dipole model,” Proceedings of International Conference on Electromagnetics in Advanced Applications (ICEAA), pp. 1264-1267, 2015.

clauzier3 S. Clauzier, S. M. Mikki, and Y. M. M. Antar, “A Generalized Methodology for Obtaining Antenna Array Surface Current Distributions With Optimum Cross-Correlation Performance for MIMO and Spatial Diversity Applications,” IEEE Antennas and Wireless Propagation Letters, vol. 14, pp. 1451-1454, 2015.

idm_cgf_mmimo_2019 D. Sarkar, S. M. Mikki and Y. M. M. Antar, “Eigenspace Structure Estimation for Dual-Polarized Massive MIMO Systems Using an IDM-CGF Technique,” to appear in IEEE Antennas and Wireless Propagation Letters, 2019.

ds_tap_1 D. Sarkar and K. V. Srivastava, “Application of Cross-correlation Green’s Function along with FDTD for Fast Computation of Envelope Correlation Coefficient over Wideband for MIMO Antennas,” IEEE Transactions on Antennas and Propagation, vol. 65, no. 2, pp. 730-740,  2017.

ds_tap_2 D. Sarkar and K. V. Srivastava, “Modified Cross-correlation Green's Function with FDTD for Characterization of MIMO Antennas in Non-uniform Propagation Environment,” IEEE Transactions on Antennas and Propagation, vol. 66, no. 7, pp. 3798-3803, 2018.

ds_aps_2018 D. Sarkar, S. M. Mikki, K. V. Srivastava and Y. M. M. Antar, “Cross-Correlation Greens Function for Interaction Between Electric and Magnetic Current Sources,” Proceedings of 2018 IEEE International Symposium on Antennas and Propagation and USNC-URSI Radio Science Meeting (APS-URSI 2018), Boston, Massachusetts, USA, 2018.

mikki_stochastic S. M. Mikki and J. Aulin, “The stochastic electromagnetic theory of antenna-antenna cross-correlation in MIMO systems,”
Proceedings of European Conference on Antennas and Propagation (EuCAP 2018), London, UK, April 9-13, 2018.

directivity_cgf S. M. Mikki, S. Clauzier and Y. M. M. Antar, “A Correlation Theory of Antenna Directivity With Applications to Superdirective Arrays,” IEEE Antennas and Wireless Propagation Letters, 2019. (Early Access)



ds_eucap1 D. Sarkar, S. M. Mikki, K. V. Srivastava and Y. M. M. Antar, “Analytical Approximation of the Time-dependent Antenna Cross-correlation Green’s Function,” Proceedings of European Conference on Antennas and Propagation (EuCAP 2018), London, UK, pp. 1-4, 2018.

ds_aps2019_1 D. Sarkar, S. M. Mikki and Y. M. M. Antar, “Estimation of the Cross-Correlation Green’s Function for MIMO Systems,” submitted to 2019 IEEE International Symposium on Antennas and Propagation and USNC-URSI Radio Science Meeting (APS-URSI 2019), Georgia, Atlanta, USA, 2019.  





dutka J. Dutka, “The early history of the factorial function,” Archive for History of Exact Sciences (Springer), vol. 43, no. 3, pp. 225–249, 1991.

robbins H. Robbins, “A Remark on Stirling's Formula,” The American Mathematical Monthly, vol. 62, no. 1, pp. 26–29, 1955.

beta_gamma M. Abramowitz and I. A. Stegun, Handbook of Mathematical Functions with Formulas, Graphs, and Mathematical Tables, Dover Publications, First Edition, Washington D.C., New York, 1983. 



















































































