-
LQFP64
LPC2148封装,，可以直接用于PCB的绘制！本人在实践项目中以及用过，现在分享给大家(LPC2148 package, can be directly used for rendering, PCB!I am in the practice of project and used, now for everyone to share )
- 2013-03-16 11:30:28下载
- 积分：1
-
_C_
说明： 一个月挑战C++ 电子书C++教学
适合新手入门学习(Month challenge C++ C++ books for beginners to learn teaching)
- 2010-04-23 20:26:07下载
- 积分：1
-
七段数码数字时钟
C# 数字时钟
- 2015-02-04下载
- 积分：1
-
Robot-inversion-movement
设计一个用于解决两关节机械手的反演运动学问题的前馈网络，要求末端执行器的运动轨迹是一条直线.(Design a feedforward network is used to solve the two-joint robot inverse kinematics problem, requirements of the end-effector trajectory is a straight line.)
- 2020-12-29 08:49:01下载
- 积分：1
-
SreenServer
远端屏幕共享，获取屏幕截图并保存，值得学习(Remote screen sharing, take a screenshot and save it, it is worth learning)
- 2014-08-21 17:38:50下载
- 积分：1
-
18f4520.X
说明： pic4520串口bootloader 通过串口下载(microchip pic4520 bootloader serial)
- 2019-11-01 09:17:47下载
- 积分：1
-
2347449
这是一个C语言实现的一阶到六阶的IIR滤波器程序,用于TI TMS320C5416 Texas 工具(This is a C-language-implemented first-to-sixth-order IIR filter program for the TI TMS320C5416 Texas tool)
- 2019-03-25 14:53:18下载
- 积分：1
-
MSKxiangwei
MSK带初始相位的正交相位调制法，显示附加相位(MSK with the initial phase of the orthogonal phase modulation method, showed that additional Phase)
- 2007-05-13 10:54:16下载
- 积分：1
-
demo_scan
说明： 在linux开发环境下采集Hokuyo雷达输出数据的程序(sampling Hokuyo output data program)
- 2020-06-16 08:00:02下载
- 积分：1
-
shanks
求离散对数的shanks算法，要求如下：
实现计算 Zp 中计算离散对数的 Shanks 算法，基本要求如下：
1）p 是一个小素数( 小于 32 bit )，a 是一个本原元。程序的输入为(p, a, b), 输出为 logab ( mod p) (可以用 log3525 (mod 809)等作为测试)；
2）采用快速模指数算法求幂（如am），采用扩展欧几里得算法求逆（ 如a-i (mod p) ）；
3）采用一种好的排序算法对 L1、L2 排序；
4）采用概率算法（如Miller Rabin算法）自动生成素数 p，采用本原元的充要条件自动生成 a；(Discrete number of shanks on demand algorithm, the following: calculation of Zp calculated to achieve the discrete logarithm Shanks algorithm, the basic requirements are as follows: 1) p is a small prime number (less than 32 bit), a is a primitive element. Process input (p, a, b), output logab (mod p) (can use log3525 (mod 809) so as a test) 2) The fast mode index algorithm to solve the power (such as the am), using extended Euclidean Reed inverse algorithm (such as ai (mod p)) 3) use a good sorting algorithm on the L1, L2 sort 4) using probabilistic algorithms (such as the Miller Rabin algorithm) automatically primes p, using primitive element automatically generate the necessary and sufficient conditions a )
- 2010-05-26 11:30:38下载
- 积分：1
