I find that to be very fast:<br><br><a href="http://aggregate.org/MAGIC/#Bit%20Reversal">http://aggregate.org/MAGIC/#Bit%20Reversal</a><br><br>HTH,<br>Kobi.<br><br><div><span class="gmail_quote">On 11/4/06, <b class="gmail_sendername">
chun ping wang</b> &lt;<a href="mailto:cablepuff@gmail.com">cablepuff@gmail.com</a>&gt; wrote:</span><blockquote class="gmail_quote" style="border-left: 1px solid rgb(204, 204, 204); margin: 0pt 0pt 0pt 0.8ex; padding-left: 1ex;">
Hey i have a quick question regarding dynamic bits. Is there a quick and effective way to reverse bits. (if so how)... i try swapping.. but i get compile time error.  so that i can calculate iterative-fft since it requires bit-reverse-copy 
<br><br>for (i = 0; i&lt;num_bits/2; ++i)<br>   swap(b[i], b[i+numbits/2]);<br><br>

<br>_______________________________________________<br>Boost-users mailing list<br><a onclick="return top.js.OpenExtLink(window,event,this)" href="mailto:Boost-users@lists.boost.org">Boost-users@lists.boost.org</a><br><a onclick="return top.js.OpenExtLink(window,event,this)" href="http://lists.boost.org/mailman/listinfo.cgi/boost-users" target="_blank">
http://lists.boost.org/mailman/listinfo.cgi/boost-users</a><br><br></blockquote></div><br><br clear="all"><br>-- <br>- Kobi