登录
首页 » matlab » Pipelined-ADC

Pipelined-ADC

于 2011-05-04 发布 文件大小:18KB
0 90
下载积分: 1 下载次数: 37

代码说明:

  pipelined ADC, 各种参数可调,最后包括fft分析和整个传输曲线(pipelined ADC, adjustable parameters, and finally including the entire transfer curve analysis and fft)

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

发表评论

0 个回复

  • DESIGN
    matlab 专业设计 源于课本的原文件 适合于编程人员(matlab professional design textbooks from the original document is suitable for programmers)
    2007-08-12 10:54:37下载
    积分:1
  • dmc
    动态矩阵预测控制m语言程序,使用平台matlab。内有注解便于修改(M dynamic matrix predictive control language program, use the platform matlab. There are easy to modify Notes)
    2020-10-20 14:17:25下载
    积分:1
  • ask
    说明:  一个ask调制解调的源程序,可以自己添加一些噪声进行仿真分析!(Ask modulation and demodulation of a source, you can add some noise to conduct their own simulation analysis!)
    2008-11-19 17:07:43下载
    积分:1
  • daolibaimohukongzhiqi
    单级倒立摆智能控制器中的模糊控制器的设计与仿真(Inverted Pendulum and Intelligent Control Design and Simulation of Fuzzy Controller)
    2010-05-15 10:25:31下载
    积分:1
  • bu_reactive_power_optimization
    配电网无功优化算法,补上了对应的论文文献。(Reactive Power Optimization, make up the corresponding paper documents.)
    2020-07-01 11:00:02下载
    积分:1
  • matlab实现VQ说话人识别系统
    说明:  基于Matlab简单的语音识别系统,能够通过样本训练得到最后结果。(Simple speech recognition system based on Matlab can get the final result through sample training.)
    2019-02-22 03:41:09下载
    积分:1
  • Untitled3
    哈夫变换检测圆,,检测一个半径为80,灰度值为160的圆,它处在灰度值为96的背景中(Hough transform to detect circles, and testing a radius of 80, round gray value of 160, it is in the background gray value of 96)
    2010-11-01 14:57:34下载
    积分:1
  • NCPSO
    matlab 优化问题 小生境和蚁群算法的结合 能运行(matlab optimization niche and the combination of ant colony algorithm can run)
    2010-12-06 16:46:16下载
    积分:1
  • GraphTheoryAlgorithmMATLAB
    说明:  图论算法及其MATLAB 程序代码 1.求赋权图G = (V, E , F )中任意两点间的最短路的Warshall-Floyd 算法、Kruskal 避圈法 2.求二部图G 的最大匹配的算法(匈牙利算法)、利用可行点标记求最佳匹配的算法 3.从一个可行流f 开始, 求最大流的Ford--Fulkerson 标号算法 6.(Graph Theory Algorithm and MATLAB program code 1. Seeking weighted graph G = (V, E, F) in the shortest path between any two points of the Warshall-Floyd algorithm, Kruskal avoid the circle method 2. Seeking the maximum bipartite graph G matching algorithm (the Hungarian algorithm), using feasible point mark seeking the best match algorithm 3. a feasible flow f from the beginning, find the maximum flow of the Ford- Fulkerson Labeling Algorithm 6.)
    2010-03-28 15:39:29下载
    积分:1
  • MATLAB-jiaocai
    一本介绍matlab学习的书籍,清华出版 高清,非常有用(An introduction to the MATLAB learning books, Tsinghua publishing HD, very useful )
    2011-11-06 16:41:52下载
    积分:1
  • 696518资源总数
  • 104226会员总数
  • 47今日下载