Abstract

SummaryIn this work, a simple, efficient and multi objective Honey Bee Mating Optimization (HBMO) is presented for the performance characterization of a microwave transistor to deliver maximum power to the load with the required noise Freq. Thus all the possible compatible {Freq ≥ Fmin, Vout = 1, GTmax} triplets and the corresponding source ZS and load ZL = Z*out (ZS) terminations can be obtained in the device operation domain of (VDS, IDS and f) without working analytically for the nonlinear performance and stability equations. HBMO is a recently emerging meta‐heuristic algorithm that combines the powers of the simulated annealing and genetic algorithms. Here, a microwave transistor is chosen as a case study, effectiveness and efficiency of the HBMO are shown by comparing its performance to those of the standard meta‐heuristics Genetic and Particle Swarm algorithms and the mean cost results for 10 runs are found to be 0.22, 1.65 and 1.85, respectively, for the comparable execution times. Furthermore, all the numerical results are found to agree with their analytical counterparts obtained using the microwave, linear circuit and noise theories. The Feasible Design Target Space FDTS can be built by the cross relations among all the possible compatible {Freq ≥ Fmin, Vout = 1, GTmax} triplets together their terminations {ZS, ZL = Z*out (ZS)} covering all the possible amplifier designs where both noise figure and output power are at a premium. Copyright © 2015 John Wiley & Sons, Ltd.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.