Efficient Bit and Digital Reversal Algorithm Using Vector Calculation

This correspondence describes an efficient bit and digital reversal algorithm using vector calculation. It is much more efficient and simple than calculating the bit and digital reversal sequentially one by one using for-loop. An auxiliary small-size seed table can also be used for building up larger table in our algorithm to speed up the computation time. It will be very useful for data shuffling in radix-2 and radix-4 fast Fourier transforms