登录
首页 » matlab » Digital_Signal_Processing_A.V.Oppenheim

Digital_Signal_Processing_A.V.Oppenheim

于 2010-12-08 发布 文件大小:18304KB
0 243
下载积分: 1 下载次数: 190

代码说明:

  奥本海默 《数字信号处理》 第二版 学习DSP的经典教材(A.V.Oppenheim, 《Digital Signal Processing》 Second Edition The classic textbook learning DSP )

文件列表:

Digital_Signal_Processing_A.V.Oppenheim.pdf,19593749,2005-03-06

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

发表评论

0 个回复

  • delaymatlab
    用相位谱法 时延估计 里面有很详细的分析 图形有点误差(delay matlab time delay estimation delay matlab identification using neural networks on matlab )
    2011-01-08 21:35:46下载
    积分:1
  • 57765079motorvectorcontrol
    按转子磁链定向的矢量控制系统matlab仿真;(Press the rotor flux oriented vector control system matlab simulation )
    2013-11-17 20:13:38下载
    积分:1
  • capacity_water
    This program uses the waterfilling to compute capacity
    2008-07-22 18:36:44下载
    积分:1
  • lvbohou
    说明:  正弦信号,单个频率的正弦信号,频率为1KHz,幅度为5(Sinusoidal signal, a single frequency sinusoidal signal, a frequency of 1KHz, the range of 5)
    2010-04-28 10:29:32下载
    积分:1
  • matlab-code
    matlab解线性方程组的源代码 function x=nagauss2(a,b,flag) % 用途:选列主元Gauss消去法解线性方程组ax=b % 格式:x=nagauss2(a,b,flag) a为系数矩阵,b为右端列向量,flag若为0,则显示中间过程 (Matlab solution of linear equations source code function nagauss2 x = (a , b, flag)% purposes : a selection PCA Gauss elimination method for solving linear equations ax = b% Format : nagauss2 x = (a, b, flag) for a coefficient matrix, b subguadratic column vector, if the flag is 0, then showed intermediate process)
    2006-06-02 11:52:10下载
    积分:1
  • TechniquesforDebuggingMATLAB-files
    matlab出错信息的技术,可以帮助我们快速找到出错的原因,提高编程效率。(matlab error information technology that can help us quickly find the wrong reasons, to improve programming efficiency.)
    2010-11-06 10:08:26下载
    积分:1
  • shuzixinhaochuli
    这是基于matlab的数字信号处理的实验。里面有详细的要求和程序解答,适合初学者。(This is based on digital signal processing matlab experiments. There are detailed requirements and procedures to answer, for beginners.)
    2011-10-19 22:15:25下载
    积分:1
  • dijikstra
    For a given source vertex (node) in the graph, the algorithm finds the path with lowest cost (i.e. the shortest path) between that vertex and every other vertex. It can also be used for finding costs of shortest paths from a single vertex to a single destination vertex by stopping the algorithm once the shortest path to the destination vertex has been determined. For example, if the vertices of the graph represent cities and edge path costs represent driving distances between pairs of cities connected by a direct road, Dijkstra s algorithm can be used to find the shortest route between one city and all other cities. As a result, the shortest path first is widely used in network routing protocols, most notably IS-IS and OSPF (Open Shortest Path First).
    2012-04-12 21:01:48下载
    积分:1
  • workshop07
    This part of workshops tutorials from game engine A7 3D Gamestudio. With Atari s Lite(C language.-This is part of workshops tutorials from game engine A7 3D Gamestudio. With Atari s Lite-C language.)
    2014-09-17 23:31:15下载
    积分:1
  • BOOST
    非线性动力学,峰值模式boost变换器分岔图绘制,闭环模型(Nonlinear dynamics, peak mode boost converter bifurcation diagram drawing, closed-loop model)
    2020-07-03 05:20:02下载
    积分:1
  • 696516资源总数
  • 106641会员总数
  • 4今日下载