Analytical constant-modulus algorithm, to separate linear combinations of CM sourcesThe algorithm
is robust in the presence of noise, and is tested on measured data,
collected from an experimental set-up.
％ BackgroundRemoval=[true],false
％ Gain=[tsquare],linear
％ BandPass=[paul],fircls
％ CenterFrequency, auto (determined using pburg)
％ BandWidth=auto (a fraction of the CenterFrequency default=0.25)
％ ContrastStretch=[true],false
％ HilbertAmplitude=[true],false
％ HorizontalStacking=1 (a number of traces)
％
A new PLL topology and a new simplified linear model are presented. The new fractional-N synthesizer presents no reference spurs and lowers the overall phase noise, thanks to the presence of a SampleJHold block. With a new simulation methodology it is possible to perform very accurate simulations, whose results match closely those obtained with the linear PLL model developed.
Waterfilling algorithm (from [Palomar and Fonollosa, Trans-SP2004]) to compute:
pi = (mu*ai - bi)^+
sum(pi) = Pt
By Daniel Perez Palomar (last revision: May 10, 2004).
New training algorithm for linear classification SVMs that can be much faster than SVMlight for large datasets. It also lets you direcly optimize multivariate performance measures like F1-Score, ROC-Area, and the Precision/Recall Break-Even Point.
HTML Parser is a Java library used to parse HTML in either a linear or nested fashion. Primarily used for transformation or extraction, it features filters, visitors, custom tags and easy to use JavaBeans. It is a fast, robust and well tested package.
