English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Tools annual

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools monthly

Global: Zendy Plus monthly

Presents the access of premium content as premium feature

Premium Content

Global: Zendy Plus annual

Global: Zendy Free Plan

Cost-effective and programmable photonic-driven solutions like electroniccounterparts (FPGAs) can be implemented using waveguide mesh architecturesalong with tunable couplers for routing to implement general-purpose photonicprocessors. These processors/ networks are represented using undirectedweighted graphs, where weights are included to implement constraints in therouting. Faster automated routing and cycle finding algorithms are crucial fordynamic path allocations in live networks to implement various functionalitiesusing these processors. We propose path and cycle finding algorithms based onbidirectional and depth-first search techniques, considering variousperformance metrics for each device to optimize the path according to therequired metric. Multiple cases of path distribution and implementation ofcycles of various sizes have been demonstrated. Various methods to eliminatethe non-functioning or malfunctioning units are proposed. The broadapplicability of the proposed path-finding algorithm has been demonstratedusing the same algorithm to create a list of all the possible input-outputcombinations in a 4*4 photonic switching network. A comparison of availablesearch algorithms in terms of execution time and complexity has been described.

Advanced Routing Algorithms for General Purpose Photonic Processors