Assume that you wish to sort a sequence x[n] of length N = 16 into bit-reversed order for input to an FFT algorithm. Give the new sample order for the bit-reversed sequence.
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.