matlab2010aword

for compression using discrete cosine transform

TSP can be defined as a problem where starting from a node it is required to visit every other node only once in a way that the total distance covered is minimized. After an initial solution a neighborhood solution is selected by an exchange of a randomly selected pair of nodes. The randomly generated neighbor solution is selected if it improves the solution else it is selected with a probability that depends on the extent to which it deteriorates from the current solution.

64-QAM通信系统设计 64-QAM通信系统设计 64-QAM通信系统设计(64-QAM communication system design of 64-QAM 64-QAM communication system Communication System)

使用基于LDA算法的人脸识别程序，附有相应的论文(LDA algorithm based on the use of face recognition procedure, with the corresponding papers)

Algorithm as described in "CoSaMP: Iterative signal recovery from incomplete and inaccurate samples"

QAM,PSK,DPSK,FSK,MSK调制仿真，包括眼图输出，误码率输出，星座图，频谱，及实际wav文件的调制解调(QAM, PSK, DPSK, FSK, MSK modulation simulation, including eye diagram output, the output BER, constellation, spectrum, and actual modem wav files)

Heed protocal for ad hoc netork

关于lms的作业，有详细的注释，程序经过验证没有问题，(homework for the lms，)

非线性规划，二次规划SQP，matlab程序求最优值(Nonlinear Programming)

一种对Toa定位算法进行性能分析的算法源代码，图形展示了Toa的性能，希望采纳(Kind of Toa localization algorithm for performance analysis algorithm source code, graphics showing the performance of Toa, and hope to adopt)