MATLABandC

matlab模拟的圆孔衍射 平面波 衍射间距可调(Matlab simulation using circular aperture diffraction images, the incident light for the plane wave)

k近邻算法源代码，用matlab语言编写的，适用于分类及相关问题的分析(K neighbor algorithm source code, written with matlab language, suitable for classification and analysis of the related problem)

在AWGN信道下采用BPSK调制，对于一个给定生成矩阵和union bound的线性码，我们得到求解其重量分布的方法。。(Compute the weight distrubution of a linear code given its generator matrix and the union bound on its performance with BPSK modulation over an AWGN channel.)

文件中有两个97提升小波程序，可以直接在matlab中运行，已经试过(File has two 97 lifting wavelet procedures can be directly run in matlab, have tried)

Intervalo de tempo corrigido

也是一个EKF和粒子滤波在目标跟踪方面的效果比较，比较实用，本来想留着，捐了！(Is also an EKF and particle filter for target tracking in the effectiveness of comparison, the more practical, originally wanted to keep, has donated!)

变频调速滤波仿真建模构建模型 用于仿真观测波形(Frequency conversion filter simulation modeling Used for simulation observation waveform )

仅供学习研究使用。对仿真主要特性、建模机制及仿真步骤进行了深入阐述，最后给出了在预测网络性能方面的一个应用实例。(For study and research use. The main characteristics, modeling and Simulation of mechanism and the simulation steps in detail, finally, an application example in the prediction of network performance.)

) 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. )

This is a wavelet soft thresholding the original code, prepared using Matlab. We want to help