dbf100zhenlie

偏移四相移相键控调制，也就是OQPSK，输出信号为OQPSK调制信号的复包络(Offset four-phase phase shift keying modulation, that is, OQPSK, the output signal for the OQPSK modulated signal complex envelope)

该程序，完成Matlab对音频信号的低通处理仿真。有前后频谱图对比！(The program, the completion of the Matlab simulation low pass processing on the audio signal. Before and after the spectrum in Fig contrast!)

Matrix Converter Commutation Strategies With and Without Explicit Input Voltage Sign Measurement

EXIT图，外信息转移图，对做迭代分析的非常有帮助。(EXIT chart, extrinsic information transfer chart, right to do iterative analysis very helpful.)

1. 对给定语料估计其基音周期。 要求用MATLAB语言实现有关基音检测算法，并给出检测结果。2. 实验语料：aoYiSheng.raw 发音：“茅以升”；时长0.9s；采样率：8kHz；量化精度为16bits/sample；数据格式 LSB,MSB分析帧长:20ms(160样点)总帧数：45(1. Corpus right to set its estimated Pitch. Asked to use MATLAB the pitch detection algorithm, and gives results. 2. Experimental corpus : aoYiSheng.raw pronunciation : "Mao Yisheng"; Time-0.9s; Sampling rate : gunfire; 16bits/sample accuracy of quantification; LSB data format, MSB analysis frame size : 20ms (160 samples) total frame count : 45)

robot path planning in complex environment

相关瑞利分布序列和相关威布尔分布序列产生(Correlated Rayleigh distribution sequence and Weibull distribution sequence)

The MatlabBGL library fills a hole in Matlab s suite of algorithms. Namely, it provides a rich set of algorithms to work with graphs, as in graph theory graphs. The MatlabBGL package uses Matlab s native sparse matrix type as a graph and provides algorithms that work (The MatlabBGL library fills a hole in Matla b's suite of algorithms. Namely, it provides a rich set of algorithms to work with graphs. as in graph theory graphs. The MatlabBGL packag e uses Matlab's native sparse matrix type as a gra ph and provides algorithms that work)

改进防碰撞扩展ALOHA的matlab仿真算法(Improved extended ALOHA anti-collision algorithm matlab simulation)

如果G的边集E(G)中有个子集M，满足M中的任何两条边 都不邻接，则M就是图G的一个匹配。包含边数最多的匹配 称为最大匹配，最大匹配所包含的边数称为最大匹配数。当 G是二分图时，问题就比较特殊了，这就是我们要解决 的问题——最大二分匹配。(If there is a subset M in the edge set E (G) of G, if any two edges in M are not adjacent, then M is a match of graph G. The match with the largest number of edges is called the maximum matching, and the number of edges contained in the maximum matching is called the maximum matching number. When G is a two point graph, the problem is very special. This is the problem we want to solve -- the biggest two points matching.)