RBF network optimization of complex microwave systems represented by small FDTD modeling data sets

This paper outlines an original algorithm of neural optimization backed by three-dimensional full-wave finite-difference time-domain (FDTD) simulation and suitable for viable computer-aided design of complex microwave (MW) systems. The frequency response of an S-parameter is optimized with a decompo...

Full description

Saved in:
Bibliographic Details
Published inIEEE transactions on microwave theory and techniques Vol. 54; no. 7; pp. 3069 - 3083
Main Authors Murphy, E.K., Yakovlev, V.V.
Format Journal Article
LanguageEnglish
Published New York, NY IEEE 01.07.2006
Institute of Electrical and Electronics Engineers
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects
Online AccessGet full text

Cover

Loading…
More Information
Summary:This paper outlines an original algorithm of neural optimization backed by three-dimensional full-wave finite-difference time-domain (FDTD) simulation and suitable for viable computer-aided design of complex microwave (MW) systems. The frequency response of an S-parameter is optimized with a decomposed radial basis function (RBF) network capable of dealing with various MW devices. The key feature of the optimization is the dynamic generation of as much FDTD data as the network needs to find a solution satisfying the constraints or the stopping criteria. Other functions contributing to the reduction of computational cost include a choice of an RBF type, radius optimization of the Gaussian RBF, optimization of the regularization parameter, etc. Performance of the algorithm is illustrated by its application to the systems, which can be adequately described only with the full-wave numerical analysis: a double waveguide window, a loaded MW oven, and a patch antenna with two long slits. In all these examples, the network demonstrates excellent generalizing capabilities with the use of relatively small data sets, and the optimized solutions are obtained within fairly reasonable time. The algorithm is shown to be advantageous over conventional gradient and nongradient local-optimization techniques because it is independent of the starting point and having the potential to find the "best" local optimum in the specified domain. Finally, parameters of FDTD simulations and the network operations influencing the computational cost of the optimization are thoroughly discussed.
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:0018-9480
1557-9670
DOI:10.1109/TMTT.2006.877059