{"id":25340,"date":"2023-12-07T08:36:21","date_gmt":"2023-12-07T00:36:21","guid":{"rendered":"http:\/\/hazlina-backup-25340"},"modified":"2023-12-07T08:36:21","modified_gmt":"2023-12-07T00:36:21","slug":"25340","status":"publish","type":"post","link":"\/hazlina-blog\/2023\/12\/07\/25340\/","title":{"rendered":"Publication 2023\/1 \u2013 FPGA Implementation of Metaheuristic Optimization Algorithm"},"content":{"rendered":"<p>Our recent publication :).<\/p>\n<p>In hardware implementations, a key hurdle emerged concerning complex numbers &#8211; especially in metaheuristics optimization algorithms. Our binary approach, marked by precision and adaptability, elegantly addressed this challenge, offering a streamlined solution for efficient FPGA implementation.<\/p>\n<p><img loading=\"lazy\" decoding=\"async\" class=\"alignnone size-large wp-image-25341\" src=\"\/hazlina\/wp-content\/uploads\/2023\/12\/fpga-1024x475.png\" alt=\"\" width=\"840\" height=\"390\" srcset=\"\/hazlina\/wp-content\/uploads\/2023\/12\/fpga-1024x475.png 1024w, \/hazlina\/wp-content\/uploads\/2023\/12\/fpga-300x139.png 300w, \/hazlina\/wp-content\/uploads\/2023\/12\/fpga-768x356.png 768w, \/hazlina\/wp-content\/uploads\/2023\/12\/fpga-1200x557.png 1200w, \/hazlina\/wp-content\/uploads\/2023\/12\/fpga.png 1366w\" sizes=\"auto, (max-width: 709px) 85vw, (max-width: 909px) 67vw, (max-width: 1362px) 62vw, 840px\" \/><\/p>\n<p><a title=\"SCImago Journal &amp; Country Rank\" href=\"https:\/\/www.scimagojr.com\/journalsearch.php?q=21101132922&amp;tip=sid&amp;exact=no\"><img decoding=\"async\" src=\"https:\/\/www.scimagojr.com\/journal_img.php?id=21101132922\" alt=\"SCImago Journal &amp; Country Rank\" border=\"0\" \/><\/a><br \/>\nIn this research we look into the world of cutting-edge metaheuristic algorithms, gaining popularity for their prowess in solving complex optimization problems.<\/p>\n<p>Curious about their potential for FPGA implementation, we embarked on a journey to identify and adapt suitable metaheuristics. Our spotlight fell on the Simulated Kalman Filter (SKF) &#8211; a low-complexity, minimal-step algorithm.<\/p>\n<p>The adventure continued as we transformed the original SKF into the Discrete SKF, rounding off floating-point values and fixing the Kalman gain at 0.5. But that wasn&#8217;t the end! We harnessed the power of behavioral modeling to birth the Binary SKF, fine-tuned for FPGA implementation.<\/p>\n<p>The design strategy emphasized modularity, breaking down the metaheuristic into distinct modules for efficient management. Plus, we optimized with a Parallel-In-Parallel-Out configuration for ports.<\/p>\n<p>Simultaneously, we simulated the Discrete SKF on MATLAB and brought the Binary SKF to life on FPGA. The results? Mind-blowing! The Binary SKF achieved speeds up to 69 times faster than the Discrete SKF simulation.<\/p>\n<p>Join us in celebrating this breakthrough \ud83d\ude42 , where FPGA meets metaheuristic excellence!<\/p>\n<p>#UMPSTEMLab #FPGA #MetaheuristicAlgorithms<\/p>\n","protected":false},"excerpt":{"rendered":"<p>Our recent publication :). In hardware implementations, a key hurdle emerged concerning complex numbers &#8211; especially in metaheuristics optimization algorithms. Our binary approach, marked by precision and adaptability, elegantly addressed this challenge, offering a streamlined solution for efficient FPGA implementation. In this research we look into the world of cutting-edge metaheuristic algorithms, gaining popularity for &hellip; <a href=\"\/hazlina\/2023\/12\/07\/25340\/\" class=\"more-link\">Continue reading<span class=\"screen-reader-text\"> &#8220;Publication 2023\/1 &#8211; FPGA Implementation of Metaheuristic Optimization Algorithm&#8221;<\/span><\/a><\/p>\n","protected":false},"author":2,"featured_media":0,"comment_status":"closed","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[2],"tags":[12],"class_list":["post-25340","post","type-post","status-publish","format-standard","hentry","category-information","tag-academia-projects"],"_links":{"self":[{"href":"\/hazlina-blog\/wp-json\/wp\/v2\/posts\/25340","targetHints":{"allow":["GET"]}}],"collection":[{"href":"\/hazlina-blog\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"\/hazlina-blog\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"\/hazlina-blog\/wp-json\/wp\/v2\/users\/2"}],"replies":[{"embeddable":true,"href":"\/hazlina-blog\/wp-json\/wp\/v2\/comments?post=25340"}],"version-history":[{"count":0,"href":"\/hazlina-blog\/wp-json\/wp\/v2\/posts\/25340\/revisions"}],"wp:attachment":[{"href":"\/hazlina-blog\/wp-json\/wp\/v2\/media?parent=25340"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"\/hazlina-blog\/wp-json\/wp\/v2\/categories?post=25340"},{"taxonomy":"post_tag","embeddable":true,"href":"\/hazlina-blog\/wp-json\/wp\/v2\/tags?post=25340"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}