Compare

4FSK调制解调的matlab代码。采用相干解调的方式4FSK进行解调，与大多数方案的包络检波不同。基带信号用四种电平来表示，与调制信号相区分。(Demodulation matlab code 4FSK modulation. Coherent demodulation 4FSK demodulates Unlike most programs envelope detector,. The baseband signal is represented with four level distinguish phase with the modulation signal.)

DMX 512协议是Digital Multiplex的缩写，是灯光行业数字化设备的通用信号控制协议，同时也是是一种国际协议。 　　USITT DMX512/1990是调光和灯光控制台数据传输标准，是娱乐灯光领域常用的控制协议。以前0-10V模拟控制用的比较多，现在DMX512是娱乐灯光行业最主要的控制协议。USITT DMX512/1990是由美国剧场技术协会USITT提出的。最原始的版本出版于1986年，在1990年做了修改。 (DMX 512 protocol is short for Digital Multiplex is light industry, general-purpose digital signal device control protocol, but also is an international agreement. USITT DMX512/1990 is dimming and lighting control data transmission standard, is commonly used in the field of entertainment lighting control protocol. 0-10V analog control previously used more, now is the entertainment lighting industry, the main DMX512 control protocol. USITT DMX512/1990 by the American Association of Theater Technology USITT s. The original version published in 1986, was revised in 1990.)

非规则LDPC码在AWGN信道下的性能仿真，码长1024，码率0.5，调制方式QPSK(simulation of LDPC codes in AWGN channel)

自适应的LMS算法及其应用 本实验通过一个二阶自回归过程来研究实时数据集平均对LMS算法的影响 包含MATLAB代码(LMS algorithm)

使用MFC编写的windows环境下的串口操作工程模板(Serial port operation project templates written using MFC windows environment)

利用vc编写的基于Goose报文的通信程序，在此程序中可对所发送的报文进行设定。(Goose vc prepared based on the use of packet communication program, in this procedure can send packets to the set.)

说明：  CONVERT A MATRIX TO LOWER TRIANGULAR MATRIX

说明：  软合并和检测中的认知无线电协作频谱感知,希望对你有用.(Soft Combination and Detection for Cooperative Spectrum Sensing in Cognitive Radio Networks.pdf)

无源传感器网络的分布式能量自适应最小化延迟调度(Distributed Energy Adaptive Minimization Delay Scheduling for Passive Sensor Networks)

说明：  求解双层规划问题常用的算法有极点算法、直接搜索法、下降法和非数值优化方法(如模拟退火算法、遗传算法等)，遗传算法的求解思路是：首先对上层的决策变量编码，代人下层规划模型，通过求解下层模型的决策变量值，代入上层模型计算适应度值，然后进行交叉、变异、选择操作，最后求出最优解。(Solving Bilevel Programming Problems with pole algorithm commonly used algorithms, direct search method, descent and non-numerical optimization methods (such as simulated annealing, genetic algorithms, etc.), genetic algorithm for solving approaches: the first on the top of the decision variable coding, on behalf of the were lower programming model, by solving the lower model of decision variables values into the upper model on behalf of the fitness value, and then crossover and mutation, select Options, and finally get the best solution.)