登录
首页 » matlab » DSP_MATLAB

DSP_MATLAB

于 2009-03-09 发布 文件大小:57KB
0 102
下载积分: 1 下载次数: 23

代码说明:

  胡广书数字信号处理的MATLAB程序,函数按章节号命名(HU Guang-book digital signal processing of the MATLAB program)

下载说明:请别用迅雷下载,失败请重下,重下不扣分!

发表评论

0 个回复

  • finalsteadystate
    说明:  传热的数值算法,包括matlab动态显示(numerical method of heat transfer problem.)
    2011-03-04 10:26:05下载
    积分:1
  • Original_pcm
    自己编写的可能性c均值聚类算法。数据需要自己load,里面有main函数,改成自己的数据就可以运行。比模糊c均值更加鲁棒的一种聚类算法,缺点是容易产生重合聚类。(possibilistic c means clustering algorithm.)
    2020-08-23 14:07:54下载
    积分:1
  • CM_MC_PLF
    含分布式电源的半不变量法概率潮流计算程序(Probabilistic Power Flow Computing Program Based on Semi-invariant Method)
    2021-01-25 11:48:37下载
    积分:1
  • satellite
    这是卫星通信方向图测量软件 采用了VB编程,整个源代码通用 方便使用(This is a satellite communication pattern measurement software using VB programming, the entire source code to facilitate the use of generic)
    2008-08-13 10:57:15下载
    积分:1
  • advection1Ddiffusion2D
    Advection and Disperison in 1D coupled diffusion into 2D matrix, diffusion happens both in 1D and 2D which interconnected 1D and 2D
    2012-06-18 06:29:55下载
    积分:1
  • MATLAB simulation of the Brown movement
    布朗运动的MATLAB模拟,动态图形的一个简单学习例程。txt文件,粘贴到matlab中就可以运行。(The MATLAB simulation of the Brown movement, a simple learning routine for dynamic graphics. Txt files, paste into the Matlab can run.)
    2018-02-09 23:12:31下载
    积分:1
  • CtrlLAB
    工具箱,控制理论发展的最新成果,很好的东西,分分享(Toolbox, the latest development of control theory, very good, sub-share)
    2010-07-25 16:39:44下载
    积分:1
  • Aver_Path_Length
    算法,采用Dijk算法,求网络所有点的最短路径和网络的平均最短路径(Algorithm, using Dijk algorithm, and all points of the shortest network path and the average shortest path network)
    2009-04-02 18:50:33下载
    积分: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
  • NRFlowOfCartesian
    基于直角坐标的牛顿拉弗逊法潮流计算程序,经过IEEE14模型测试。(the newton_lafason power flow )
    2014-11-19 15:43:17下载
    积分:1
  • 696518资源总数
  • 104349会员总数
  • 32今日下载