我上传了个 记事本 C#写的 在Windows自带的记事本上加了工具栏...

描述了LTE下行物理信道的信道编码的详细实现，包括CRC校验、turbo编码、咬尾卷积编码和速率匹配等。(Describes LTE downlink physical channel channel coding detailed implementation, including the CRC check, turbo encoding, tail-biting convolutional coding and rate matching.)

2802 步进电机控制器，可以作为步进电机驱动设计的重要参考(2802 stepper motor controller, stepper motor driver can be used as an important reference design)

ts 码流 可以通过同步系统时间 pcr 发送 参考VLC 代码

鬼影DDOS集群发包源码，分为客户端和服务端完整源码(Ghost DDOS cluster source code, divided into client and server complete source code)

人类动作识别，使用的是c++和opencv开发，有多种识别方法，建议收藏-Human movement recognition, using a c++ and opencv development, there are a variety of identification methods, the proposed collection of

选主元的高斯消元法，用于求解线性方程组。很方便！基于c++开发。(Selected principal component of the Gaussian elimination method for solving linear equations. Very convenient! Based on c++ development.)

将一个正整数分解质因数。例如：输入90,打印出90=2*3*3*5。 程序分析：对n进行分解质因数，应先找到一个最小的质数k，然后按下述步骤完成： (1)如果这个质数恰等于n，则说明分解质因数的过程已经结束，打印出即可。 (2)如果nk，但n能被k整除，则应打印出k的值，并用n除以k的商,作为新的正整数你n, 　重复执行第一步。 (3)如果n不能被k整除，则用k+1作为k的值,重复执行第一步。 -Will be a positive integer decomposition of the quality factor. For example: enter 90, print out 90 = 2* 3* 3* 5. Program analysis: the decomposition of n quality factor, should be to find a smallest prime number k, then complete the following steps: (1) If the prime number exactly equal to n, is illustrated in the process of decomposition of the quality factor has come to an end, you can print out . (2) If n

此程序主要是关于赫米特多项式的研究与C#中的实现(Hemet polynomial on research and C# implementation)

二叉树的打包数据结构，包括遍历，删除，添加，注释详细(Packaged binary tree data structure, including traversal, delete, add, annotate details)