getMFCC

本压缩包包括OFDM系统的信道估计理论与matlab仿真程序两部分，其中m文件为仿真程序。(The archive includes OFDM system channel estimation theory matlab simulation program with two parts, one m file for the simulation program.)

its a zero forcing error calculation matlab code

matlab环境下简单的部分响应仿真程序，供初学者查阅(The simple part of the Matlab environment response simulation program for beginners inspection)

《计算机程序设计艺术》重译自Donald E. Knuth(汉名高德纳)的三卷著作： The Art of Computer Programming: 1. Fundamental Algorithms 2. Seminumerical Algorithms 3. Sorting and Searching ；三卷中文名为《基本算法》、《半数值算法》及《排序与查找》。本书内容博大精深，作者因为三卷书获得美国计算机协会1974年图灵奖（该奖被国际公认为计算机科学领域的最高奖项）。(The Art of Computer Programming retranslation Donald e. Knuth (han gartner) three volumes of The book: The Art of Computer Programming: 1. The Fundamental Algorithms 2. The Seminumerical Algorithms 3. The Sorting and Searching Three volumes in Chinese, the basic algorithm, a numerical algorithm and the sorting and searching.And profound content of the book, the author for three books for the computer association in 1974 Turing award (the prize is internationally recognized as the highest award in the field of computer science).)

继续上传基于稳态kalman滤波器事例讲解，这里可以不需要考虑观测系统中的噪声。(to upload based on steady-state Kalman filter on the case, it need not consider here Observing System of noise.)

PSO模型为一种新型的改进仿生算法，通过鸟群的捕食模型得到启示并用于解决优化问题。这里提供一个优化版本的PSO算法的matlab代码(PSO model for a new improved bionic algorithm, to be inspired by birds of prey model and used to solve optimization problems. Here to provide an optimized version of the PSO algorithm matlab code)

Tactial+and+Strategic+Missile+Guidance book program source code (For Mac in Matlab)

利用c++编程，该程序实现了不使用标准块输入访问simulink信号(Using c++ programming, the program achieved without the use of standard access simulink block input signal )

图像分割程序，包含roberts，sobel和prewitt算法，很好用！(Image segmentation procedures, contains Roberts, Sobel and Prewitt algorithm, very good!)

The Vigenère cipher is a method of encrypting alphabetic text by using a series of different Caesar ciphers based on the letters of a keyword. It is a simple form of polyalphabetic substitution.Though the cipher is easy to understand and implement, for three centuries it resisted all attempts to break it this earned it the description le chiffre indéchiffrable (French for the indecipherable cipher ). Many people have tried to implement encryption schemes that are essentially Vigenère ciphers.[3] Friedrich Kasiski was the first to publish a general method of deciphering a Vigenère cipher.Unlike the monoalphabetic ciphers, polyalphabetic ciphers are not susceptible to frequency analysis, as more than one letter in the plaintext can be represented by a single letter in the encryption.