-
untitleddemodulatePSK
用simulink搭建的2dpsk调制及解调的通信系统(Simulink structures 2dpsk with modulation and demodulation of the communication system)
- 2009-06-08 01:44:52下载
- 积分：1
-
Mukesh
file is uploaded as per instructions
- 2013-05-14 18:52:24下载
- 积分：1
-
Q-learning-Reinforcement-learning
强化学习matlab源代码很少见的源代码，详细介绍Q学习的编程过程。(Reinforcement learning matlab source code，rare source code, detailed Q learning programming.)
- 2021-04-13 16:38:56下载
- 积分：1
-
convbi
convolution of a signal
- 2012-03-28 08:11:14下载
- 积分：1
-
matlablaguage
介绍了matlab语言的一些基础知识 对刚刚开始学习matlab的同学很有用的哦 (Matlab language of the basic knowledge has just begun to study the students very Matlab the oh)
- 2006-06-22 21:24:07下载
- 积分：1
-
2
说明： 小波包去噪小波包去噪小波包去噪小波包去噪(Wavelet packet denoising wavelet packet denoising wavelet packet denoising wavelet packet denoising)
- 2011-05-18 16:05:05下载
- 积分：1
-
yydd2mmdd
程序将一年中的天数转换到相应的月份及日期。适用于TLE数据中的日期转换。程序不用if语句，简单易懂高效。输入参数可以是数组形式。(The program will convert the number of days in a year to the corresponding month and date. TLE data for the date conversion. Program without the if statement, straightforward and efficient. Input parameters may be matrix form.)
- 2013-07-11 07:44:38下载
- 积分：1
-
FHN
example of matlab code to calculate a Fitzhug Nagumo system of equation
- 2020-12-20 22:49:10下载
- 积分：1
-
guandao1
惯性导航误差分析程序可以做误差曲线图像，可以模拟真实系统的误差特性(Inertial navigation error analysis program can make the error curve of the image, you can simulate the real system error characteristic)
- 2007-08-29 19:24:04下载
- 积分：1
-
GraphTheoryAlgorithmMATLAB
说明： 图论算法及其MATLAB 程序代码
1.求赋权图G = (V, E , F )中任意两点间的最短路的Warshall-Floyd 算法、Kruskal 避圈法
2.求二部图G 的最大匹配的算法(匈牙利算法)、利用可行点标记求最佳匹配的算法
3.从一个可行流f 开始, 求最大流的Ford--Fulkerson 标号算法
6.(Graph Theory Algorithm and MATLAB program code 1. Seeking weighted graph G = (V, E, F) in the shortest path between any two points of the Warshall-Floyd algorithm, Kruskal avoid the circle method 2. Seeking the maximum bipartite graph G matching algorithm (the Hungarian algorithm), using feasible point mark seeking the best match algorithm 3. a feasible flow f from the beginning, find the maximum flow of the Ford- Fulkerson Labeling Algorithm 6.)
- 2010-03-28 15:39:29下载
- 积分：1
