hack

基于MATLAB的IIR滤波器设计，用MATLAB语言进行编程，供滤波器设计者参考(Based on the MATLAB IIR filter designing, MATLAB programming language, for filter designers)

实现一个序列的分数差分的matlab程序，能够提取序列的长相关信息。(the process of fratual diff in the matlab and it can know the LRD of the sequnce)

K-d树实现。采用matalb和C++混合编译的方式实现。(kdtree provides a minimalistic implementation of kd-tree. The implementation can be used either inside MATLAB by means of MEX calls, or as a standalone tool, directly a C/C++ program. )

OKI的ML610Q495芯片例程demo(OKI ML610Q495 chip routines demo)

能够非常有效地在比较大的干扰下比较准确地反映真实值，如果观测端加入干扰较大时，卡尔曼滤波器能够较为有效地进行滤波，不过当状态端的干扰增大时，卡尔曼滤波器的滤波效果也会随之下降。(Can very effectively in the relatively large disturbances under more accurately reflect the true value, if the observation end joining interference is large, Calman filter can effectively filter, but when increasing the jamming state end when the filter effect of Calman filters will fall.)

说明：  分布式编码代码 C语言的，很多行，如果要用Matlab编应该有些参考价值。(distributed coding)

OFDM编码,调制的方法有QPSK,16QAM和64QAM(OFDM coding, modulation method QPSK, 16QAM and 64QAM)

3524工作原理,似乎是很牛的解释，里面有图，解释的很清楚~(how does the 3524 play~)

说明：  利用直接替换法进行缓冲区溢出的相关检测的几个c++程序。(Related buffer overflow detection method using a direct replacement for a few c++ program.)

说明：  给定n种物品和一个背包,物品i的重量是Wi,价值是vi,被包容量是C,应该如何选择装入被包的物品,使得装入背包中物品的总价值最大?对于每种物品i,只有两种选择,装入或者不装入. 输入:第一行两个正整数n(物品数)和C(容量) 第二行n个正整数n,表示物品价值 第三行n个正整数n,表示物品重量 输出:第一行表示总价值 第二行n个数(0/1),0表示物品不装入,1表示装入 例如, 输入: 5 10 6 3 5 4 6 2 2 6 5 4 输出 15 1 1 0 0 1 (Species of a given n items and a backpack, the weight of item i is Wi, the value of vi, was packet capacity is C, should be how to choose a package of items to be loaded, the backpack load in the largest total value of goods? For each item i, there are only two options, loaded or not loaded. Input: the first line of the two positive integer n (the number of items) and C (capacity) of the second line of n positive integer n, that the value of the third line of n positive integer n, that the weight of output: the total value of the first line of the second line, said n number of (0/1), 0 that the items do not load, that load 1 for example, enter: 5,106,354,622 6 5 4 output 15 1 1 0 0 1)