-
Si4730-31Rev0_5
采用CMOS技术的FM/AM收音机单芯片Si4730技术资料，讲解非常的详细，是原厂内部资料。(CMOS technology, the use of FM/AM radio Si4730 single-chip technical information, on the very detailed and is the original internal information.)
- 2009-07-08 16:14:32下载
- 积分：1
-
SAR压制干扰
说明： 该程序用于产生干扰，用于SAR压制干扰仿真，附运行说明(SAR Jamming:The program is used to generate jamming, SAR suppression jamming simulation, with operating instructions.)
- 2021-03-14 14:30:18下载
- 积分：1
-
源码伟 伽勒华域乘法器的verilog代码，经过验证
源码伟 伽勒华域乘法器的verilog代码，经过验证-Source-wei Galle Chinese domain multiplier verilog code, a proven
- 2022-03-23 08:03:58下载
- 积分：1
-
小球加速运动，可用于多种扩展。物体加速的算法
小球加速运动，可用于多种扩展。物体加速的算法-Ball accelerated motion, can be used for a variety of expansion. Objects to speed up the algorithm
- 2022-07-02 15:52:39下载
- 积分：1
-
1）设定字节型变量VAR1的内容为35H，编写程序将VAR1的高4位与低4位分离，分别作为低4位保存在RES1和RES2中,这两个变量高4位置0。
2...
1）设定字节型变量VAR1的内容为35H，编写程序将VAR1的高4位与低4位分离，分别作为低4位保存在RES1和RES2中,这两个变量高4位置0。
2）设定32位（二进制）数据0E2597455H（注：最高位为E）保存在变量VAR2中，将该变量中的内容算术左移2位，所得结果仍然保存在VAR2中-1) Set the contents of byte variable VAR1 is 35H, the preparation of the program will VAR1 high 4 and low 4 separation, respectively, as a low 4 bits stored in RES1 and RES2, this high-4 position of the two variables 0.2 ) to set the 32-bit (binary) data 0E2597455H (Note: The highest level of E) stored in the variable VAR2 in the contents of the variable arithmetic left two, the result is still stored in the VAR2 in the
- 2022-09-12 00:15:03下载
- 积分：1
-
classyslides
latex beamer 很简洁的beamer模板 很简洁的beamer模板 很简洁的beamer模板(latex beamer Very concise beamer templates are simple beamer templates that are very simple beamer templates)
- 2017-12-07 16:34:09下载
- 积分：1
-
ndvi
基于GEE计算landsat 的植被覆盖度(Calculating ndvi based on GEE)
- 2021-04-27 09:08:45下载
- 积分：1
-
工具提示效果库
s通过简单的设置可以实现在不同位置显示提示框，根(S can display prompt box and root in different places by simple settings.)
- 2019-02-14 11:19:15下载
- 积分：1
-
石器服务端源代码工具集
用于制做石器图像补丁.等陆画面.和登陆列表的工具.地图制作工具,图片修改,补丁追加等工具。研究石器时代、开服必备。
- 2023-04-26 11:20:03下载
- 积分：1
-
FloodingSimulation
在具有至少十五个节点的网络中模拟洪泛路由。每个数据包应包含一个计数器（n = 10），该计数器在每一跳上递减。(Simulate flood routing in a network with at least fifteen nodes. Each packet should contain a counter (n=10) that is decremented on each hop. When the counter gets to zero, the packet is discarded. Time is discrete, and each
link can handle only one packet per time interval (i.e. only one packet in total may traverse
the link in either direction). Nodes should include a buffer to queue any additional packets.
Present your results in terms of the number of duplicate packets produced, and the
congestion at each node, and suggest a possible solution for reducing this problem.)
- 2020-06-24 09:40:07下载
- 积分：1
|
联系客服（QQ：3324461878）
