Ir a la página de inicio del Gobierno del Principado de Asturias

Datos del Documento

Utilice este identificador para citar o enlazar este documento: https://ria.asturias.es/RIA/handle/123456789/11827


Título: Acceleration of Gradient-Based Algorithms for Array Antenna Synthesis with Far Field or Near Field Constraints
Autores: Rodriguez Prado, Daniel
Fernández Vaquero, Álvaro
Arrebola Baena, Manuel
Rodriguez Pino, Marcos
Las-Heras Andrés, Fernando
Palabras Claves: Gradient-based algorithm
optimization
synthesis
aperiodic array
reflectarray
near field
far field
differential contributions
finite differences
Fecha Edición: Oct-2018
Editor: IEEE
Cita Bibliográfica: D. R. Prado, A. F. Vaquero, M. Arrebola, M. R. Pino, F. Las-Heras, "Acceleration of Gradient-Based Algorithms for Array Antenna Synthesis with Far-Field or Near- Field Constraints", IEEE Transactions on Antennas and Propagation, vol. 66, no. 10, pp. 5239-5248, Oct. 2018, DOI: 10.1109/TAP.2018.2859915
Resumen: This work presents a technique for the acceleration of gradient-based algorithms that employ finite differences in the calculation of the gradient for the optimization of array antennas. It is based on differential contributions, which takes advantage of the fact that when an array is optimized, each element is analyzed independently from the rest. Thus, the computation of the gradient of the cost function, which is typically the most time consuming operation of the algorithm, can be accelerated. A time cost study is presented and the technique is implemented, as an example, in the generalized Intersection Approach algorithm for array optimization in near and far fields. Several syntheses are performed to assess the improvement of this technique. In the far field, it is compared for periodic and aperiodic arrays using different approaches for the computation of the gradient, including the analytic derivative. A reflectarray is also optimized in the near field with the goal of improving its quiet zone. The technique of differential contributions shows important reductions in the time per iteration in all three syntheses, specially in that of aperiodic arrays and near field optimization, where the time saved in the evaluation of the gradient is greater than 99%.
URI: https://ria.asturias.es/RIA/handle/123456789/11827
ISSN: 0018-926X
1558-2221
Aparece en las Colecciones:Ingeniería

Archivos en este documento:



Archivo TamañoFormato
01_TAP_DFC_RIA.pdf902,95 kBAdobe PDFVer/Abrir



logo

Todos los documentos en RIA están protegidos por derechos de autor.


Valid XHTML 1.0! DSpace Software Copyright © 2002-2007 MIT and Hewlett-Packard - Contacto