exm1

运用matlab进行EXCEL文件读取程序，希望对大家有帮助！(EXCEL file using matlab to read the program, want to help you!)

本程序中得到的收端OFDM信号的频谱波形，是与其发端信号的排步有关的。在发端的 ％ 载波安排上，128个载波有前后各32个载波是null载波(如果这前后各32各载波是带外频段， ％ 那么理论上它们都应该是零！)，中间的64个载波是数据载波。这样的排步很明显就是一个 ％ 两边低，中间高的频谱形式。所以，收端也应该是这个轮廓。 (this process the resumption end of the spectrum OFDM signal waveform, with the originator of the signal further on the row. The originator% carrier arrangements, 128 of the carrier after a 32 carrier is null carrier (if it was around the 32 is the carrier frequency band. % then theoretically they should be zero!) the middle 64 carrier data carrier. This arrangement is obviously further 1% lower on both sides, in the middle of the spectrum form high. Therefore, the admission should end this profile.)

Segmentation by growing a region from seed point using intensity mean measure.Simple but effective example of "Region Growing" from a single seed point.

The document describes seismic signal processing. Main function is to extract the edge of the seismic signal.

计算Einstein场方程的mathematica程序包。输入变量和度规。自动计算里奇张量和曲率张量。( calculate Ricci Tensor and the Curvature Scalar)

这是自己写的实现哈夫曼编码的几个MATLAB程序，可以直接运行(This is the realization of their own to write several MATLAB programs Huffman coding, can run)

signals snr ratio by opertions

it is a pll (phase locked loop simulation)

蚁群算法是一种模仿蚁群行为的仿生优化算法，其实现机理包括两个基本阶段：适应阶段和协作阶段。在适应阶段，各可行解根据积累的信息不断调整自身结构，路径上经过的蚂蚁越多，信息量越大，则该路径越容易被选择：时间越长，信息量越小。在协作阶段，各可行解之间通过信息交流，以期望产生性能更好的解。(Ant colony algorithm is a mimic ant colony behavior of bionic optimization algorithm, its implementation mechanism includes two basic stages: adaptation and collaboration. In adaptive phase, the feasible solution according to the accumulated information constantly adjust their structure, path through the more the ants, the greater the amount of information, it is the easier path is chosen: the longer the time, the smaller the amount of information. The collaboration stage, through the exchange of information between the feasible solution, expecting to generate better solutions.)

MATLAB 牛顿下山法的一个小程序，原理就不详细说了。因牛顿迭代法受初值选取的限制，为防止迭代发散，对迭代过程再附加一项要求:|f(x(k+1))|<|f(x(k))|,将牛顿法迭代的结果:x(k+1) =x(k)-f(x(k))/f (x(k))和前一近似值x(k)适当加权平均做为新的改进值:x(k+1)=u*x(k+1) +(1-u)*x(k),其中u(0<> 迭代时u取1开始，逐次减半计算，直至附加要求符合为止。实例计算中x(k)=x(0)不变，只更新u和x(k+1)，直至:|f(x(k+1))|<|f(x(k))|（即|f(x(1))|<|f(x(0))|)，然后更新下山因子为u=1,继续以牛顿法迭代。(MATLAB Newton-down a small program, the principle is not explained in detail. Newton iteration by the initial value of the selected limit, in order to prevent additional iterative divergence, the iterative process a request: | f (x (k+1)) | < | f (x (k)) | Newton iteration Results: x (k+1) ' = X (k)-f (x (k))/f' (x (k)) and a previous approximation x (k), appropriately weighted average as a new improved value: x (k+1 ) = u* x (k+1) ' + (1-u)* x (k), where u (0 < u> iteration take successive calculated at 50 until the additional requirements found so far. examples of calculation of X ( k) = x (0) unchanged profile u and x (k+1, hungry) until: | f (x (k+1)) | < | f (x (k)) | (i.e. | f (x (1)) | < | f (x (0)) |), then profile downhill factor for u = 1, to continue to Newton iteration.)