dipu_newton_lu

FFT蝶形运算,C 语言,可有MATLAB M 语言转换实现(FFT butterfly computation, C language, MATLAB M language can be converted to achieve)

说明：  ICA的matlab程序，含有实验的数据资料(The matlab ica-based，Contains experimental data )

compressive sensing theory

Am FM modulation Generator using 512 points in Ms Excel

说明：  广义S变换，具有良好的分析特性和局部的时频的特性，而谱白化和反褶积也是高分辨处理中的一种有效的频率补偿手段，本文利用他们的他们的各自优点，使二者结合起来，该方法对地震信号用广义S变换分解，进行频率补偿再进行重构，得到高分辨率时间信号。  理论模型试算和实际地震处理结果证明了该方法的正确性和有效性。  关键词：广义S变换，谱白化，高分辨处理(Generalized S transformation (GST) has good analyzing feature and good Time-frequency localization,. spectrum whitening and deconvolution is an Effective tool for frequency compensation , Utilizing both their advantages , The method first conducts GST decomposition to seismic data,. doing high frequency compensation and then reconstruction to get high resolution seismic to get a high-resolution time signal. Theoretic modeling and field seismic data processing results has proved this method corrected and effective . )

TotalWES.m是主干程序，而DCoef和FCTforAW是里面调用的函数。TotalWES只要实现交错网格有限差分波场数值模拟，其中的FCTforAW是用来消除数值频散的。这些是实现弹性波波场模拟的程序，其它两个文件是实现声波波场模拟的程序(TotalWES.m is the backbone of the procedure, and DCoef and FCTforAW is inside a function call. As long as the realization of TotalWES staggered grid finite difference numerical simulation of wave field, which FCTforAW is used to eliminate the numerical dispersion. These are the realization of elastic wave field simulation procedures, the other two documents are to achieve the sound the ball field simulation procedures)

robot-gyro and gsensor(kalman filter-state space)

基础卡尔曼滤波。附有滤波初始条件，适合初学者(Basic Kalman filter. With filter initial conditions, suitable for beginners)

Additive synthesis algorithm for generating piano tones

For a given source vertex (node) in the graph, the algorithm finds the path with lowest cost (i.e. the shortest path) between that vertex and every other vertex. It can also be used for finding costs of shortest paths from a single vertex to a single destination vertex by stopping the algorithm once the shortest path to the destination vertex has been determined. For example, if the vertices of the graph represent cities and edge path costs represent driving distances between pairs of cities connected by a direct road, Dijkstra s algorithm can be used to find the shortest route between one city and all other cities. As a result, the shortest path first is widely used in network routing protocols, most notably IS-IS and OSPF (Open Shortest Path First).