type "untitled" to run.
The 7 bit data can be inputted or generated randomly.The crc polynomial used is fixed and cant be changed. The function that calculates and verifies the crc is " mycrc ". The file untitled is the gui but its m file also contains code for generation of random data. Iv included the pseudo code in the zip file.
Made this program last year as part of an...
TCM with BCJR (Log-Map) & channel Encoder Ungerboeck's TCM with BCJR (Log-Map) Decoder with Generater Polynomial
Like polyfit.m but includes weighting of each data point.
Summary ---------------- Find a least-squares fit of 1D data y(x) with an nth order polynomial, weighted by w(x).
Usage -----
P =...
Thee purpose, 1. Speed up the convergence of correcting for each points (By newton method). 2. To find the first few points by this method instead of R.K. method. 3. To apply for higher order polynomial fitting.
SMIProm: Single Molecule Image Processing Program. I use this program to get intensity profiles of single molecule images and fit it using the curve fitting toolbox. basically you can use the program to: -->Select an ROI from an...
The following program is written to simulate a randomly generated message under BSC(p) channel. It examines whether or not the generator polynomial is strong enough to be used at a given packet size and crossover probability p. Error patterns are...
Removes nonlinear trend from data DETRENDNONLIN Removes non-linear trend from a vector. The nonlinearity is removed by subtracting a least-squares polynomial fit. Y = DETRENDNONLIN(X) subtracts a second order polynomial fit...
It returns a vector POL, if it exists, such that conv(POL,POL) = P. P is a vector whose elements are the coefficients of a polynomial in descending powers
Genetic Programming (GP) generates nonlinear input-output models of dynamical systems from input-output measurement data. This GP-OLS toolbox applies Orthogonal Least Squares algorithm (OLS) to improve the search effeciency of GP. It can be...
DIRECTORIES: - SMALLPART/ smallpart.m clusterindex.m
- PARTITIONS/ partition.m cluster.m BLLSG.m
Both are based on the Cluster Polynomial Representation of binary words of arbitrary length. The...
Ever wonder how the weights and abscissae are calculated for the numerical conversion from radiance to flux? The long and the short of it is that Gauss-Jacobi quadrature determines the weights and abscissae which is similar to Gaussian for...
Find the projection of point P in R^n on the ellipsoid
E = { x = x0 + U*(z.*radii) : |z| = 1 }, where U is orthogonal matrix of the orientation of E, radii are the axis lengths, and x0 is the center.
Or on generalized conic E...
Improved algorithms for finding the roots (direct method for first order quadratic, cubic and Quartic) are used for low order equations. Fadeev algorithm for finding the characteristic polynomial is implemented to ensure high accuracy.
Often, measured data is comprised of N sampled values of z, evaluated at N locations (x,y). With this function, you can calculate the coefficients of the best-fit x,y polynomial using a linear least squares approximation.
You can use...
These functions show some advances about MPF (Matrix Polynomial Fraction) using for represent multivariable models and design multivariable control system.
Ruby interface to the CRM114 Controllable Regex Mutilator, an advanced and fast text classifier that uses sparse binary polynomial matching with a Bayesian Chain Rule evaluator and a hidden Markov model to categorize data with up to a 99.87%...
This interpolation package re-implements Matlab's built in methods ppval (1-d case polynomial evaluator) and ppual (multidimensional polynomial evaluator) which are used by Matlab to evaluate polynomial in their so called "pp-form"....
% function ynew=smoothdiff(dados,xnew,sdx,q,nmin) % % This function smoothes and differentiates a sequence of numbers based on % an algorithm similar to Savistky and Golay. There are no restrictions % however, on the number of...
SYLVESTER - Sylvester matrix of two polynomials SYLVESTER(P,Q) returns the Sylvester Matrix associated with the two polynomial representations P and Q. M is a N-by-N square matrix with N being the total number of elements of P...
This code permits us to generate the polynomiography of the Newton's method for the one parameter cubic polynomial p(z)= z^3+(c-1)*z-c, where c is the parameter space We first check that 0 is a free critical point of Newton... |