一个粒子追踪测速迭代松弛算法代码

自适应滤波原理_西蒙.赫金_Matlab_源代码 希望能够对学习自适应滤波技术的朋友有所帮助(Principles of Adaptive Filtering _ Simon. Hyuk Kim _Matlab_ source code would like to learn adaptive filtering technologies help a friend)

MIMO下的ZF滤波器的实现，主要实现的功能是针对任意大小的收发天线的误比特率仿真(MIMO ZF filter is implemented under the main function is to achieve any size for the antenna simulation of bit error rate)

计算求解连续时间信号的SINAD，分析其频谱特型(Calculate the SINADof Real Signal)

计算信号的短时傅里叶变换。用法见函数说明。(Short-time Fourier transform calculation signals. Usage See function description.)

说明：  压缩感知算法，实现了大数据的压缩过程，恢复过程简单。(Compressive sensing algorithm realizes the compression process of large data and the recovery process is simple.)

雷达直达波和目标回波之间抵消，两个信号一强一弱，既可以抵消强信号，也可以抵消弱信号(Radar direct wave and the target echo offset between the two signals a strong one weak, only to be offset by a strong signal, you can also offset the weak signal)

It describes the fading in wireless channels

压缩感知目前广泛应用于雷达成像或得超分辨稀疏成像，该文件为压缩感知三维成像。(Compressed sensing has been widely applied in radar imaging or sparse super resolution imaging, the file is compressed perception three-dimensional imaging. )

如何生成mif文件 用于导入fpga的RAM存储中(How to generate mif file for importing RAM memory in fpga)

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