登录
首页 » matlab » Wiener

Wiener

于 2014-11-15 发布 文件大小:1KB
0 95
下载积分: 1 下载次数: 3

代码说明:

  数字信号处理基于MATLAB的维纳滤波器实现(Wiener filter to realize digital signal processing based on MATLAB)

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

发表评论

0 个回复

  • deep-learning-scene-recognition
    deep learning code it helpful the begainer in deep learning
    2015-03-13 04:44:11下载
    积分:1
  • carr_fraquen_offset
    carrier frequency offset and time offset in radio communication system,
    2010-06-21 22:44:29下载
    积分:1
  • mat002
    matlab纠错码编译原理之程序1 做实验时免去了手工输入的繁琐 和避免出错(matlab compiler theory of error-correcting code program 1)
    2011-06-22 23:28:30下载
    积分:1
  • random-walk
    this is a simulation of the problem random walk , coded in c
    2015-02-13 06:04:52下载
    积分:1
  • wt
    说明:  tart a simulation with this model, the variable xInitial saved in the myModel_init.mat file will be loaded in your workspace.
    2016-04-07 04:51:31下载
    积分:1
  • ISAR单特显点法相位补偿
    说明:  isar 单特点法相位补偿,可以对相位进行运动补偿(ISAR single feature phase compensation can compensate the phase motion)
    2020-09-09 09:18:02下载
    积分:1
  • matlab-function
    Matlab中所有的函数,用户可以方便地使用(Matlab, all functions, users can easily use)
    2011-04-27 21:27:56下载
    积分:1
  • NormFitGA
    normal fit遗传算法,MATLBA编程。。。。。。。。。。。。(normal fit algorithm, MATLBA programming. . . . . . . . . . . .)
    2011-05-08 10:56:53下载
    积分:1
  • FM
    说明:  FM调制模型,用simulink做的,希望与大家交流,共同进步。(fm modulation model in matlab/simulink)
    2010-05-14 08:33:52下载
    积分:1
  • Matlab_zuixiaoerchengfa
      最小费用最大流算法通用Matlab函数 基于Floyd最短路算法的Ford和Fulkerson迭加算法   基本思路:把各条弧上单位流量的费用看成某种长度,用Floyd求最短路的方法确定一条   自V1至Vn的最短路 再将这条最短路作为可扩充路,用求解最大流问题的方法将其上的流   量增至最大可能值 而这条最短路上的流量增加后,其上各条弧的单位流量的费用要重新   确定,如此多次迭代,最终得到最小费用最大流.( Minimum cost maximum flow algorithm for general Matlab functions based on the Floyd shortest path algorithm of Ford and Fulkerson superposition algorithm of the basic ideas: the cost of unit flow on the arc as a certain length of Floyd for the most short-circuit method to determine the one percent V1 through Vn are the most short-circuit then this short circuit as a scalable road, a method for solving the maximum flow problem on flow increased to the maximum possible value that the shortest way increased traffic, the cost of unit flow on each arc sure, so many iterations, the final minimum cost maximum flow.)
    2012-07-27 14:54:17下载
    积分:1
  • 696518资源总数
  • 104360会员总数
  • 40今日下载