publications

2025

1. 

   Dense or Sparse? Post-Packing Interconnection Analysis in FPGAs

   Xiaoke Wang, and Dirk Stroobandt

   In Proceedings of the International Symposium on Highly Efficient Accelerators and Reconfigurable Technologies (HEART 2025), 2025

   DOI

2. 

   Adaptive elite learning particle swarm optimization algorithm with complementary sub-strategies for multimodal problems

   Qianbo Lu, Jiaxin Sun, Zhenshan Wang, and 9 more authors

   SCIENCE CHINA Information Sciences, 2025

   Available online: Jul 3, 2025

   DOI

2024

1. 

   A Novel Connection-Based Multicasting Router for Programmable Photonic Circuits

   Xiaoke Wang, Ferre Vanden Kerchove, Raveena Raikar, and 3 more authors

   Journal of Lightwave Technology, 2024

   Abs DOI

   In the rapidly evolving domain of Photonic Integrated Circuits, reconfigurability is making strides through tunable waveguide elements, facilitating ‘general-purpose’ programmable waveguide grids. Routing in modern programmable photonic networks is challenging due to the numerous possibilities that exist for assigning photonic circuits in the grid. Especially the necessary scaling to devices with many more photonic elements calls for more advanced routing heuristics. We can leverage on the existing routers for electronic reconfigurable systems (FPGAs), such as the PathFinder. However, it is crucial to connect network elements while adhering to optical signals’ physical restrictions. This complexity requires careful planning for smooth, error-free connections in the network infrastructure. This paper proposes a novel algorithm addressing routing challenges in programmable photonic circuits, specifically multicasting (single-source-multiple-sink) scenarios. Efficiently conserving the overall utilized routing resources stands as a crucial objective in programmable photonics routing. Our algorithm adeptly tackles multicasting routing problems with a particular focus on shortest pathlength multicasting routing. In contrast to the PathFinder, our algorithm demonstrates notable performance in optimization speed and the utilization of routing resources.

2. 

   The Influence of Interconnection Complexity on the FPGA CAD Flow

   Xiaoke Wang, and Dirk Stroobandt

   In Proceedings of the 2024 ACM International Workshop on System-Level Interconnect Pathfinding (SLIP ’24), Newark, NJ, USA, 2024

   Abs DOI

   Moore’s Law has been guiding the development of the VLSI industry for the past half-century. This law underscores fabrication technology’s crucial role in enhancing chip performance. However, with technology nearing physical limitations, we envisage that there is still significant potential for optimizing interconnection complexity in VLSI design.Interconnection complexity is characterized by Rent’s Rule and the Rent exponent. We propose a new recursive normalized approach that can measure the Rent exponent accurately by eliminating the imbalance between blocks of different sizes. Then we demonstrate that optimizing the Rent exponent of the FPGA netlist can yield substantial benefits throughout the CAD flow process, particularly in physical design. By employing the GNL synthetic netlist generator to control interconnection complexity, we observe that a lower Rent exponent results in reduced running time, total wirelength and area usage. We also include real-world circuits from the Koios 2.0 benchmark suite in our analysis. The run-time of packing, placement and routing are ranging from exponential to double-exponential with respect to the Rent exponent. Our study highlights the significant impact of interconnection complexity on the EDA physical design flow. The results suggest that optimizing the netlist’s interconnection structure during logic synthesis or packing to reduce complexity could enhance the efficiency and performance of the EDA flow.