The control algorithm and the FPGA controller for non-interruptive rearrangeable Log2(N, 0, p) switching networks
Wojciech Kabaciński, Marek Michalski · 2013
This paper presents the control algorithm for non-interruptive rearrangements in log2(N, 0, p) switching networks. The proposed algorithm is able to find a plane for any new connection in the rearrangeable switching network with no more than three rearrangements. Moreover, these rearrangements can be realized in the switching network without interrupting transmission for existing connections. Rearrangements are done by setting up a new connecting path before the old connecting path for the rearranged connection is disconnected. We also describe the FPGA implementation of this algorithm for the log2(32, 0, 4) switching network. This FPGA controller has been tested and verified.