[SciPy-User] frequency components of a signal buried in a noisy time domain signal
Sat Feb 27 12:45:09 CST 2010
On Sat, Feb 27, 2010 at 12:41, <email@example.com> wrote:
> On Sat, Feb 27, 2010 at 1:31 PM, Charles R Harris
> <firstname.lastname@example.org> wrote:
>> On Sat, Feb 27, 2010 at 11:02 AM, Robert Kern <email@example.com> wrote:
>>> On Sat, Feb 27, 2010 at 04:02, Ivo Maljevic <firstname.lastname@example.org>
>>> > 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)
>> 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
"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
More information about the SciPy-User