-
MATLAB
自适应滤波的基本LMS算法的例程，有基本的信号对比(The basic LMS algorithm for adaptive filtering routines, some basic signal contrast)
- 2010-09-24 20:32:13下载
- 积分：1
-
poincare123
Poincare Sphere Plot of Polarimetry Stokes Vectors
- 2010-10-26 06:52:16下载
- 积分：1
-
MATLABdeyingyong_11193564
说明： 是关于matlab工具箱的应用，对于初学者和老辈们都有帮助的(is on the application of Matlab Toolbox for beginners and elders have made to help the)
- 2006-03-22 10:51:20下载
- 积分：1
-
CDKFflying
使用CDKF：中心差分卡尔曼滤波算法模拟仿真不同编队构形的轨道预报，实现双星编队的精确轨道确定。其中还有可观测性能监测，Monte-Carlo的性能分析等相关程序(central difference kalman filter was used to fulfill the estimation of dual satellite, the observation of different foramtion was investigated.)
- 2015-07-31 11:54:10下载
- 积分：1
-
getgroundtruth
在机器学习时需要图像groundtruth，本程序是一个matlab脚本，可以快速提取图像groundtruth，并保存为mat文件(you can get the object groundtruth in a picture, using my program. It s convenient for you when you do research on machine learning.)
- 2015-11-01 18:42:50下载
- 积分：1
-
MUSIC
说明： MUSIC算法是最经典的超分辨DOA估计方法，它利用了信号子空间和噪声子空间的正交性，构造空间谱函数，通过谱峰搜索，检测信号的DOA。MUSIC算法对DOA的估计从理论上可以有任意高的分辨率(MUSIC algorithm is the most classical super-resolution DOA estimation method. It uses the orthogonality of signal subspace and noise subspace to construct spatial spectral function, and detects the DOA of signal through peak search. MUSIC algorithm can theoretically estimate DOA with arbitrary high resolution.)
- 2019-04-11 16:18:18下载
- 积分：1
-
MMSE
基于V-BLAST 的MMSE 信道估计算法 MIMO(The MMSE channel estimation algorithm based on V- BLAST MIMO
)
- 2020-09-15 14:07:58下载
- 积分：1
-
FaultyPolar
改进的polar码解码算法faulty sc decoder，及其matlab实现(the improved sc decoding algorithm named faulty sc decoder, and its implementation in matlab)
- 2020-11-28 20:39:28下载
- 积分：1
-
djistra
说明： 迪克拉斯算法进行寻找最优路径。有一定参考价值(Dick Las algorithm to find the optimal path. Some reference value)
- 2011-03-20 22:20:21下载
- 积分：1
-
Floyd
从任意一条单边路径开始。所有两点之间的距离是边的权，或者无穷大，如果两点之间没有边相连。 2，对于每一对顶点 u 和 v，看看是否存在一个顶点 w 使得从 u 到 w 再到 v 比己知的路径更短。如果是更新它。 3，不可思议的是，只要按排适当，就能得到结果。(A unilateral path from any start. All the distance between two points is the right side, or infinity, if there is no edge between two points connected. 2, for each pair of vertices u and v, to see if there is a vertex w from u to w and then to make than the known path v shorter. If you are updating it. 3, incredibly, just press the appropriate row, you can get results.)
- 2011-09-02 23:33:33下载
- 积分：1
