UWB 测距代码 完美移植到各类MCU

程序烧到片子，单片机完成对彩灯有规律的控制

说明：  基于子空间投影的 CSMG 波束形成算法，是一种将子空间投影与波束形成技术相 结合的抗干扰方法。该方法首先构造干扰子空间的正交补空间，再将天线阵列接收到的空时信号矢量向其投影，然后对投影后的输出信号采用具有严格约束最小功率的抽样矩阵梯度（CSMG）算法，在固定方向上进行波束形成，最后捕获、定位及解算出每个波束得到的无干扰数据等，可以有效地抑制干扰信号，同时又可以更好的保留期望信号。(The algorithm of the CSMG beamforming based on subspace projection, which is a combination of the Subspace projection and beam forming technology. Firstly, the data vector received by antenna array is projected onto the interference subspace, which is orthogonal to interference subspace for achieving interference suppression. And then, by using the method of the strictly constrained minimum power sampling matrix gradient(CSMG), after the projection of the subspace, the signal is beamformed in a fixed direction. Finally, for jammer-free data of each beam achieved to capture, locate, solute and so on. The ability of the suppress interference by this method, which can be more effectively, and keep the desired signal better.)

cancanbaud canbaud canbaud canbaud canbaud

nat blaster,测试nat的连通性能.(nat blaster, tests nat to connect the performance )

利用stc89c51设计超神波测距，达到一定距离会报警，显示到数码管上，还可以通过按键设置距离上限

西门子PLC通讯源码 libnodave-0.8.4.6  西门子PLC通讯源码 libnodave-0.8.4.6  西门子PLC通讯源码 libnodave-0.8.4.6 

改变预设打印机设置代码,方便管理打印机

说明：  FreeRTOS实时内核_实用指南 原版本英文的中文翻译版本(FreeRTOS translated to chinese)

基于TMS320LF2407的FFT算法的实现及应用(TMS320LF2407 of the FFT algorithm based on Implementation and Application of)

poj 3941 Hideyuki is allowed by his father Ujisato some 1000 yen bills every month for his pocket money. In the first day of every month, the number of bills is decided as follows. Ujisato prepares n pieces of m-sided dice and declares the cutback k. Hideyuki rolls these dice. The number of bills given is the sum of the spots of the rolled dice decreased by the cutback. Fortunately to Hideyuki, Ujisato promises him to give at least one bill, even if the sum of the spots does not exceed the cutback. Each of the dice has spots of 1 through m inclusive on each side, and the probability of each side is the same. In this problem, you are asked to write a program that finds the expected value of the number of given bills. (poj 3941 Hideyuki is allowed by his father Ujisato some 1000 yen bills every month for his pocket money. In the first day of every month, the number of bills is decided as follows. Ujisato prepares n pieces of m-sided dice and declares the cutback k. Hideyuki rolls these dice. The number of bills given is the sum of the spots of the rolled dice decreased by the cutback. Fortunately to Hideyuki, Ujisato promises him to give at least one bill, even if the sum of the spots does not exceed the cutback. Each of the dice has spots of 1 through m inclusive on each side, and the probability of each side is the same. In this problem, you are asked to write a program that finds the expected value of the number of given bills.)