登录
首页 » matlab » sampling

sampling

于 2012-04-06 发布 文件大小:2KB
0 204
下载积分: 1 下载次数: 5

代码说明:

  Sampling theorem. Natural Sampling.

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

发表评论

0 个回复

  • Matlabshuzixinhao
    数字信号处理实验教程中的例子(MATLAB版),挺全的……(Experimental Course of Digital Signal Processing (MATLAB version))
    2010-06-11 09:53:56下载
    积分:1
  • matlab
    matlab数学手册,全面介绍了matlab在数值计算时的用法。(mathematics matlab manuals, a comprehensive introduction to numerical calculation in matlab usage.)
    2009-06-15 15:27:37下载
    积分:1
  • 角度
    利用斯托克斯公式分析偏振态(Analysis of polarization state by Stokes formula)
    2018-01-21 11:04:27下载
    积分:1
  • logistics_map-(2)
    it is a implementation of a chaotic map.the chaotic map nam is logistic map
    2014-10-01 15:56:12下载
    积分:1
  • steepest_descent
    这个Matlab程序实现最速下降算法。最速下降法是一种最基本的算法,它在最优化方法中占有重要地位.最速下降法的优点是工作量小,存储变量较少,初始点要求不高;缺点是收敛慢,最速下降法适用于寻优过程的前期迭代或作为间插步骤,当接近极值点时,宜选用别种收敛快的算法. (Matlab implementation of this procedure steepest descent algorithm.)
    2009-04-07 18:44:43下载
    积分:1
  • acsman
    controller design using matlab
    2009-11-08 23:21:18下载
    积分:1
  • CRLB无线定位算法仿真
    CRLB无线定位算法仿真,大家看看,请多指教(CRLB simulation of wireless location algorithm, let us look at, please advice)
    2020-07-04 17:20:02下载
    积分:1
  • 001
    PSO coding in MATLAB
    2011-08-28 11:01:04下载
    积分:1
  • gp
    GREY PREDICTION ALGORITHM implementation in matlab source code
    2013-09-08 20:03:38下载
    积分:1
  • Fastdiscretecurvelettransforms
    This paper describes two digital implementations of a new mathematical transform, namely, the second generation curvelet transform [12, 10] in two and three dimensions. The first digital transformation is based on unequally-spaced fast Fourier transforms (USFFT) while the second is based on the wrapping of specially selected Fourier samples. The two implementations essentially differ by the choice of spatial grid used to translate curvelets at each scale and angle. Both digitaltransformations return a table of digital curvelet coefficients indexed by a scale parameter, anorientation parameter, and a spatial location parameter. And both implementations are fast in the sense that they run in O(n2 log n) flops for n by n Cartesian arrays in addition, they are also invertible, with rapid inversion algorithms of about the same complexity.
    2011-10-30 15:57:56下载
    积分:1
  • 696518资源总数
  • 105877会员总数
  • 14今日下载