Felipe Cátedra
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Felipe Cátedra has a total of 35 co-authors. Here are the top co-authors by number of shared publications:
- Eliseo Garcia
Department de Automática, Universidad de Alcalá, 28801 Alcalá de Henares, Spain
14 shared publications - Lorena Lozano
University of Alcalá
14 shared publications - Carlos Delgado
Department de Ciencias de la Computación, Universidad de Alcalá, 28801 Alcalá de Henares, Spain
13 shared publications - Iván González
Department of Computer Science, University of Alcalá, 28805 Alcalá de Henares, Spain
10 shared publications - Álvaro Somolinos
Department of Computer Science, University of Alcalá, 28805 Alcalá de Henares, Spain
9 shared publications Javier Moreno
Department of Computer Science, University of Alcalá, Alcalá de Henares, Spain
5 shared publications
Latest Publications
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Aerospace and Electronic Systems
- Vol. 62, 17871-17886
Aircraft Classification Using Convolutional Neural Networks on RCS Data and ISAR Images
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Aerospace and Electronic Systems
- Vol. 62, 17871-17886
Aircraft Classification Using Convolutional Neural Networks on RCS Data and ISAR Images
- Open Access
- 10 March 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Open Journal of Antennas and Propagation
- Vol. 6 (3) , 810-820
Application of Relational Databases to the Acceleration of Ray Tracing in High Frequency Asymptotic Techniques
A new ray-tracing acceleration technique is presented for electromagnetic simulation problems using the Uniform Theory of Diffraction and meshes of planar facets. The innovation involves using relational databases to accurately store spatial information, enabling spatial indexing through space partitioning with R-trees. This technique effectively reduces the computational cost of several critical phases, including the shadowing test. Additionally, there are multiple advantages to utilizing this technology, such as automated memory and disk management along with a query planner that organizes the instructions automatically. Direct rays, multiple reflections, multiple transmissions, simple diffraction, and combinations of these effects have been implemented in PostgreSQL and its spatial library PostGIS. Compared to traditional techniques that employ Angular Z-Buffer acceleration and store information solely in RAM using a low-level language, this approach decreases memory usage by more than 90% in complex scenarios. It also shows a decrease in execution time by more than half when the scenario is sufficiently complex.
- 10 March 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Open Journal of Antennas and Propagation
- Vol. 6 (3) , 810-820
Open AccessApplication of Relational Databases to the Acceleration of Ray Tracing in High Frequency Asymptotic Techniques
A new ray-tracing acceleration technique is presented for electromagnetic simulation problems using the Uniform Theory of Diffraction and meshes of planar facets. The innovation involves using relational databases to accurately store spatial information, enabling spatial indexing through space partitioning with R-trees. This technique effectively reduces the computational cost of several critical phases, including the shadowing test. Additionally, there are multiple advantages to utilizing this technology, such as automated memory and disk management along with a query planner that organizes the instructions automatically. Direct rays, multiple reflections, multiple transmissions, simple diffraction, and combinations of these effects have been implemented in PostgreSQL and its spatial library PostGIS. Compared to traditional techniques that employ Angular Z-Buffer acceleration and store information solely in RAM using a low-level language, this approach decreases memory usage by more than 90% in complex scenarios. It also shows a decrease in execution time by more than half when the scenario is sufficiently complex.
- Open Access
- 11 December 2024
- Published by MDPI AG in Electronics
- Vol. 13 (24) , 4890
An Efficient Dual Application of the Adaptive Cross Approximation for Scattering and Radiation Problems
This paper presents a computationally efficient approach for the solution of electromagnetic problems based on the combination of the Characteristic Basis Functions and Adaptative Cross Approximation, allowing an improvement of the processing time and memory requirements with respect to the conventional MoM and CBFM approaches. The presented technique has been validated using a number of cases in order to assess its accuracy and efficiency.
- 11 December 2024
- Published by MDPI AG in Electronics
- Vol. 13 (24) , 4890
Open AccessAn Efficient Dual Application of the Adaptive Cross Approximation for Scattering and Radiation Problems
This paper presents a computationally efficient approach for the solution of electromagnetic problems based on the combination of the Characteristic Basis Functions and Adaptative Cross Approximation, allowing an improvement of the processing time and memory requirements with respect to the conventional MoM and CBFM approaches. The presented technique has been validated using a number of cases in order to assess its accuracy and efficiency.
- Open Access
- 19 July 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Antennas and Propagation
- Vol. 72 (8) , 6831-6836
Efficient Interpolation Technique for the Analysis of RCS Problems
A numerical approach for the reduction of the CPU-time associated with the solution of electromagnetic problems with multiple right hand sides is presented. This technique is especially suited to analyze the monostatic radar cross section of electrically large cases, based on a novel interpolation approach over several directions and/or frequencies, reducing the total simulation time significantly while maintaining a good degree of accuracy. The test cases show that the approach provides accurate results for complex bodies and a noticeable reduction on the CPU-time of the simulations.
- 19 July 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Antennas and Propagation
- Vol. 72 (8) , 6831-6836
Open AccessEfficient Interpolation Technique for the Analysis of RCS Problems
A numerical approach for the reduction of the CPU-time associated with the solution of electromagnetic problems with multiple right hand sides is presented. This technique is especially suited to analyze the monostatic radar cross section of electrically large cases, based on a novel interpolation approach over several directions and/or frequencies, reducing the total simulation time significantly while maintaining a good degree of accuracy. The test cases show that the approach provides accurate results for complex bodies and a noticeable reduction on the CPU-time of the simulations.
- Open Access
- 17 May 2024
- Published by MDPI AG in Mathematics
- Vol. 12 (10) , 1565
Use of the Adaptive Cross Approximation for the Efficient Computation of the Reduced Matrix with the Characteristic Basis Function Method
A technique for the reduction in the CPU-time in the analysis of electromagnetic problems using the Characteristic Basis Function Method (CBFM) is presented here, allowing for analysis of electrically large cases where an iterative solution process cannot be avoided. This technique is based on the use of the Adaptive Cross Approximation (ACA) for the fast computation of the coupling matrix between CBFs belonging to adjacent blocks, as well as the Multilevel Fast Multipole Method (MLFMM) for the computation of matrix−vector products in the solution of the full system. This combination allows for a noticeable reduction in the computational resources during the analysis of electrically large and complex scenarios while maintaining a very good degree of accuracy. A number of test cases serve to validate the presented approach in terms of accuracy, memory and CPU-time compared with conventional techniques.
- 17 May 2024
- Published by MDPI AG in Mathematics
- Vol. 12 (10) , 1565
Open AccessUse of the Adaptive Cross Approximation for the Efficient Computation of the Reduced Matrix with the Characteristic Basis Function Method
A technique for the reduction in the CPU-time in the analysis of electromagnetic problems using the Characteristic Basis Function Method (CBFM) is presented here, allowing for analysis of electrically large cases where an iterative solution process cannot be avoided. This technique is based on the use of the Adaptive Cross Approximation (ACA) for the fast computation of the coupling matrix between CBFs belonging to adjacent blocks, as well as the Multilevel Fast Multipole Method (MLFMM) for the computation of matrix−vector products in the solution of the full system. This combination allows for a noticeable reduction in the computational resources during the analysis of electrically large and complex scenarios while maintaining a very good degree of accuracy. A number of test cases serve to validate the presented approach in terms of accuracy, memory and CPU-time compared with conventional techniques.
- Open Access
- 5 February 2024
- Published by MDPI AG in Electronics
- Vol. 13 (3) , 657
Flexible Approach for the Generation of Macro-Basis Functions Using the Characteristic Basis Function Method
This document presents a method for reducing the memory and CPU time required for the electromagnetic analysis of complex scenarios employing the Characteristic Basis Function Method. This technique introduces a novel procedure to accelerate the calculation of basis functions and the reduced matrix. The accuracy and computational cost associated with this approach are studied and validated through a number of test cases, making use of about five times less memory than with the conventional approach.
- 5 February 2024
- Published by MDPI AG in Electronics
- Vol. 13 (3) , 657
Open AccessFlexible Approach for the Generation of Macro-Basis Functions Using the Characteristic Basis Function Method
This document presents a method for reducing the memory and CPU time required for the electromagnetic analysis of complex scenarios employing the Characteristic Basis Function Method. This technique introduces a novel procedure to accelerate the calculation of basis functions and the reduced matrix. The accuracy and computational cost associated with this approach are studied and validated through a number of test cases, making use of about five times less memory than with the conventional approach.
- 18 January 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Antennas and Wireless Propagation Letters
- Vol. 23 (4) , 1341-1345
A Computationally Efficient Technique Using Characteristic Basis Functions and Large Block Sizes
A technique for the reduction of the CPU-time in the solution of complex electromagnetic problems using the Characteristic Basis Function Method is presented. This approach allows the analysis of electrically large cases iteratively using the Multilevel Fast Multipole Method to account for the matrix-vector products and defines a new procedure for the fast computation of the Characteristic Basis Functions and the reduced matrix. Some representative test cases show that the approach provides accurate results for complex bodies with a noticeable efficiency improvement.
- 18 January 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Antennas and Wireless Propagation Letters
- Vol. 23 (4) , 1341-1345
A Computationally Efficient Technique Using Characteristic Basis Functions and Large Block Sizes
A technique for the reduction of the CPU-time in the solution of complex electromagnetic problems using the Characteristic Basis Function Method is presented. This approach allows the analysis of electrically large cases iteratively using the Multilevel Fast Multipole Method to account for the matrix-vector products and defines a new procedure for the fast computation of the Characteristic Basis Functions and the reduced matrix. Some representative test cases show that the approach provides accurate results for complex bodies with a noticeable efficiency improvement.
- Open Access
- 8 September 2021
- Published by MDPI AG in Electronics
- Vol. 10 (18) , 2196
Fast Hybrid Computational Technique for the Analysis of Radome Structures Using Dual Domain Decomposition
This work details a technique tailored to the analysis of complex radome structures based on the non-overlapping separation of two different domains: antenna and radome. Both domains are analyzed isolated using the method of moments with the multilevel fast multipole algorithm (MoM-MLFMA) for the antenna domain and a modified characteristic basis function method with the multilevel fast multipole algorithm approach for the radome domain. An iterative procedure is then applied to compute the effect of each domain over the complementary domain. This approach usually converges into a few iterations, yielding very good results and significant efficiency improvements with respect to other efficient approaches such as a full-wave MoM-MLFMA analysis of the full problem. A realistic test case is included, considering a radome with an embedded frequency selective structure on one of its interfaces. The results show a very good agreement considering only three iterations between domains, requiring only one-third of the CPU-time needed by the conventional approach.
- 8 September 2021
- Published by MDPI AG in Electronics
- Vol. 10 (18) , 2196
Open AccessFast Hybrid Computational Technique for the Analysis of Radome Structures Using Dual Domain Decomposition
This work details a technique tailored to the analysis of complex radome structures based on the non-overlapping separation of two different domains: antenna and radome. Both domains are analyzed isolated using the method of moments with the multilevel fast multipole algorithm (MoM-MLFMA) for the antenna domain and a modified characteristic basis function method with the multilevel fast multipole algorithm approach for the radome domain. An iterative procedure is then applied to compute the effect of each domain over the complementary domain. This approach usually converges into a few iterations, yielding very good results and significant efficiency improvements with respect to other efficient approaches such as a full-wave MoM-MLFMA analysis of the full problem. A realistic test case is included, considering a radome with an embedded frequency selective structure on one of its interfaces. The results show a very good agreement considering only three iterations between domains, requiring only one-third of the CPU-time needed by the conventional approach.
- Open Access
- 28 June 2021
- Published by MDPI AG in Electronics
- Vol. 10 (13) , 1560
Fast Computation by MLFMM-FFT with NURBS in Large Volumetric Dielectric Structures
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.
- 28 June 2021
- Published by MDPI AG in Electronics
- Vol. 10 (13) , 1560
Open AccessFast Computation by MLFMM-FFT with NURBS in Large Volumetric Dielectric Structures
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.
- 5 April 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Antennas and Propagation
- Vol. 69 (9) , 5881-5891
Efficient Iterative Analysis Technique of Complex Radome Antennas Based on the Characteristic Basis Function Method
We present a new approach for the analysis and design of radome structures. It makes use of extended domain macro-basis functions obtained from the characteristic basis function method in order to represent the current distribution over the radome. This involves computational advantages due to the reduction in the number of unknowns compared to conventional approaches. This approach involves dividing the scenario into two domains, antenna and radome, and calculating the influence between them using a technique that iteratively corrects the error of the currents on each domain. This technique can be used to analyze arbitrary-shaped radome antennas including several material layers with different thicknesses and dielectric properties that can embed frequency selective surfaces on any interface. Several test cases are presented for the validation of the proposed technique.
- 5 April 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Antennas and Propagation
- Vol. 69 (9) , 5881-5891
Efficient Iterative Analysis Technique of Complex Radome Antennas Based on the Characteristic Basis Function Method
We present a new approach for the analysis and design of radome structures. It makes use of extended domain macro-basis functions obtained from the characteristic basis function method in order to represent the current distribution over the radome. This involves computational advantages due to the reduction in the number of unknowns compared to conventional approaches. This approach involves dividing the scenario into two domains, antenna and radome, and calculating the influence between them using a technique that iteratively corrects the error of the currents on each domain. This technique can be used to analyze arbitrary-shaped radome antennas including several material layers with different thicknesses and dielectric properties that can embed frequency selective surfaces on any interface. Several test cases are presented for the validation of the proposed technique.