21 November 2024 in Journal of Lightwave Technology
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.
27 September 2025 in arXiv
In the realm of programmable photonic integrated circuits (PICs), precise wire length control is crucial for the performance of on-chip programmable components such as optical ring resonators, Mach-Zehnder interferometers, and optical true time-delay lines. Unlike conventional routing algorithms that prioritize shortest-path solutions, these photonic components require exact-length routing to maintain the desired optical properties. To address these challenges, this paper presents different length-matching routing strategies to find exact-length paths while balancing search space and runtime efficiently. We propose a novel admissible heuristic estimator and a pruning method, designed to enhance the accuracy and efficiency of the search process. The algorithms are derived from the Best-First search with modified evaluation functions. For two-pin length-matching routing, we formally prove that the proposed algorithms are complete under monotonic heuristics. For multi-pin length-matching challenges, we introduce a pin-ordering mechanism based on detour margins to reduce the likelihood of prematurely blocking feasible routes. Through evaluations on various length-matching benchmarks, we analyze runtime and heuristic performance, demonstrating the effectiveness of the proposed approaches across different layout scenarios.
6 March 2026 in Integration