登录
首页 » ASP » eje1

eje1

于 2014-02-03 发布 文件大小:712KB
0 218
下载积分: 1 下载次数: 2

代码说明:

  game in fpga example, also is a fpga

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

发表评论

0 个回复

  • cepstrum2
    利用了抽样及倒谱算法,进行图像分解和重建过程。(use of sampling and cepstrum algorithm for image decomposition and reconstruction process.)
    2006-07-06 12:44:16下载
    积分:1
  • QRS-detection-by-Caceres
    This Matlab program makes a simple QRS detection by the method of Caceres
    2014-10-16 07:59:08下载
    积分:1
  • MVDR
    This Program simulates the MVDR beamformer which is useful for beginners.
    2014-01-25 18:16:38下载
    积分:1
  • PSO-Sphere
    粒子群优化算法pso的matlab程序,测试函数为Sphere函数,可以直接使用,其他函数可以自己更改(PSO pso matlab program, test the function of Sphere function, can be used directly, other functions can own change)
    2020-11-26 12:19:31下载
    积分:1
  • oct3bank
    说明:  1/3倍频程分析。有需要做这方面研究的同志们可以好好看一下。(1/3 octave analysis. There is a need to do research in this area can be a good look comrades.)
    2011-03-29 18:45:55下载
    积分:1
  • The-lane-edge-recognition
    各种算子对车道线边缘识别的对比,其中包括车道线图像,也包含sobel,canny,prewritt算子的差异。(The operator of lane edge recognition)
    2014-10-16 19:31:26下载
    积分:1
  • GA-GUIDE
    Matlab基因遗传的一些入门学习资料和指导(Matlab genetic entry learning and guidance)
    2012-08-24 12:07:28下载
    积分:1
  • wavelets
    matlab 刚刚接触 在做小波方便 传一个小波去噪程序 很简单的(a simple wavelets denoise function)
    2010-12-30 20:10:47下载
    积分:1
  • Optimization_Newton
    设r是f(x) = 0的根,选取x0作为r初始近似值,过点(x0,f(x0))做曲线y = f(x)的切线L,L的方程为y = f(x0)+f (x0)(x-x0),求出L与x轴交点的横坐标 x1 = x0-f(x0)/f (x0),称x1为r的一次近似值。过点(x1,f(x1))做曲线y = f(x)的切线,并求该切线与x轴交点的横坐标 x2 = x1-f(x1)/f (x1),称x2为r的二次近似值。重复以上过程,得r的近似值序列,其中x(n+1)=x(n)-f(x(n))/f (x(n)),称为r的n+1次近似值(Let r is f (x) = 0 root, select the initial approximation x0 as the r, over point (x0, f (x0)) to do the curve y = f (x) the tangent L, L the equation y = f ( x0)+ f ' (x0) (x-x0), find the intersection of L and the x-axis of abscissa x1 = x0-f (x0)/f' (x0), x1 is called an approximation r. Through points (x1, f (x1)) to do the curve y = f (x) the tangent, and find the intersection of the tangent with the x-axis of abscissa x2 = x1-f (x1)/f ' (x1), x2 is called r the second approximation. Repeat the process, get an approximation of the sequence r, where x (n+1) = x (n)-f (x (n))/f ' (x (n)), as an approximation of r n+1 times)
    2011-06-21 21:13:09下载
    积分:1
  • bark2343
    实现巴克码筛选,可以选出所有长度的巴克码码组。并进行画图(Achieve screening, Barker code, you can elect all of the length of the Barker code group. And for drawing)
    2012-07-02 21:16:04下载
    积分:1
  • 696516资源总数
  • 106459会员总数
  • 0今日下载