lineslam

通讯系统仿真（Matlab）Dynamic Resource Allocation（DCA） in JOINT system(Communication system simulation (Matlab) Dynamic Resource Allocation (DCA) in JOINT system)

说明：  能够清晰的分析线性调频信号的频谱特性，能够很好的帮助理解lfm信号(Can clear analysis of linear FM signal spectrum characteristics, can be very helpful in understanding LFM signal)

直接序列扩频通信系统误码率的仿真分析PN码同步方法的比较与仿真(direct sequence spread spectrum communication system BER simulation analysis PN code synchronization method of comparison and Simulation)

a single axis kalman filter simulation for pose-estimation

用matlab开发的B-样条工具箱，包括B-样条近似，de-boor算法等(Developed with matlab, B-spline toolbox, including B-spline approximation, de-boor algorithm)

是图像处理中奇异值分解的代码，对图像处理很有用。(Is the singular value decomposition of the image processing code, useful for image processing.)

simple read audio file. plot time domain signal. play audio file. matlab source code

说明：  该文件为MATLAB中的garch多元代码工具箱(This file is the GARCH multicode toolbox in MATLAB)

Matlab 经典分割段子，分水岭等，欢迎下载(Matlab classic split scripts, please download)

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