| Trees | Indices | Help |
|
|---|
|
|
|
|||
|
Inherited from |
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
Inherited from Inherited from Inherited from Inherited from Inherited from |
|||
|
|||
|
Inherited from |
|||
|
|||
__abstract = Truebool(x) -> bool |
|||
window_increment = param.Number(default= 1, constant= True, doThe most recent portion of the signal on which to perform the Fourier transform, in units of 1/sample_rate, i.e., the length of a sliding window on which to operate. |
|||
window_length = param.Number(default= 0.0001, constant= True, The amount of overlap between each window, in units of 1/sample_rate. |
|||
sample_rate = param.Number(default= 44100, constant= True, docNumber of samples per second, which defines the range for frequency. |
|||
windowing_function = param.Parameter(default= rectangular, conThis function is multiplied with the current window, i.e. |
|||
min_frequency = param.Number(default= 1, doc= Smallest frequency for which to return an amplitude. |
|||
max_frequency = param.Number(default= 20000, doc= Largest frequency for which to return an amplitude. |
|||
name = <param.parameterized.String object at 0xb20d9ec>String identifier for this object. |
|||
|
Inherited from Inherited from |
|||
|
|||
|
Inherited from |
|||
|
|||
|
|
Perform a real Discrete Fourier Transform (DFT; implemented using a Fast Fourier Transform algorithm, FFT) of the current sample from the signal multiplied by the smoothing window. See numpy.rfft for information about the Fourier transform. |
Call the subclass's 'function' method on a rotated and scaled coordinate system. Creates and fills an array with the requested pattern. If called without any params, uses the values for the Parameters as currently set on the object. Otherwise, any params specified override those currently set on the object.
|
|
|||
__abstractbool(x) -> bool Returns True when the argument x is true, False otherwise. The builtins True and False are the only two instances of the class bool. The class bool is a subclass of the class int, and cannot be subclassed.
|
window_incrementThe most recent portion of the signal on which to perform the Fourier transform, in units of 1/sample_rate, i.e., the length of a sliding window on which to operate. Note that the Fourier transform algorithm is most efficient for matrix sizes that are powers of 2, or that can be decomposed into small prime factors; see numpy.fft.rfft.
|
window_lengthThe amount of overlap between each window, in units of 1/sample_rate.
|
sample_rateNumber of samples per second, which defines the range for frequency.
|
windowing_functionThis function is multiplied with the current window, i.e. the most recent portion of the waveform interval of a signal, before performing the Fourier transform. It thus shapes the interval, which would otherwise always be rectangular. The function chosen here dictates the tradeoff between resolving comparable signal strengths with similar frequencies, and resolving disparate signal strengths with dissimilar frequencies. numpy provides a number of options, e.g. bartlett, blackman, hamming, hanning, kaiser; see http://docs.scipy.org/doc/numpy/reference/routines.window.html You can also supply your own.
|
min_frequencySmallest frequency for which to return an amplitude.
|
max_frequencyLargest frequency for which to return an amplitude.
|
| Trees | Indices | Help |
|
|---|
| Generated by Epydoc 3.0.1 on Thu Aug 5 14:59:41 2010 | http://epydoc.sourceforge.net |