[SciPy-User] frequency components of a signal buried in a noisy time domain signal

[Robert Kern]

On Sat, Feb 27, 2010 at 12:41,  <josef.pktd at gmail.com> wrote:
> On Sat, Feb 27, 2010 at 1:31 PM, Charles R Harris
> <charlesr.harris at gmail.com> wrote:
>>
>> On Sat, Feb 27, 2010 at 11:02 AM, Robert Kern <robert.kern at gmail.com> wrote:
>>>
>>> On Sat, Feb 27, 2010 at 04:02, Ivo Maljevic <ivo.maljevic at gmail.com>
>>> wrote:
>>> > David,
>>> > Nice way of avoiding log2, but how do you determine the length of your
>>> > tab
>>> > array?
>>>
>>> The input arrays can only be so large. Even on 64-bit machines, the
>>> table need not have more than 64 entries.
>>>
>>>  tab = 2 ** np.arange(np.iinfo(np.intp).bits)
>>>
>>
>> Or
>>
>> tab = 1 << arange(iinfo(intp).bits - 1)
>
> I think I prefer a readable solution to this for calls that are not in
> an inner loop.
>
> scipy.signal.fftconvolve uses the same as Ivo's solution
>
> <<  means it's much larger than 1 ?

It's a bitshift operator. Basically "x << y" means "x * (2 ** y)" for
integer arguments.

-- 
Robert Kern

"I have come to believe that the whole world is an enigma, a harmless
enigma that is made terrible by our own mad attempt to interpret it as
though it had an underlying truth."
  -- Umberto Eco