Rearranging algorithms for log<inf>2</inf>(N, 0, p) switching networks with even number of stages

FPGA controller for rearrangeable Log<inf>2</inf>(N, 0, p) fabrics with an even number of stages

“…There are many algorithms for rearrangements, they may have different characteristics (efficiency, time and hardware complexity). We will focus on the algorithm proposed in [9]. Another way of representing the state of the switching fabric is a bipartite graph [6] (i.e.…”

“…5. More detailed analysis of types of blocking connection is given in [9], in this paper type C connections are only important. …”

“…The controller presented in this paper will use the algorithm Algorithm 1: Algorithm for rearrangements without inter ruption of any existing connection [9] Step 1: Wait for a new connection.…”

“…The main goal of algorithm 1 described in [9] is to point out a connection for rearrangement and a new plane for this connection. However, their direct implementation in hardware structures is not possible.…”

“…In this paper lOg2(N,0,p) rerearrangeable switching fabrics will be considered [8]. We will focus on a hardware implementation of the algorithm for rearrangements in switching fabrics with an even number of stages, which was proposed in [9]. This algorithm unblocks a path for a new connection in one rearrangement.…”