Single-sideband-modulation

k-means algorithm clustering

DC-DC Buck converter

最小二乘辨识参数，用来辨识非线性系统的参数，还可以对非线性系统进行仿真。(Least squares identification parameters, used to identify nonlinear system parameters, it can also nonlinear system simulation. )

Finally, probability analysis, based on the chosen database, is performed and judgment whether the person is recognized is pronounced. Two different modeling techniques can be suggested for purposes of person identification or verification. The approach based on Hidden Markov Speaker Models (HMMs) with the mixtures of Gaussian distribution is text-dependent one. For this technology a speaker is described by a set of HMMs, constructing the set of speech groups spoken by that person. The speech groups may be phonemes or words [7]. The text-independent technology is rested upon Gaussian Mixture Speaker Models. For this technology each speaker is defined by only one model describing all utterances of that person. Identification in the range of both approaches is executed by evaluation of maximum a posteriori probability [7].

UCP problem solving Using Dynamic Problem by Maninder Kaur and Vikram Kumar

说明：  频分复用(FDM，Frequency Division Multiplexing)的matlab实现，仿真时录入三路声音信号进行处理，将用于传输信道的总带宽划分成三个子频带，经过复用以后再将录入的声音信号恢复出来。(FDM (frequency division multiplexing) is realized by MATLAB. In the simulation, three sound signals are input for processing. The total bandwidth used for transmission channel is divided into three sub bands. After multiplexing, the input sound signals are recovered.)

最短路这个说明倒不是说明函数的功能，只是声明一下函数中出现的问题。 shortest()函数没有问题，在secshortest中我希望只得到一条次短路（或几条roadcost()值相同的次短路），结果却出来好几条，我仔细检查了一下程序，应该没有什么问题。 因此在使用时，要得到次短路，只能用roadcost()函数分别求一下各条路的权重和，找到最小的。 有些奇怪 (short path)

codes for image proc

This program uate BER performance of OFDM systems in AWGN environment. Basically, modulation and demodulation function is supported BPSK to 64QAM.

拉格朗日插值多项式拟合,牛顿插值多项式,欧拉方程解偏微分方程,使用极限微分求解导数（微分）,微分方程组的N=4龙格库塔解法,雅可比爹迭代法解方程AX=B,最小二乘多项式拟合,组合辛普生公式求解积分,用三角分解法解方程AX=B(Lagrange interpolation polynomial fitting, polynomial interpolation Newton, Euler equations partial differential equations, Limit the use of derivative solving differential (differential), the equations of N = 4 Runge- Kutta method. Jacobian Davis iterative method of solving equations AX = B, least squares polynomial fitting, portfolio Simpson formula for integration, with a triangular decomposition method of solving equations AX = B. )