AmplitudePhaseDistortionCompare

以正弦波信号为例，对其进行信源编码、信源译码译码以及循环信道编码(a sinusoidal signal as an example, its source code, source decoder decoding and channel coding cycle)

实验一 双极性矩形随机信号的归一化功率谱密度一 1.1 功率谱密度简介 平稳过程的任何一个非零样本函数的持续时间为无限长，显然都不满足绝对可积和总能量有限的条件。因此，它的傅里叶变换不存在即没有频谱函数。所以我们用功率谱密度来表述其频谱特性。 随机过程的任一实现是一个确定的功率型信号。而对于任意的确定功率信号f(t)，它的功率谱密度为： 式中， 是f(t)的截短函数 对应的频谱函数。f(t)是平稳随机过程 的一个实现。而随机过程某一个实现的功率谱密度不能作为过程的功率谱密度。过程的功率谱密度应该看作是任一实现的功率谱密度的统计平均，即 虽然该式给出了平稳随机过程的功率谱密度，但我们通常都不利用这个式子来计算功率谱。我们知道，确知的非周期功率信号的自相关函数与功率谱密度是一对傅里叶变换。对于平稳随机过程，也有类似的关系，即 和 对于平稳随机过程我们通常先求出其自相关函数再利用上式求出其功率谱密度。 1.2 实验要求  1.了解平稳随机信号功率谱的概念及计算方法  2.仿真不同占空比，等概、非等概双极性矩形随机信号的归一化功率谱密度  3.分析不同信号所包含的频谱分量，有无直流分量和定时分量信息 (A pair of rectangular random experiment polarity signal sample return a nonzero function of any duration power spectral density of a 1.1 power spectral density of a stationary process Introduction of infinite length, apparently not satisfied absolutely integrable and the total energy of the limited conditions. Therefore, it is the Fourier transform of the spectrum that does not function does not exist. Therefore, we use the power spectral density to express their spectral characteristics. Any random process is a realization of a certain type signal power. For arbitrarily determined power signal f (t), its power spectral density is: wherein, is f (t) is a function corresponding to the truncated spectrum function. f (t) is a stationary random process of realization. The random process to achieve a certain power spectral density can not serve as the power spectral density of the process. Power spectral density process should be seen as a statistical average power spectral density of any r)

大量雷达系统仿真的matlab程序集合，学习雷达信号处理的同学可以看看。(A large number of radar system simulation matlab Program )

基于labvieW的光纤光栅采集程序，使用了MOI公司的sm125解调仪。(FBG based labvieW collection procedures, the use of MOI' s sm125 demodulator.)

人的面部识别程序，检测正确率很高，经过对多账户照片的识别，正确率为百分之一百(Facial recognition program, the detection accuracy is high)

二元分类问题。有完整的代码和详细的分析文档。(Binary Classification. complete code and detailed analysis .)

差分 微分模型的代码,很好用，学习很快。可尝试学习。(Differential differential model code, useful, learning quickly. You can try to learn.)

MATLAB神经网络30个案例分析pdf(MATLAB neural network analysis of 30 cases)

帝国算法：初始化，帝国同化，帝国更新，帝国竞争，帝国删除。与粒子群算法比较(ICA social politic)

We consider the scheduling of simple linear deteriorating jobs on parallel machines a new perspective based on game theory. In scheduling, jobs are often controlled by independent and selfish agents, in which each agent tries to a machine for processing that optimizes its own payoff while ignoring the others. We formalize this situation as a game in which the players are job owners, the strategies are machines, and a player’s utility is inversely proportional to the total completion time of the machine selected by the agent. The price of anarchy is the ratio between the worst-case equilibrium makespan and the optimal makespan. In this paper, we design a game theoretic approximation algorithm Aand prove that it converges to a pure-strategy Nash equilibrium in a linear number of rounds. We also derive the upper bound on the price of anarchy of Aand further show that the ratio obtained by Ais tight. Finally, we analyze the time complexity of the proposed algorithm