3DMATLAB-FEM-PREP-MESH

说明：  雷达信号处理中相参积累，生成线性调频程序，加噪声，形成回波，进行数字下变频， 抽取，再通过匹配滤波器，进行相参积累，非常完整的程序(In radar signal processing, coherent accumulation generates LFM program, adds noise, forms echo, performs digital down conversion, extraction, and then conducts coherent accumulation through matched filter, which is a very complete program.)

verilog语法说明，包含verilog golden reference guide，verilog 2001语法(verilog golden reference guide)

安卓串口助手　SerialDemo是一个安卓串口调试工具，可以调试安卓的串口通信(Android serial port assistant SerialDemo is a Android serial debugging tool that can debug the serial port communication of Android)

谭浩强C程序设计第四版第9章习题答案,自己做出来的( C Programming Fourth Edition Chapter 9 Exercise answers, do it yourself)

说明：  将图片二值化，对其进行刷条形码以及拼接的一系列操作(Pictures can be binarized, barcoded and stitched.)

说明：  一阶rc电路的电池1阶RC模型辨识数据及程序(Identification Data and Procedures of First Rc Circuit Battery First Rc Model)

说明：  适合新学习语音增强人员学习,，大家下载学习(suitable for studying speech enhancement)

说明：  数字无线电课程设计代码，代码含有详细的注释(Digital radio course design code with detailed notes)

关于空间调制的PPT，自己做的，老师已经审核过了(About spatial modulation of PPT, do it yourself, school teacher reviewed the)

平衡二叉树操作的演示 一、 需求分析 （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