APPLICAT

基于MMSE准则的盲自适应多用户检测算法(Based on MMSE criterion for blind adaptive multiuser detection algorithm)

SSIM 1.0 Local Search Similarity

说明：  任何一个检测的信号都不可避免地受到干扰源的影响，脑电检测中的干扰源主要分为体内体外两大类。 体外干扰包括检测系统本身（如电极与头皮的接触阻抗的变化）、交流电源和环境中的电磁干扰源。把脑电图机的接地端与地线向量，并保持电极与头皮的良好接触，可以有效地抑制工频干扰。在电磁屏蔽室中进行脑电采集，能有效地避免环境中的电磁干扰。(eeg eog)

Microchip 永磁同步电机 磁场定向控制(PMSM FOC)

标准单点定位，利用观测文件和导航文件进行标准单点定位(Standard single point positioning, the use of observation and navigation files document standard single point positioning)

对不同源节点到中继节点距离的固定DF译码转发协作通信的误码率进行了仿真(The error rate of fixed DF decode and forward cooperative communication is simulated for the distance from heterogeneous nodes to relay nodes)

Document about embbedded programming by C

Visual C++ 下调用Matcom转换的Matlab代码(Visual C++ under the call of the Matlab code conversion Matcom)

Ansi To Ascii and Ascii to Ansi converter

说明：  C++源代码，递归实现。原问题描述：鼓上蚤时迁到一个山洞里去盗宝，里面有n件宝贝，价值分别是a1,a2......an，并且满足ai大于a1+a2+....+a(i-1)的和。他身上有一个背包，能装的东西最大价值是K，他只能进洞一次，请问他最多能带出多少？ 要求：输入K，n，a1，a2......an 输出：他能最多带出的宝物价值 (C++ Source code Recursive achieve. The original problem description: drum when flea盗宝going to move in a cave, there are n pieces of treasure, valued are a1, a2 ...... an, and to meet ai than a1+ A22B !....+ a (i-1) and. Him to have a backpack, things can hold the greatest value is K, he could only hole once, to ask him to bring out the maximum number of? Requirements: Enter K, n, a1, a2 ...... an output: he can bring out the maximum value of the treasures)