matlablearner

this code of Particle Swarm Optimization algorithm

vc++与matlab混合编程的快速实现 (vc++ with matlab the rapid realization of mixed programming)

在高斯白噪声情况下，MSK的维特比解调程序(Gaussian white noise case, the Viterbi MSK demodulation process)

harris角点检测算子，该代码运行速度快(harris corner detection operator, the code to run faster)

traditional otsu threshold algorithm imlementation used in image processing

说明：  matlab平台的一些运动估计块匹配算法，包括3步法，新3步法，4步法，菱形搜索等等(motionsEstAnalysis.m——Script to execute all Algorithms motionEstES.m——Exhaustive Search Algorithm motionEstTSS.m——Three Step Search Algorithm motionEstNTSS.m——New Three Step Search Algorithm motionEstSESTSS.m——Simple And Efficient Search Algorithm motionEst4SS.m——Four Step Search Algorithm motionEstDS.m——Diamond Search Algorithm motionEstARPSm——Adaptive Root Pattern Search Algorithm costFuncMAD.m——Mean Absolute Difference Function minCost.m ——minimum cost among macro blocks motionComp.m——motion compensated image creator imgPSNR.m ——finds image PSNR w.r.t. reference image)

) Compression using huffman code -with a number of bits k per code word -provide huffman table Huffman coding is optimal for a symbol-by-symbol coding with a known input probability distribution.This technique uses a variable-length code table for encoding a source symbol. The table is derived in a particular way based on the estimated probability of occurrence for each possible value of the source symbol .Huffman coding uses a specific method for representing each symbol, resulting in a prefix code that expresses the most common characters using shorter strings of bits than those used for less common source symbols.The Huffman coding is a procedure to generate a binary code tree. () Compression using huffman code -with a number of bits k per code word -provide huffman table Huffman coding is optimal for a symbol-by-symbol coding with a known input probability distribution.This technique uses a variable-length code table for encoding a source symbol. The table is derived in a particular way based on the estimated probability of occurrence for each possible value of the source symbol .Huffman coding uses a specific method for representing each symbol, resulting in a prefix code that expresses the most common characters using shorter strings of bits than those used for less common source symbols.The Huffman coding is a procedure to generate a binary code tree. )

计算电磁学，本程序用边界元方法求解正方形柱体内电位分布(A simple code for boundary element method.)

说明：  使用simulink实现2ask的最佳接收，其中包含调制解调的过程和最佳接收机(Use the best receiver simulink realization 2ask, including modulation and demodulation process and the best receiver)

Samples of ECG signals we used in our project the