Abstract
Pixel antennas provide a straightforward method for antenna design that can meet a given set of specifications. A key step in the design of pixel antennas is the optimization of the hardwire connections between the pixels in the antenna. Due to the very large number of possible pixel connection combinations, this optimization needs to be performed by heuristic algorithms. In this work, the sensitivity analysis is proposed for the efficient optimization of pixel antennas. In the approach, each individual pixel of the antenna is perturbed in turn to obtain the sensitivity vector of the objective function. The sensitivity analysis at each step is performed efficiently through the use of algebraic simplification that avoids matrix inversion and leads to a significant saving in computational load. The optimization process then selects the perturbation with the greatest sensitivity. Two examples are provided to demonstrate the performance of the proposed optimization method. For both examples, the proposed approach performs the optimization with significantly fewer iterations and either achieves a better or similar minimum in the objective function compared to genetic algorithm approaches. Combined with the efficient computation of the sensitivity vector, significant savings in the computational load are achieved compared to existing approaches.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
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.