Cost-Effective Network Reordering Using FPGA

. 2023 Jan 10;23(2):819. doi: 10.3390/s23020819

Algorithm 1 Procedure to insert a new packet

U_{j}

Find k such that $S_{i} < U_{s}$ for $1 \leq i \leq k - 1$ , and $S_{i} > U_{s}$ for $i \geq k$

for $k < i \leq M$ in parallel

$P_{i} \leftarrow P_{i - 1}$ ; $P_{k} \leftarrow U_{j}$ ▹ Shift $[P_{k}, P_{k + 1}, \dots, P_{M - 1}]$ to the right; Insert $U_{j}$ in $P_{k}$