Rotating shafts experience a an elliptical motion called whirl. It is important to decompose this motion into a forward and backward whil orbits. The current function makes use of two sensors to generate a bi-directional spectrogram. The method can be extended to any time-frequency distribution
%
% compute the forward/backward Campbell/specgtrogram
%
% INPUT:
% y (n x 2) each column is measured from a different sensor
% ///////
% __
% |s1| y(:,1)
% |__|
% __
% / \ ________|/
% | | | s2 |/ y(:,2)
% \____/ --------|/
%
% Fs Sampling frequnecy
%
% OUTPUT:
% B spectrogram/Campbel diagram
% x x-axis coordinate vector (time or Speed)
% y y-axis coordinate vector (frequency [Hz])
A series of .c and .m files which allow one to perform univariate and bivariate wavelet analysis of discrete time series. Noother wavelet package is necessary -- everything is contained in this archive. The C-code computes the DWT and maximal overlap DWT. MATLAB routines are then used to compute such quantities as the wavelet variance, covariance, correlation, cross-covariance and cross-correlation. Approximate confidence intervals are available for all quantities except the cross-covariance and cross-correlation.
A set of commands is provided. For a description of this example, please see http://www.eurandom.tue.nl/whitcher/software/.
This a software runing on the matlab, it is used in the channel coding simulation.
It include DVB-S2 LDPC, Covolution turbo, and block turbo code, You can choose which channel coding to run.
it run the encoder and add white noise in the channel, then it run the decoder, and compute the error rate.
% binomial.m by David Terr, Raytheon, 5-11-04, from mathworks.com
% Given nonnegative integers n and m with m<=n, compute the
% binomial coefficient n choose m.
Over the years, this bestselling guide has helped countless programmers learn how to support computer peripherals under the Linux operating system, and how to develop new hardware under Linux. Now, with this third edition, it s even more helpful, covering all the significant changes to Version 2.6 of the Linux kernel. Includes full-featured examples that programmers can compile and run without special hardware.
The present paper deals with the problem of calculating mean delays in polling systems
with either exhaustive or gated service. We develop a mean value analysis (MVA) to
compute these delay figures. The merits of MVA are in its intrinsic simplicity and its
intuitively appealing derivation. As a consequence, MVA may be applied, both in an
exact and approximate manner, to a large variety of models.
The problem of image registration subsumes a number of problems and techniques in multiframe
image analysis, including the computation of optic flow (general pixel-based motion), stereo
correspondence, structure from motion, and feature tracking. We present a new registration
algorithm based on spline representations of the displacement field which can be specialized to
solve all of the above mentioned problems. In particular, we show how to compute local flow,
global (parametric) flow, rigid flow resulting from camera egomotion, and multiframe versions of
the above problems. Using a spline-based description of the flow removes the need for overlapping
correlation windows, and produces an explicit measure of the correlation between adjacent flow
estimates. We demonstrate our algorithm on multiframe image registration and the recovery of 3D
projective scene geometry. We also provide results on a number of standard motion sequences.
Returns weighted percentiles of a sample given the weight vector w
% The idea is to give more emphasis in some examples of data as compared to
% others by giving more weight. For example, we could give lower weights to
% the outliers.
% The motivation to write this function is to compute percentiles for Monte
% Carlos simulations where some simulations are very bad (in terms of goodness
% of fit between simulated and actual value) than the others and to give
% the lower weights based on some goodness of fit criteria.