A recursive algorithm for pruned bit-reversal permutations

A fast recursive algorithm for pruned bit-reversal permutations is proposed. The algorithm is based on a computationally efficient scheme for evaluating a novel permutation statistic called permutation inliers that counts inlier addresses under pruning. This statistic is computed by evaluating a recursion using integer shift and add operations in logarithmic time complexity. Moreover, a parallel pruned interleaving algorithm based on computing multiple inliers in parallel is proposed. The advantages of the proposed algorithm are reduced latency and reduced memory requirements, which are describe in many signal processing and communication applications.