panbie

说明：  复数函数与积分变换 Fourier变换 Laplace逆变换(Complex number function and integral transformation Fourier transformation Laplace inverse transformation)

计算按频率抽取的基4快速傅里叶变换算法，与基2FFT相比，基4FFT的乘法量约减少25 。(Calculating frequency taken by fast Fourier transform algorithm base 4, compared with the base 2FFT the base 4FFT multiplication about 25 less.)

利用FFT估计正弦信号的频率,要估计一个叠加了高斯白噪声的正弦信号 的频率 ，可以通过对x(n)做傅里叶变换，得到频谱图，找出幅度的最大值对应的频率值 ，进行多次变换，求出均方误差 。改变信噪比SNR，通过仿真可以得出随着信噪比增加，均方误差减小。(Sinusoidal signal using FFT frequency estimation, to estimate a Gaussian white noise superimposed on the frequency of sinusoidal signals, can be achieved by x (n) be the Fourier transform to get spectrum to identify the magnitude of the frequency value corresponding to the maximum , several transformations, find the mean square error. Change the signal to noise ratio SNR, the simulation can be drawn as the SNR increases, the mean square error decreases.)

电磁计算用的快速多级子算法，欢迎大家下载交流(Fast multilevel sub algorithm for electromagnetic computation)

变分模态分解的python版本，个人根据MATLAB版本译制而成(Python version of variational mode decomposition)

对信号的FFT（快速傅里叶变换）变换，针对LabView内部信号。(The signal FFT (Fast Fourier Transform) transformation, the internal signal for LabView.)

具有等式约束和不等式约束的二次规划问题，的积极集方法（有效集方法）(the active set methods for QP with equality and ineqality constrain)

代码实现多项式拟合算法(非内置函数)。有较详细的说明。(Polynomial algorithm design (non-built-in function), the source explained in more detail Chinese.)

Hypercomplex mathematical morphology

多种传递熵的计算方法，包括离散和连续信号的传递熵计算，包括多种核函数(JIDT: An information-theoretic to olkit for studying the dynamics of complex systems)