A refinement for the computation of the rigorous part of the multi-level fast multipole method (MLFMM) of analyzing volumetric objects is presented. A scheme based on the fast Fourier technique (FFT) is proposed with the objective of reducing the computational resources required to accurately analyze large homogeneous and non-homogeneous dielectric volumes. In order to reduce the memory requirements, the storage of the near-field terms of the method of moments (MoM) matrix is performed only for the positions corresponding to a parallelepiped with the size of the level 1 block of the MLFMM, computed with the vacuum permittivity, taking advantage of the Toeplitz symmetry present in regular hexahedral meshes. The FFT avoids applying the near-field MoM matrix in the iterative solution process. The application of this approach results in huge improvements in terms of memory usage, but also a speeds up the iterative solution process because the use of three-dimensional (3D) FFTs is very efficient for computing convolutions when the number of unknowns of the problems becomes very large as happens in volumetric problems. We also propose a new approach for the numerical treatment of the transition of the dielectric permittivity between different dielectrics or between a dielectric and a free space. To validate the computation technique, the radar cross section (RCS) of several dielectric bodies is computed using the classical MLFMM approach and it is compared with the presented FFT-based-MLFMM solution. The results demonstrate that the efficient memory and computation time usage of the proposed approach.
3 December 2014 in IEEE Antennas and Propagation Magazine
This work deals with the design, analysis, and measurement of a novel multibeam reflector feed at X band. The whole system is composed of a five-horn array and two layers of electromagnetic bandgap (EBG) material. The goal of this antenna is to obtain high gain over a wide bandwidth, while maintaining a compact size. An efficient optimization process was carried out to find the optimum dimensions of the feed antenna. The final design was built and measured. High illumination performance was achieved. The feed antenna provided 5.5% of 3 dB gain bandwidth and 3.1% of 1.5 dB gain bandwidth, which is higher compared to designs previously reported in the literature.
BICGSTAB-FFT method of moment (MM) scheme is proposed to analyze several levels of planar generic layouts embedded in large multilayer structures when the layout geometries are modeled by NURBS surfaces. In this scheme, efficient computation of normalized error defined in iterative bi-conjugate gradient stabilized (BICGSTAB) method for large multilayer structure analysis problems is implemented. The efficient computation is based on pulse expansion with dense equi-spaced mesh of generalized rooftop basis functions (BFs) defined on NURBS surfaces and equivalent periodic problem (EPP) in order to apply fast Fourier transforms (FFT). Moreover, efficient computation of Green’s functions for multilayer structure is implemented for near and far field regions. Experimental and numerical validations of whole printed reflect array antennas of electrical size between 8 and 16 times the vacuum wavelengths are shown. In these validations, CPU time consumptions of the proposed method are obtained with results between few minutes and half an hour using a conventional laptop.
In this paper, an efficient technique of computation of method of moments (MM) matrix entries for multilayer periodic structures with NURBS surface and Bézier patches modelling is proposed. An approximation in terms of constant pulses of generalized rooftop basis functions (BFs) defined on Bézier patches is proposed. This approximation leads discrete convolutions instead of usual continuous convolution between Green’s functions and BFs obtained by the direct mixed potential integral equation (MPIE) approach. An equivalent periodic problem (EPP) which contains the original problem is proposed to transform the discrete convolutions in discrete cyclic convolutions. The resultant discrete cyclic convolutions are computed by efficiently using the Fast Fourier Transform (FFT) procedure. The performance of the proposed method and direct computation of the MM entries are compared for phases of reflection coefficient. The proposed method is between 9 and 50 times faster than the direct computation for phase errors less than 1 deg. The proposed method exhibits a behaviour of CPU time consumption of O(NbLog10Nb) as the number Nb of BFs increases. This behaviour provides significant CPU time savings with respect to the expected behaviour of O(Nb2) provided by the direct computation of the MM matrix entries.
Fast computation of the coefficients of the reduced impedance matrix of the method of moment (MM) is proposed by expanding the basis functions (BFs) in pulses and solving an equivalent periodic problem (EPP) for analyzing large multilayer structures with non-uniform rational basis spline (NURBS) modeling of the embedded layout. These coefficients are required by the computation of sparse approximate inverse (SAI) preconditioner, which leads an efficient iterative version of the MM. This reduced coefficient matrix only considers the near field part of the MM matrix. Discrete functions of small sizes are required to implement the pulse expansion and EPP. These discrete functions of small size lead to discrete cyclic convolutions that are computed in a very fast way by fast Fourier transform (FFT)-accelerated matrix–vector multiplication. Results obtained using a conventional laptop show an analysis of very large multilayer structures with resonant layouts, as whole reflectarrays of electrical size 40 times the vacuum wavelengths, where the iterative MM with a SAI preconditioner can be 22.7 times faster than the pure iterative MM without any preconditioner.