登录
首页 » matlab » AAC_Encoder_MATLAB

AAC_Encoder_MATLAB

于 2010-04-21 发布 文件大小:1714KB
0 266
下载积分: 1 下载次数: 0

代码说明:

说明:  AAC编码程序,用Matlab语言编写,可以详细了解AAC编码的过程。(AAC encoding process, with the Matlab language, you can learn more about AAC encoding process.)

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

发表评论

0 个回复

  • MATLAB
    说明:  MATLAB做的源代码,用于录制声音等获取信号啦,研究(MATLAB to do the source code, used to record the voice signal, such as access to you, research)
    2008-10-28 23:00:24下载
    积分:1
  • sanshechengxu
    说明:  关于雨点的散射程序,希望和有关同行探讨探讨(The scattering process on the rain, hope, and the study of peer)
    2010-04-21 00:04:08下载
    积分:1
  • Calc_ZuHe_1
    惯性导航系统中,惯导解算过程中组合导航算法(Inertial navigation systems, inertial navigation solution integrated navigation algorithm)
    2012-11-05 20:27:08下载
    积分:1
  • pca___pls
    PLS toolbox 3.0 manual for matlab
    2014-01-31 16:53:40下载
    积分:1
  • 联合熵
    本程序适用于matlab中,读取两幅图像,求取两幅图像的联合熵 程序非常易懂,适合初学者使用,可以用里面的图片进行测试,注意对程序读取图片名进行更改。(Read the two images and calculate the joint entropy of the two images.)
    2020-12-15 14:59:13下载
    积分:1
  • MATLAB
    基于+MATLAB+的时域信号采样及频谱分析(+ MATLAB+ based on the time-domain signal sampling and spectral analysis)
    2009-04-23 10:10:47下载
    积分:1
  • rayleighiuo58
    use to create rayligh channel with normalizing it around 1.
    2009-11-18 02:49:31下载
    积分:1
  • blind1cma
    盲均衡1,采用的自适应算法为横模算法 (blind1cma)()
    2008-05-08 17:37:23下载
    积分:1
  • matlab_3_opt
    提供一种求解最优哈密尔顿的算法---三边交换调整法,要求在运行jiaohuan3(三交换法)之前,给定邻接矩阵C和节点个数N,结果路径存放于R中。 bianquan.m文件给出了一个参数实例,可在命令窗口中输入bianquan,得到邻接矩阵C和节点个数N以及一个任意给出的路径R,,回车后再输入jiaohuan3,得到了最优解。 由于没有经过大量的实验,又是近似算法,对于网络比较复杂的情况,可以尝试多运行几次jiaohuan3,看是否能到进一步的优化结果。 (Provide an optimal algorithm Hamilton- trilateral exchange Adjustment Act, requiring running jiaohuan3 (c exchange) before a given adjacency matrix C and the node number N, the results of the path stored in the R in. bianquan.m document gives examples of a parameter can be in the command window, type bianquan, be the adjacency matrix C and the node number N and an arbitrary given path R,, carriage return after the input jiaohuan3, have been the optimal solution . After the absence of a large number of experiments, it is approximate algorithm, for more complex network situations, you can try to run several jiaohuan3, can look to further optimize the results.)
    2007-09-20 19:35:15下载
    积分:1
  • kmeans-plusPlus
    K-means++算法实现,加强了初始聚类点的选取(careful seeding)(K-means++ algorithm to enhance the selection of the initial clustering points (careful seeding))
    2010-10-07 11:05:53下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载