On Jan 3, 11:53 pm, "Jon Slaughter" wrote: [.....]
The code for docomposing into Walsh waveforms looks a lot like the one for doing an FFT. It runs a lot faster than FFT because no sin(X) needs to be done.
Even the non-fast version looks like the non-fast FT. You need the ability to do a parity check computation. It looks a lot like this:
Sum = 0 Mask = BitReverse(Freq)
for I = 0 to N-1 if Parity(Mask AND I) Sum = Sum + X[I] else Sum = Sum - X[I] next I