weichushimallet

Hi ,it s a simple code

Add pilot symbols to the input data just before transmission 2. Implement cyclic prefix (CP), use 10 of symbol length. Divide the 64 input data points into 8-bit streams, generate and append the CP based on each symbol 3. Include complex noise into transmitted signal Organization of Transmitter end of OFDM System a. Generate Data b. Modulate c. Serial to Parallel d. Cyclic Prefix (CP) e. Add Pilot points f. IFFT g. Parallel to Serial

车牌分割与识别，是现在交通电子眼必备的系统，本程序就是用matlab程序实现车牌的分割与识别，(License plate segmentation and recognition, is now an essential transport system of electronic eyes, the procedure is to use matlab program to achieve license plate segmentation and recognition,)

自适应控制的简单程序，对于初学者有很大的帮助，大家共同学习，共同进步(In order to improve the adaptation property of the system by making the best of the direction of distribution of radar measurement errors, a optimum estimation algorithm for Kepler orbit is proposed, which yields a maximum likelihood estimation of the Kepler orbit with multi-spatio-temporal state based on both the preprocessing of the small manoeuvring model and the determining of initial value parameter with two spatio-temporal state. )

bpsk in Rayleigh fading

LT码的matlab代码,程序运行时最好预先预测长度开辟空间(LT code)

lms算法经典，实现了lms自适应的源程序。经过调试，绝对可以运行(lms classical algorithm, achieving adaptive lms of the source. After debugging, can definitely run)

La logique floue est le meilleur moyen de convertir les stratégies de contrô le du langage naturel qui sont utilisées par l’homme à une forme utilisable par les machines. Des expériences ont montré qu’un contrô leur classique donne parfois même de meilleurs résultats que l’opérateur humain

本文档介绍了Matlab软件中可以灵活运用的一种算法--线性规划，其中对原理和操作步骤进行了详细介绍。(This document describes the Matlab software flexibility in the use of an algorithm- linear programming, in which the principles and steps are described in detail.)

针对基本快速扩展随机树(RRT)算法存在搜索过于平均、效率低下、用时较长的缺陷，提出了一种偏向目标型的改进型RRT算法。这种算法在生成随机点时以一定概率选择最终目标点作为局部目标点，使树的扩展有一个趋向于最终目标点的趋势，从而加快了算法的收敛速度，优化了规划路径(For basic fast Random Tree (RRT) search algorithm exists too mean, inefficient, long time with defects, we proposed a goal-biased improved RRT algorithm. This algorithm when generating random points with a certain probability of selecting a final destination point as a local target, enabling the expansion of the tree has a tendency to trend the final destination point, thereby speeding up the convergence of the algorithm, optimized route planning)