登录
首页 » Visual C++ » foo_dsp_srcresample

foo_dsp_srcresample

于 2013-09-10 发布 文件大小:3706KB
0 229
下载积分: 1 下载次数: 4

代码说明:

  audio resampler for windows

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

发表评论

0 个回复

  • rtxdep
    RTX开发包,是RTX内部文件,对于做开发很有用.(rtx dep file)
    2010-01-07 23:08:39下载
    积分:1
  • mymailcode
    本程序主要进行了发邮件的编写 已经调试通过了 可以进行发邮件的处理(the main procedures for the preparation of the mail has been testing can be conducted through the mail processing)
    2007-03-22 10:17:52下载
    积分:1
  • WBBaayesianr
    我写的贝叶斯fusion的Visual C+++源码,简明易懂,提供参数说明 可直接使用。 (The Bayesian fusion the Visual C+++ of what I wrote source, easy-to-understand parameters can be used directly.)
    2012-09-30 11:17:27下载
    积分:1
  • white-answer
    一种对白皮书上的一些例题的答案以及自己的一些见解(An answer to some examples on the white paper, and some of his own opinions )
    2014-01-14 15:49:06下载
    积分:1
  • GMS-Feature-Matcher-master
    说明:  利用GMS对特征点匹配进行约束,降低误匹配率,代码包含python版本,C++版本,matlab版本。(GMS is used to constrain the matching of feature points to reduce the error matching rate. The code includes Python version, C + + version and Matlab version.)
    2021-05-06 16:31:53下载
    积分:1
  • Projects
    一个使用PSPICE来完成的大作业,内含所有源文件(a big homework of pspice)
    2012-07-04 12:05:26下载
    积分:1
  • CHL_Cpp
    MSN8.0客户端回复服务器ping的最新认证算法(MSN8.0 client server ping response to the latest Authentication Algorithm)
    2006-07-26 13:44:00下载
    积分:1
  • huffman_src22
    本代码提供一种非常简单且快速的哈夫曼编码方法。 (this code provide a very simple and rapid method of Huffman coding.)
    2007-06-15 16:02:25下载
    积分:1
  • QRDCMP
    用镜像矩阵求出矩阵的QR分解(正交三角分解),并求解线性方程组,该方法不必选主元,但其计算过程非常稳定。也可用于求矩阵的广义逆和求解线性最小二乘问题。子过程QRDCMP用镜像矩阵求m*n矩阵A的QR分解,A=Q^TR,其中Q是m*m正交矩阵,R为m*n上三角矩阵;子过程QRBKSB用矩阵的QR分解求解线性方程组Ax=b,其中A为n阶非奇异方阵。(Matrix obtained with the mirror matrix QR decomposition (orthogonal triangular decomposition), and solving linear equations, the method does not have to choose the main element, but its calculation process is very stable. Can also be used to find the generalized inverse matrix and solving linear least squares problems. Sub-process of the mirror matrix QRDCMP m* n matrix A QR decomposition, A = Q ^ TR, wherein Q is a m* m orthogonal matrix, R is m* n upper triangular matrix subprocess QRBKSB a QR decomposition to solve the matrix linear equations Ax = b, where A is non-singular square matrix of order n.)
    2013-09-27 11:05:18下载
    积分:1
  • BinaryTree
    二叉树的后序遍历,非递归算法的实现,C++文件。(Binary Tree ,post order)
    2014-12-18 15:40:15下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载