“…Here, we use the following feasible constraints: the values of N vary as follows: N = {2 6 , 2 7 ,…, 2 20 } and k s = L o , where L o represents the number of consecutive output coefficients to be calculated. In different test scenarios, the SFFTv1, SFFTv2, and SFFTv3 algorithms deliver successful results: the first of them for N = {2 13 , 2 14 ,…, 2 20 } and k s = L o = 50, the second of them for N = {2 13 , 2 14 ,…, 2 20 } and k s = L o = 50, and finally, the third of them for N = {2 10 , 2 11 ,…, 2 20 } and k s = L o = 50, respectively. Furthermore, it was experimentally corroborated that the DFT COMM algorithm was able to deliver efficient results in all such tested sparse scenarios, as reported in Table 9.…”