登录
首页 » PDF » L1730SSFTMENG

L1730SSFTMENG

于 2010-08-02 发布 文件大小:400KB
0 165
下载积分: 1 下载次数: 1

代码说明:

  LG Monitor user s guide L1730S&L1930S

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

发表评论

0 个回复

  • libMyAdd
    matlab编译的dll文件案例,文件内容为a+b=c(failed to translate)
    2011-11-04 16:31:25下载
    积分:1
  • FAST-AUTOCORELATION
    the fast autocorelation function matlab code, used for basicallly pitch extraction and thus is extremely useful
    2013-10-21 20:40:55下载
    积分:1
  • Cspline
    这是一个三次样条插值的.m程序 输入的是一个二维数组A(Nx2) 插值方法为: S(x) = A(J) + B(J)*( x - x(J) ) + C(J)*( x - x(J) )**2 +D(J) * ( x - x(J) )**3 for x(J) <= x < x(J + 1) (This is a cubic spline interpolation. M program input is a two-dimensional array A (Nx2) interpolation method: S (x) = A (J)+ B (J)* (x- x (J ))+ C (J)* (x- x (J))** 2+ D (J)* (x- x (J))** 3 for x (J) )
    2008-07-21 11:53:17下载
    积分:1
  • Consensus-Kalman-filtering
    关于卡尔曼滤波的最经典起步资料,介绍卡尔曼滤波协同算法,值得学习(A classical paper which introduce the Kalman filtering algorithm,especially for the Kalman-Consensus filter)
    2012-05-14 09:25:45下载
    积分:1
  • ofdm-system
    本仿真程序实现了正交频分复用系统的调制与解调。(This program simulates orthogonal frequency division multiplexing(OFDM)system.)
    2014-01-15 19:35:03下载
    积分:1
  • Kmean_1
    Kmeans聚类算法的一个示例 是一个简单的程序但是体现了思想(a simple example of K-means algorthm which contains the core thinking method of clustering)
    2012-02-09 19:31:16下载
    积分:1
  • modulation&demodulation
    支持多种星座符号调制和解调,包括m-PSK和m-QAM(Supports a variety of constellation symbol modulation and demodulation, including m-PSK and m-QAM)
    2018-11-30 11:03:14下载
    积分:1
  • S_O_W_C_Early_Objects
    It s a tutorial about introduction
    2009-03-14 12:33:57下载
    积分:1
  • MATLABarticles
    适于matlab初学者学习和参考,内容简练而易懂,为日后深入学习matlab打下基础(Matlab suitable for beginners to learn and reference, concise and easy-to-understand content for future in depth study lay the foundation for matlab)
    2008-02-14 11:12:42下载
    积分:1
  • cebk_tsp
    用离散数学或图论的术语来说,假设有一个图g=(v,e),其中v是顶点集,e是边集,设d=(dij)是由顶点i和顶点j之间的距离所组成的距离矩阵,旅行商问题就是求出一条通过所有顶点且每个顶点只通过一次的具有最短距离的回路。 (Discrete Mathematics or use the terminology of graph theory, assume that a graph g = (v, e), where v is the vertex set, e is the edge set, let d = (dij) is a vertex between i and vertex j formed from the distance matrix, a traveling salesman problem is obtained through all the vertices and each vertex only once has the shortest distance through the loop.)
    2011-05-22 08:12:37下载
    积分:1
  • 696518资源总数
  • 105873会员总数
  • 12今日下载