bit_reverse.m

dft algorithm(no fft) (matlab)

function [yn] = bit_reverse(xn)
%---------------------------------------------------------------
%   Complete this code to obtain a new sequence yn
%   with bit-reversed indices.
%   Although we can make a general code for N=2^m,
%   we'll just make a special code for N=8 for convenience.
%---------------------------------------------------------------
N=8;
for ii=0:N-1
   [q0, r0] = get_qr(ii, 2);
   [q1, r1] = ?
   .....

   jj = ?
   yn(jj+1) = xn(ii+1);
end