Modulation-and-demodulation-process

MATLAB program for implementing COSTAS reciever in communications.

用matlab来仿真floyd算法，并计算任意两点的最短路径和路由；(Using matlab to simulate floyd algorithm, and calculate any two of the shortest path and routing )

This M Code simulate the effects of clipping and filtering on PAPR PAPR reduction in OFDM-based wireless standard.Also the performance of BER versus SNR of original OFDM signals with PAPR reduction based on clipping and filtering schemes over AWGN channel is evaluated. The simplest and most widely used technique of PAPR reduction is to basically clip the part of signals that are outside the allowed region.Clipping methode introduces both in band distortion and out of band radiation into OFDM signals which degrades the performance including the BER and spectral efficiency.Filtering can reduce out of band radiation after clipping although it can not reduce in-band radiation distortion.However, clipping may cause some peak regrowth so that the signal after clipping and filtering will exceed the clipping level at some point.To reduce peak regrowth a repeated filtering and clipping operation can be used to obtain a desirable PAPR at a cost of computational complexity increase.

非常好的资料,希望大家有用,GA遗传算法的Matlab程序原理资料.(Very good information, I hope everyone useful, GA genetic algorithm Matlab program theory information.)

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

Same functionality as the MATLAB rref function

说明：  在matlab环境下编写的快速傅里叶变换程序，改变换程序简单有效(Matlab environment in the preparation of the fast Fourier transform procedure to change the procedure for simple and effective)

说明：  本程序为误差椭圆matlab例程，工程应用(This procedure for the error ellipse matlab routines, engineering applications)

用C Sharp编写一个Windows服务，有详细的图文并茂的编写设计文档。代码有注释，容易阅读。(The preparation of a Windows service by C Sharp, has detailed pictures and write design document. Annotated code, easy to read.)

matlab粗糙集程序 以上程序都在matlab2011a中调试通过(matlab rough set procedures above procedures are debugging through in matlab2011a)