登录
首页 » VHDL » ieee

ieee

于 2014-07-08 发布 文件大小:11879KB
0 218
下载积分: 1 下载次数: 1

代码说明:

  VLSI Implementation IEEE Papers 2010 to 2014

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

发表评论

0 个回复

  • keshe
    是基于vc6.0的课程设计。学数据结构的时候做的,有源码和课设分析。(Vc6.0 curriculum design is based. Data structure when done with meta-analysis of the source code and classes.)
    2014-01-01 14:56:59下载
    积分:1
  • Debug
    仅供学习这个是C语言二级考试中有难度的题(For study only. This is a difficult question in the C Language Level 2 Examination.)
    2020-06-24 19:00:01下载
    积分:1
  • 基于adi blackfin dsp的卷积序,包含多种通信系统中的卷积码源代码...
    基于adi blackfin dsp的卷积编码程序,包含多种通信系统中的卷积编码源代码-Patrick Blackfin DSP-based convolution coding process, covering a wide variety of communications systems convolutional coding of the source code
    2022-06-21 04:04:05下载
    积分:1
  • gods-master
    说明:  GoDS (Go Data Structures). Containers (Sets, Lists, Stacks, Maps, Trees),
    2020-06-24 21:00:01下载
    积分:1
  • 基于VB语言的最短路径计算
    基于“邻接点”概念,研究了最短路径的快速计算方法,并利用VB语言编写了计算所需的核心模块,最终实现了从一个节点到另一个节点的所有最短路径的快速查询和显示。(The best traveling line among many distribution nodes is searched by calculating the shortest path between two nodes based on basic principle of adjacency node, the core module is writted with VB, the shortest path from one node to the other node is quickly found and showed.)
    2019-03-15 02:37:34下载
    积分:1
  • DLL-of-VCPP-for-windows
    这本书详细的讲解了windows 动态链接库编程的方方面面。是学习动态链接库编程的最佳书籍。(This is a best book for programmer to learn how to work on dynamid link library on windows platform.)
    2015-09-23 09:38:07下载
    积分:1
  • ReadMessages
    Read sms c# with smslib 3.5.3
    2013-10-02 12:29:34下载
    积分:1
  • OMNET++学习书,包含每个实例的网络层…
    Omnet++学习全书,内含网络每个层的仿真实例和源代码(已经测试) -Omnet++ Learning book that contains the network layer of each simulation examples and source code (already tested)
    2022-02-20 12:12:56下载
    积分:1
  • 文件下载器,运行后下载文件并运行,DELPHI代码
    文件下载器,运行后下载文件并运行,DELPHI代码-files for running after the download and run, Delphi code
    2022-07-04 01:31:50下载
    积分:1
  • how_many_fibs
    Recall the definition of the Fibonacci numbers: f1 := 1 f2 := 2 fn := fn-1 + fn-2 (n>=3) Given two numbers a and b, calculate how many Fibonacci numbers are in the range [a,b]. (Recall the definition of the Fibonacci numbers: f1 := 1 f2 := 2 fn := fn-1+ fn-2 (n>=3) Given two numbers a and b, calculate how many Fibonacci numbers are in the range [a,b]. )
    2009-11-27 15:18:02下载
    积分:1
  • 696516资源总数
  • 106442会员总数
  • 11今日下载