IDEAS home Printed from https://ideas.repec.org/a/hin/jnljam/5513346.html
   My bibliography  Save this article

Performance Analysis of FPGA-Based Semi-Dual Active Bridge DC-DC Boost Converter Using Artificial Intelligence Optimization Algorithms

Author

Listed:
  • G. Nethaji
  • J. Kathirvelan

Abstract

This study presents a FPGA-based design and implementation of a semi-dual active bridge (S-DAB) DC-DC boost converter to raise the DC voltage generated by renewable sources while effectively regulating it against line and load fluctuations for inverter applications. The topology and zero current switching technique of the S-DAB converter play crucial roles in enhancing the overall performance and increasing the efficiency. This study employs optimization algorithms such as the neural network controller (NNC), sliding mode controller (SMC), genetic algorithm (GA), firefly algorithm (FA), and particle swarm optimization (PSO) for effective voltage regulation, fast transient response, and stable steady-state response. The S-DAB converter attained an output voltage of 350 V at a current of 0.92 A from the input voltage of 20 V at a current of 17 A and achieved an efficiency of 94.07%. The S-DAB converter was designed and simulated using MATLAB Simulink, and its performance metrics was measured and analyzed for different optimization algorithms. The hardware prototype of the S-DAB converter was implemented using a FPGA controller with different optimization algorithms to provide better voltage regulation and to enhance the converter's time-domain values. The converter's simulation and experimental results were compared, validated, and analyzed, showing close agreement in performance metrics.

Suggested Citation

  • G. Nethaji & J. Kathirvelan, 2025. "Performance Analysis of FPGA-Based Semi-Dual Active Bridge DC-DC Boost Converter Using Artificial Intelligence Optimization Algorithms," Journal of Applied Mathematics, Hindawi, vol. 2025, pages 1-25, December.
  • Handle: RePEc:hin:jnljam:5513346
    DOI: 10.1155/jama/5513346
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/jam/2025/5513346.pdf
    Download Restriction: no

    File URL: http://downloads.hindawi.com/journals/jam/2025/5513346.xml
    Download Restriction: no

    File URL: https://libkey.io/10.1155/jama/5513346?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:hin:jnljam:5513346. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.