Ma Jesús Algar

REDESIGN AND OPTIMIZATION OF THE PAVING ALGORITHM APPLIED TO ELECTROMAGNETIC TOOLS (Invited Paper)

To study any electromagnetic system, the geometry model must be discretized into elements with an appropriate size for the working frequency. The discretization of a system must be transparent to the user of electromagnetic computing tools. A mesher is presented based on the paving algorithm. The algorithm has been modifled to allow triangular elements and has been accelerated by distributing the load on multiple processors simultaneously. Also, a multilevel mode has been implemented. With this tool, any geometry deflned by NURBS (Non Uniform Rational B-Spline) surfaces can be decomposed into triangular and quadrangular curved elements.

Efficient RCS analysis of complex targets on infinite ground plane

An approach for computing efficiently monostatic and/or bistatic radar cross section of complex target on an infinite perfect electric conductor or dielectric ground plane is presented. The approach is based on Physical Optics and Equivalent Currents Method together with the Image Theory. The last one is used to obtain the scattering from the target above the ground plane, avoiding to model the infinite ground plane. In order to consider realistic targets composed of dielectric or perfect electric conductor, they are modeled by parametric surfaces (NURBS).

FASANT: A Versatile Tool to Analyze Radio Localization System at Indoor or Outdoor Environments

Due to the increase of the technological area related to the radio localization, coverage study, both indoor and outdoor environments, the role of simulation tools rahter than traditional measurement techniques, are becoming more important. These tools are based on High Frequencies.

Pre-processing and meshing optimization for electromagnetic tools

This work present a new mesh generator capable of improving the quality of the original geometries and ensure continuous meshes with a very high quality to be used in electromagnetic tools. It is based in the paving algorithm- The generated meshes are composed by quadrilateral and triangular curved elements. This algorithm has been parallelized and has a multilevel mode which is a new feature for meshing in several steps, reducing the time for meshing. It has been included in the NewFasant computer tool.

New algorithm to speed-up the computation of the radiation pattern of antennas on board complex structures

The new algorithm developed presents an advance in the analysis of the radiation pattern of antennas on board complex targets. The results shown verify the accuracy of this method and the efficiency in terms of CPU time.

Acceleration algorithm based on master point technique to compute the radiation pattern of reflector structures

To compute the radiation pattern of complex antennas considering multiple bounces, is necessary to obtain the electrical field in a vast number of observation directions or points. Most of the CPU time is consumed in the computation of the ray-trancing that reach the points in which the electrical field is wanted to obtain. Therefore, a new algorithm has been developed, to achieve this goal, allowing the analysis of reflectors and reflectorarrays systems feed with a single horn or an array. This new improvements reduce the CPU time as much as possible without losing accuracy in the results.

Computer code for the efficient calculation of the RCS of complex target considering multiple bounces

This paper presents the improvements in the new POGCROS [1] code for the analysis of the monostatic and/or bistatic radar cross section (RCS) of electrically large complex targets. This computer tool is based on a new iterative algorithm based on angular z-buffer algorithm (AZB), space volumetric partitioning (SVP) and a depth-limited search.

Depth-limited search applied to compute n-order reflections in the analysis of the RCS in large and complex targets

A new iterative algorithm able to consider multiple iterations between different flat surfaces, to compute efficiently the monostatic and/or bistatic radar cross section (RCS) of complex targets is presented. This method is based on a combination of several ray-tracing acceleration techniques as AZB and SVP algorithms together with uniformed search strategies as depth-limited search strategy, reducing the CPU time and memory resources.