登录
首页 » matlab » polysimu1

polysimu1

于 2007-10-10 发布 文件大小:1KB
0 274
下载积分: 1 下载次数: 33

代码说明:

  10-channel polyphase filter的simulink程序(10-channel polyphase filter the simulink program)

文件列表:

polysimu1.m

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

发表评论

0 个回复

  • nlfa
    nonlinear separation based on MLP
    2010-12-23 18:44:15下载
    积分:1
  • createwhitenoise
    说明:  产生白噪声的方法,调试通过,数据和代码都齐全。(Generated white noise method, debug through, data and code are complete.)
    2008-10-18 13:51:31下载
    积分:1
  • pingcha
    可以进行很多常见的平差测量计算 免去自己动手计算的麻烦(Adjustment can be many common measurement and calculation eliminates the trouble of calculating it yourself)
    2011-10-23 11:07:17下载
    积分:1
  • shuxujianmo
    2009年9月全国大学生数学建模获奖论文所需程序代码,其中有较详细的matlab编程,应该有些用处吧(September 2009 Mathematical Contest in Modeling program code required for the award-winning paper, including more detailed matlab programming, it should be useful)
    2009-05-19 19:27:54下载
    积分:1
  • xiaobo
    自己编写的基于小波变换的matlab算法,希望对大家有所帮助(I have written matlab algorithm based on wavelet transform, I hope to be helpful)
    2010-05-23 22:59:11下载
    积分:1
  • radar
    实现雷达的测速和测距,并观测雷达的多普勒效应(Achieve moving target radar speed and ranging, and realize the moving target of the Doppler effect)
    2016-03-14 10:07:01下载
    积分:1
  • Exe0705
    说明:  MATLAB实用教程(第2版)实例源代码程序EXE0705(MATLAB Practical Guide (2nd Edition) examples source code program EXE0705)
    2011-04-11 21:57:10下载
    积分:1
  • GPCsoft
    高斯过程分类程序,运用拉普拉斯近似来实现二分类和多分类功能。(Implements Laplace s approximation for binary and multiclass classification.)
    2020-09-01 10:28:09下载
    积分:1
  • KNN
    K最邻近密度估计技术是一种分类方法,不是聚类方法。 不是最优方法,实践中比较流行。 通俗但不一定易懂的规则是: 1.计算待分类数据和不同类中每一个数据的距离(欧氏或马氏)。 2.选出最小的前K数据个距离,这里用到选择排序法。 3.对比这前K个距离,找出K个数据中包含最多的是那个类的数据,即为待分类数据所在的类。(K nearest neighbor density estimation is a classification method, not a clustering method. It is not the best method, but it is popular in practice. Popular but not necessarily understandable rule is: 1. calculate the distance between the data to be classified and the data in each other (Euclidean or Markov). 2. select the minimum distance from the previous K data, where the choice sorting method is used. 3. compare the previous K distances to find out which K data contains the most data of that class, that is, the class to which the data to be classified is located.)
    2020-10-23 14:37:22下载
    积分:1
  • kakearney-bufferm2-pkg-bd7ba0b
    CREATE a buffer around a polygon in Matlab
    2015-02-02 18:56:40下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载