资源列表
Section_3_ZF_homogeneous_MISO
- section ZF precoding for communication systems. Regards
search
- 数据结构上机实验——文学助手。可实现读取txt文件或其它文件，扫描其中某个英文字幕或单词并输出搜索词出现的位置。简明、易懂、C++自编版。-Data structure on experiments- literary assistant. Txt file to read can be achieved or other documents, or scan one of the words in the English subtitles and output of the search w
autocorrelation
- 对音频信号进行处理，以采样频率为22050进行采样，并分别画出其自相关函数曲线.-Handle audio files, to 22050 sampling frequency for sampling respectively, and draw the autocorrelation function curve.
Beyond_STL_cn
- Beyond the C++ Standard Library : An Introduction to Boost
Huffmancodeandincludeexe
- 这是一些Huffman编码的代码，包括源程序，以及生成的可执行文件
pipei
- 这是用matlab编写的一个数字图像匹配算法-It is written with a digital image matlab matching algorithm
SPWM
- SPWM波的基准值的自动计算，节省时间的好办法。-SPWM wave of the reference value
bashuma_zeyou
- 八数码问题全局择优算法-eight digital algorithm selection of the best overall problem
zhmjiugong
- 八数码问题全局择优算法这个程序是上学期上人工智能课的时候，老师让做的，采用全局择优算法．-8 digital issues overall are merit-based algorithm for this procedure on the artificial intelligence class last semester, the teacher to do so, and the use of the overall selection of the best algorithm.
fetaure_extraction_lidar
- With the rapid development of remote sensing technology, three dimensional coordinates and intensity information of observation target can be obtained directly from LIDAR system. It is one of the important issues in the study on LIDAR data process
jishu
- 判断两个数在什么基数下相等，要是找不到，就是在任何基数下都不相等，得出结论。-Judge two Numbers under what base in equal, if can t find, is in any base of equal, draw the conclusion.
LISS_FAST
- 时间复杂度为O(nlogn)的最长单调递增子序列问题的计算程序。不是动态规划算法。在一分钟之内可以计算n=10^6个元素的递增子序列。-time complexity of O (nlogn) of the longest-monotonically increasing sequence of the program. Is not dynamic programming algorithm. In a minute can be calculated n = 10 ^ 6 elements