function

本文是music算法的一种改进，其具有更好的性能，以及能够满足大多数用户的需求，希望会给大家带来方便(This article is a modified music algorithm, which has better performance, and the ability to meet the needs of most users, I hope we will bring convenience)

K-MEANS algorithm Input: cluster number k, and contains n data object . Output: the minimum

C++和matlab混编示例 (Mixed C++ and matlab examples)

有关机动目标跟踪，卡尔曼滤波相关的资料，对从事卡尔曼滤波研究，机动目标跟踪的朋友有参考价值 (The maneuvering target tracking, Kalman filtering relevant information, engaged in Kalman filtering, target tracking friends have reference value)

模板类名：CircleBuffer 功 能：环形缓冲区 优 点：相对于队列来说减少了很多对地址的反复操作，增加稳定性。(Template class name: CircleBuffer function: the ring buffer Pros: relative to the queue for reduced many repeated operation of the address, to increase stability.)

matlab没有提供画椭圆的函数，该函数在获得椭圆中心 长轴轴 短轴后进行画椭圆，其中使用复变函数(did not draw an ellipse matlab function, the function in the long axis of the axis minor axis of the ellipse center painted oval, which use the complex function)

“cppmathref2b.pdf”Matlab 6.5的C++数学库函数及用法详细参考手册，包含全部内容，很详尽，做Matlab和VC混合编程必不可少的工具书。(" Cppmathref2b.pdf" Matlab 6.5 for C++ Math Library function and the use of detailed reference manual, including all content, very detailed, so Matlab and VC hybrid programming tool indispensable.)

在MATLAB的运行环境下 傅里叶变换提取信号系数 相角 幅值(Operating environment in MATLAB Fourier transform to extract the amplitude of the signal phase angle coefficient)

to make dll using matlab

主要用途是对抗多径衰落。由于多径衰落的存在，使得同一个帧由于路径不同，到达用户端的时延有先有后。在相关的频域上的会造成子载波之间的相互干扰，影响 性能。另外，由于有了循环前缀，使得IFFT FFT操作把原来的线性卷积变成循环卷积，大大简化了相应的信号处理复杂度(The main purpose is to fight against multipath fading. Due to the presence of multipath fading, the first after they have the same frame different paths to reach the client delay. Would cause mutual interference between sub-carriers in the frequency domain, affecting performance. In addition, thanks to the cyclic prefix, so IFFT FFT operation to the linear convolution of the original into a circular convolution, greatly simplifying the corresponding signal processing complexity)