From GUI can import arbitrary data or audio signal. Next we can plot them both in time and frequency domain. Also we can visualize the short time Fourier transform of that signal.
Computes by using the FFT (fast Fourier transform) algorithm the covolution of two discrete sequences.
Simple implementation of  with small modification. Hopefully this is going to help beginners in speech/audio signal processing.
 X. Zhu, G. T. Beauregard and L. L. Wyse, "Real-Time Signal Estimation From Modified Short-Time...
DFT transforms one function into another, which is called the frequency domain representation, or simply the DFT, of the original function (which is often a function in the time domain). But the DFT requires an input function that is discrete and...
The function implement the 2D dyadic(Paley) ordered fast in-place Walsh-Hadamard transform, which can be used in signal processing, pattern recognition and Genetic alogorithms. This algorithm uses a Cooley-Tukey type signal flow graph and is...
This program calculates the non-destructive zoom Fast Fourier transform of a time history.
The input file must be time(sec) and amplitude(units)
Reference: Randall, Frequency Analysis, Bruel & Kjaer, page 170.
Doing linear tests (like ANOVA or t-tests) on proportional data (values between 0 and 1) is difficult since the distributions of these values are not strictly Gaussian, especially when the proportions are near 0 or 1. The Rationalized Arcsine...
Simple Draw Helix Spring 3D Rotate Translate Transform Dilate Save JPG
Betting system is a set of modules that can transform your Drupal site into betting shop. It's mainly designed for course betting.
For better extensibility is created with more modules. It also defines own hooks.
The core of the...
A simple to learn and use, yet very powerful web extraction framework in Ruby. Navigate through the Web, Extract, query, transform and save data from the Web page of interest by the concise and easy to use DSL provided by scRUBYt! -...
Explain why we use fftshift(fft(fftshift(x))) in Matlab instead of fft(x). An example is given. The example and Matlab codes are partially copied from Daniele Disco d-de?s work in "A guide to the Fast Fourier Transform, 2nd Edition".
Transforms a 24x24 pixel patch (576-dimensional) to 132-dimensional representation by averaging pixels far away from the center (i.e. fovea). There is code for both directions of the transform.
IDX = OTSU(I,N) segments the image I into N classes by means of Otsu's N-thresholding method. OTSU returns an array IDX containing the cluster indices (from 1 to N) of each point.
IDX = OTSU(I) uses two classes (N=2, default value).
Toolbox provides thermochemical properties of selected substances by using SOA through web service
The "SOA_service" function allows it to easily obtain, elaborate and to make available thermochemical properties of selected...
PHP transForm is a form generator and processor that allows a website developer an easy way to view/add/edit/delete data in various databases.
In order to use PHP transForm, you must be using at least PHP4.1.1.
This m file acquired and processed using chirp Fourier transform spectrum of HR4000 spectrometer
Nowadays there are heaps of articles on the theory of fuzzy entropy and fuzzy mutual information. However, there is a clear significant lack for a Matlab implementation of these concepts. Based on numerous requests from students and researchers, I...
This m.file shows how to transform a point on a cube by using quaternions, when rotating over a given line.
RSS (Really Simple Syndication) is a lightweight XML format designed for sharing headlines and other Web content.
This VBScript class makes it easy to download and display RSS XML feeds.
- Provides object-based...
This program is open source code of fast Fourier transform in matlab.
Where y is the input argument and p is the normalized size of the input. Let
y = [1 2 3 4 ];
To call the...