-
GaoyingLMS
说明： 一种变步长LMS自适应滤波算法及分析,电子学报，高鹰，谢长利提出的一种算法。本文提供该文中提出算法的matalb源程序文件，仅供大家参考。(A Variable Step Size LMS Adaptive Filtering Algorithm and analysis, electronic Journal of High Eagle, Xiechang Li proposed an algorithm. This article provides the text of the proposed algorithm matalb source file, only for your reference.)
- 2021-02-10 16:29:52下载
- 积分：1
-
sf_building
这是讲述MATLAB中stateflow的知识，很有用处，需要的可以下载。(This is about the knowledge of MATLAB, stateflow, useful, and we need can be downloaded.)
- 2010-05-12 14:50:03下载
- 积分：1
-
Spreading-code-acquisition-method
扩频伪码捕获方法，截获搜索策略及截获判定。(Spreading pseudo-code acquisition method, the to intercept search strategy and intercepted judgment.)
- 2013-04-16 21:05:41下载
- 积分：1
-
STFT
短时傅里叶变换的matlab代码，可以用来测试短时傅里叶变换(Matlab code, and short time Fourier transform can be used to test the short-time Fourier transform)
- 2015-06-23 14:28:45下载
- 积分：1
-
autocorrelazione
Autocorrelation speech signal for matlab. Computes the f0 frequency.
- 2009-10-30 07:49:33下载
- 积分：1
-
smart-antennas
智能天线技术，里面介绍了很多关于频域宽带波束形成方面的算法。作者L.C Godara是这方面的大牛，发表了很多关于波束形成方面的paper，大家可以参阅一下。(Smart antenna technology, which introduces a number of algorithms on the frequency domain broadband beamforming aspects. The Author LC Godara large cattle in this area, published a paper about the many aspects of beam forming, we can see it.)
- 2016-10-26 20:18:00下载
- 积分：1
-
NM
说明： Newton法的计算程序，通过它可以计算复杂函数的根(Newton method computer program, through which the roots of complex functions can be calculated
)
- 2010-12-30 14:19:22下载
- 积分：1
-
Analysis-of-several-ESPRIT
说明： 几种ESPRIT算法性能分析，源码内有详细注解(Performance Analysis of several ESPRIT)
- 2011-03-16 11:19:00下载
- 积分：1
-
readclk
读取卫星钟钟误差和IGS站接收机钟差的程序(Read the satellite Zhong Zhong error and IGS stations receiver clock error program)
- 2015-01-17 10:14:26下载
- 积分：1
-
5
说明： 利用Dijkstra算法来求网络图的最短路径，找到从起点P1到终点Pn的最短路径，由于上述算法使用了连接线中点的条件，不是整个规划空间的最优路径，然后利用遗传算法对找到的最短路径各个路径点Pi (i=1,2,…n)调整，让各路径点在相应障碍物端点连线上滑动(Use Dijkstra algorithm to find the shortest path network diagram to find the starting point P1 to the end of Pn from the shortest path algorithm is used as the midpoint of the condition of cable, not the entire optimal path planning of space, and then use genetic algorithm to find shortest path of each path points Pi (i = 1,2, ... n) adjusted to the path of obstacles in the corresponding endpoint connection point slide)
- 2011-05-10 16:03:58下载
- 积分：1
