Comments on: Binary to Gray code conversion for PSK and PAM

By: Krishna Sankar

Krishna Sankar — Thu, 10 Dec 2009 01:02:15 +0000

@vijay: I emailed you the details.

By: vijay j

vijay j — Tue, 08 Dec 2009 11:14:32 +0000

Dear Sir,

Kindly send me the free e-book on AWGN, I am already a memebr.

Thankyou
Vijay

By: Krishna Sankar

Krishna Sankar — Tue, 27 Oct 2009 00:29:25 +0000

@O.S.O: I agree

By: O.S.O

O.S.O — Thu, 22 Oct 2009 04:32:46 +0000

Yes, i agree (strange) !
Disregarding the way of implementation of bitshift/floor under Matlab/Octave, it is well known that (Bit Shifting) is faster than any multiplication/division method, specially on microprocessors.

By: Krishna Sankar

Krishna Sankar — Fri, 09 Oct 2009 00:36:33 +0000

@O.S.O: Thanks for the tip. However, I did a quick experiment with octave using tic-toc and did not observe that using bitshift() instead of floor is faster.
octave:51> clear all; tic; ip = [0:2^20-1];op = bitxor(ip,floor(ip/2));toc
Elapsed time is 0.4 seconds.
octave:52> clear all; tic;ip1 = [0:2^20-1];op1 = bitxor(ip1,bitshift(ip1,-1));toc
Elapsed time is 0.46 seconds.

Agree?

By: O.S.O

O.S.O — Wed, 07 Oct 2009 21:21:32 +0000

Great job
i just wanted to mention that this snippet :
op = bitxor(ip,floor(ip/2));
can be more optimized by just doing a right-shift bit by 1.
so the equivalent code would be :
bitxor(ip,bitshift(ip,-1));
-1 means a 1 bit shift to the right (the negative sign means right).

By: suraj kumar

suraj kumar — Sun, 14 Sep 2008 05:36:19 +0000

i liked your method of conversion very much.
so
thanks