登录
首页 » matlab » Lempel_Ziv_program

Lempel_Ziv_program

于 2012-04-02 发布 文件大小:3KB
0 166
下载积分: 1 下载次数: 31

代码说明:

  Lempel_Ziv信源编解码 含测试数据(Lempel_Ziv_Coder/Decoder test_data included)

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

发表评论

0 个回复

  • SIMULINK-s-function
    这个资料主要介绍,simulink中s-function的编程的一些规则(The data are introduced, simulink in the s-function of a number of programming rules)
    2009-05-01 14:15:35下载
    积分:1
  • psd_integ
    功率谱估计,通过matlab程序对声发射信号进行功率谱估计(Power spectrum estimation, through the matlab program to acoustic emission signals, power spectrum estimation)
    2008-12-30 22:03:04下载
    积分:1
  • gamma
    与gamma函数和正态分布函数有关的三份资料,对深入理解和应用gamma函数有帮助。(Normal distribution function with the gamma function and the three relevant information on the in-depth understanding and application of gamma function is helpful.)
    2010-10-29 20:40:47下载
    积分:1
  • network
    神经网络的matlab程序,可以作为入门学习,欢迎使用(networ in matlab)
    2009-12-02 02:51:43下载
    积分:1
  • CtoF
    Converter Celsius Fahrenheit for a temperature set by the user
    2010-05-25 05:56:57下载
    积分:1
  • lbp
    计算机视觉领域中的lbp特征提取的matlab代码(the matlab code of the lbp feature extraction in the computer vision domain)
    2013-08-29 15:21:07下载
    积分:1
  • DDSHEX
    生成Intel Hex file的MATLAB源程序(MATLAB source generates Intel Hex file)
    2013-04-16 20:26:05下载
    积分:1
  • windrose
    通过给定的风速数据,自动绘制相应的风玫瑰图。(Through the data from a given wind speed, the corresponding wind rose. )
    2013-12-13 14:58:55下载
    积分:1
  • Monte Carlo method
    用蒙特卡洛原理计算定积分的几个例子,使用平台MATLAB,程序里有问题描述和程序的详细讲解(Monte Carlo method used to calculate a few examples of fixed points, the use of platform MATLAB, the program has a problem description and procedures to explain in detail)
    2017-10-31 16:58:25下载
    积分:1
  • 5
    说明:  利用Dijkstra算法来求网络图的最短路径,找到从起点P1到终点Pn的最短路径,由于上述算法使用了连接线中点的条件,不是整个规划空间的最优路径,然后利用遗传算法对找到的最短路径各个路径点Pi (i=1,2,…n)调整,让各路径点在相应障碍物端点连线上滑动(Use Dijkstra algorithm to find the shortest path network diagram to find the starting point P1 to the end of Pn from the shortest path algorithm is used as the midpoint of the condition of cable, not the entire optimal path planning of space, and then use genetic algorithm to find shortest path of each path points Pi (i = 1,2, ... n) adjusted to the path of obstacles in the corresponding endpoint connection point slide)
    2011-05-10 16:03:58下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载