LFM_radar

说明：  一个多目标跟踪的matlab代码,里面附有说明文档.其中背景差分法可以实现实时更新.该代码在检测与跟踪少量目标时效果很好,但是跟踪目标大于8后,效果下降很多(A multi-target tracking matlab code, which accompanied by documentation. Including real-time background subtraction method can be updated. The code in small target detection and tracking works well, but the tracking target is greater than 8, the effect of decreased number of)

OFDM SPACE TIME BLOCK CODE MIMO MIMO PDF

用MATLAB实现CCSDS_LDPC编码，并生成相应的校验矩阵H。压缩包内包含相应源程序以及CCSDS_LDPC编码原理的说明文档。(Using MATLAB CCSDS_LDPC coding, and generate the corresponding check matrix H. Compressed package that contains the corresponding documentation and CCSDS_LDPC source coding theory.)

参加数学建模大赛获奖，提供图像的拼接的matlab源代码，有很大价值(Participate in mathematical modeling contest winners, providing an image stitching matlab source code, there is great value)

4 files are included in the package: (1) fs01.m - the 1st-order local linear approximation (LLA) very similar to algorithm by Farmer and Sidorowich (1987). Uses constrained linear least squares (lsqlin) and (2) ts1.m - to reconstruct the vectors of the state space. (3) Example.m - runs fs01 and ts1 to predict (4) composite.txt - synthetic time series of decadal average sunspot number (4 files are included in the package: (1) fs01.m- the 1st-order local linear approximation (LLA) very similar to algorithm by Farmer and Sidorowich (1987). Uses constrained linear least squares (lsqlin) and (2) ts1.m- to reconstruct the vectors of the state space. (3) Example.m- runs fs01 and ts1 to predict (4) composite.txt- synthetic time series of decadal average sunspot number )

替代数据法中最重要的文献和文献相关的软件代码，非常经典亚(alternative method of data the most important literature and the literature related to the software code, very classic Asia)

OFDM solution RxTx for MATLAB

Another file of actuator example.

In computer science, a binary tree is a tree data structure in which each node has at most two children, which are referred to as the left child and the right child. A recursive definition using just set theory notions is that a (non-empty) binary tree is a triple (L, S, R), where L and R are binary trees or the empty set and S is a singleton set.[1] Some authors allow the binary tree to be the empty set as well.

说明：  利用som算法进行数据的聚类，实现无监督聚类(clustering the data with the som algorithm, that can relizing unsupervised cluster)