dynamic-bitset: reversing bits.
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
for (i = 0; i
I find that to be very fast:
http://aggregate.org/MAGIC/#Bit%20Reversal
HTH,
Kobi.
On 11/4/06, chun ping wang
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
for (i = 0; i
_______________________________________________ Boost-users mailing list Boost-users@lists.boost.org http://lists.boost.org/mailman/listinfo.cgi/boost-users
-- - Kobi
Chun,
"chun ping wang" cablepuff@gmail.com> wrote in message news:7253f6b30611040957jd863beyc72ffb73605002bf@mail.gmail.com... 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
for (i = 0; i
Have your tried: std::reverse( b.begin(), b.end() ); or some other valid range in b? Also there is a std::reverse_copy algorithm. IIRC, fft does not use a simple bit reverse. I don't have the details readily accessible to me now but can look into it this evening. Jeff Flinn
participants (3)
-
chun ping wang -
Jeff F -
Kobi Cohen-Arazi