登录
首页 » matlab » EE562_A2_Q4

EE562_A2_Q4

于 2013-04-10 发布 文件大小:1KB
0 198
下载积分: 1 下载次数: 1

代码说明:

  Assignmnet of adaptive filtering

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

发表评论

0 个回复

  • imhist
    计算并绘制图像的直方图,本设计中绘制了四种形式的直方图,imhist,bar,stem,plot进行比较和区别!(Calculated and plotted the histogram of the image, the design of four forms of the histograms drawn, imhist, bar, stem, plot and compare the difference!)
    2011-05-22 14:08:39下载
    积分:1
  • Mean-filter
    滤波模板为 m=3,5,7对加噪正弦信号的滤波的实现和显示 (Filter template for m = 3,5,7 plus noise filtering to achieve sinusoidal signal and display)
    2014-08-11 19:38:27下载
    积分:1
  • 基于变步长滞环比较法的MPPT算法研究
    基于变步长滞环比较法的MPPT算法研究,太阳能最大功率点跟踪(The MPPT algorithm based on variable step length hysteresis comparison research The solar energy maximum power point tracking)
    2021-01-02 20:58:57下载
    积分:1
  • fuzzy
    matlab的模糊数学工具箱,帮您处理更多非二元问题(the Fuzzy toolbox of MATLAB)
    2010-12-03 13:59:22下载
    积分:1
  • pimc_india
    采用Monta Carlo 方法求Pi值方法,并画出圆内随机点(Monta Carlo method, to calculate the value of Pi method, and draw a random point within the circle)
    2012-07-05 11:21:36下载
    积分:1
  • 基于改进遗传算法的路径规划MATLAB实现
    说明:  该算法是基于遗传算法的路劲规划算法,使用的是MATLAB平台仿真(Realization of Path Planning Based on Genetic Algorithms in MATLAB)
    2019-10-14 22:44:31下载
    积分:1
  • FDTD_4_1
    Sullivan关于FTDT经典文章的MATLAB翻译,第四章第一个例子的源程序。(Sullivan article on FTDT classic MATLAB translation of chapter IV, an example of the source.)
    2010-01-08 22:34:52下载
    积分:1
  • maoxiguan
    以R404A为介质的毛细管管内流动压强及气含率分布特性一维均相模型计算程序(R404A as the medium of capillary tube flow pressure and gas holdup distribution characteristics of one-dimensional homogeneous model calculation program)
    2015-10-30 15:43:03下载
    积分:1
  • Dijkstra
    说明:  最短路径的Dijkstra算法程序。Dijkstra算法是典型最短路算法,用于计算一个节点到其他所有节点的最短路径。主要特点是以起始点为中心向外层层扩展,直到扩展到终点为止。Dijkstra算法能得出最短路径的最优解,但由于它遍历计算的节点很多,所以效率低。   Dijkstra算法是很有代表性的最短路算法,在很多专业课程中都作为基本内容有详细的介绍,如数据结构,图论,运筹学等等。 (The Dijkstra shortest path algorithm for the procedure. Dijkstra algorithm is a typical shortest path algorithm, used to calculate a node to all other nodes of the shortest path. The main characteristics is the starting point as the center outward expansion layers, until the end date be extended to. Dijkstra shortest path algorithm can arrive at the optimal solution, but because of its calculation of the node traversal, so inefficient. Dijkstra algorithm is very representative of the shortest path algorithm, in many professional courses in the basic content as described in detail, such as data structures, graph theory, operational research and so on.)
    2008-11-26 22:27:45下载
    积分:1
  • comunication-
    通信原理基于matlab仿真 北京邮电大学出版社的(Communication Theory matlab simulation-based Beijing University of Posts and Telecommunications Press)
    2012-11-21 16:02:32下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载