session23

使用ESPRIT方法来进行谐波频率的估计(using esprit method to estimate the frequence)

本代码为割线法求解非线性方程组。其调用格式为[r,m]=mulGXF1(F,x0,x1,eps) 其中，F:非线性方程组；x0初始解；x1：初始解；eps：解的精度；m：迭代步数。(The code for the secant method for solving nonlinear equations. Its call format [r, m] = mulGXF1 (F, x0, x1, eps) where, F: non-linear equations x0 initial solution x1: initial solution eps: solution accuracy m: the number of iterative steps.)

说明：  matlab 编程（第七版),英文书籍，详细阐述了matlab工具的使用(Timothy A. Davis.MATLAB Primer.7th ed.CRC.2005)

model predective control system design and implementation using matlab

FOR HELP AND DOCUMENT FOR POWER AND HELP ME

循环冗余码的生成和验证:数字通信中的编码分为信源编码和信道编码两大类。为了提高数字通信的可靠性采取的编码称为信道编码，又称抗干扰编码。数字通信中为了尽可能地提高通信的可靠性，需要采用信道编码技术，对可能或已经出现的差错进行控制，CRC码就是其中的一种编码技术。本实验就是编写RCR编码，可以模拟发送信息，噪声加入，检测验证，信息重发的过程!(Cyclic redundancy code generation and validation: digital communication in the coding is divided into source coding and channel coding two broad categories. In order to improve the reliability of digital communications to the code known as channel coding, also known as anti-interference codes. Digital communication as much as possible in order to improve the reliability of communication need to use channel coding techniques, which may or may control the errors that have emerged, CRC code is one of a kind of coding techniques. RCR in this experiment is to write code that can simulate send a message, noise adding, testing verification, information, process re-issued!)

多姿态，多角度，有不同光照,包括调制，解调，信噪比计算，阵列信号处理的高分辨率估计，基于互功率谱的时延估计，合成孔径雷达（SAR)目标成像仿真，关于神经网络控制。( Much posture, multi-angle, have different light, Includes the modulation, demodulation, signal to noise ratio calculation, High-resolution array signal processing estimates, Based on the time delay estimation of power spectrum, Synthetic Aperture Radar (SAR) imaging simulation target, On neural network control.)

pod 分解用于PIV数据处理的提取相干结构程序(pod decomposition)

图像编码的matlab代码，压缩文件内是matlab代码。(Matlab code for image coding)

球形检测算法论文，性能接近最大似然算法，但是复杂度较低(Spherical detection algorithm paper, the performance near the maximum likelihood algorithm, but the complexity is low)