this directory
contains the following:
* The acdc algorithm for finding the
approximate general (non-orthogonal)
joint diagonalizer (in the direct Least Squares sense) of a set of Hermitian matrices.
[acdc.m]
* The acdc algorithm for finding the
same for a set of Symmetric matrices.
[acdc_sym.m](note that for real-valued matrices the Hermitian and Symmetric cases are similar however, in such cases the Hermitian version
[acdc.m], rather than the Symmetric version[acdc_sym] is preferable.
* A function that finds an initial guess
for acdc by applying hard-whitening
followed by Cardoso s orthogonal joint
diagonalizer. Note that acdc may also
be called without an initial guess,
in which case the initial guess is set by default to the identity matrix.
The m-file includes the joint_diag
function (by Cardoso) for performing
the orthogonal part.
[init4acdc.m]
s3c2410 ads下的測試程序移植到 iar ewarm v5.2;包括
Please select function :
0 : Please input 1-14 to select test
1 : Real time clock display
2 : 4 key array test
3 : Buzzer test
4 : ADC test
5 : IIC EEPROM test
6 : Touchpanel test
7 : 3.5# TFT LCD 240*320 test
8 : UDA1341 play audio test
9 : UDA1341 record audio test
10 : IRDA test
11 : SD Card write and read test
12 : COM port ( UART2 ) test
These three articles involves the combination of wavelet and MCTF. MCTF means motion-compensated-time-filter. It makes wavelet transform more popular because of the high compression efficiency.
AODV-UU is an AODV (Ad hoc On-demand Distance Vector) routing protocol implementation from Uppsala University. Key features are recent draft compliance, stability, and the ability to use it in both real-world (Linux) and ns-2 simulations
The "GEE! It s Simple" package illustrates Gaussian elimination with partial pivoting, which produces a factorization of P*A into the product L*U where P is a permutation matrix, and L and U are lower and upper triangular, respectively.
The functions in this package are accurate, but they are far slower than their MATLAB equivalents (x=A\b, [L,U,p]=lu(A), and so on). They are presented here merely to illustrate and educate. "Real" production code should use backslash and lu, not this package.
The "GEE! It s Simple" package illustrates Gaussian elimination with partial pivoting, which produces a factorization of P*A into the product L*U where P is a permutation matrix, and L and U are lower and upper triangular, respectively.
The functions in this package are accurate, but they are far slower than their MATLAB equivalents (x=A\b, [L,U,p]=lu(A), and so on). They are presented here merely to illustrate and educate. "Real" production code should use backslash and lu, not this package.
16點FFT VHDL源程序,The xFFT16 fast Fourier transform (FFT) Core computes a 16-point complex FFT. The input data
is a vector of 16 complex values represented as 16-bit 2’s complement numbers – 16-bits for
each of the real and imaginary component of a datum.
BPMLL is a package for training multi-label BP neural networks. The package includes the MATLAB code of the algorithm BP-MLL, which is designed to deal with multi-label learning. It is in particular useful when a real-world object is associated with multiple labels simultaneously