PROFIBUS的的通讯芯片SPC3的控制源码

仿真RM码，及在高斯信道下的译码性能，对RM采用大数逻辑译码算法，并与单独BPSK调制在高斯信道的性能进行比较，分析上述两个码带来的编码增益。-RM

这是一个JAVA帮助文档,我在这里上传是为了帮JAVA初学者一个平台,让我们的JAVA事业能有一个新的台阶,我们这里为我们JAVA爱好者能够一起努力.为JAVA事业奋斗-This is a JAVA help documentation, I upload here is to help beginners a JAVA platform, Let us Java can cause to a new height, we are here for our Java enthusiasts can work together. JAVA struggle for the cause

演示把几个文件打包成一个文件并且释放-demo packages combine several documents into one document and release

作业调度模拟程序,操作系统实验来的.会对你有很大帮助的,哈哈哈哈.-scheduling simulation program, the operating system of the experiment. You will be very helpful, ha ha ha ha.

自动洗手器与自动干手器电路设计，有参考价值。-Automatic hand-washing device Automatic Hand Dryer with circuit design, have reference value.

本程序是在Ti的dm642上通过PCI和主机通信的测试程序-is in the process of Ti dm642 adopted PCI and host communications testing procedures

视频录象，人人易懂 XLISP（XL600，XL1000）软件烧写操作视频录像教程-Video video, everyone read XLISP (XL600. XL1O00) software video burning operation Video Guide

This is an extension of sign example. You can design your own traffic sign by using Verilog. And the result from Verilog can be seen by the attached C file.

stc最新1T单片机片内EEPROM应用代码-stc latest 1T-chip single-chip EEPROM application code

平衡二叉树操作的演示 一、 需求分析 （1） 利用平衡二叉树实现动态查找表。实现查找，插入和删除三种基本功能。 （2） 初始，平衡二叉树为空树，操作界面给出查找，插入和删除三种操供选择。每种操作均要提示输入关键字。每次插入和删除一个接点时，显示更新的平衡二叉树。 （3） 重点在于对删除算法的实现。假设要删除的关键字为X的结点，若X不在叶子结点上，则用左子树中的最大值或者右子树中的最小值取代X。如此反复，直到删除动作传递到某个叶子结点，删除叶子结点时，若要进行平衡变换，可采用插入的平衡变换反变换。 -balanced binary tree operation of a demonstration, demand analysis (1) using a balanced binary tree dynamic lookup table. Lookup, insertion and deletion of the three basic functions. (2) The initial, balanced binary tree is empty tree interface gives you insert and delete options for the three parade. Each operation will have to be me to input keywords. Each insert and delete a contact in that update balanced binary tree. (3), the focus is on the deletion algorithm. To remove the assumption that the keyword for the X-Node, if X is not the leaf nodes, Left-used for the highest tree or right-tree to replace the minimum X. So repeatedly, until the deletion of a transfer leaf nodes, delete the leaf nodes, if balancing transform, Ins